Reconstructing minimal rooted trees.
From MaRDI portal
Publication:1811070
DOI10.1016/S0166-218X(02)00250-0zbMath1038.05014MaRDI QIDQ1811070
Publication date: 10 June 2003
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items
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