Compatibility of unrooted phylogenetic trees is FPT
type: Item
instance of: scholarly article
title: Compatibility of unrooted phylogenetic trees is FPT
zbMATH Open document ID: 1086.68097
author: David Bryant
author: Jens Lagergren
published in: Theoretical Computer Science
publication date: 2006-04-06T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5017468
MaRDI profile type: Publication
full work available at URL: j.tcs.2005.10.033
OpenAlex ID: W2081804360
cites work: On the computational power of pushdown automata
cites work: Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
cites work: Easy problems for tree-decomposable graphs
cites work: Q4291429
cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
cites work: Extension operations on sets of leaf-labelled trees
cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
cites work: Q4393480
cites work: Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves
cites work: Q4792088
cites work: The complexity of reconstructing trees from qualitative characters and subtrees
DOI: 10.1016/J.TCS.2005.10.033
description: scientific article; zbMATH DE number 5017468