Skip to main content

Research Repository

Advanced Search

Counting Consistent Phylogenetic Trees is #P-complete

Bordewich, M.; Semple, C.; Talbot, J.


C. Semple

J. Talbot


Reconstructing phylogenetic trees is a fundamental task in evolutionary biology. Various algorithms exist for this purpose, many of which come under the heading of `supertree methods'. These methods amalgamate a collection Ρ of phylogenetic trees into a single parent tree. In this paper, we show that, in both the rooted and unrooted settings, counting the number of parent trees that preserve all of the ancestral relationships displayed by the phylogenetic trees in Ρ is #P-complete.


Bordewich, M., Semple, C., & Talbot, J. (2004). Counting Consistent Phylogenetic Trees is #P-complete. Advances in Mathematics, 33(2), 416-430.

Journal Article Type Article
Publication Date Aug 1, 2004
Deposit Date Dec 21, 2009
Journal Advances in Mathematics
Print ISSN 0001-8708
Publisher Elsevier
Peer Reviewed Peer Reviewed
Volume 33
Issue 2
Pages 416-430
Keywords Phylogenetic tree, Complexity, #P complete.
Publisher URL