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 electrospray ionization technique.

The implementation of the algorithm from one piece of mass spectrometry software to another differs. Some implementations need clean chromatograms to substruct background.

References

edit
  1. ^ Windig, Willem; Phalp, J. Martin; Payne, Alan W. (1996). "A Noise and Background Reduction Method for Component Detection in Liquid Chromatography/Mass Spectrometry". Analytical Chemistry. 68 (20): 3602–3606. doi:10.1021/ac960435y.
  2. ^ Christin, Christin; Smilde, Age K.; Hoefsloot, Huub C. J.; Suits, Frank; Bischoff, Rainer; Horvatovich, Peter L. (2008). "Optimized Time Alignment Algorithm for LC−MS Data: Correlation Optimized Warping Using Component Detection Algorithm-Selected Mass Chromatograms". Analytical Chemistry. 80 (18): 7012–7021. doi:10.1021/ac800920h. PMID 18715018.
  3. ^ Windig, W.; Smith, W. F. (27 July 2007). "Chemometric analysis of complex hyphenated data: Improvements of the component detection algorithm". Journal of Chromatography A. Data Analysis in Chromatography. 1158 (1): 251–257. doi:10.1016/j.chroma.2007.03.081. PMID 17418223.


Stub icon

This computational chemistry-related article is a stub. You can help Wikipedia by adding missing information.

📚 Artikel Terkait di Wikipedia

Leiden algorithm

The Leiden algorithm is a community detection algorithm developed by Traag et al at Leiden University. It was developed as a modification of the Louvain

Independent component analysis

the complexity of the problem for the actual iterative algorithm. Linear independent component analysis can be divided into noiseless and noisy cases

Random early detection

congestion avoidance. In the conventional tail drop algorithm, a router or other network component buffers as many packets as it can, and simply drops

Strongly connected component

off the stack into a new component. The path-based strong component algorithm uses a depth-first search, like Tarjan's algorithm, but with two stacks. One

Connected-component labeling

algorithmic application of graph theory, where subsets of connected components are uniquely labeled based on a given heuristic. Connected-component labeling

Coda

a system used at Jefferson Lab in the United States Component detection algorithm, an algorithm in mass spectrometry CODA (company), financial software

Collision detection

computational physics. Collision detection algorithms can be divided into operating on 2D or 3D spatial objects. Collision detection is closely linked to calculating

Machine learning

rule-based machine learning algorithms that combine a discovery component, typically a genetic algorithm, with a learning component, performing either supervised