Algorithmic Aspects of Tree Amalgamation

DOI10.1006/JAGM.2000.1116MaRDI QIDQ4521528zbMATH OpenOpenAlexFDO

Authors Sebastian Böcker, David Bryant, Andreas W. M. Dress, Mike Steel

Publication date 19 December 2000

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

Full work available at URL http://hdl.handle.net/10092/238

zbMATH Keywords

amalgamation of leaf-labeled trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• Exponentially many supertrees
• A Class of General Supertree Methods for Nested Taxa
• A supertree method for rooted trees
• Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves
• Improved algorithms for maximum agreement and compatible supertrees

Cited in

(14)

• Characterizing phylogenetically decisive taxon coverage
• Patching up \(X\)-trees
• The matroid structure of representative triple sets and triple-closure computation
• Exponentially many supertrees
• Closure operations in phylogenetics
• Recovering a phylogenetic tree using pairwise closure operations
• From subtrees to supertrees
• Unique perfect phylogeny is NP-hard
• Data structures for mergeable trees
• Treelike quintet systems
• A Class of General Supertree Methods for Nested Taxa
• Patchworks
• Slim sets of binary trees
• An algebraic foundation for automatic feature-based program synthesis

This page was built for publication: Algorithmic Aspects of Tree Amalgamation

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