Loading...
Please wait, while we are loading the content...
Similar Documents
Counting trees in a phylogenetic network is #p-complete.
| Content Provider | CiteSeerX |
|---|---|
| Author | Linz, Simone John, Katherine St. Semple, Charles |
| Abstract | 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. |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Phylogenetic Tree Phylogenetic Network Counting Tree Phylogenetic Network P-complete Immediate Consequence Key Word |
| Content Type | Text |