A New Efficient Algorithm for Computing the Longest Common Subsequence

被引：0
|
作者：
Costas S. Iliopoulos
M. Sohel Rahman
机构：
[1] King’s College London,Algorithm Design Group, Department of Computer Science
来源：
Theory of Computing Systems | 2009年 / 45卷
关键词：
Longest common subsequence; Algorithms; Strings;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
The Longest Common Subsequence (LCS) problem is a classic and well-studied problem in computer science. The LCS problem is a common task in DNA sequence analysis with many applications to genetics and molecular biology. In this paper, we present a new and efficient algorithm for solving the LCS problem for two strings. Our algorithm runs in O(ℛlog log n+n) time, where ℛ is the total number of ordered pairs of positions at which the two strings match.
引用
收藏
页码：355 / 371
页数：16
相关论文
共 50 条
  • [1] A New Efficient Algorithm for Computing the Longest Common Subsequence
    Iliopoulos, Costas S.
    Rahman, M. Sohel
    [J]. THEORY OF COMPUTING SYSTEMS, 2009, 45 (02) : 355 - 371
  • [2] A new efficient algorithm for computing the longest common subsequence
    Rahman, M. Sohel
    Iliopoulos, Costas S.
    [J]. ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, PROCEEDINGS, 2007, 4508 : 82 - +
  • [3] A fast algorithm for computing a longest common increasing subsequence
    Yang, IH
    Huang, CP
    Chao, KM
    [J]. INFORMATION PROCESSING LETTERS, 2005, 93 (05) : 249 - 253
  • [4] A new algorithm for the longest common subsequence problem
    Xiang, Xuyu
    Zhang, Dafang
    Qin, Jiaohua
    [J]. CIS WORKSHOPS 2007: INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY WORKSHOPS, 2007, : 112 - 115
  • [5] An efficient algorithm for the longest common palindromic subsequence problem
    Liang, Ting-Wei
    Yang, Chang-Biau
    Huang, Kuo-Si
    [J]. THEORETICAL COMPUTER SCIENCE, 2022, 922 : 475 - 485
  • [6] An efficient systolic algorithm for the longest common subsequence problem
    Lin, YC
    Chen, JC
    [J]. JOURNAL OF SUPERCOMPUTING, 1998, 12 (04): : 373 - 385
  • [7] An Efficient Systolic Algorithm for the Longest Common Subsequence Problem
    Yen-Chun Lin
    Jyh-Chian Chen
    [J]. The Journal of Supercomputing, 1998, 12 : 373 - 385
  • [8] A linear space algorithm for computing a longest common increasing subsequence
    Sakai, Yoshifumi
    [J]. INFORMATION PROCESSING LETTERS, 2006, 99 (05) : 203 - 207
  • [9] Computing a Longest Common Palindromic Subsequence
    Chowdhury, Shihabur Rahman
    Hasan, Md. Mahbubul
    Iqbal, Sumaiya
    Rahman, M. Sohel
    [J]. FUNDAMENTA INFORMATICAE, 2014, 129 (04) : 329 - 340
  • [10] A new flexible algorithm for the longest common subsequence problem
    Rick, C
    [J]. COMBINATORIAL PATTERN MATCHING, 1995, 937 : 340 - 351
12345