Optimal phylogenetic reconstruction

DOI10.1145/1132516.1132540zbMATH Open1301.92054OpenAlexW2128020980MaRDI QIDQ2931380FDOQ2931380

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

zbMATH Keywords

phylogeneticsIsing modelphase transitionsreconstruction problemJukes-Cantor modelCFN model

Mathematics Subject Classification ID

Problems related to evolution (92D15) Analysis of algorithms and problem complexity (68Q25)

Cited In (22)

• Phase Transition of the Reconstructability of a General Model with Different In-Community and Out-Community Mutations on an Infinite Tree
• Global alignment of molecular sequences via ancestral state reconstruction
• Phylogenetic information complexity: is testing a tree easier than finding it?
• The tightness of the Kesten-Stigum reconstruction bound of symmetric model with multiple mutations
• Recovering hierarchies in terms of content similarity
• Large-Scale Multiple Sequence Alignment and Phylogeny Estimation
• Information reconstruction on an infinite tree for a \(4\times 4\)-state asymmetric model with community effects
• Reconstruction of random colourings
• Fast phylogeny reconstruction through learning of ancestral sequences
• Large degree asymptotics and the reconstruction threshold of the asymmetric binary channels
• Title not available (Why is that?)
• Topology discovery of sparse random graphs with few participants
• Evolutionary trees and the Ising model on the Bethe lattice: A proof of Steel's conjecture
• Alignment-free phylogenetic reconstruction: Sample complexity via a branching process analysis
• Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges
• Ancestral sequence reconstruction with maximum parsimony
• Gibbs measures and phase transitions on sparse random graphs
• Reconstructibility of a general DNA evolution model
• Broadcasting on random recursive trees
• Learning loopy graphical models with latent variables: efficient methods and guarantees
• Reconstruction for the Potts model
• On the variational distance of two trees

This page was built for publication: Optimal phylogenetic reconstruction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2931380)