Reconstructing minimal rooted trees.

DOI10.1016/S0166-218X(02)00250-0zbMath1038.05014OpenAlexW2043950637MaRDI QIDQ1811070

Charles Semple

Publication date: 10 June 2003

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

Full work available at URL: https://doi.org/10.1016/s0166-218x(02)00250-0

zbMATH Keywords

clustersphylogenetic treesupertreesrooted triplestree compatibility

Mathematics Subject Classification ID

Trees (05C05) Problems related to evolution (92D15)

Related Items

Closure operations in phylogenetics ⋮ Complete characterization of incorrect orthology assignments in best match graphs ⋮ Best match graphs ⋮ Computing quadratic entropy in evolutionary trees ⋮ The matroid structure of representative triple sets and triple-closure computation ⋮ Best match graphs with binary trees

Cites Work

• The complexity of reconstructing trees from qualitative characters and subtrees
• Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology
• An efficient algorithm for supertrees
• Extension operations on sets of leaf-labelled trees
• Reconstruction of rooted trees from subtrees
• Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions