Abstract
The Minimum Fragments Removal (MFR) problem is one of the haplotyping problems: given a set of fragments, remove the minimum number of fragments so that the resulting fragments can be partitioned into k classes of non-conflicting subsets. In this paper, we formulate the k-MFR problem as an integer linear programming problem, and develop a dynamic programming approach to solve the k-MFR problem for both the gapless and gap cases.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Greenberg, H.J., Hart, W.E., Lancia, G. Opportunities for combinatorial optimization in computational Biology. INFORMS Journal on Computing, 16(3): 211–231 (2004)
Lippert, R. Schwartza, R., Lancia, G., Istrail, S. Algorithmic strategies for the SNPs haplotype assembly problem. Briefings in Bioinformatrics, 3(1): 23–31 (2002)
Lancia, G., Bafna, V., Istrail, S., Lippert, R., Schwartz, R. SNPs problems, complexity and algorithms. In Proceedings of Annual European Symposium on Algorithms (ESA), volume 2161, Lecture Notes in Computer Science, 182–193, Springer-Verlag, Berlin, Heidelberg, 2001
Lund, C., Yannakakis, M. The approximation of maximum subgraph problems. In Proceedings of 20th Int. Colloqium on Automata, Languages and Programming, 40–51, Springer-Verlag, Berlin, Heidelberg, 1994
Rizzi, R. Bafna, V., Istrail, S., Lancia, G. Practical algorithms and fixed-parameter tractability for the single individual SNP haploityping problem. In R. Guigo and D. Gusfield, editors. Proceedings of 2nd Annual Workshop on Algorithms in Bioinformaticcs (WABI), volum 2452 of Lecture Notes in Computer Science, 29–43, Springer-Verlag, Berlin, Heidelberg, 2002
Tardos, E. A strongly polynomial minimum cost circulation algorithm. Combinatorica, 5(3): 247–255 (1985)
Venter, J. et al. The sequence of the human genome. Science, 291: 1304–1351 (2001)
Weber, J., Myers. E. Human whole genome shotgun sequencing. Genome Research, 7: 401–409 (1997)
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by the National Natural Science Foundation of China (No. 60503004, No. 10471141). The authors gratefully acknowledge the support of K.G.Wang Education Foundation of Hong Kong.
Rights and permissions
About this article
Cite this article
Li, Zp., Wu, Ly., Zhao, Yy. et al. A Dynamic Programming Algorithm for the k-Haplotyping Problem. Acta Math. Appl. Sin, Engl. Ser. 22, 405–412 (2006). https://doi.org/10.1007/s10255-006-0315-6
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/s10255-006-0315-6