A large neighborhood search heuristic for the longest common subsequence problem

被引：0
|
作者：
Todd Easton
Abhilash Singireddy
机构：
[1] Kansas State University,School of Industrial and Manufacturing Systems Engineering
来源：
Journal of Heuristics | 2008年 / 14卷
关键词：
Longest common subsequence; Dynamic programming; Large neighborhood search; Heuristic;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Given a set S={S1,…,Sk} of finite strings, the k-Longest Common Subsequence Problem (k-LCSP) seeks a string L* of maximum length such that L* is a subsequence of each Si for i=1,…,k. This paper presents a large neighborhood search technique that provides quality solutions to large k-LCSP instances. This heuristic runs in linear time in both the length of the sequences and the number of sequences. Some computational results are provided.
引用
收藏
页码：271 / 283
页数：12
相关论文
共 50 条
  • [21] Thermodynamical approach to the longest common subsequence problem
    Amsalu, Saba
    Matzinger, Heinrich
    Vachkovskaia, Marina
    JOURNAL OF STATISTICAL PHYSICS, 2008, 131 (06) : 1103 - 1120
  • [22] SYSTOLIC SYSTEMS FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM
    ANDREJKOVA, G
    COMPUTERS AND ARTIFICIAL INTELLIGENCE, 1986, 5 (03): : 199 - 212
  • [23] A SYSTOLIC ARRAY FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM
    ROBERT, Y
    TCHUENTE, M
    INFORMATION PROCESSING LETTERS, 1985, 21 (04) : 191 - 198
  • [24] Thermodynamical Approach to the Longest Common Subsequence Problem
    Saba Amsalu
    Heinrich Matzinger
    Marina Vachkovskaia
    Journal of Statistical Physics, 2008, 131 : 1103 - 1120
  • [25] A genetic algorithm for the longest common subsequence problem
    Hinkemeyer, Brenda
    Julstrorn, Bryant A.
    GECCO 2006: GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, VOL 1 AND 2, 2006, : 609 - +
  • [26] BOUNDS ON COMPLEXITY OF LONGEST COMMON SUBSEQUENCE PROBLEM
    AHO, AV
    HIRSCHBERG, DS
    ULLMAN, JD
    JOURNAL OF THE ACM, 1976, 23 (01) : 1 - 12
  • [27] PARALLEL ALGORITHMS FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM
    LU, M
    LIN, H
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1994, 5 (08) : 835 - 848
  • [28] An improved algorithm for the longest common subsequence problem
    Mousavi, Sayyed Rasoul
    Tabataba, Farzaneh
    COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (03) : 512 - 520
  • [29] A Hybrid Metaheuristic for the Longest Common Subsequence Problem
    Lozano, Manuel
    Blum, Christian
    HYBRID METAHEURISTICS, 2010, 6373 : 1 - +
  • [30] Longest common substring in Longest Common Subsequence's solution service: A novel hyper-heuristic
    Abdi, Alireza
    Hajsaeedi, Masih
    Hooshmand, Mohsen
    COMPUTATIONAL BIOLOGY AND CHEMISTRY, 2023, 105
12345