The comparison of tree-sibling time consistent phylogenetic networks is graph isomorphism-complete

Details The comparison of tree-sibling time consistent phylogenetic networks is graph isomorphism-complete The comparison of tree-sibling time consistent phylogenetic networks is graph isomorphism-complete

2009-02-26

arxiv.org/abs/0902.4640v1

Biology

Quantitative Biology

Populations and Evolution

10 pages, 3 figures

Scientific paper

In a previous work, we gave a metric on the class of semibinary tree-sibling time consistent phylogenetic networks that is computable in polynomial time; 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 above, then the problem becomes much harder. More precisely, we proof 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 to be neither in P nor NP-complete, 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.

Affiliated with

Also associated with

No associations

Rating

The comparison of tree-sibling time consistent phylogenetic networks is graph isomorphism-complete does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The comparison of tree-sibling time consistent phylogenetic networks is graph isomorphism-complete, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The comparison of tree-sibling time consistent phylogenetic networks is graph isomorphism-complete will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-254756