作者: Peijun Zhu , Zengyou He , Ting Huang
DOI:
关键词: Quantitative proteomics 、 Special case 、 Protein identification 、 Computational biology 、 Spectral counting 、 Computational problem 、 Shotgun proteomics 、 Protein abundance 、 Bioinformatics 、 Computer science 、 Protein inference
摘要: Motivation: In mass spectrometry-based shotgun proteomics, protein quantification and identification are two major computational problems. To quantify the abundance, a list of proteins must be firstly inferred from sample. Then relative or absolute abundance is estimated with methods, such as spectral counting. Until now, researchers have been dealing these processes separately. fact, they sides same coin in sense that truly present those non-zero abundances. Then, one interesting question if we regard inference problem special problem, it possible to achieve better performance? Contribution: this paper, investigate feasibility using methods solve problem. Protein determine whether each candidate sample not. calculate protein. Naturally, absent should zero Thus, argue can viewed case problem: Based on idea, our paper tries use three very simple effectively. Results: The experimental results six datasets show competitive previous algorithms. This demonstrates plausible take quantification, which opens door devising more effective algorithms perspective.