Guiding belief propagation using domain knowledge for protein-structure determination

Authors:
Ameet Soni;Craig Bingman;Jude Shavlik
Affiliations:
University of Wisconsin, Madison, WI;University of Wisconsin, Madison, WI;University of Wisconsin, Madison, WI
Venue:
Proceedings of the First ACM International Conference on Bioinformatics and Computational Biology
Year:
2010

Citing 7
Cited 1

Probabilistic reasoning in intelligent systems: networks of plausible inference

Probabilistic reasoning in intelligent systems: networks of plausible inference
A probabilistic approach to protein backbone tracing in electron density maps

Bioinformatics
Belief Propagation in Large, Highly Connected Graphs for 3D Part-Based Object Recognition

ICDM '06 Proceedings of the Sixth International Conference on Data Mining
Creating protein models from electron-density maps using particle-filtering methods

Bioinformatics
Spherical-harmonic decomposition for molecular recognition in electron-density maps

International Journal of Data Mining and Bioinformatics
Loopy belief propagation for approximate inference: an empirical study

UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
A tutorial on particle filters for online nonlinear/non-GaussianBayesian tracking

IEEE Transactions on Signal Processing

Probabilistic ensembles for improved inference in protein-structure determination

Proceedings of the 2nd ACM Conference on Bioinformatics, Computational Biology and Biomedicine

Quantified Score

Hi-index	0.00

Visualization

Abstract

A major bottleneck in high-throughput protein crystallography is producing protein-structure models from an electron-density map. In previous work, we developed Acmi, a probabilistic framework for sampling all-atom protein-structure models. Acmi uses a fully connected, pairwise Markov random field to model the 3D location of each non-hydrogen atom in a protein. Since exact inference in this model is intractable, Acmi uses loopy belief propagation (BP) to calculate marginal probability distributions. In cases of approximation, BP's message-passing protocol becomes a crucial design decision. Previously, Acmi took a naive, round-robin protocol to sequentially process messages. Others have proposed informed methods for message scheduling by ranking messages based on the amount of new information they contain. These information-theoretic measures, however, fail in the highly connected, large output space domain of protein-structure inference. In this work, we develop a framework for using domain knowledge as a criterion for prioritizing messages in BP. Specifically, we show that using predictions of protein-disorder regions effectively guides BP in our task. Our results show that guiding BP using protein-disorder prediction improves the accuracy of marginal probability distributions and also produces more accurate, complete protein-structure models.