Constructing big trees from short sequences

DOI10.1007/3-540-63165-8_235MaRDI QIDQ4572010zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• scientific article; zbMATH DE number 2034574
• A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application
• A few logs suffice to build (almost) all trees. II
• A memetic algorithm to schedule planned maintenance for the national grid
• Constructing optimal trees from quartets

Cites work

• scientific article; zbMATH DE number 1256739 (Why is no real title available?)
• scientific article; zbMATH DE number 850224 (Why is no real title available?)
• scientific article; zbMATH DE number 871934 (Why is no real title available?)
• The complexity of reconstructing trees from qualitative characters and subtrees
• The probabilities of rooted tree-shapes generated by random bifurcation

Cited in

(12)

• Inferring evolutionary trees with strong combinatorial evidence
• Combining polynomial running time and fast convergence for the disk-covering method.
• A few logs suffice to build (almost) all trees. II
• Minimum tree cost quartet puzzling
• Absolute convergence: True trees from short sequences
• scientific article; zbMATH DE number 1305415 (Why is no real title available?)
• scientific article; zbMATH DE number 1305446 (Why is no real title available?)
• scientific article; zbMATH DE number 1088266 (Why is no real title available?)
• scientific article; zbMATH DE number 2034574 (Why is no real title available?)
• scientific article; zbMATH DE number 1445316 (Why is no real title available?)
• A memetic algorithm to schedule planned maintenance for the national grid
• A polynomial time algorithm for the minimum quartet inconsistency problem with O(n) quartet errors

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4572010)