Fixed-parameter algorithms for finding agreement supertrees

DOI10.1007/978-3-642-31265-6_30MaRDI QIDQ2904511zbMATH OpenOpenAlexFDO

Authors Sylvain Guillemot, Brad Shutters, David Fernández-Baca, Sudheer Vakati

Publication date 14 August 2012

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-31265-6_30

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Problems related to evolution (92D15)

Recommendations

• Fixed-Parameter Algorithms for Finding Agreement Supertrees
• Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem
• scientific article; zbMATH DE number 1746436
• The agreement problem for unrooted phylogenetic trees is FPT
• Combinatorial Pattern Matching

Cited in

(4)

• Maximum agreement and compatible supertrees
• scientific article; zbMATH DE number 1746436 (Why is no real title available?)
• Fixed-Parameter Algorithms for Finding Agreement Supertrees
• The agreement problem for unrooted phylogenetic trees is FPT

This page was built for publication: Fixed-parameter algorithms for finding agreement supertrees

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