DocumentCode :
3511041
Title :
Hybrid meta-heuristics for DNA fragment assembly problem for noiseless data
Author :
Firoz, Jesun Sahariar ; Rahman, M. Sahel ; Saha, Tanay Kumar
Author_Institution :
Dept. of Comput. Sci. & Eng., Bangladesh Univ. of Eng. & Technol., Dhaka, Bangladesh
fYear :
2012
fDate :
18-19 May 2012
Firstpage :
652
Lastpage :
656
Abstract :
In DNA fragment assembly problem we are given a large set of DNA fragments and we have to construct a complete DNA sequence from them. As it is an NP-hard problem, accurate DNA sequence is hard to find. It is one of the crucial challenges faced by computational biologists. To approximate the DNA sequence, metaheuristic-based algorithms can come in handy. We analyze the performance of two hybrid metaheuristic algorithms to solve the fragment assembly problem and report quite promising results.
Keywords :
DNA; biology computing; genetic algorithms; genetics; genomics; molecular biophysics; DNA fragment assembly problem; NP-hard problem; complete DNA sequence; computational biologists; genomes; metaheuristic-based algorithms; noiseless data; Bioinformatics; Continuous wavelet transforms; Genomics;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Informatics, Electronics & Vision (ICIEV), 2012 International Conference on
Conference_Location :
Dhaka
Print_ISBN :
978-1-4673-1153-3
Type :
conf
DOI :
10.1109/ICIEV.2012.6317502
Filename :
6317502
Link To Document :
بازگشت