NATURE INSPIRED ALGORITHMS TO SOLVE DNA FRAGMENT ASSEMBLY PROBLEM: A SURVEY

Evolutionary search algorithms are becoming an essential advantage in the algorithmic toolbox for solving multi-dimensional optimization problems in a wide range of bioinformatics problems such as Genome fragment assembly which is a NP-hard problem. In computational biology, one of the most challenging problems is to reconstruct the original DNA sequence from a huge number of fragments, each one being numerous hundred base-pairs (bps) long. Recently it has become common for the researchers to apply the heuristic search algorithms to solve these kinds of complex problems with the help of combinatorial optimization. A genetic algorithm, the most well-known and representative evolutionary search technique has been the subject of the major part of such applications. Despite the fact that there have been different methods available in the literature, researchers are still facing difficulties in choosing the best method that could solve these problems efficiently and effectively. This paper aims to analyses the existing algorithms, evaluate them, point out the faults of these works and specify the emerging trend