Tree enumeration modulo a consensus

DOI10.1007/BF01894196MaRDI QIDQ1107457zbMATH OpenOpenAlexFDO

Authors Mariana Constantinescu

Publication date 1986

Published in Journal of Classification (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01894196

zbMATH Keywords

cladisticsconsensusconstraintsSteiner treestree enumeration

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) General biology and biomathematics (92B05) Other natural sciences (mathematical treatment) (92F05)

Recommendations

• Optimal algorithms for comparing trees with labeled leaves
• Enumeration of constrained subtrees of trees
• scientific article; zbMATH DE number 910861
• Computing the Local Consensus of Trees
• Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves

Cites work

• Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves
• Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
• Unlikelihood that minimal phylogenies for a realistic biological study can be constructed in reasonable computational time

Cited in

(3)

• The complexity of reconstructing trees from qualitative characters and subtrees
• Distributions on bicoloured binary trees arising from the principle of parsimony
• An efficient algorithm for supertrees

This page was built for publication: Tree enumeration modulo a consensus

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