Por favor, use este identificador para citar o enlazar este Item:http://hdl.handle.net/20.500.12105/19941
Título
The Comparison of Tree-Sibling Time Consistent Phylogenetic Networks Is Graph Isomorphism-Complete
Autor(es)
Fecha de publicación
2014
Cita
Cardona G, Llabres Segura M, Rossello F, Valiente G. The Comparison of Tree-Sibling Time Consistent Phylogenetic Networks Is Graph Isomorphism-Complete. Sci World J. 2014;:254279. Epub 2014 Apr 2.
Idioma
Inglés
Tipo de documento
research article
Resumen
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 semibinarity condition, then the problem becomes much harder. More precisely, we prove that the isomorphism problem for generic tree-sibling time consistent phylogenetic networks is polynomially equivalent to the graph isomorphism problem. Since the latter is believed not to belong to P, the chances are that it is impossible to define a metric on the class of all tree-sibling time consistent phylogenetic networks that can be computed in polynomial time.
MESH
DECS
Filogenia | Humanos | Algoritmos | Biología Computacional
Versión en línea
DOI
Aparece en las colecciones
Acceso a texto completo