We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.

Durham Research Online
You are in:

Counting consistent phylogenetic trees is #P-complete.

Bordewich, M. and Semple, C. and Talbot, J. (2004) 'Counting consistent phylogenetic trees is #P-complete.', Advances in mathematics., 33 (2). pp. 416-430.


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.

Item Type:Article
Keywords:Phylogenetic tree, Complexity, #P complete.
Full text:Full text not available from this repository.
Publisher Web site:
Date accepted:No date available
Date deposited:No date available
Date of first online publication:August 2004
Date first made open access:No date available

Save or Share this output

Look up in GoogleScholar