Please use this identifier to cite or link to this item:
|Title:||Perfect phylogenetic networks with recombination|
|Citation:||Wang, L., Zhang, K., Zhang, L. (2001). Perfect phylogenetic networks with recombination. Journal of Computational Biology 8 (1) : 69-78. ScholarBank@NUS Repository. https://doi.org/10.1089/106652701300099119|
|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.|
|Source Title:||Journal of Computational Biology|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jun 15, 2018
WEB OF SCIENCETM
checked on May 23, 2018
checked on Jun 22, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.