Efficient Inference in Phylogenetic InDel Trees
Alexandre Bouchard-Côté ⋅ Michael Jordan ⋅ Dan Klein
2008 Poster
Abstract
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.
Chat is not available.
Successful Page Load