Combining peak- and chromatogram-based retention time alignment algorithms for multiple chromatography-mass spectrometry datasets
1 Genome Informatics Group, Faculty of Technology, Bielefeld University, Bielefeld, Germany
2 Department of Proteome and Metabolome Research, Faculty of Biology, Bielefeld University, Bielefeld, Germany
3 Center for Biotechnology (CeBiTec), Bielefeld University, Bielefeld, Germany
4 Plant Ecology and Ecotoxicology, Institute for Landscape and Plant Ecology, University of Hohenheim, Stuttgart, Germany
5 Microbial Drugs, Helmholtz Centre for Infection Research, Braunschweig, Germany
6 Bruker Daltonik GmbH, Bremen, Germany
BMC Bioinformatics 2012, 13:214 doi:10.1186/1471-2105-13-214Published: 27 August 2012
Modern analytical methods in biology and chemistry use separation techniques coupled to sensitive detectors, such as gas chromatography-mass spectrometry (GC-MS) and liquid chromatography-mass spectrometry (LC-MS). These hyphenated methods provide high-dimensional data. Comparing such data manually to find corresponding signals is a laborious task, as each experiment usually consists of thousands of individual scans, each containing hundreds or even thousands of distinct signals. In order to allow for successful identification of metabolites or proteins within such data, especially in the context of metabolomics and proteomics, an accurate alignment and matching of corresponding features between two or more experiments is required. Such a matching algorithm should capture fluctuations in the chromatographic system which lead to non-linear distortions on the time axis, as well as systematic changes in recorded intensities. Many different algorithms for the retention time alignment of GC-MS and LC-MS data have been proposed and published, but all of them focus either on aligning previously extracted peak features or on aligning and comparing the complete raw data containing all available features.
In this paper we introduce two algorithms for retention time alignment of multiple GC-MS datasets: multiple alignment by bidirectional best hits peak assignment and cluster extension (BIPACE) and center-star multiple alignment by pairwise partitioned dynamic time warping (CEMAPP-DTW). We show how the similarity-based peak group matching method BIPACE may be used for multiple alignment calculation individually and how it can be used as a preprocessing step for the pairwise alignments performed by CEMAPP-DTW. We evaluate the algorithms individually and in combination on a previously published small GC-MS dataset studying the Leishmania parasite and on a larger GC-MS dataset studying grains of wheat (Triticum aestivum).
We have shown that BIPACE achieves very high precision and recall and a very low number of false positive peak assignments on both evaluation datasets. CEMAPP-DTW finds a high number of true positives when executed on its own, but achieves even better results when BIPACE is used to constrain its search space. The source code of both algorithms is included in the OpenSource software framework Maltcms, which is available from http://maltcms.sf.net webcite. The evaluation scripts of the present study are available from the same source.