The longest common subsequence problem is classical string problem. It has applications, for example, in pattern
recognition and bioinformatics. In this work we present a socalled Beam-ACO approach for solving this problem. Beam-ACO algorithms are hybrid techniques that results from a
combination of ant colony optimization and beam search, which is an incomplete branch and bound derivative. Our results show that Beam-ACO is able to find new best solutions for 31 out of 60 benchmark instances that we chose for the experimental evaluation of the algorithm.
CitationBlum, C. Beam-ACO for the longest common subsequence problem. A: IEEE World Congress on Computational Intelligence. "2010 IEEE World Congress on Computational Intelligence". Barcelona: IEEE Computer Society Publications, 2010, p. 1-8.
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. If you wish to make any use of the work not provided for in the law, please contact: email@example.com