title: An Efficient Algorithm for Clustering of Large-Scale Mass Spectrometry Data.
abstract: High-throughput spectrometers are capable of producing data sets containing thousands of spectra for a single biological sample. These data sets contain a substantial amount of redundancy from peptides that may get selected multiple times in a LC-MS/MS experiment. In this paper, we present an efficient algorithm, CAMS (Clustering Algorithm for Mass Spectra) for clustering mass spectrometry data which increases both the sensitivity and confidence of spectral assignment. CAMS utilizes a novel metric, called F-set, that allows accurate identification of the spectra that are similar. A graph theoretic framework is defined that allows the use of F-set metric efficiently for accurate cluster identifications. The accuracy of the algorithm is tested on real HCD and CID data sets with varying amounts of peptides. Our experiments show that the proposed algorithm is able to cluster spectra with very high accuracy in a reasonable amount of time for large spectral data sets. Thus, the algorithm is able to decrease the computational time by compressing the data sets while increasing the throughput of the data by interpreting low S/N spectra.
authors.affiliation: Epithelial Systems Biology Laboratory, National Heart Lung and Blood Institute (NHLBI), National Institutes of Health (NIH), Bethesda, Maryland USA.
authors.forename: Fahad
authors.initials: F
authors.lastname: Saeed
authors.forename: Trairak
authors.initials: T
authors.lastname: Pisitkun
authors.forename: Mark A
authors.initials: MA
authors.lastname: Knepper
authors.forename: Jason D
authors.initials: JD
authors.lastname: Hoffert
keywords: Clustering; Efficient Algorithms; Graph Theory; Mass spectrometry