1. ScholarBank@NUS
  2. 1. Staff
  3. Staff Publications
Please use this identifier to cite or link to this item: https://doi.org/10.1109/TCBB.2007.1018
DC FieldValue
dc.titleReconstructing recombination network from sequence data: The small parsimony problem
dc.contributor.authorNguyen, C.T.
dc.contributor.authorNguyen, N.B.
dc.contributor.authorSung, W.-K.
dc.contributor.authorZhang, L.
dc.date.accessioned2013-07-23T09:26:16Z
dc.date.available2013-07-23T09:26:16Z
dc.date.issued2007
dc.identifier.citationNguyen, 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
dc.identifier.issn15455963
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/43146
dc.description.abstractThe 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.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/TCBB.2007.1018
dc.sourceScopus
dc.subjectApproximability
dc.subjectDynamic programming
dc.subjectNP-hardness
dc.subjectParsimony method
dc.subjectPhylogenetic network
dc.subjectRecombination network
dc.typeArticle
dc.contributor.departmentCOMPUTER SCIENCE
dc.contributor.departmentMATHEMATICS
dc.description.doi10.1109/TCBB.2007.1018
dc.description.sourcetitleIEEE/ACM Transactions on Computational Biology and Bioinformatics
dc.description.volume4
dc.description.issue3
dc.description.page394-402
dc.identifier.isiut000248414700006
Appears in Collections:Staff Publications

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

Google ScholarTM

Check

Altmetric


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