A survey of longest common subsequence algorithms

@article{Bergroth2000ASO,
  title={A survey of longest common subsequence algorithms},
  author={Lasse Bergroth and Harri Hakonen and Timo Raita},
  journal={Proceedings Seventh International Symposium on String Processing and Information Retrieval. SPIRE 2000},
  year={2000},
  pages={39-48}
}
  • L. Bergroth, H. Hakonen, T. Raita
  • Published 27 September 2000
  • Computer Science
  • Proceedings Seventh International Symposium on String Processing and Information Retrieval. SPIRE 2000
The aim of this paper is to give a comprehensive comparison of well-known longest common subsequence algorithms (for two input strings) and study their behaviour in various application environments. The performance of the methods depends heavily on the properties of the problem instance as well as the supporting data structures used in the implementation. We want to make also a clear distinction between methods that determine the actual lcs and those calculating only its length, since the… 

Figures from this paper

Generalized LCS
A NEW ALGORITM FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM
TLDR
A new online algorithm which runs in time and in space where is the length of the input sequences and is the number of minimal matches between them and the time complexity bound can be reduced to preserving the space bound of .
Shortest Path Approaches for the Longest Common Subsequence of a Set of Strings
TLDR
This work redesigns both algorithms for solving the k-LCS problem such that the generalization to higher dimensions becomes natural, and proposes a new approach to reduce the algorithms' space complexity.
Utilizing Dynamically Updated Estimates in Solving the Longest Common Subsequence Problem
TLDR
A straightforward method for updating dynamically the lower bound value for the lcs is presented and the purpose is to refine the estimate gradually to prune more effectively the search space of the used exact lcs algorithm.
A New Algorithm to Find Longest Common Sub- sequence’s
TLDR
A new algorithm to find the longest common subsequence between two strings by optimizing the running time & improvement of time complexity against the existing well-known improved dynamic programming algorithm for LCS.
Fast algorithm for the constrained longest common subsequence problem
TLDR
A novel approach is introduced in which time and space complexities depend also on the number of matches between A, B, and P, and the time complexity is better for typical parameter settings and never worse.
Fast algorithm for the constrained longest common subsequence problem
TLDR
A novel approach is introduced in which time and space complexities depend also on the number of matches between A, B, and P, and the time complexity is better for typical parameter settings and never worse.
Constrained Longest Common Subsequence Computing Algorithms in Practice
TLDR
An improvement to the algorithms by Chin et al. and Deorowicz based on an entry-exit points technique by He and Arslan is proposed and experimentally the existing algorithms for solving the CLCS problem are compared.
Quick-MLCS: a new algorithm for the multiple longest common subsequence problem
TLDR
A new algorithm for the general case of multiple LCS (MLCS) which is based on one of the fastest existing algorithms and uses a linear sorting technique to minimize the dominant points set.
A Fast On-Line Algorithm for the Longest Common Subsequence Problem with Constant Alphabet
  • Y. Sakai
  • Computer Science
    IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
  • 2012
TLDR
An on-line version of the longest common subsequence (LCS) problem for two strings over a constant alphabet is presented, in O(d+n) time and O(m+d) space, where m is the length of the shorter string, the whole of which is given to the algorithm in advance.
...
...

References

SHOWING 1-10 OF 34 REFERENCES
New approximation algorithms for longest common subsequences
  • L. Bergroth, H. Hakonen, T. Raita
  • Computer Science
    Proceedings. String Processing and Information Retrieval: A South American Symposium (Cat. No.98EX207)
  • 1998
TLDR
The majority of the presented algorithms give a lower bound for the lcs, which can be used, for example, as a filter to decide quickly, if a more detailed, space- and time-consuming study is needed.
A New Flexible Algorithm for the Longest Common Subsequence Problem
  • C. Rick
  • Computer Science
    Nord. J. Comput.
  • 1995
TLDR
A new algorithm that is efficient for both short and long longest common subsequences is presented, based on the well-known paradigm of computing dominant matches and was obtained by observing additional structural properties leading to a kind of dualization.
A fast algorithm for computing longest common subsequences
TLDR
An algorithm for finding the longest common subsequence of two sequences of length n which has a running time of O((r + n) log n), where r is the total number of ordered pairs of positions at which the two sequences match.
New Algorithms for the LCS Problem
Bounds on the Complexity of the Longest Common Subsequence Problem
TLDR
It is shown that unless a bound on the total number of distinct symbols is assumed, every solution to the problem can consume an amount of time that is proportional to the product of the lengths of the two strings.
The Complexity of Some Problems on Subsequences and Supersequences
TLDR
It is shown that theyes/no version of the LCS problem is NP-complete for sequences over an alphabet of size 2, and that the yes/no SCS problem isNPcomplete for sequence over an Alphabet of size 5.
...
...