Estimating the confidence of peptide identifications without decoy databases.
Using decoy databases to compute the confidence of peptide identifications has become the standard procedure for mass spectrometry driven proteomics. While decoy databases have numerous advantages, they double the run time and are not applicable to all peptide identification problems such as error-tolerant or de novo searches or the large-scale identification of cross-linked peptides. Instead, we propose a fast, simple and robust mixture modeling approach to estimate the confidence of peptide identifications without the need for decoy database searches, which automatically checks whether its underlying assumptions are fulfilled. This approach is then evaluated on 41 LC/MS data sets of varying complexity and origin. The results are very similar to those of the decoy database strategy at a negligible computational cost. Our approach is applicable not only to standard protein identification workflows, but also to proteomics problems for which meaningful decoy databases cannot be constructed.
Renard
Bernhard Y
BY
Interdisciplinary Center for Scientific Computing, University of Heidelberg, Speyerer Strasse 6, 69115 Heidelberg, Germany.
Timm
Wiebke
W
Kirchner
Marc
M
Steen
Judith A J
JA
Hamprecht
Fred A
FA
Steen
Hanno
H
D000818:Animals; D016208:Databases, Factual; D006801:Humans; D013058:Mass Spectrometry; D051379:Mice; D010455:Peptides / Q000032:analysis*; D040901:Proteomics / Q000379:methods*; D015203:Reproducibility of Results; D013997:Time Factors
D010455:Peptides