Speeding up tandem mass spectrometry-based database searching by longest common prefix

BMC Bioinformatics

Volumn 11, Issue , 2010, Pages

  Zhou, Chen ^a,b,c   Chi, Hao ^a,b,c   Wang, Le Heng ^a,b   Li, You ^a,b   Wu, Yan Jie ^a,b,c   Fu, Yan ^a,b   Sun, Rui Xiang ^a,b   He, Si Min ^a,b  

^a INSTITUTE OF GEOLOGY AND GEOPHYSICS   (China)

^b INSTITUTE OF COMPUTING TECHNOLOGY   (China)

^c UNIVERSITY OF CHINESE ACADEMY OF SCIENCES   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL DEMANDS; DATABASE SEARCHING; ENZYMATIC DIGESTIONS; LONGEST COMMON PREFIXES; POST-TRANSLATIONAL MODIFICATIONS; PROTEIN DATABASE; PROTEIN IDENTIFICATION; PROTEIN SEQUENCE DATABASE;

ALGORITHMS; DATABASE SYSTEMS; INDEXING (MATERIALS WORKING); INDEXING (OF INFORMATION); INFORMATION RETRIEVAL; MASS SPECTROMETRY; SEARCH ENGINES;

PEPTIDES;

PEPTIDE; PROTEIN;

ALGORITHM; ARTICLE; CHEMISTRY; METHODOLOGY; PEPTIDE MAPPING; PROTEIN DATABASE; SEQUENCE ANALYSIS; TANDEM MASS SPECTROMETRY;

ALGORITHMS; DATABASES, PROTEIN; PEPTIDE MAPPING; PEPTIDES; PROTEINS; SEQUENCE ANALYSIS, PROTEIN; TANDEM MASS SPECTROMETRY;

EID: 78649920362     PISSN: None     EISSN: 14712105     Source Type: Journal    
DOI: 10.1186/1471-2105-11-577     Document Type: Article

References (30)

1. Eng JK, McCormack AL, Yates Iii JR. An approach to correlate tandem mass spectral data of peptides with amino acid sequences in a protein database. Journal of the American Society for Mass Spectrometry 1994, 5:976-989.
2. Perkins DN, Pappin DJC, Creasy DM, Cottrell JS. Probability-based protein identification by searching sequence databases using mass spectrometry data. Electrophoresis 1999, 20:3551-3567. 10.1002/(SICI)1522-2683(19991201)20:18<3551::AID-ELPS3551>3.0.CO;2-2, 10612281.
3. Craig R, Beavis RC. TANDEM: matching proteins with tandem mass spectra. BIOINFORMATICS 2004, 20:1466-1467. 10.1093/bioinformatics/bth092, 14976030.
4. Geer LY, Markey SP, Kowalak JA, Wagner L, Xu M, Maynard DM, Yang X, Shi W, Bryant SH. Open mass spectrometry search algorithm. Journal of proteome research 2004, 3:958-964. 10.1021/pr0499491, 15473683.
5. Colinge J, Masselot A, Giron M, Dessingy T, Magnin J. OLAV: towards high-throughput tandem mass spectrometry data identification. Proteomics 2003, 3:1454-1463. 10.1002/pmic.200300485, 12923771.
6. Roos FF, Jacob R, Grossmann J, Fischer B, Buhmann JM, Gruissem W, Baginsky S, Widmayer P. PepSplice: cache-efficient search algorithms for comprehensive identification of tandem mass spectra. Bioinformatics 2007, 23:3016-3023. 10.1093/bioinformatics/btm417, 17768164.
7. Park CY, K ll L, Klammer AA, MacCoss MJ, Noble WS. Rapid and accurate peptide identification from tandem mass spectra. Journal of proteome research 2008, 7:3022. 10.1021/pr800127y, 2667385, 18505281.
8. Fu Y, Yang Q, Sun R, Li D, Zeng R, Ling CX, Gao W. Exploiting the kernel trick to correlate fragment ions for peptide identification via tandem mass spectrometry. Bioinformatics 2004, 20:1948-1954. 10.1093/bioinformatics/bth186, 15044235.
9. Li D, Fu Y, Sun R, Ling CX, Wei Y, Zhou H, Zeng R, Yang Q, He S, Gao W. pFind: a novel database-searching software system for automated peptide and protein identification via tandem mass spectrometry. Bioinformatics 2005, 21:3049-3050. 10.1093/bioinformatics/bti439, 15817687.
10. Wang L, Li DQ, Fu Y, Wang HP, Zhang JF, Yuan ZF, Sun RX, Zeng R, He SM, Gao W. pFind 2.0: a software package for peptide and protein identification via tandem mass spectrometry. Rapid Communications in Mass Spectrometry 2007, 21:2985-2991. 10.1002/rcm.3173, 17702057.
11. Kersey PJ, Duarte J, Williams A, Karavidopoulou Y, Birney E, Apweiler R. Technical Brief The International Protein Index: An integrated database for proteomics experiments. Proteomics 2004, 4:1985-1988. 10.1002/pmic.200300721, 15221759.
12. Wilfred H, Tang BRH, Ignat SV, Sean SL, Sean KP, Alex L, Alpesh PA, Daniel SA, Lydia NM. Discovering Known and Unanticipated Protein Modifications Using MS/MS Database Searching. Analytical Chemistry 2005, 77:3931-3946. 10.1021/ac0481046, 15987094.
13. Lu B, Chen T. A suffix tree approach to the interpretation of tandem mass spectra: applications to peptides of non-specific digestion and post-translational modifications. Bioinformatics 2003, 19. 10.1093/bioinformatics/btg1068, 14534180.
14. Tanner S, Shu H, Frank A, Wang LC, Zandi E, Mumby M, Pevzner PA, Bafna V. InsPecT: identification of posttranslationally modified peptides from tandem mass spectra. Anal Chem 2005, 77:4626-4639. 10.1021/ac050102d, 16013882.
15. Edwards N, Lippert R. Sequence database compression for peptide identification from tandem mass spectra. Algorithms in Bioinformatics 2004, 230-241.
16. Edwards NJ. Novel peptide identification from tandem mass spectra using ESTs and sequence database compression. Molecular Systems Biology 2007, 3. 1865584, 17437027.
17. Edwards N, Lippert R. Generating peptide candidates from amino-acid sequence databases for protein identification via mass spectrometry. Lecture Notes in Computer Science 2002, 68-81.
18. Li Y, Chi H, Wang LH, Wang HP, Fu Y, Yuan ZF, Li SJ, Liu YS, Sun RX, Zeng R, He SM. Speeding up tandem mass spectrometry based database searching by peptide and spectrum indexing. Rapid Commun Mass Spectrom 24:807-814. 10.1002/rcm.4448, 20187083.
19. Klimek J, Eddes JS, Hohmann L, Jackson J, Peterson A, Letarte S, Gafken PR, Katz JE, Mallick P, Lee H. The Standard Protein Mix Database: A Diverse Dataset to Assist in the Production of Improved Peptide and Protein Identification Software Tools. Journal of proteome research 2008, 7:96. 10.1021/pr070244j, 2577160, 17711323.
20. Villén J, Beausoleil SA, Gerber SA, Gygi SP. Large-scale phosphorylation analysis of mouse liver. Proceedings of the National Academy of Sciences 2007, 104:1488.
21. Simon J, Puglisi WFS, Anderw H, Turpin Simon J. A Taxonomy of Suffix Array Construction Algorithms. ACM Computing Surveys 2007, 39:31.
22. Manber U, Myers G. Suffix arrays: A new method for on-line string searches. Society for Industrial and Applied Mathematics Philadelphia, PA, USA 1990, 319-327.
23. Gusfield D. Algorithms on strings, trees, and sequences: computer science and computational biology. Cambridge Univ Pr 1997,
24. Larsson NJ, Sadakane K. Faster suffix sorting. Theoretical Computer Science 2007, 387:258-272.
25. Kärkkäinen J, Sanders P, Burkhardt S. Linear work suffix array construction. Journal of the ACM (JACM) 2006, 53:936.
26. Manzini G, Ferragina P. Engineering a lightweight suffix array construction algorithm. Algorithmica 2004, 40:33-50.
27. Maniscalco MA, Puglisi SJ. An efficient, versatile approach to suffix sorting. Journal of Experimental Algorithmics (JEA) 2008, 12:1-2.
28. Kasai T, Lee G, Arimura H, Arikawa S, Park K. Linear-time longest-common-prefix computation in suffix arrays and its applications. Lecture Notes in Computer Science 2001, 2089:181-192.
29. Puglisi SJ, Turpin A. Space-time tradeoffs for Longest-Common-Prefix array computation. Springer 2008, 124-135.
30. Aho AV, Corasick MJ. Efficient string matching: an aid to bibliographic search. Communications of the ACM 1975, 18:340.