title: Perfect phylogenetic networks with recombination.
abstract: 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.
authors.affiliation: Department of Computer Science, City University of Hong Kong, 83 Tat Chee Avenue, Kowloon, Hong Kong. lwang@cs.cityu.edu.hk
authors.forename: L
authors.initials: L
authors.lastname: Wang
authors.forename: K
authors.initials: K
authors.lastname: Zhang
authors.forename: L
authors.initials: L
authors.lastname: Zhang
mesh_terms: D000465:Algorithms; D008954:Models, Biological; D010802:Phylogeny; D011995:Recombination, Genetic