Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep
From MaRDI portal
Publication:3094948
DOI10.1137/09075576XzbMath1227.92042arXiv0801.4190OpenAlexW1970170219MaRDI QIDQ3094948
Constantinos Daskalakis, Sebastien Roch, Elchanan Mossel
Publication date: 27 October 2011
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0801.4190
Trees (05C05) Problems related to evolution (92D15) Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Special processes (60K99) Distance in graphs (05C12)
Related Items (14)
Circular Networks from Distorted Metrics ⋮ Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges ⋮ Identifiability and inference of non-parametric rates-across-sites models on large-scale phylo\-genies ⋮ Consistency and convergence rate of phylogenetic inference via regularization ⋮ Fast error-tolerant quartet phylogeny algorithms ⋮ Phylogenetic mixtures: concentration of measure in the large-tree limit ⋮ On the quartet distance given partial information ⋮ Unnamed Item ⋮ Learning a tree-structured Ising model in order to make predictions ⋮ Alignment-free phylogenetic reconstruction: Sample complexity via a branching process analysis ⋮ Fast phylogeny reconstruction through learning of ancestral sequences ⋮ Phase transition in the sample complexity of likelihood-based phylogeny inference ⋮ Network delay inference from additive metrics ⋮ Large-Scale Multiple Sequence Alignment and Phylogeny Estimation
This page was built for publication: Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep
