Compatibility of unrooted phylogenetic trees is FPT

Theoretical Computer Science

Volumn 351, Issue 3, 2006, Pages 296-302

  Bryant, David ^a   Lagergren, Jens ^b  

^a MCGILL UNIVERSITY   (Canada)

^b ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; EDGE DETECTION; GENETIC ENGINEERING;

CONTRACTING EDGES; FIXED PARAMETER TRACTABLE (FPT); PHYLOGENETIC TREES;

FORESTRY;

ALGORITHMS; EDGES; GENETIC ENGINEERING; LEAVES; TREES;

EID: 32144460195     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.10.033     Document Type: Conference Paper

References (11)

1. A.V. Aho, J.E. Hopcroft, and J.D. Ullman The Design and Analysis of Computer Algorithms 1974 Addison-Wesley Reading, MA
2. A.V. Aho, T.G. Sagiv, T.G. Szymanski, and J.D. Ullman Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions SIAM J. Comput. 10 3 1981 405 421
3. S. Arnborg, J. Lagergren, and D. Seese Easy problems for tree-decomposable graphs J. Algorithms 12 2 1991 308 340
4. H.L. Bodlaender A tourist guide through treewidth Acta Cybernet. 11 1993 1 21
5. H.L. Bodlaender A linear-time algorithm for finding tree-decompositions of small treewidth SIAM J. Comput. 25 6 1996 1305 1317
6. D. Bryant, and M. Steel Extension operations on sets of leaf-labelled trees Adv. Appl. Math. 16 1995 425 453
7. B. Courcelle The monadic second-order logic of graphs. I. Recognizable sets of finite graphs Inform. Comput. 85 1 1990 12 75
8. R.G. Downey, and M.R. Fellows Parameterized Complexity 1999 Springer Berlin
9. A.D. Gordon Consensus supertrees: the synthesis of rooted trees containing overlapping sets of labeled leaves J. Classification 3 1986 335 348
10. C. Semple, and M. Steel Phylogenetics 2003 Oxford University Press Oxford
11. M. Steel The complexity of reconstructing trees from qualitative characters and subtrees J. Classification 9 1992 91 116