Counting Trees in a Phylogenetic Network Is \#P-Complete

Answering a problem posed by Nakhleh, we prove that counting the number of phylogenetic trees inferred by a (binary) phylogenetic network is \#P-complete. An immediate consequence of this result is that counting the number of phylogenetic trees commonly inferred by two (binary) phylogenetic networks...

Full description

Saved in:
Bibliographic Details
Published inSIAM journal on computing Vol. 42; no. 4; pp. 1768 - 1776
Main Authors Linz, Simone, John, Katherine St, Semple, Charles
Format Journal Article
LanguageEnglish
Published Philadelphia Society for Industrial and Applied Mathematics 01.01.2013
Subjects
Applied mathematics
Computation
Counting
Networks
Phylogenetics
Trees
Online AccessGet full text

Cover

More Information
Summary:Answering a problem posed by Nakhleh, we prove that counting the number of phylogenetic trees inferred by a (binary) phylogenetic network is \#P-complete. An immediate consequence of this result is that counting the number of phylogenetic trees commonly inferred by two (binary) phylogenetic networks is also \#P-complete. [PUBLICATION ABSTRACT]
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0097-5397
1095-7111
DOI:10.1137/12089394X