Variational upper bounds for probabilistic phylogenetic models

4Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Probabilistic phylogenetic models which relax the site independence evolution assumption often face the problem of infeasible likelihood computations, for example for the task of selecting suitable parameters for the model. We present a new approximation method, applicable for a wide range of probabilistic models, which guarantees to upper bound the true likelihood of data, and apply it to the problem of probabilistic phylogenetic models. The new method is complementary to known variational methods that lower bound the likelihood, and it uses similar methods to optimize the bounds from above and below. We applied our method to aligned DNA sequences of various lengths from human in the region of the CFTR gene and homologous from eight mammals, and found the upper bounds to be appreciably close to the true likelihood whenever it could be computed. When computing the exact likelihood was not feasible, we demonstrated the proximity of the upper and lower variational bounds, implying a tight approximation of the likelihood. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Wexler, Y., & Geiger, D. (2007). Variational upper bounds for probabilistic phylogenetic models. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4453 LNBI, pp. 226–237). Springer Verlag. https://doi.org/10.1007/978-3-540-71681-5_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free