title: Speed improvements of peptide-spectrum matching using single-instruction multiple-data instructions.
abstract: Peptide-spectrum matching is one of the most time-consuming portion of the database search method for assignment of tandem mass spectra to peptides. In this study, we develop a parallel algorithm for peptide-spectrum matching using Single-Instruction Multiple Data (SIMD) instructions. Unlike other parallel algorithms in peptide-spectrum matching, our algorithm parallelizes the computation of matches between a single spectrum and a given peptide sequence from the database. It also significantly reduces the number of comparison operations. Extra improvements are obtained by using SIMD instructions to avoid conditional branches and unnecessary memory access within the algorithm. The implementation of the developed algorithm is based on the Streaming SIMD Extensions technology that is embedded in most Intel microprocessors. Similar technology also exists in other modern microprocessors. A simulation shows that the developed algorithm achieves an 18-fold speedup over the previous version of Real-Time Peptide-Spectrum Matching algorithm [F. X. Wu et al., Rapid Commun. Mass Sepctrom. 2006, 20, 1199-1208]. Therefore, the developed algorithm can be employed to develop real-time control methods for MS/MS.
authors.affiliation: Department of Computer Science, University of Saskatchewan, Saskatoon, SK, Canada.
authors.forename: Jian
authors.initials: J
authors.lastname: Zhang
authors.forename: Ian
authors.initials: I
authors.lastname: McQuillan
authors.forename: Fang-Xiang
authors.initials: FX
authors.lastname: Wu
mesh_terms: D000465:Algorithms; D030562:Databases, Protein; D010455:Peptides / Q000737:chemistry*; D053719:Tandem Mass Spectrometry / Q000191:economics / Q000379:methods*; D013997:Time Factors
chemical_list: D010455:Peptides