title: The probabilistic convolution tree: efficient exact Bayesian inference for faster LC-MS/MS protein inference.
abstract: Exact Bayesian inference can sometimes be performed efficiently for special cases where a function has commutative and associative symmetry of its inputs (called "causal independence"). For this reason, it is desirable to exploit such symmetry on big data sets. Here we present a method to exploit a general form of this symmetry on probabilistic adder nodes by transforming those probabilistic adder nodes into a probabilistic convolution tree with which dynamic programming computes exact probabilities. A substantial speedup is demonstrated using an illustration example that can arise when identifying splice forms with bottom-up mass spectrometry-based proteomics. On this example, even state-of-the-art exact inference algorithms require a runtime more than exponential in the number of splice forms considered. By using the probabilistic convolution tree, we reduce the runtime to O(k log(k)2) and the space to O(k log(k)) where k is the number of variables joined by an additive or cardinal operator. This approach, which can also be used with junction tree inference, is applicable to graphs with arbitrary dependency on counting variables or cardinalities and can be used on diverse problems and fields like forward error correcting codes, elemental decomposition, and spectral demixing. The approach also trivially generalizes to multiple dimensions.
authors.affiliation: Thermo Fisher Scientific, Bremen, Germany.
authors.forename: Oliver
authors.initials: O
authors.lastname: Serang
mesh_terms: D000465:Algorithms; D017398:Alternative Splicing; D001499:Bayes Theorem; D002853:Chromatography, Liquid; D015233:Models, Statistical; D011336:Probability; D011506:Proteins / Q000737:chemistry*; D040901:Proteomics / Q000379:methods; D012815:Signal Processing, Computer-Assisted; D053719:Tandem Mass Spectrometry
chemical_list: D011506:Proteins