An efficient parallelization of phosphorylated peptide and protein identification |
| |
| Authors: | Leheng Wang Wenping Wang Hao Chi Yanjie Wu You Li Yan Fu Chen Zhou Ruixiang Sun Haipeng Wang Chao Liu Zuofei Yuan Liyun Xiu Si‐Min He |
| |
| Affiliation: | 1. Key Lab of Intelligent Information Processing, Chinese Academy of Sciences, Beijing 100190, P.R. China;2. Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100190, P.R. China;3. Graduate University of Chinese Academy of Sciences, Beijing 100049, P.R. China |
| |
| 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. |
| |
| Keywords: | |
|
|
