Perfect phylogenetic networks with recombination
Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review
Related Research Unit(s)
|Journal / Publication||Journal of Computational Biology|
|Publication status||Published - 2001|
|Link to Scopus||https://www.scopus.com/record/display.uri?eid=2-s2.0-0034913468&origin=recordpage|
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.