Perfect phylogenetic networks with recombination | Zendy

Lusheng Wang | Zendy; Kaizhong Zhang | Zendy; Louxin Zhang | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Perfect phylogenetic networks with recombination

Author(s) -

Lusheng Wang,

Kaizhong Zhang,

Louxin Zhang

Publication year - 2001

Publication title -

citeseer x (the pennsylvania state university)

Language(s) - English

Resource type - Conference proceedings

DOI - 10.1145/372202.372271

Subject(s) - phylogenetic network , phylogenetic tree , recombination , phylogenetics , time complexity , tree (set theory) , computer science , mathematics , theoretical computer science , evolutionary biology , combinatorics , algorithm , biology , genetics , gene

The perfect phylogeny problem is a classical problem in evolutionary tree construction. In this paper, we propose a new model called phylogenetic network with recombination that takes recombination events into account. We show that the problem of finding a perfect phylogenetic network with the minimum number of recombination events is NP-hard; we also present an efficient polynomial time algorithm for an interesting restricted version of the problem.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research