Recovering a tree from the leaf colourations it generates under a Markov model

DOI10.1016/0893-9659(94)90024-8zbMath0794.60071OpenAlexW2019750012MaRDI QIDQ1324462

Mike A. Steel

Publication date: 28 August 1994

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10092/11108

zbMATH Keywords

Markov processphylogenetic invariantsapplications to taxonomy

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)

Related Items (35)

Circular Networks from Distorted Metrics ⋮ A basic limitation on inferring phylogenies by pairwise sequence comparisons ⋮ Identifiability of species network topologies from genomic sequences using the logDet distance ⋮ Markov invariants and the isotropy subgroup of a quartet tree ⋮ Towards optimal distance functions for stochastic substitution models ⋮ Topics on phylogenetic algebraic geometry ⋮ Markovian log-supermodularity, and its applications in phylogenetics ⋮ Estimating the bias on the LogDeterminant transformation for evolutionary trees ⋮ Learning loopy graphical models with latent variables: efficient methods and guarantees ⋮ Using the tangle: A consistent construction of phylogenetic distance matrices for quartets ⋮ A remarkable nonlinear invariant for evolution with heterogeneous rates ⋮ Reconstruction of certain phylogenetic networks from their tree-average distances ⋮ Reconstructing pedigrees: Some identifiability questions for a recombination-mutation model ⋮ Generating Markov evolutionary matrices for a given branch length ⋮ An algebraic analysis of the two state Markov model on tripod trees ⋮ Phylogenetic invariants for the general Markov model of sequence mutation ⋮ Estimating trees from filtered data: identifiability of models for morphological phylogenetics ⋮ A few logs suffice to build (almost) all trees. II ⋮ Tree representations of non-symmetric group-valued proximities ⋮ Phase transition in the sample complexity of likelihood-based phylogeny inference ⋮ Learning nonsingular phylogenies and hidden Markov models ⋮ Identifying evolutionary trees and substitution parameters for the general Markov model with invariable sites ⋮ Consistent formulas for estimating the total lengths of trees ⋮ Species Tree Inference from Genomic Sequences Using the Log-Det Distance ⋮ Unnamed Item ⋮ Relevant phylogenetic invariants of evolutionary models ⋮ Lie Markov models ⋮ Markov invariants, plethysms, and phylogenetics ⋮ Consistency and identifiability of the polymorphism-aware phylogenetic models ⋮ Phase transitions in phylogeny ⋮ Reconstructing phylogenies from nucleotide pattern probabilities: A survey and some new results ⋮ Large-Scale Multiple Sequence Alignment and Phylogeny Estimation ⋮ Distance measures in terms of substitution processes ⋮ What can and what cannot be inferred from pairwise sequence comparisons? ⋮ An impossibility result for phylogeny reconstruction from \(k\)-mer counts

Cites Work

• Unnamed Item
• Reconstructing the shape of a tree from observed dissimilarity data
• Structuring causal trees
• Invariants of phylogenies in a simple case with discrete states
• A canonical decomposition theory for metrics on a finite set
• Taxonomy with confidence

This page was built for publication: Recovering a tree from the leaf colourations it generates under a Markov model