Please use this identifier to cite or link to this item: https://doi.org/10.1109/TCBB.2007.1018
Title: Reconstructing recombination network from sequence data: The small parsimony problem
Authors: Nguyen, C.T.
Nguyen, N.B.
Sung, W.-K. 
Zhang, L. 
Keywords: Approximability
Dynamic programming
NP-hardness
Parsimony method
Phylogenetic network
Recombination network
Issue Date: 2007
Citation: Nguyen, C.T., Nguyen, N.B., Sung, W.-K., Zhang, L. (2007). Reconstructing recombination network from sequence data: The small parsimony problem. IEEE/ACM Transactions on Computational Biology and Bioinformatics 4 (3) : 394-402. ScholarBank@NUS Repository. https://doi.org/10.1109/TCBB.2007.1018
Abstract: The small parsimony problem is studied for reconstructing recombination networks from sequence data. The small parsimony problem is polynomial-time solvable for phylogenetic trees. However, the problem is proven NP-hard even for galled recombination networks. A dynamic programming algorithm is also developed to solve the small parsimony problem. It takes 0(dn23h) time on an Input recombination network over length-d sequences In which there are h recombination and n - h tree nodes. © 2007 IEEE.
Source Title: IEEE/ACM Transactions on Computational Biology and Bioinformatics
URI: http://scholarbank.nus.edu.sg/handle/10635/43146
ISSN: 15455963
DOI: 10.1109/TCBB.2007.1018
Appears in Collections:Staff Publications

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

SCOPUSTM   
Citations

6
checked on Oct 9, 2018

WEB OF SCIENCETM
Citations

6
checked on Oct 9, 2018

Page view(s)

77
checked on Oct 13, 2018

Google ScholarTM

Check

Altmetric


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