Fast phylogeny reconstruction through learning of ancestral sequences

DOI10.1007/s00453-012-9644-4zbMath1266.68237arXiv0812.1587OpenAlexW1643503295MaRDI QIDQ1950394

Yanyan Li

Publication date: 13 May 2013

Published in: Algorithmica (Search for Journal in Brave)

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

zbMATH Keywords

phase transitionsIsing modelphylogenetic reconstructioninformation flowancestral sequence reconstructionphylogenetic forests

Mathematics Subject Classification ID

Problems related to evolution (92D15) Learning and adaptive systems in artificial intelligence (68T05) Algorithms on strings (68W32)

Related Items (4)

Phase transition in the sample complexity of likelihood-based phylogeny inference ⋮ Global alignment of molecular sequences via ancestral state reconstruction ⋮ Unnamed Item ⋮ Species tree estimation under joint modeling of coalescence and duplication: sample complexity of quartet methods

Cites Work

• Unnamed Item
• Unnamed Item
• Taxonomy with confidence
• Sequence length bounds for resolving a deep phylogenetic divergence
• A few logs suffice to build (almost) all trees. II
• Optimal phylogenetic reconstruction
• Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep
• Maximal Accurate Forests from Distance Matrices
• A few logs suffice to build (almost) all trees (I)
• Phase transitions in phylogeny
• Estimation of evolutionary distances between homologous nucleotide sequences.

This page was built for publication: Fast phylogeny reconstruction through learning of ancestral sequences