Optimal phylogenetic reconstruction

DOI10.1145/1132516.1132540zbMATH Open1301.92054OpenAlexW2128020980MaRDI QIDQ2931380FDOQ2931380

Authors Constantinos Daskalakis, Elchanan Mossel, Sebastien Roch 

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)

Recommendations

• Evolutionary trees and the Ising model on the Bethe lattice: A proof of Steel's conjecture
• A phase transition for a random cluster model on phylogenetic trees.
• Phase transitions in phylogeny
• Fast phylogeny reconstruction through learning of ancestral sequences
• Optimal sequence length requirements for phylogenetic tree reconstruction with indels

Cited In (38)

• Global alignment of molecular sequences via ancestral state reconstruction
• Spectral neighbor joining for reconstruction of latent tree models
• Phylogenies without branch bounds: contracting the short, pruning the deep
• 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
• Phylogenetic mixtures: concentration of measure in the large-tree limit
• Recovering hierarchies in terms of content similarity
• Title not available (Why is no real title available?)
• 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
• Do tree split probabilities determine the branch lengths?
• Fast phylogeny reconstruction through learning of ancestral sequences
• On the accuracy of ancestral sequence reconstruction for ultrametric trees with parsimony
• Large degree asymptotics and the reconstruction threshold of the asymmetric binary channels
• Title not available (Why is no real title available?)
• 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
• Phase transition of the reconstructability of a general model with different in-community and out-community mutations on an infinite tree
• Alignment-free phylogenetic reconstruction: Sample complexity via a branching process analysis
• Teasing Apart Two Trees
• Phase transitions in phylogeny
• Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges
• Ancestral sequence reconstruction with maximum parsimony
• Necessary and sufficient conditions for consistent root reconstruction in Markov models on trees
• Gibbs measures and phase transitions on sparse random graphs
• Reconstructibility of a general DNA evolution model
• Optimal sequence length requirements for phylogenetic tree reconstruction with indels
• Broadcasting on random recursive trees
• On the inference of large phylogenies with long branches: how long is too long?
• Parametric maximum parsimonious reconstruction on trees
• The optimal rate for resolving a near-polytomy in a phylogeny
• Learning loopy graphical models with latent variables: efficient methods and guarantees
• Sufficient conditions for two tree reconstruction techniques to succeed on sufficiently long sequences
• Reconstruction for the Potts model
• Phase transition in the sample complexity of likelihood-based phylogeny inference
• How much can evolved characters tell us about the tree that generated them?
• 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)