English   español  
Por favor, use este identificador para citar o enlazar a este item: http://hdl.handle.net/10261/163002
COMPARTIR / IMPACTO:
Estadísticas
logo share SHARE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:
Título

A hybrid evolutionary algorithm based on solution merging for the longest arc-preserving common subsequence problem

AutorBlum, Christian ; Blesa, Maria J.
Palabras claveHybrid evolutionary algorithm
Fecha de publicación6-jun-2017
EditorInstitute of Electrical and Electronics Engineers
Citación2017 IEEE Congress on Evolutionary Computation, CEC 2017. Proceedings: 129-136 (2017)
ResumenThe longest arc-preserving common subsequence problem is an NP-hard combinatorial optimization problem from the field of computational biology. This problem finds applications, in particular, in the comparison of art-annotated ribonucleic acid (RNA) sequences. In this work we propose a simple, hybrid evolutionary algorithm to tackle this problem. The most important feature of this algorithm concerns a crossover operator based on solution merging. In solution merging, two or more solutions to the problem are merged, and an exact technique is used to find the best solution within this union. It is experimentally shown that the proposed algorithm outperforms a heuristic from the literature. © 2017 IEEE.
URIhttp://hdl.handle.net/10261/163002
Identificadoresdoi: 10.1109/CEC.2017.7969305
isbn: 978-150904601-0
Aparece en las colecciones: (IIIA) Comunicaciones congresos
Ficheros en este ítem:
Fichero Descripción Tamaño Formato  
accesoRestringido.pdf15,38 kBAdobe PDFVista previa
Visualizar/Abrir
Mostrar el registro completo
 


NOTA: Los ítems de Digital.CSIC están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.