2026-06-14T03:18:12Zhttps://repisalud.isciii.es/rest/oai/request

oai:repisalud.isciii.es:20.500.12105/199412024-11-28T19:57:23Zcom_20.500.12105_15322com_20.500.12105_2051col_20.500.12105_16967

00925njm 22002777a 4500 dc Cardona, Gabriel author Llabres, Merce author Rossello, Francesc author Valiente, Gabriel author 2014 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. 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. 10.1155/2014/254279 1537-744X Scientific World Journal http://hdl.handle.net/20.500.13003/11385 24982934 L372953415 2-s2.0-84899408710 http://hdl.handle.net/20.500.12105/19941 334201300001 The Comparison of Tree-Sibling Time Consistent Phylogenetic Networks Is Graph Isomorphism-Complete