A novel algorithm for chromatogram matching in qualitative analysis
β Scribed by Mason, John P. ;Kirk, Ian ;Windsor, Colin G. ;Tipler, Andy ;Spragg, Richard A. ;Rendle, Mark
- Publisher
- John Wiley and Sons
- Year
- 1992
- Tongue
- English
- Weight
- 780 KB
- Volume
- 15
- Category
- Article
- ISSN
- 0935-6304
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
The matching of the pattern of peaks produced during gas chromatography is of importance to many applications. At present, this task is generally performed manually, but this generates the usual problems associated with human inspection, such as a lack of objectivity and reproducibility, proneness to errors, and practical restriction of the volume of data which can reasonably be processed.
This paper explores the use of a novel algorithm for automation of this task. The performance of the method on well controlled simulated data sets and real chromatograms is used to show not only how problems of manual inspection can be circumvented, but also how the existence of such a powerful method should open up the possibility of many new analyses for quality control, discrimination of varieties of sample, and the identification of specific components within a sample.
π SIMILAR VOLUMES
We discuss a wide range of matching problems in terms of a network flow model. More than this, we start up a matching theory which is very intuitive and independent from the original graph context. This first paper contains a standardized theory for the performance analysis of augmentation algorithm
## Abstract A loop closureβbased sequential algorithm, PRODA\_MATCH, was developed to match catalytic residues onto a scaffold for enzyme design __in silico__. The computational complexity of this algorithm is polynomial with respect to the number of active sites, the number of catalytic residues,