IEEE - Institute of Electrical and Electronics Engineers, Inc. - Beam-ACO for the longest common subsequence problem

2010 IEEE Congress on Evolutionary Computation (CEC)

Author(s): Blum, C.
Publisher: IEEE - Institute of Electrical and Electronics Engineers, Inc.
Publication Date: 1 July 2010
Conference Location: Barcelona, Spain, Spain
Conference Date: 18 July 2010
Page(s): 1 - 8
ISBN (CD): 978-1-4244-6910-9
ISBN (Electronic): 978-1-4244-6911-6
ISBN (Paper): 978-1-4244-6909-3
DOI: 10.1109/CEC.2010.5585928
Regular:

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 so-called Beam-ACO... View More

Advertisement