A New Parallel Asynchronous Cellular Genetic Algorithm for de Novo Genomic Sequencing

This work proposes a new parallel asynchronous cellular genetic algorithm model for multi-core processors. The algorithm has been used for solving the DNA fragment assembly problem with the aim of finding highly accurate solutions in short computation times. This NP-Complete problem lies in reconstructing a DNA chain from multiple fragments that have previously been sequenced in a laboratory. The considered problem is a critical step in any genomic project, since the resulting chains are the basis for the entire work. Therefore, the quality of these chains is a major aspect for the correct development of the project. The proposed algorithm is able to find highly accurate results much faster than the other algorithms in the literature. Additionally, since it is parallel, it could be scalable to much larger problem instances, for which the methods typically used usually encounter difficulties. Finally, several new local search methods have been designed, and their influence on the performance of the algorithm has been analyzed.

[1]  Max E. Valentinuzzi.  Handbook of bioinspired algorithms and applications , 2006, BioMedical Engineering OnLine.

[2]  Enrique Alba,et al.  Analyzing Parallel Cellular Genetic Algorithms , 2009 .

[3]  Max E Valentinuzzi,et al.  Handbook of bioinspired algorithms and applications , 2005, BioMedical Engineering OnLine.

[4]  E. Birney,et al.  Velvet: algorithms for de novo short read assembly using de Bruijn graphs. , 2008, Genome research.

[5]  Enrique Alba,et al.  A self-adaptive cellular memetic algorithm for the DNA fragment assembly problem , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[6]  Enrique Alba,et al.  Parallelism and evolutionary algorithms , 2002, IEEE Trans. Evol. Comput..

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

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

[9]  G. Croes.  A Method for Solving Traveling-Salesman Problems , 1958 .

[10]  Haixu Tang,et al.  De novo repeat classification and fragment assembly , 2004, RECOMB.

[11]  Juliane C. Dohm,et al.  SHARCGS, a fast and highly accurate short-read assembly algorithm for de novo genomic sequencing. , 2007, Genome research.

[12]  Sami Khuri,et al.  A Comparison of DNA Fragment Assembly Algorithms , 2004, METMBS.

[13]  Enrique Alba,et al.  A New Local Search Algorithm for the DNA Fragment Assembly Problem , 2007, EvoCOP.

[14]  Enrique Alba,et al.  Optimization Techniques for Solving Complex Problems , 2009 .

[15]  Mihai Pop,et al.  Shotgun Sequence Assembly , 2004, Adv. Comput..

[16]  Enrique Alba,et al.  An asynchronous parallel implementation of a cellular genetic algorithm for combinatorial optimization , 2009, GECCO.

[17]  Jude Shavlik,et al.  Computational methods for fast and accurate dna fragment assembly , 1999 .

[18]  S. Kim,et al.  AMASS: A Structured Pattern Matching Approach to Shotgun Sequence Assembly , 1998, J. Comput. Biol..

[19]  João Meidanis,et al.  Introduction to computational molecular biology , 1997 .

[20]  L. Darrell Whitley,et al.  Cellular Genetic Algorithms , 1993, ICGA.

[21]  Bernard Manderick,et al.  Fine-Grained Parallel Genetic Algorithms , 1989, ICGA.