scientific article; zbMATH DE number 1746436

MaRDI QIDQ4532062zbMATH OpenFDO

Authors David Bryant

Publication date 28 May 2002

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

Mathematics Subject Classification ID

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

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

Cited in

(10)

• An efficient algorithm for supertrees
• 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

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)