These authors contributed equally to this work.
Research Article
An efficient parallelization of phosphorylated peptide and protein identification
Article first published online: 17 MAY 2010
DOI: 10.1002/rcm.4578
Copyright © 2010 John Wiley & Sons, Ltd.
Additional Information
How to Cite
Wang, L., Wang, W., Chi, H., Wu, Y., Li, Y., Fu, Y., Zhou, C., Sun, R., Wang, H., Liu, C., Yuan, Z., Xiu, L. and He, S.-M. (2010), An efficient parallelization of phosphorylated peptide and protein identification. Rapid Communications in Mass Spectrometry, 24: 1791–1798. doi: 10.1002/rcm.4578
Publication History
- Issue published online: 19 MAY 2010
- Article first published online: 17 MAY 2010
- Manuscript Accepted: 12 APR 2010
- Manuscript Revised: 19 MAR 2010
- Manuscript Received: 8 NOV 2009
Abstract
Protein sequence database search based on tandem mass spectrometry is an essential method for protein identification. As the computational demand increases, parallel computing has become an important technique for accelerating proteomics data analysis. In this paper, we discuss several factors which could affect the runtime of the pFind search engine and build an estimation model. Based on this model, effective on-line and off-line scheduling methods were developed. An experiment on the public dataset from PhosphoPep consisting of 100 RAW files of phosphopeptides shows that the speedup on 100 processors is 83.7. The parallel version can complete the identification task within 9 min, while a stand-alone process on a single PC takes more than 10 h. On another larger dataset consisting of 1 366 471 spectra, the speedup on 320 processors is 258.9 and the efficiency is 80.9%. Our approach can be applied to other similar search engines. Copyright © 2010 John Wiley & Sons, Ltd.

1097-0231/asset/RCM_left.gif?v=1&s=91be5e0205fbe00fe36141e410291b5802ce099f)
1097-0231/asset/cover.gif?v=1&s=685086e2b20ab07e9ab5ac022b9782ebdcd7ce5c)