Description
The shortest common superstring problem has important applications in bioinformatics, and several approaches have been proposed in the literature to find good approximations to its solutions. In this talk we survey some heuristic algorithms used to get such approximations, and present a new method based on the use of “estimation of distribution algorithms” (EDAs).
(Joint work with Iker Malaina, Martín Blas Pérez and Ildefonso Martínez de la Fuente).
Primary author
Dr
Luis Martínez Fernández
(University of the Basque Country)
