PepSplice: cache-efficient search algorithms for comprehensive identification of tandem mass spectra

被引:28
作者
Roos, Franz F. [1 ]
Jacob, Riko
Grossmann, Jonas
Fischer, Bernd
Buhmann, Joachim M.
Gruissem, Wilhelm
Baginsky, Sacha
Widmayer, Peter
机构
[1] ETH, Inst Theoret Comp Sci, CH-8092 Zurich, Switzerland
[2] ETH, Inst Plant Sci, CH-8092 Zurich, Switzerland
[3] ETH, Inst Comp Sci, CH-8092 Zurich, Switzerland
[4] Tech Univ Munich, Inst Informat, D-85748 Garching, Germany
关键词
D O I
10.1093/bioinformatics/btm417
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
Motivation: Tandem mass spectrometry allows for high-throughput identification of complex protein samples. Searching tandem mass spectra against sequence databases is the main analysis method nowadays. Since many peptide variations are possible, including them in the search space seems only logical. However, the search space usually grows exponentially with the number of independent variations and may therefore overwhelm computational resources. Results: We provide fast, cache-efficient search algorithms to screen large peptide search spaces including non-tryptic peptides, whole genomes, dozens of posttranslational modifications, unannotated point mutations and even unannotated splice sites. All these search spaces can be screened simultaneously. By optimizing the cache usage, we achieve a calculation speed that closely approaches the limits of the hardware. At the same time, we control the size of the overall search space by limiting the combinations of variations that can co-occur on the same peptide. Using a hypergeometric scoring scheme, we applied these algorithms to a dataset of 1 420 632 spectra. We were able to identify a considerable number of peptide variations within a modest amount of computing time on standard desktop computers. Availability: PepSplice is available as a C application for Linux, Windows and OSX at www.ti.inf.ethz.ch/pw/software/pepsplice/. It is open source under the revised BSD license. Contact: franz.roos@alumni.ethz.ch or jacob@in.tum.de Supplementary information: Supplementary data are available at Bioinformatics online.
引用
收藏
页码:3016 / 3023
页数:8
相关论文
共 29 条
[1]   THE INPUT OUTPUT COMPLEXITY OF SORTING AND RELATED PROBLEMS [J].
AGGARWAL, A ;
VITTER, JS .
COMMUNICATIONS OF THE ACM, 1988, 31 (09) :1116-1127
[2]  
BALGLEY BM, 2007, MOL CELL PROTEOMICS
[3]  
CHEN T, 2001, RECOMB 2001, P87
[4]  
Choudhary JS, 2001, PROTEOMICS, V1, P651, DOI 10.1002/1615-9861(200104)1:5<651::AID-PROT651>3.0.CO
[5]  
2-N
[6]   Experiments in searching small proteins in unannotated large eukaryotic genomes [J].
Colinge, J ;
Cusin, I ;
Reffas, S ;
Mahé, E ;
Niknejad, A ;
Rey, PA ;
Mattou, H ;
Moniatte, M ;
Bougueleret, L .
JOURNAL OF PROTEOME RESEARCH, 2005, 4 (01) :167-174
[7]   High-performance peptide identification by tandem mass spectrometry allows reliable automatic data processing in proteomics [J].
Colinge, J ;
Masselot, A ;
Cusin, I ;
Mahé, E ;
Niknejad, A ;
Argoud-Puy, G ;
Reffas, S ;
Bederr, N ;
Gleizes, A ;
Rey, PA ;
Bougueleret, L .
PROTEOMICS, 2004, 4 (07) :1977-1984
[8]   A method for reducing the time required to match protein sequences with tandem mass spectra [J].
Craig, R ;
Beavis, RC .
RAPID COMMUNICATIONS IN MASS SPECTROMETRY, 2003, 17 (20) :2310-2316
[9]   TANDEM: matching proteins with tandem mass spectra [J].
Craig, R ;
Beavis, RC .
BIOINFORMATICS, 2004, 20 (09) :1466-1467
[10]   Review - Mass spectrometry and protein analysis [J].
Domon, B ;
Aebersold, R .
SCIENCE, 2006, 312 (5771) :212-217