An impossibility result for phylogeny reconstruction from k-mer counts
From MaRDI portal
Publication:2108911
Recommendations
- Counting ancestral reconstructions in a fixed phylogeny
- Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
- Parameterized and Exact Computation
- Identifiability of phylogenetic parameters from \(k\)-mer data under the coalescent
- Reconstructing phylogenies from nucleotide pattern probabilities: A survey and some new results
- Reconstructibility of unrooted level-\(k\) phylogenetic networks from distances
- A basic limitation on inferring phylogenies by pairwise sequence comparisons
- Alignment-free phylogenetic reconstruction: Sample complexity via a branching process analysis
Cites work
- scientific article; zbMATH DE number 3366301 (Why is no real title available?)
- A few logs suffice to build (almost) all trees (I)
- Algorithms on Strings, Trees and Sequences
- Alignment-free phylogenetic reconstruction: Sample complexity via a branching process analysis
- An elementary proof of the local central limit theorem
- Biological Sequence Analysis
- Broadcasting on trees and the Ising model.
- Compound Poisson approximation: A user's guide
- Computational phylogenetics. An introduction to designing methods for phylogeny estimation
- Consistency of a phylogenetic tree maximum likelihood estimator
- Distributional regimes for the number of k -word matches between two random sequences
- Full reconstruction of Markov models on evolutionary trees: identifiability and consistency.
- Identifiability of phylogenetic parameters from \(k\)-mer data under the coalescent
- Impossibility of consistent distance estimation from sequence lengths under the TKF91 model
- Line-of-descent and genealogical processes, and their applications in population genetics models
- Methods for assessing the statistical significance of molecular sequence features by using general scoring schemes.
- Necessary and sufficient conditions for consistent root reconstruction in Markov models on trees
- Optimal sequence length requirements for phylogenetic tree reconstruction with indels
- Phase transition in the sample complexity of likelihood-based phylogeny inference
- Phase transition of the largest eigenvalue for nonnull complex sample covariance matrices
- Phase transitions in phylogeny
- Phylogeny. Discrete and random processes in evolution
- Probability
- Recovering a tree from the leaf colourations it generates under a Markov model
- Taxonomy with confidence
Cited in
(2)
This page was built for publication: An impossibility result for phylogeny reconstruction from \(k\)-mer counts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2108911)
