A Comparison of Evolutionary Approaches to the Shortest Common Supersequence Problem

The Shortest Common Supersequence problem is a hard combinatorial optimization problem with numerous practical applications. Several evolutionary approaches are proposed for this problem, considering the utilization of penalty functions, GRASP-based decoders, or repairing mechanisms. An empirical co...

Descripción completa

Detalles Bibliográficos
Autor principal: Cotta, Carlos
Formato: Online Artículo Texto
Lenguaje:English
Publicado: 2005
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7121053/
http://dx.doi.org/10.1007/11494669_7

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7121053/
http://dx.doi.org/10.1007/11494669_7

Ejemplares similares