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 条
  • [31] The constrained longest common subsequence problem for degenerate strings
    Iliopoulos, Costas
    Rahman, M. Sohel
    Voracek, Michal
    Vagner, Ladislav
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2007, 4783 : 309 - +
  • [32] Beam-ACO for the Longest Common Subsequence Problem
    Blum, Christian
    2010 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2010,
  • [33] A new flexible algorithm for the longest common subsequence problem
    Rick, C
    COMBINATORIAL PATTERN MATCHING, 1995, 937 : 340 - 351
  • [34] NEW SYSTOLIC ARRAYS FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM
    LIN, YC
    PARALLEL COMPUTING, 1994, 20 (09) : 1323 - 1334
  • [35] Analysis of Evolutionary Algorithms for the Longest Common Subsequence Problem
    Jansen, Thomas
    Weyland, Dennis
    GECCO 2007: GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, VOL 1 AND 2, 2007, : 939 - +
  • [36] An efficient algorithm for the longest common palindromic subsequence problem
    Liang, Ting-Wei
    Yang, Chang-Biau
    Huang, Kuo-Si
    THEORETICAL COMPUTER SCIENCE, 2022, 922 : 475 - 485
  • [37] The Longest Wave Subsequence Problem: Generalizations of the Longest Increasing Subsequence Problem
    Chen, Guan-Zhi
    Yang, Chang-Biau
    Chang, Yu-Cheng
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2024,
  • [38] High precision simulations of the longest common subsequence problem
    Bundschuh, R
    EUROPEAN PHYSICAL JOURNAL B, 2001, 22 (04): : 533 - 541
  • [39] BOUNDS ON THE COMPLEXITY OF THE LONGEST COMMON SUBSEQUENCE PROBLEM.
    Aho, A.V.
    Hirschberg, D.S.
    Ullman, J.D.
    Journal of the Association for Computing Machinery, 1976, 23 (01): : 1 - 12
  • [40] Algorithms for computing variants of the longest common subsequence problem
    Iliopoulos, Costas S.
    Rahman, A. Sohel
    THEORETICAL COMPUTER SCIENCE, 2008, 395 (2-3) : 255 - 267
12345