Please use this identifier to cite or link to this item:
|Title:||Reconstructing recombination network from sequence data: The small parsimony problem|
|Source:||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|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 7, 2017
WEB OF SCIENCETM
checked on Nov 22, 2017
checked on Dec 10, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.