A hybrid evolutionary algorithm based on solution merging for the longest arc-preserving common subsequence problem
Document typeConference lecture
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Rights accessOpen Access
The 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.
CitationBlum, C., Blesa, M. A hybrid evolutionary algorithm based on solution merging for the longest arc-preserving common subsequence problem. A: IEEE Congress on Evolutionary Computation. "2017 IEEE Congress on Evolutionary Computation (CEC): proceedings: 5-8 June 2017, Donostia-San Sebastián, Spain". Donostia-San Sebastián: Institute of Electrical and Electronics Engineers (IEEE), 2017, p. 129-136.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder