The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - July-September (2007 vol.4)
pp: 394-402
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 proved NP-hard even for galled recombination networks. A dynamic programming algorithm is also developed to solve the small parsimony problem. It takes $O(dn2^{3h})$ time on an input recombination network over length-$d$ sequences in which there are $h$ recombination and $n - h$ tree nodes.
INDEX TERMS
combination network, phylogenetic network, parsimony method, NP-hardness, approximability, dynamic programming
CITATION
C. Thach Nguyen, Nguyen Bao Nguyen, Wing-Kin Sung, Louxin Zhang, "Reconstructing Recombination Network from Sequence Data: The Small Parsimony Problem", IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.4, no. 3, pp. 394-402, July-September 2007, doi:10.1109/tcbb.2007.1018
17 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool