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...

Descripción completa

Detalles Bibliográficos
Autores principales: Cardona, Gabriel, Llabrés, Mercè, Rosselló, Francesc, Valiente, Gabriel
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Hindawi Publishing Corporation 2014
Materias:
Research Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3996867/
https://www.ncbi.nlm.nih.gov/pubmed/24982934
http://dx.doi.org/10.1155/2014/254279

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3996867/
https://www.ncbi.nlm.nih.gov/pubmed/24982934
http://dx.doi.org/10.1155/2014/254279

Ejemplares similares