Identifier to cite or link to this item: http://hdl.handle.net/20.500.13003/11385
The Comparison of Tree-Sibling Time Consistent Phylogenetic Networks Is Graph Isomorphism-Complete
Identifiers
DOI: 10.1155/2014/254279
ISSN: 1537-744X
WOS ID: 000334201300001
Scopus EID: 2-s2.0-84899408710
PMID: 24982934
Embase PUI: L372953415
Share
Statistics
Item usage statisticsMetadata
Show Dublin Core item recordPublication date
2014Document type
research articleCitation
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.Abstract
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.