The Community for Technology Leaders
Green Image
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.
combination network, phylogenetic network, parsimony method, NP-hardness, approximability, dynamic programming

L. Zhang, N. B. Nguyen, W. Sung and C. T. Nguyen, "Reconstructing Recombination Network from Sequence Data: The Small Parsimony Problem," in IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 4, no. , pp. 394-402, 2007.
85 ms
(Ver 3.3 (11022016))