Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem

DOI10.1007/978-3-540-73437-6_28MaRDI QIDQ3506929zbMATH OpenOpenAlexFDO

Authors Sylvain Guillemot, Vincent Berry

Publication date 17 June 2008

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

Full work available at URL https://hal-lirmm.ccsd.cnrs.fr/lirmm-00130406/file/RR07005.pdf

Mathematics Subject Classification ID

Trees (05C05) Data structures (68P05) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Fixed parameter polynomial time algorithms for maximum agreement and compatible supertrees
• Combinatorial Pattern Matching
• Maximum agreement and compatible supertrees
• Fixed-Parameter Algorithms for Finding Agreement Supertrees
• Improved algorithms for maximum agreement and compatible supertrees

Cited in

(10)

• Maximum agreement and compatible supertrees
• Fixed-parameter algorithms for finding agreement supertrees
• scientific article; zbMATH DE number 1746436 (Why is no real title available?)
• Analogs & duals of the MAST problem for sequences & trees
• Fixed parameter polynomial time algorithms for maximum agreement and compatible supertrees
• Fixed-Parameter Algorithms for Finding Agreement Supertrees
• Improved algorithms for maximum agreement and compatible supertrees
• Advancing divide-and-conquer phylogeny estimation using Robinson-Foulds supertrees
• New results on optimizing rooted triplets consistency
• Linear kernel for \textsc{Rooted Triplet Inconsistency} and other problems based on conflict packing technique

This page was built for publication: Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem

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