Alignment-free phylogenetic reconstruction: Sample complexity via a branching process analysis
From MaRDI portal
Publication:1948701
DOI10.1214/12-AAP852zbMath1377.92060arXiv1109.5002MaRDI QIDQ1948701
Constantinos Daskalakis, Sebastien Roch
Publication date: 24 April 2013
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1109.5002
60J85: Applications of branching processes
60K35: Interacting random processes; statistical mechanics type models; percolation theory
92D10: Genetics and epigenetics
Related Items
Unnamed Item, Parametric analysis of alignment and phylogenetic uncertainty, Phase transition in the sample complexity of likelihood-based phylogeny inference, Identifiability of phylogenetic parameters from \(k\)-mer data under the coalescent, An impossibility result for phylogeny reconstruction from \(k\)-mer counts, Impossibility of consistent distance estimation from sequence lengths under the TKF91 model, Statistically consistent and computationally efficient inference of ancestral DNA sequences in the TKF91 model under dense taxon sampling, A note on probabilistic models over strings: the linear algebra approach
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Global alignment of molecular sequences via ancestral state reconstruction
- The performance of neighbor-joining methods of phylogenetic reconstruction
- Inverting random functions
- A few logs suffice to build (almost) all trees. II
- Invertibility of the TKF model of sequence evolution
- A signal-to-noise analysis of phylogeny estimation by neighbor-joining: Insufficiency of polynomial length sequences
- Provably Fast and Accurate Recovery of Evolutionary Trees through Harmonic Greedy Triplets
- Optimal phylogenetic reconstruction
- Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep
- Alignment Uncertainty and Genomic Analysis
- Maximal Accurate Forests from Distance Matrices
- A few logs suffice to build (almost) all trees (I)
- Inverting Random Functions II: Explicit Bounds for Discrete Maximum Likelihood Estimation, with Applications
- A memetic algorithm to schedule planned maintenance for the national grid
- Learning nonsingular phylogenies and hidden Markov models
