Učitavanje...
The Comparison of Tree-Sibling Time Consistent Phylogenetic Networks Is Graph Isomorphism-Complete
Several polynomial time computable metrics on the class of semibinary tree-sibling time consistent phylogenetic networks are available in the literature; in particular, the problem of deciding if two networks of this kind are isomorphic is in P. In this paper, we show that if we remove the semibinar...
Spremljeno u:
| Glavni autori: | , , , |
|---|---|
| Format: | Artigo |
| Jezik: | Inglês |
| Izdano: |
Hindawi Publishing Corporation
2014
|
| Teme: | |
| Online pristup: | https://ncbi.nlm.nih.gov/pmc/articles/PMC3996867/ https://ncbi.nlm.nih.gov/pubmed/24982934 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1155/2014/254279 |
| Oznake: |
Dodaj oznaku
Bez oznaka, Budi prvi tko označuje ovaj zapis!
|