Reconstruction of rooted trees from subtrees

DOI10.1016/0166-218X(95)00074-2zbMath0868.05019MaRDI QIDQ1923599

Nicholas C. Wormald, Meei Pyng Ng

Publication date: 25 November 1996

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

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

rooted treesreconstruction of rooted trees

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (14)

Nonparametric estimation of the tree structure of a nested Archimedean copula ⋮ Counting consistent phylogenetic trees is \#P-complete ⋮ On the estimation of nested Archimedean copulas: a theoretical and an experimental comparison ⋮ Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees ⋮ An Improved Fixed-Parameter Algorithm for Minimum-Flip Consensus Trees ⋮ The difficulty of constructing a leaf-labelled tree including or avoiding given subtrees ⋮ Tree representations of non-symmetric group-valued proximities ⋮ The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets ⋮ New results on optimizing rooted triplets consistency ⋮ Fixed-Parameter Algorithms for Finding Agreement Supertrees ⋮ Realization problems on reachability sequences ⋮ Reconstructing minimal rooted trees. ⋮ Combining tree partitioning, precedence, and incomparability constraints ⋮ A supertree method for rooted trees

Cites Work

• The complexity of reconstructing trees from qualitative characters and subtrees
• An efficient algorithm for supertrees
• Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
• Unnamed Item
• Unnamed Item

This page was built for publication: Reconstruction of rooted trees from subtrees