Tree enumeration modulo a consensus
From MaRDI portal
Publication:1107457
DOI10.1007/BF01894196zbMath0652.92002OpenAlexW1979692639MaRDI QIDQ1107457
Publication date: 1986
Published in: Journal of Classification (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01894196
Trees (05C05) Enumeration in graph theory (05C30) General biology and biomathematics (92B05) Other natural sciences (mathematical treatment) (92F05)
Related Items (3)
An efficient algorithm for supertrees ⋮ The complexity of reconstructing trees from qualitative characters and subtrees ⋮ Distributions on bicoloured binary trees arising from the principle of parsimony
Cites Work
- Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves
- Unlikelihood that minimal phylogenies for a realistic biological study can be constructed in reasonable computational time
- Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
This page was built for publication: Tree enumeration modulo a consensus
