The agreement problem for unrooted phylogenetic trees is FPT

DOI10.7155/JGAA.00327zbMATH Open1295.05239OpenAlexW2026466670MaRDI QIDQ5494863FDOQ5494863

Authors: Celine Scornavacca, Leo Van Iersel, Steven Kelk, David Bryant 

Publication date: 30 July 2014

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00327

Recommendations

• Compatibility of unrooted phylogenetic trees is FPT
• Fixed-Parameter Algorithms for Finding Agreement Supertrees
• Fixed-parameter algorithms for finding agreement supertrees

zbMATH Keywords

FPT algorithmstrictly compatible unrooted phylogenetic trees

Mathematics Subject Classification ID

Problems related to evolution (92D15) Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85)

Cited In (6)

• Fixed-parameter algorithms for finding agreement supertrees
• Composing dynamic programming tree-decomposition-based algorithms
• Compatibility of unrooted phylogenetic trees is FPT
• A general framework for gene tree correction based on duplication-loss reconciliation
• Agreement forests of caterpillar trees: complexity, kernelization and branching
• On compatibility and incompatibility of collections of unrooted phylogenetic trees

This page was built for publication: The agreement problem for unrooted phylogenetic trees is FPT

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