title: Faster mass spectrometry-based protein inference: junction trees are more efficient than sampling and marginalization by enumeration.
abstract: The problem of identifying the proteins in a complex mixture using tandem mass spectrometry can be framed as an inference problem on a graph that connects peptides to proteins. Several existing protein identification methods make use of statistical inference methods for graphical models, including expectation maximization, Markov chain Monte Carlo, and full marginalization coupled with approximation heuristics. We show that, for this problem, the majority of the cost of inference usually comes from a few highly connected subgraphs. Furthermore, we evaluate three different statistical inference methods using a common graphical model, and we demonstrate that junction tree inference substantially improves rates of convergence compared to existing methods. The python code used for this paper is available at http://noble.gs.washington.edu/proj/fido.
authors.affiliation: Department of Neurobiology, Harvard Medical School, Boston, MA 02115, USA. Oliver.Serang@Childrens.Harvard.edu
authors.forename: Oliver
authors.initials: O
authors.lastname: Serang
authors.forename: William Stafford
authors.initials: WS
authors.lastname: Noble
mesh_terms: D000465:Algorithms; D008390:Markov Chains; D013058:Mass Spectrometry / Q000379:methods*; D009010:Monte Carlo Method; D011506:Proteins / Q000032:analysis / Q000737:chemistry*
chemical_list: D011506:Proteins