The agreement problem for unrooted phylogenetic trees is FPT

DOI10.7155/jgaa.00327zbMath1295.05239OpenAlexW2026466670MaRDI QIDQ5494863

Celine Scornavacca, David Bryant, Steven Kelk, Leo van Iersel

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

zbMATH Keywords

FPT algorithmstrictly compatible unrooted phylogenetic trees

Mathematics Subject Classification ID

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

Related Items (3)

Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees ⋮ On compatibility and incompatibility of collections of unrooted phylogenetic trees ⋮ Unnamed Item

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