, Volume 40, Issue 1, pp 1–14 | Cite as

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.


Bioinformatics Cuckoo search genome sequence assembly meta-heuristics 


  1. Burks C 1994 DNA sequence assembly. Engineering in Medicine and Biology Magazine. IEEE, 13 771–773CrossRefGoogle Scholar
  2. Chandrasekaran K and Simon S P 2012 Multi-objective scheduling problem: Hybrid approach using fuzzy assisted cuckoo search algorithm. Swarm and Evolutionary compution, 5 1–16CrossRefGoogle Scholar
  3. Chen T and Skiena S 1998 Tree-based data structures for sequence assembly. Combinatorial Pattern Matching 206–223Google Scholar
  4. Elloumi M and Kaabi S 1999 Exact and approximation algorithms for the DNA sequence assembly problem. SCI in Biology and Medicine 8Google Scholar
  5. Engle M L and Burks C 1993 Artificially generated data sets for testing dna sequence assembly algorithms. Genomics, 16 (1) 286–288CrossRefGoogle Scholar
  6. Enrique Alba and Gabriel Luque 2008 A Hybrid Genetic Algorithm for the DNA Fragment Assembly Problem. Recent advances in Evolutionary Computation for combinatorial optimization Studies in computational Intelligence, Springer, 153: 101–112Google Scholar
  7. Fang S C, Wang Y and Zhong J 2005 A Genetic Algorithm Approach to Solving DNA Fragment Assembly Problem. J. Computational and Theoretical Nanoscience, 2 499–505CrossRefGoogle Scholar
  8. Green P 1997 Against a whole genome shotgun. Genome Research 7: 410–417Google Scholar
  9. Huang X and Madan A 1999 CAP3: A DNA sequence assembly program. Genome Res, 9 868–877CrossRefGoogle Scholar
  10. Kikuchi S and Chakraborty G 2006 Heuristically tuned GA to solve genome fragment assembly problem. Evolutionary Computation. IEEE: 1491–1498Google Scholar
  11. Kim K and Mohan C K 2003 Parallel hierarchical adaptive genetic algorithm for fragment assembly. Evolutionary Computation, CEC’03, 1 600–607Google Scholar
  12. Luque G and Alba E 2005 Metaheuristics for the DNA fragment assembly problem. Int. J. Comput. Intelligence Res., 1 98–108CrossRefGoogle Scholar
  13. Meksangsouy P and Chaiyaratana N 2003 DNA fragment assembly using an ant colony system algorithm. Evolutionary Computation, 3 1756–1763Google Scholar
  14. Myers E W 2000 Towards simplifying and accurately formulating fragment assembly. J. Computational Biol., 2 275–290CrossRefGoogle Scholar
  15. Nebro A J, Luque G, Luna F, and Alba E 2008 DNA Fragment assembly using a grid-based algorithm. Computers and Operations Res., 35 2776–2790CrossRefMATHGoogle Scholar
  16. Parsons R J and Johnson M E 1995 DNA sequence assembly and genetic algorithms- new results and puzzling insights. Proceedings of the Third International Conference on Intelligent Systems for Molecular Biology (ISMB-95), 277–284Google Scholar
  17. Parsons R J, Forrest S, and Burks C 1995 Genetic algorithms, operators, and DNA fragment assembly. Machine Learning, 21 11–33Google Scholar
  18. Pevzner P A 2000 Computational Molecular Biology: An Algorithmic Approach. Cambridge, MA: MIT Press1Google Scholar
  19. Ravi, Vikas, and Sanjay 2011 DNA Sequence Assembly using Particle Swarm Optimization. Int. J. Comput. Appl., 28(10) 33–38Google Scholar
  20. Setubal J and Meidanis J 1997 Introduction to Computational Molecular Biology. Brazil: University of Campinas, ch. 4 – Fragment Assembly of DNA, 105–139Google Scholar
  21. Sutton G G, White O, Adams M D, and Kerlavage A R 1995 TIGR Assembler: A new tool for assembling large shotgun sequencing projects. Genome Science and Tech, 1 9–19CrossRefGoogle Scholar
  22. Yang X -S and Deb S 2009 Cuckoo search via Lévy flights. In Proc. of World Congress on Nature & Biologically Inspired Computing, (NaBIC 2009), IEEE Publications, USA, pp. 210–214Google Scholar
  23. Yang X -S and Deb S 2010 Engineering optimization by Cuckoo search. Int. J. Mathematical Modeling and Numerical Optimization, 1 330–343CrossRefMATHGoogle Scholar
  24. Zhao Y et al 2008 An improved ant colony algorithm for DNA sequence alignment. Int. Symp. Information Sci. and Eng. 683–688Google Scholar
  25. Zuwairie Ibrahim and Tri Basuki Kurniawan 2009 Implementation of an ant colony system for DNA sequence optimization. J. Artif Life Robotics 293–296Google Scholar

Copyright information

© Indian Academy of Sciences 2015

Authors and Affiliations

  1. 1.Department of Electronics and Communication EngineeringCoimbatore Institute of TechnologyCoimbatoreIndia
  2. 2.Department of Information TechnologyPSG College of TechnologyCoimbatoreIndia

Personalised recommendations