A dynamic programming algorithm for the k-haplotyping problem

Acta Mathematicae Applicatae Sinica

Volumn 22, Issue 3, 2006, Pages 405-412

  Li, Zhen Ping ^a,b   Wu, Ling Yun ^a   Zhao, Yu Ying ^c   Zhang, Xiang Sun ^a  

^a INSTITUTE OF APPLIED MATHEMATICS   (China)

^b BEIJING WUZI UNIVERSITY   (China)

^c BEIJING FORESTRY UNIVERSITY   (China)

Author keywords

Dynamic programming; Integer programming; K haplotyping; SNP

Indexed keywords

EID: 36348977063     PISSN: 01689673     EISSN: 16183932     Source Type: Journal    
DOI: 10.1007/s10255-006-0315-6     Document Type: Article

References (8)

1. Greenberg, H.J., Hart, W.E., Lancia, G. Opportunities for combinatorial optimization in computational Biology. INFORMS Journal on Computing, 16(3): 211-231 (2004)
2. Lippert, R. Schwartza, R., Lancia, G., Istrail, S. Algorithmic strategies for the SNPs haplotype assembly problem. Briefings in Bioinformatrics, 3(1): 23-31 (2002)
3. 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
4. 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
5. 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
6. Tardos, E. A strongly polynomial minimum cost circulation algorithm. Combinatorica, 5(3): 247-255 (1985)
7. Venter, J. et al. The sequence of the human genome. Science, 291: 1304-1351 (2001)
8. Weber, J., Myers. E. Human whole genome shotgun sequencing. Genome Research, 7: 401-409 (1997)