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 条
  • [41] Analysis of Evolutionary Algorithms for the Longest Common Subsequence Problem
    Thomas Jansen
    Dennis Weyland
    Algorithmica, 2010, 57 : 170 - 186
  • [42] Analysis of Evolutionary Algorithms for the Longest Common Subsequence Problem
    Jansen, Thomas
    Weyland, Dennis
    ALGORITHMICA, 2010, 57 (01) : 170 - 186
  • [43] A Multiobjective Approach to the Weighted Longest Common Subsequence Problem
    Becerra, David
    Mendivelso, Juan
    Pinzon, Yoan
    PROCEEDINGS OF THE PRAGUE STRINGOLOGY CONFERENCE 2012, 2012, : 64 - 74
  • [44] An efficient systolic algorithm for the longest common subsequence problem
    Lin, YC
    Chen, JC
    JOURNAL OF SUPERCOMPUTING, 1998, 12 (04): : 373 - 385
  • [45] The longest common subsequence problem a finite automata approach
    Melichar, L
    Polcar, T
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, PROCEEDINGS, 2003, 2759 : 294 - 296
  • [46] An Efficient Systolic Algorithm for the Longest Common Subsequence Problem
    Yen-Chun Lin
    Jyh-Chian Chen
    The Journal of Supercomputing, 1998, 12 : 373 - 385
  • [47] Longest common subsequence problem for unoriented and cyclic strings
    Nicolas, Francois
    Rivals, Eric
    THEORETICAL COMPUTER SCIENCE, 2007, 370 (1-3) : 1 - 18
  • [48] 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
  • [49] Expected length of the longest common subsequence for large alphabets
    Kiwi, M
    Loebl, M
    Matousek, J
    ADVANCES IN MATHEMATICS, 2005, 197 (02) : 480 - 498
  • [50] FAST ALGORITHM FOR THE LONGEST-COMMON-SUBSEQUENCE PROBLEM
    MUKHOPADHYAY, A
    INFORMATION SCIENCES, 1980, 20 (01) : 69 - 82
12345