scientific article; zbMATH DE number 1746436

zbMATH Open0991.92019MaRDI QIDQ4532062FDOQ4532062

Authors: David Bryant 

Publication date: 28 May 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2066/20660024

Title of this publication is not available (Why is that?)

Recommendations

• Maximum agreement and compatible supertrees
• Rooted maximum agreement supertrees
• LATIN 2004: Theoretical Informatics
• Fixed-parameter algorithms for finding agreement supertrees
• Fixed-Parameter Algorithms for Finding Agreement Supertrees
• Combinatorial Pattern Matching
• Improved algorithms for maximum agreement and compatible supertrees
• Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem
• Fixed parameter polynomial time algorithms for maximum agreement and compatible supertrees
• The maximum agreement subtree problem

Mathematics Subject Classification ID

Problems related to evolution (92D15) Trees (05C05) Computational methods for problems pertaining to biology (92-08)

Cited In (10)

• Constructing rooted supertrees using distances
• Exponentially many supertrees
• Fixed-parameter algorithms for finding agreement supertrees
• Finding smallest supertrees
• Variational supertrees for Bayesian phylogenetics
• Maximum agreement and compatible supertrees
• Optimizing phylogenetic supertrees using answer set programming
• Treelike quintet systems
• Fixed-Parameter Algorithms for Finding Agreement Supertrees
• An efficient algorithm for supertrees

This page was built for publication:

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