paper-with-me

홈 › Papers

Efficient Inference in Phylogenetic InDel Trees

2008-12-01 · NeurIPS 2008 12 · Alexandre Bouchard-Côté, Dan Klein, Michael. I. Jordan

Accurate and efficient inference in evolutionary trees is a central problem in computational biology. Realistic models require tracking insertions and deletions along the phylogenetic tree, making inference challenging. We propose new sampling techniques that speed up inference and improve the quality of the samples. We compare our method to previous approaches and show performance improvement on metrics evaluating multiple sequence alignment and reconstruction of ancestral sequences.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

Multiple Sequence Alignment

Methods 이 논문이 사용한 방법론

SPEED The monocular depth estimation (MDE) is the task of estimating depth from a single frame. This information is an essential knowledge in many computer vision tasks such as scene…

Similar Papers 제목 키워드 기반

A Fast and Scalable Method for Inferring Phylogenetic Networks from Trees by Aligning Lineage Taxon Strings

2023-01-03 · Louxin Zhang, Niloufar Abhari, Caroline Colijn, Yufeng Wu

The reconstruction of phylogenetic networks is an important but challenging problem in phylogenetics and genome evolution, as the space of phylogenetic networks is vast and cannot be sampled well. One approach to the pro…

Approximate Bayesian computation for Markovian binary trees in phylogenetics

2023-09-01 · Mingqi He, Sophie Hautphenne, Yao-ban Chan

Phylogenetic trees describe the relationships between species in the evolutionary process, and provide information about the rates of diversification. To understand the mechanisms behind macroevolution, we consider a cla…

Variational phylogenetic inference with products over bipartitions

2025-02-21 · Evan Sidrow, Alexandre Bouchard-Côté, Lloyd T. Elliott

Bayesian phylogenetics requires accurate and efficient approximation of posterior distributions over trees. In this work, we develop a variational Bayesian approach for ultrametric phylogenetic trees. We present a novel …

Unsupervised Learning of Phylogenetic Trees via Split-Weight Embedding

2023-12-26 · Yibo Kong, George P. Tiley, Claudia Solis-Lemus

Unsupervised learning has become a staple in classical machine learning, successfully identifying clustering patterns in data across a broad range of domain applications. Surprisingly, despite its accuracy and elegant si…

Clustering

No substitute for real data: phylogenies from birth-death polytomy resolvers should not be used for many downstream comparative analyses

2015-03-17

The statistical estimation of phylogenies is always associated with uncertainty, and accommodating this uncertainty is an important component of modern phylogenetic comparative analysis. The birth-death polytomy resolver…