Show simple item record

dc.contributor.authorBlum, Christian
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics
dc.identifier.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.
dc.description.abstractThe 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.
dc.format.extent8 p.
dc.publisherIEEE Computer Society Publications
dc.subjectÀrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitat
dc.subject.lcshAnt colony optimization
dc.subject.lcshBeam search
dc.subject.lcshMathematical optimization
dc.titleBeam-ACO for the longest common subsequence problem
dc.typeConference report
dc.subject.lemacOptimització matemàtica
dc.subject.lemacAlgorisme de la colònia de formigues
dc.contributor.groupUniversitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
dc.description.peerreviewedPeer Reviewed
dc.rights.accessOpen Access
dc.description.versionPostprint (published version)
upcommons.citation.authorBlum, C.
upcommons.citation.contributorIEEE World Congress on Computational Intelligence
upcommons.citation.publicationName2010 IEEE World Congress on Computational Intelligence

Files in this item


This item appears in the following Collection(s)

Show simple item record

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