Nature-inspired novel Cuckoo Search Algorithm for genome sequence assembly

This study aims to produce a novel optimization algorithm, called the Cuckoo Search Algorithm (CS), for solving the genome sequence assembly problem. Assembly of genome sequence is a technique that attempts to rebuild the target sequence from the collection of fragments. This study is the first application of the CS for DNA sequence assembly problem in the literature. The algorithm is based on the levy flight behaviour and brood parasitic behaviour. The CS algorithm is employed to maximize the overlap score by reconstructing the original DNA sequence. Experimental results show the ability of the CS to find better optimal genome assembly. To check the efficiency of the proposed technique the results of the CS is compared with one of the well known evolutionary algorithms namely, particle swarm optimization (PSO) and its variants.

[1]  Goutam Chakraborty,et al.  Heuristically Tuned GA to Solve Genome Fragment Assembly Problem , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[2]  Eugene W. Myers,et al.  Toward Simplifying and Accurately Formulating Fragment Assembly , 1995, J. Comput. Biol..

[3]  Kumar Sanjay,et al.  DNA Sequence Assembly using Particle Swarm Optimization , 2011 .

[4]  Ping Ma,et al.  An Improved Ant Colony Algorithm for DNA Sequence Alignment , 2008, 2008 International Symposium on Information Science and Engineering.

[5]  C. Burks,et al.  DNA sequence assembly , 1994, IEEE Engineering in Medicine and Biology Magazine.

[6]  Pavel A. Pevzner,et al.  Computational molecular biology : an algorithmic approach , 2000 .

[7]  Chilukuri K. Mohan,et al.  Parallel hierarchical adaptive genetic algorithm for fragment assembly , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[8]  X. Huang,et al.  CAP3: A DNA sequence assembly program. , 1999, Genome research.

[9]  Enrique Alba,et al.  Metaheuristics for the DNA Fragment Assembly Problem , 2005 .

[10]  Steven Skiena,et al.  Trie-Based Data Structures for Sequence Assembly , 1997, CPM.

[11]  K. Chandrasekaran,et al.  Multi-objective scheduling problem: Hybrid approach using fuzzy assisted cuckoo search algorithm , 2012, Swarm Evol. Comput..

[12]  Xin-She Yang,et al.  Cuckoo Search via Lévy flights , 2009, 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC).

[13]  Mark E. Johnson,et al.  DNA Sequence Assembly and Genetic Algorithms - New Results and Puzzling Insights , 1995, ISMB.

[14]  Owen White,et al.  TIGR Assembler: A New Tool for Assembling Large Shotgun Sequencing Projects , 1995 .

[15]  Enrique Alba,et al.  DNA fragment assembly using a grid-based genetic algorithm , 2008, Comput. Oper. Res..

[16]  Marzuki Khalid,et al.  Implementation of an ant colony system for DNA sequence optimization , 2009, Artificial Life and Robotics.

[17]  Nachol Chaiyaratana,et al.  DNA fragment assembly using an ant colony system algorithm , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[18]  C. Burks,et al.  Artificially generated data sets for testing DNA sequence assembly algorithms. , 1993, Genomics.

[19]  Yong Wang,et al.  A Genetic Algorithm Approach to Solving DNA Fragment Assembly Problem , 2005 .

[20]  Enrique Alba,et al.  A Hybrid Genetic Algorithm for the DNA Fragment Assembly Problem , 2008, Recent Advances in Evolutionary Computation for Combinatorial Optimization.

[21]  Stephanie Forrest,et al.  Genetic algorithms, operators, and DNA fragment assembly , 1995, Machine Learning.

[22]  Asen Asenov,et al.  Self-consistent particle simulation of ion channels , 2005 .

[23]  Xin-She Yang,et al.  Engineering optimisation by cuckoo search , 2010, Int. J. Math. Model. Numer. Optimisation.

[24]  P. Green,et al.  Against a whole-genome shotgun. , 1997, Genome research.