Chi Hao, He Kun, Yang Bing, Chen Zhen, Sun Rui-Xiang, Fan Sheng-Bo, Zhang Kun, Liu Chao, Yuan Zuo-Fei, Wang Quan-Hui, Liu Si-Qi, Dong Meng-Qiu, He Si-Min
Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS), Institute of Computing Technology, CAS, Beijing 100190, China.
National Institute of Biological Sciences, Beijing, Beijing 102206, China.
J Proteomics. 2015 Jul 1;125:89-97. doi: 10.1016/j.jprot.2015.05.009. Epub 2015 May 12.
Database search is the dominant approach in high-throughput proteomic analysis. However, the interpretation rate of MS/MS spectra is very low in such a restricted mode, which is mainly due to unexpected modifications and irregular digestion types. In this study, we developed a new algorithm called Alioth, to be integrated into the search engine of pFind, for fast and accurate unrestricted database search on high-resolution MS/MS data. An ion index is constructed for both peptide precursors and fragment ions, by which arbitrary digestions and a single site of any modifications and mutations can be searched efficiently. A new re-ranking algorithm is used to distinguish the correct peptide-spectrum matches from random ones. The algorithm is tested on several HCD datasets and the interpretation rate of MS/MS spectra using Alioth is as high as 60%-80%. Peptides from semi- and non-specific digestions, as well as those with unexpected modifications or mutations, can be effectively identified using Alioth and confidently validated using other search engines. The average processing speed of Alioth is 5-10 times faster than some other unrestricted search engines and is comparable to or even faster than the restricted search algorithms tested.
数据库搜索是高通量蛋白质组学分析中的主要方法。然而,在这种受限模式下,MS/MS谱图的解析率非常低,这主要是由于意外修饰和不规则消化类型所致。在本研究中,我们开发了一种名为Alioth的新算法,将其集成到pFind搜索引擎中,用于对高分辨率MS/MS数据进行快速准确的无限制数据库搜索。为肽前体和碎片离子构建了一个离子索引,通过该索引可以有效地搜索任意消化以及任何修饰和突变的单个位点。使用一种新的重新排序算法来区分正确的肽-谱匹配与随机匹配。该算法在几个HCD数据集上进行了测试,使用Alioth时MS/MS谱图的解析率高达60%-80%。使用Alioth可以有效地识别来自半特异性和非特异性消化以及具有意外修饰或突变的肽,并使用其他搜索引擎进行可靠验证。Alioth的平均处理速度比其他一些无限制搜索引擎快5-10倍,与测试的受限搜索算法相当甚至更快。