Reconstructing phylogenies from nucleotide pattern probabilities: A survey and some new results
From MaRDI portal
Publication:1281782
DOI10.1016/S0166-218X(98)00080-8zbMath0940.92018MaRDI QIDQ1281782
David Penny, Michael D. Hendy, Mike A. Steel
Publication date: 22 March 1999
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Trees (05C05) Problems related to evolution (92D15) Applications of graph theory (05C90) Continuous-time Markov processes on general state spaces (60J25) Protein sequences, DNA sequences (92D20)
Related Items
Identifiability of tree-child phylogenetic networks under a probabilistic recombination-mutation model of evolution, On the variational distance of two trees, Using the tangle: A consistent construction of phylogenetic distance matrices for quartets, Full reconstruction of Markov models on evolutionary trees: identifiability and consistency., Consistency and convergence rate of phylogenetic inference via regularization, Adaptation of the closest tree method for a two state quartet to Jukes-Cantor tripod trees, Phylogenetic invariants for the general Markov model of sequence mutation, A few logs suffice to build (almost) all trees. II, Maximum likelihood estimation of symmetric group-based models via numerical algebraic geometry, Entanglement invariants and phylogenetic branching, Invertibility of the TKF model of sequence evolution, Teasing Apart Two Trees, Reconstructing pedigrees using probabilistic analysis of ISSR amplification, Consistency and identifiability of the polymorphism-aware phylogenetic models, Inverting random functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reconstructing the shape of a tree from observed dissimilarity data
- Structuring causal trees
- Statistical analysis of hominoid molecular evolution
- Full reconstruction of Markov models on evolutionary trees: identifiability and consistency.
- A combinatorial description of the closest tree algorithm for finding evolutionary trees
- A canonical decomposition theory for metrics on a finite set
- Spectral analysis and a closest tree method for genetic sequences
- Taxonomy with confidence
- Markov chain models - rarity and exponentiality
- Fourier calculus on evolutionary trees
- Recovering a tree from the leaf colourations it generates under a Markov model
- Estimating the bias on the LogDeterminant transformation for evolutionary trees
- A Fourier inversion formula for evolutionary trees
- Inconsistency of evolutionary tree topology reconstruction methods when substitution rates vary across characters
- Invariants of some probability models used in phylogenetic inference
- Asynchronous Distance between Homologous DNA Sequences
- Recognition of Tree Metrics
- A discrete Fourier analysis for evolutionary trees.
- Estimation of evolutionary distances between homologous nucleotide sequences.
- Symmetric Matrices Representable by Weighted Trees over a Cancellative Abelian Monoid
- Efficient algorithms for inferring evolutionary trees
