DocumentCode
1988942
Title
Exact and heuristic algorithms for the DNA fragment assembly problem
Author
Jing, Yimin ; Khuri, Sami
Author_Institution
Dept. of Comput. Sci., San Jose State Univ., CA, USA
fYear
2003
fDate
11-14 Aug. 2003
Firstpage
581
Lastpage
582
Abstract
As more and more public and private genomic assemblies are available, the need for comparison of different computation methods used in the DNA fragment assembly becomes apparent. In this work, we design, implement, and test four heuristic algorithms for assembling DNA fragments. We also design, implement and test an exact algorithm to solve the fragment assembly problem.
Keywords
DNA; biocomputing; dynamic programming; genetic algorithms; heuristic programming; molecular biophysics; DNA fragment assembly problem; computation methods; exact algorithm; genomic assembly; heuristic algorithm; Assembly systems; Bioinformatics; DNA computing; Heuristic algorithms;
fLanguage
English
Publisher
ieee
Conference_Titel
Bioinformatics Conference, 2003. CSB 2003. Proceedings of the 2003 IEEE
Print_ISBN
0-7695-2000-6
Type
conf
DOI
10.1109/CSB.2003.1227413
Filename
1227413
Link To Document