Constructing big trees from short sequences

DOI10.1007/3-540-63165-8_235zbMath1401.92149OpenAlexW1486005765MaRDI QIDQ4572010

László A. Székely, Péter L. Erdős, Tandy J. Warnow, Mike A. Steel

Publication date: 4 July 2018

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-63165-8_235

zbMATH Keywords

\(L_\infty\)-nearest tree problemshort quartets method

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Trees (05C05) Problems related to evolution (92D15)

Related Items (4)

A polynomial time algorithm for the minimum quartet inconsistency problem with \(O(n)\) quartet errors ⋮ A few logs suffice to build (almost) all trees. II ⋮ Inferring evolutionary trees with strong combinatorial evidence ⋮ Minimum tree cost quartet puzzling

Cites Work

• The complexity of reconstructing trees from qualitative characters and subtrees
• The probabilities of rooted tree-shapes generated by random bifurcation
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Constructing big trees from short sequences