DocumentCode :
3569671
Title :
Adaptation of cuckoo search algorithm for the Motif Finding problem
Author :
Elewa, Ebtehal S. ; Abdelhalim, M.B. ; Mabrouk, Mai S.
Author_Institution :
Coll. of Comput. & Inf. Technol. (CCIT), Arab Acad. for Sci., Technol. & Maritime Transp. (AASTMT), Cairo, Egypt
fYear :
2014
Firstpage :
87
Lastpage :
91
Abstract :
In Bioinformatics, Motif Finding is defined as the ability to locate repeated patterns in the sequence of nucleotides or amino acids. Identifying these motifs in DNA sequences is a computationally hard problem which requires efficient algorithms. Cuckoo search (CS) is a new promising metaheuristic search algorithm , CS has been inspired by the breeding behavior of cuckoos and belongs to a class of novel nature-inspired algorithm. CS has been successfully applied to solve continuous optimization problems; however, its ability to solve discrete problems has not been sufficiently explored. In this paper, applying CS algorithm for solving Planted Motif Problems is proposed. Experimental results show that the proposed adaptation can find the motifs fast and efficiently compared to other existing algorithms.
Keywords :
DNA; bioinformatics; optimisation; search problems; DNA sequences; amino acids; bioinformatics; cuckoo search algorithm; metaheuristic search algorithm; motif finding problem; nucleotides; optimization problem; Algorithm design and analysis; Equations; Random access memory; Sociology; Statistics; Cuckoo search; Motif finding; Swarm Intelligence; bio-inspired algorithms; combinatorial problems; discrete domain;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Engineering Conference (ICENCO), 2014 10th International
Print_ISBN :
978-1-4799-5240-3
Type :
conf
DOI :
10.1109/ICENCO.2014.7050437
Filename :
7050437
Link To Document :
بازگشت