An impossibility result for phylogeny reconstruction from \(k\)-mer counts

DOI10.1214/22-AAP1805MaRDI QIDQ2108911

Wai-Tong Louis Fan, Brandon Legried, Sebastien Roch

Publication date: 20 December 2022

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2010.14460

zbMATH Keywords

phylogenetics\(k\)-merstatistical consistencyinformation-theoretic boundsMarkov models on trees

Mathematics Subject Classification ID

Markov processes: estimation; hidden Markov models (62M05) Statistical aspects of information-theoretic topics (62B10)

Uses Software

• Mash
• Eigenstrat

Cites Work

• Unnamed Item
• Phase transition in the sample complexity of likelihood-based phylogeny inference
• Line-of-descent and genealogical processes, and their applications in population genetics models
• Full reconstruction of Markov models on evolutionary trees: identifiability and consistency.
• Taxonomy with confidence
• Recovering a tree from the leaf colourations it generates under a Markov model
• Necessary and sufficient conditions for consistent root reconstruction in Markov models on trees
• Identifiability of phylogenetic parameters from \(k\)-mer data under the coalescent
• Compound Poisson approximation: A user's guide
• Broadcasting on trees and the Ising model.
• An elementary proof of the local central limit theorem
• Alignment-free phylogenetic reconstruction: Sample complexity via a branching process analysis
• Impossibility of consistent distance estimation from sequence lengths under the TKF91 model
• Consistency of a phylogenetic tree maximum likelihood estimator
• Phase transition of the largest eigenvalue for nonnull complex sample covariance matrices
• Phylogeny
• Methods for assessing the statistical significance of molecular sequence features by using general scoring schemes.
• Biological Sequence Analysis
• Algorithms on Strings, Trees and Sequences
• A few logs suffice to build (almost) all trees (I)
• Phase transitions in phylogeny
• Probability
• Computational Phylogenetics
• Optimal sequence length requirements for phylogenetic tree reconstruction with indels
• Distributional regimes for the number of k -word matches between two random sequences

This page was built for publication: An impossibility result for phylogeny reconstruction from \(k\)-mer counts