Counting consistent phylogenetic trees is #P-complete

Advances in Applied Mathematics

Volumn 33, Issue 2, 2004, Pages 416-430

  Bordewich, Magnus ^a   Semple, Charles ^b   Talbot, John ^c  

^a NEW COLLEGE   (United Kingdom)

^b UNIVERSITY OF CANTERBURY   (New Zealand)

^c MERTON COLLEGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 3342966895     PISSN: 01968858     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.aam.2003.08.006     Document Type: Article

References (12)

1. Aho A.V. Sagiv Y. Szymanski T.G. Ullman J.D. Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions SIAM J. Comput. 10 1981 405-421
2. Bininda-Emonds O.R.P. Gittleman J.L. Steel M.A. The (super)tree of life: procedures, problems and prospects Annual Rev. Ecology Systematics 33 2002 265-289
3. O.R.P. Bininda-Emonds, Phylogenetic supertrees: combining information to reveal the Tree of life, Comput. Biology Ser., Kluwer, in press
4. Brightwell G. Winkler P. Counting linear extensions ORDER 8 3 1992 225-242
5. D. Bryant, Building trees, hunting for trees, and comparing trees: the theory and methods in phylogenetic analysis, PhD thesis, University of Canterbury, 1997
6. Constantinescu M. Sankoff D. An efficient algorithm for supertrees J. Classification 12 1995 101-112
7. Jerrum M.R. Valiant L.G. Vazirani V.V. Random generation of combinatorial structures from a uniform distribution Theoret. Comput. Sci. 43 1986 169-188
8. Ng M.P. Wormald N.C. Reconstruction of rooted trees from subtrees Discrete Appl. Math. 69 1996 19-31
9. Semple C. Steel M. Phylogenetics 2003 Oxford University Press
10. Steel M. The complexity of reconstructing trees from qualitative characters and subtrees J. Classification 9 1992 91-116
11. Valiant L.G. The complexity of enumeration and reliability problems SIAM J. Comput. 8 1979 410-421
12. Welsh D. Complexity: Knots, Colourings and Counting 1993 Cambridge University Press