Please use this identifier to cite or link to this item: https://doi.org/10.1089/106652701300099119
Title: Perfect phylogenetic networks with recombination
Authors: Wang, L.
Zhang, K.
Zhang, L. 
Issue Date: 2001
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
URI: http://scholarbank.nus.edu.sg/handle/10635/103919
ISSN: 10665277
DOI: 10.1089/106652701300099119
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

138
checked on Sep 19, 2018

WEB OF SCIENCETM
Citations

135
checked on Sep 10, 2018

Page view(s)

22
checked on Jun 29, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.