论文信息 - A Dynamic Programming Algorithm for the k-Haplotyping Problem

A Dynamic Programming Algorithm for the k-Haplotyping Problem

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.

Xiang-Sun Zhang | Ling-Yun Wu | Yu-Ying Zhao | Zhenping Li

[1] Timothy B. Stockwell,et al. The Sequence of the Human Genome , 2001, Science.

[2] Harvey J. Greenberg,et al. Opportunities for Combinatorial Optimization in Computational Biology , 2004, INFORMS J. Comput..

[3] J. Weber,et al. Human whole-genome shotgun sequencing. , 1997, Genome research.

[4] Giuseppe Lancia,et al. Practical Algorithms and Fixed-Parameter Tractability for the Single Individual SNP Haplotyping Problem , 2002, WABI.

[5] Russell Schwartz,et al. Algorithmic strategies for the single nucleotide polymorphism haplotype assembly problem , 2002, Briefings Bioinform..

[6] Carsten Lund,et al. The Approximation of Maximum Subgraph Problems , 1993, ICALP.

[7] Éva Tardos,et al. A strongly polynomial minimum cost circulation algorithm , 1985, Comb..

[8] Russell Schwartz,et al. SNPs Problems, Complexity, and Algorithms , 2001, ESA.