Improving sensitivity by probabilistically combining results from multiple MS/MS search methodologies. Searle, B. C., Turner, M., & Nesvizhskii, A. I. JOURNAL OF PROTEOME RESEARCH, 7(1):245-253, JAN, 2008. doi abstract bibtex Database-searching programs generally identify only a fraction of the spectra acquired in a standard LC/MS/MS study of digested proteins. Subtle variations in database-searching algorithms for assigning peptides to MS/MS spectra have been known to provide different identification results. To leverage this variation, a probabilistic framework is developed for combining the results of multiple search engines. The scores for each search engine are first independently converted into peptide probabilities. These probabilities can then be readily combined across search engines using Bayesian rules and the expectation maximization learning algorithm. A significant gain in the number of peptides identified with high confidence with each additional search engine is demonstrated using several data sets of increasing complexity, from a control protein mixture to a human plasma sample, searched using SEQUEST, Mascot, and X! Tandem database-searching programs. The increased rate of peptide assignments also translates into a substantially larger number of protein identifications in LC/MS/MS studies compared to a typical analysis using a single database-search tool.
@article{ ISI:000252154200029,
Author = {Searle, Brian C. and Turner, Mark and Nesvizhskii, Alexey I.},
Title = {{Improving sensitivity by probabilistically combining results from
multiple MS/MS search methodologies}},
Journal = {{JOURNAL OF PROTEOME RESEARCH}},
Year = {{2008}},
Volume = {{7}},
Number = {{1}},
Pages = {{245-253}},
Month = {{JAN}},
Abstract = {{Database-searching programs generally identify only a fraction of the
spectra acquired in a standard LC/MS/MS study of digested proteins.
Subtle variations in database-searching algorithms for assigning
peptides to MS/MS spectra have been known to provide different
identification results. To leverage this variation, a probabilistic
framework is developed for combining the results of multiple search
engines. The scores for each search engine are first independently
converted into peptide probabilities. These probabilities can then be
readily combined across search engines using Bayesian rules and the
expectation maximization learning algorithm. A significant gain in the
number of peptides identified with high confidence with each additional
search engine is demonstrated using several data sets of increasing
complexity, from a control protein mixture to a human plasma sample,
searched using SEQUEST, Mascot, and X! Tandem database-searching
programs. The increased rate of peptide assignments also translates into
a substantially larger number of protein identifications in LC/MS/MS
studies compared to a typical analysis using a single database-search
tool.}},
DOI = {{10.1021/pr070540w}},
ISSN = {{1535-3893}},
ResearcherID-Numbers = {{Nesvizhskii, Alexey/A-5410-2012}},
Unique-ID = {{ISI:000252154200029}},
}
Downloads: 0
{"_id":"PioYPAZHZJGusmzFR","authorIDs":[],"author_short":["Searle, B. C.","Turner, M.","Nesvizhskii, A. I."],"bibbaseid":"searle-turner-nesvizhskii-improvingsensitivitybyprobabilisticallycombiningresultsfrommultiplemsmssearchmethodologies-2008","bibdata":{"bibtype":"article","type":"article","author":[{"propositions":[],"lastnames":["Searle"],"firstnames":["Brian","C."],"suffixes":[]},{"propositions":[],"lastnames":["Turner"],"firstnames":["Mark"],"suffixes":[]},{"propositions":[],"lastnames":["Nesvizhskii"],"firstnames":["Alexey","I."],"suffixes":[]}],"title":"Improving sensitivity by probabilistically combining results from multiple MS/MS search methodologies","journal":"JOURNAL OF PROTEOME RESEARCH","year":"2008","volume":"7","number":"1","pages":"245-253","month":"JAN","abstract":"Database-searching programs generally identify only a fraction of the spectra acquired in a standard LC/MS/MS study of digested proteins. Subtle variations in database-searching algorithms for assigning peptides to MS/MS spectra have been known to provide different identification results. To leverage this variation, a probabilistic framework is developed for combining the results of multiple search engines. The scores for each search engine are first independently converted into peptide probabilities. These probabilities can then be readily combined across search engines using Bayesian rules and the expectation maximization learning algorithm. A significant gain in the number of peptides identified with high confidence with each additional search engine is demonstrated using several data sets of increasing complexity, from a control protein mixture to a human plasma sample, searched using SEQUEST, Mascot, and X! Tandem database-searching programs. The increased rate of peptide assignments also translates into a substantially larger number of protein identifications in LC/MS/MS studies compared to a typical analysis using a single database-search tool.","doi":"10.1021/pr070540w","issn":"1535-3893","researcherid-numbers":"Nesvizhskii, Alexey/A-5410-2012","unique-id":"ISI:000252154200029","bibtex":"@article{ ISI:000252154200029,\nAuthor = {Searle, Brian C. and Turner, Mark and Nesvizhskii, Alexey I.},\nTitle = {{Improving sensitivity by probabilistically combining results from\n multiple MS/MS search methodologies}},\nJournal = {{JOURNAL OF PROTEOME RESEARCH}},\nYear = {{2008}},\nVolume = {{7}},\nNumber = {{1}},\nPages = {{245-253}},\nMonth = {{JAN}},\nAbstract = {{Database-searching programs generally identify only a fraction of the\n spectra acquired in a standard LC/MS/MS study of digested proteins.\n Subtle variations in database-searching algorithms for assigning\n peptides to MS/MS spectra have been known to provide different\n identification results. To leverage this variation, a probabilistic\n framework is developed for combining the results of multiple search\n engines. The scores for each search engine are first independently\n converted into peptide probabilities. These probabilities can then be\n readily combined across search engines using Bayesian rules and the\n expectation maximization learning algorithm. A significant gain in the\n number of peptides identified with high confidence with each additional\n search engine is demonstrated using several data sets of increasing\n complexity, from a control protein mixture to a human plasma sample,\n searched using SEQUEST, Mascot, and X! Tandem database-searching\n programs. The increased rate of peptide assignments also translates into\n a substantially larger number of protein identifications in LC/MS/MS\n studies compared to a typical analysis using a single database-search\n tool.}},\nDOI = {{10.1021/pr070540w}},\nISSN = {{1535-3893}},\nResearcherID-Numbers = {{Nesvizhskii, Alexey/A-5410-2012}},\nUnique-ID = {{ISI:000252154200029}},\n}\n\n","author_short":["Searle, B. C.","Turner, M.","Nesvizhskii, A. I."],"key":"ISI:000252154200029","id":"ISI:000252154200029","bibbaseid":"searle-turner-nesvizhskii-improvingsensitivitybyprobabilisticallycombiningresultsfrommultiplemsmssearchmethodologies-2008","role":"author","urls":{},"downloads":0,"html":""},"bibtype":"article","biburl":"http://www.nesvilab.org/cgi-bin/citations_nesvi.bib","creationDate":"2015-02-13T16:06:43.998Z","downloads":0,"keywords":["*bayes theorem","*information storage and retrieval","*software","*tandem mass spectrometry","algorithms","databases","protein","humans","models","statistical","proteins/*analysis","proteomics/*methods"],"search_terms":["improving","sensitivity","probabilistically","combining","results","multiple","search","methodologies","searle","turner","nesvizhskii"],"title":"Improving sensitivity by probabilistically combining results from multiple MS/MS search methodologies","year":2008,"dataSources":["3G7HHGZZzqcNrpudy"]}