COmponent Detection Algorithm
- COmponent Detection Algorithm
-
For other uses, see
Coda.
The COmponent Detection Algorithm (CODA) is a name for a type of LC-MS[1][2] and chemometrics[3] software algorithm focused on detecting peaks in noisy chromatograms (TIC) often obtained using the electospray ionization technique.
The implementation of the algorithm from a mass spectrometry software to another differs. Some implementations need clean chromatograms to substruct background.
References
- ^ A Noise and Background Reduction Method for Component Detection in Liquid Chromatography/Mass Spectrometry. Willem Windig, J. Martin Phalp and Alan W. Payne, Anal. Chem., 1996, 68 (20), pp 3602–3606, DOI: 10.1021/ac960435y
- ^ Optimized Time Alignment Algorithm for LC−MS Data: Correlation Optimized Warping Using Component Detection Algorithm-Selected Mass Chromatograms. Christin Christin, Age K. Smilde, Huub C. J. Hoefsloot, Frank Suits, Rainer Bischoff and Peter L. Horvatovich, nal. Chem., 2008, 80 (18), pp 7012–7021, DOI: 10.1021/ac800920h
- ^ Chemometric analysis of complex hyphenated data: Improvements of the component detection algorithm. W. Windig and W.F. Smith, Journal of Chromatography A, Volume 1158, Issues 1-2, 27 July 2007, Pages 251-257, doi:10.1016/j.chroma.2007.03.081
Wikimedia Foundation.
2010.
Look at other dictionaries:
Connected-component labeling — (alternatively connected component analysis, blob extraction, region labeling, blob discovery, or region extraction) is an algorithmic application of graph theory, where subsets of connected components are uniquely labeled based on a given… … Wikipedia
Random early detection — (RED), also known as random early discard or random early drop is an active queue management algorithm. It is also a congestion avoidance algorithm. [cite journal | last = Floyd | first = Sally | coauthors = Jacobson, Van | title = Random Early… … Wikipedia
K-means algorithm — The k means algorithm is an algorithm to cluster n objects based on attributes into k partitions, k < n. It is similar to the expectation maximization algorithm for mixtures of Gaussians in that they both attempt to find the centers of natural… … Wikipedia
Coda — can denote any concluding event, summation, or section. Coda may also refer to: Contents 1 Acronyms 2 Automotive 3 Ballet … Wikipedia
Mass spectrum analysis — is an integral part of mass spectrometry.[1][2] Organic chemists obtain mass spectra of chemical compounds as part of structure elucidation and the analysis is part of every organic chemistry curriculum. Co … Wikipedia
Maximally stable extremal regions — Feature detection Output of a typical corner detection algorithm … Wikipedia
Scale-invariant feature transform — Feature detection Output of a typical corner detection algorithm … Wikipedia
List of algorithms — The following is a list of the algorithms described in Wikipedia. See also the list of data structures, list of algorithm general topics and list of terms relating to algorithms and data structures.If you intend to describe a new algorithm,… … Wikipedia
Auditory brainstem response — The auditory brainstem response (ABR) is an auditory evoked potential extracted from ongoing electrical activity in the brain and recorded via electrodes placed on the scalp. The resulting recording is a series of vertex positive waves of which I … Wikipedia
Rapidly-exploring random tree — A Rapidly exploring Random Tree (RRT) is a data structure and algorithm designed for efficiently searching nonconvex, high dimensional search spaces. Simply put, the tree is constructed in such a way that any sample in the space is added by… … Wikipedia
