Optimal phylogenetic reconstruction
From MaRDI portal
Publication:2931380
DOI10.1145/1132516.1132540zbMath1301.92054OpenAlexW2128020980MaRDI QIDQ2931380
Constantinos Daskalakis, Sebastien Roch, Elchanan Mossel
Publication date: 25 November 2014
Published in: Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://repository.upenn.edu/statistics_papers/190
Related Items
Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges, Reconstructibility of a general DNA evolution model, Phylogenetic information complexity: is testing a tree easier than finding it?, Reconstruction of random colourings, On the variational distance of two trees, Learning loopy graphical models with latent variables: efficient methods and guarantees, Unnamed Item, Recovering hierarchies in terms of content similarity, Alignment-free phylogenetic reconstruction: Sample complexity via a branching process analysis, Fast phylogeny reconstruction through learning of ancestral sequences, The tightness of the Kesten-Stigum reconstruction bound of symmetric model with multiple mutations, Global alignment of molecular sequences via ancestral state reconstruction, Gibbs measures and phase transitions on sparse random graphs, Reconstruction for the Potts model, Evolutionary trees and the Ising model on the Bethe lattice: A proof of Steel's conjecture, Information reconstruction on an infinite tree for a \(4\times 4\)-state asymmetric model with community effects, Large degree asymptotics and the reconstruction threshold of the asymmetric binary channels, Large-Scale Multiple Sequence Alignment and Phylogeny Estimation, Topology discovery of sparse random graphs with few participants, Phase Transition of the Reconstructability of a General Model with Different In-Community and Out-Community Mutations on an Infinite Tree, Broadcasting on random recursive trees
