Beam-ACO for the Longest Common Subsequence Problem

被引：0
|
作者：
Blum, Christian [1 ]
机构：
[1] Univ Politecn Cataluna, ALBCOM Res Grp, ES-08034 Barcelona, Spain
来源：
2010 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC) | 2010年
关键词：
SEARCH;
D O I：
暂无
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
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 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.
引用
收藏
页数：8
相关论文
共 50 条
  • [1] Beam-ACO for the Repetition-Free Longest Common Subsequence Problem
    Blum, Christian
    Blesa, Maria J.
    Calvo, Borja
    [J]. ARTIFICIAL EVOLUTION, EA 2013, 2014, 8752 : 79 - 90
  • [2] Beam search for the longest common subsequence problem
    Blum, Christian
    Blesa, Maria J.
    Lopez-Ibanez, Manuel
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (12) : 3178 - 3186
  • [3] Probabilistic beam search for the longest common subsequence problem
    Blum, Christian
    Blesa, Maria J.
    [J]. ENGINEERING STOCHASTIC LOCAL SEARCH ALGORITHMS: DESIGNING, IMPLEMENTING AND ANALYZING EFFECTIVE HEURISTICS, 2007, 4638 : 150 - +
  • [4] ALGORITHMS FOR LONGEST COMMON SUBSEQUENCE PROBLEM
    HIRSCHBERG, DS
    [J]. JOURNAL OF THE ACM, 1977, 24 (04) : 664 - 675
  • [5] THE LONGEST COMMON SUBSEQUENCE PROBLEM REVISITED
    APOSTOLICO, A
    GUERRA, C
    [J]. ALGORITHMICA, 1987, 2 (03) : 315 - 336
  • [6] On the constrained longest common subsequence problem
    [J]. Gorbenko, A. (gorbenko.aa@gmail.com), 1600, International Association of Engineers (40):
  • [7] On the Longest Common Rigid Subsequence Problem
    Nikhil Bansal
    Moshe Lewenstein
    Bin Ma
    Kaizhong Zhang
    [J]. Algorithmica, 2010, 56 : 270 - 280
  • [8] On the Longest Common Rigid Subsequence Problem
    Bansal, Nikhil
    Lewenstein, Moshe
    Ma, Bin
    Zhang, Kaizhong
    [J]. ALGORITHMICA, 2010, 56 (02) : 270 - 280
  • [9] On the longest common rigid subsequence problem
    Ma, B
    Zhang, KZ
    [J]. COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2005, 3537 : 11 - 20
  • [10] The constrained longest common subsequence problem
    Tsai, YT
    [J]. INFORMATION PROCESSING LETTERS, 2003, 88 (04) : 173 - 176
12345