A New Procedure for Solving the Shortest Superstring Problem, Using the Memetic Algorithm.

The shortest superstring problem (SSP) is a NP-Hard which is used a lot in data compression algorithms, data encryption and also in medical and biological calculations. This problem remains a NP-Hard problem, even with different limitations in size of superstring alphabet. This article presents an optimal solution for shortest superstring problem via using memetic algorithm. Memetic algorithm is an evolutionary algorithm that mixed the local searches with partial improvements to reach better solutions than other evolutionary algorithms like as genetic algorithm. [ABSTRACT FROM AUTHOR]