English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/163002
logo share SHARE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE
Exportar a otros formatos:


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

AuthorsBlum, Christian ; Blesa, Maria J.
KeywordsHybrid evolutionary algorithm
Issue Date6-Jun-2017
PublisherInstitute of Electrical and Electronics Engineers
Citation2017 IEEE Congress on Evolutionary Computation, CEC 2017. Proceedings: 129-136 (2017)
AbstractThe 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.
Identifiersdoi: 10.1109/CEC.2017.7969305
isbn: 978-150904601-0
Appears in Collections:(IIIA) Comunicaciones congresos
Files in This Item:
File Description SizeFormat 
accesoRestringido.pdf15,38 kBAdobe PDFThumbnail
Show full item record
Review this work

WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.