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 条
  • [41] Longest common subsequence problem for unoriented and cyclic strings
    Nicolas, Francois
    Rivals, Eric
    THEORETICAL COMPUTER SCIENCE, 2007, 370 (1-3) : 1 - 18
  • [42] A hyper-heuristic for the Longest Common Subsequence problem
    Tabataba, Farzaneh Sadat
    Mousavi, Sayyed Rasoul
    COMPUTATIONAL BIOLOGY AND CHEMISTRY, 2012, 36 : 42 - 54
  • [43] High precision simulations of the longest common subsequence problem
    R. Bundschuh
    The European Physical Journal B - Condensed Matter and Complex Systems, 2001, 22 : 533 - 541
  • [44] An A* search algorithm for the constrained longest common subsequence problem
    Djukanovic, Marko
    Berger, Christoph
    Raidl, Gunther R.
    Blum, Christian
    INFORMATION PROCESSING LETTERS, 2021, 166
  • [45] FAST ALGORITHM FOR THE LONGEST-COMMON-SUBSEQUENCE PROBLEM
    MUKHOPADHYAY, A
    INFORMATION SCIENCES, 1980, 20 (01) : 69 - 82
  • [46] Anytime algorithms for the longest common palindromic subsequence problem
    Djukanovic, Marko
    Raidl, Guenther R.
    Blum, Christian
    COMPUTERS & OPERATIONS RESEARCH, 2020, 114
  • [47] A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation
    Djukanovic, Marko
    Raidl, Guenther R.
    Blum, Christian
    MACHINE LEARNING, OPTIMIZATION, AND DATA SCIENCE, 2019, 11943 : 154 - 167
  • [48] Cyclic longest common subsequence
    Naiman, Aaron E.
    Farber, Eliav
    Stein, Yossi
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2023, 15 (04)
  • [49] The longest common subsequence problem for arc-annotated sequences
    Jiang, T
    Lin, GH
    Ma, B
    Zhang, KZ
    COMBINATORIAL PATTERN MATCHING, 2000, 1848 : 154 - 165
  • [50] Another efficient systolic algorithm for the longest common subsequence problem
    Lin, YC
    Chen, JC
    JOURNAL OF THE CHINESE INSTITUTE OF ENGINEERS, 2000, 23 (05) : 607 - 613
12345