# 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} }

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…

## 611 Citations

A NEW ALGORITM FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM

- Computer Science
- 2010

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

- Computer Science2007 IEEE 7th International Symposium on BioInformatics and BioEngineering
- 2007

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

- Computer ScienceSPIRE
- 2005

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

- Computer Science
- 2013

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.

An FPT-Algorithm for Longest Common Subsequence Parameterized by the Maximum Number of Deletions

- Computer ScienceCPM
- 2022

It is shown that LCS is fixed-parameter tractable (FPT) when parameterized by the maximum number of deletions per input string, which could finally pave the way to a new, exact and practically useful algorithm for this notoriously hard string problem.

Fast algorithm for the constrained longest common subsequence problem

- Computer Science

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

- Computer Science
- 2007

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

- Computer ScienceComput. Informatics
- 2010

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

- Computer ScienceC3S2E '12
- 2012

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.

## References

SHOWING 1-10 OF 34 REFERENCES

New approximation algorithms for longest common subsequences

- Computer ScienceProceedings. String Processing and Information Retrieval: A South American Symposium (Cat. No.98EX207)
- 1998

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.

Fast Linear-Space Computations of Longest Common Subsequences

- Computer ScienceTheor. Comput. Sci.
- 1992

A fast algorithm for computing longest common subsequences

- Computer ScienceCACM
- 1977

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.

An Information-Theoretic Lower Bound for the Longest Common Subsequence Problem

- Computer ScienceInf. Process. Lett.
- 1978

Improving the Worst-Case Performance of the Hunt-Szymanski Strategy for the Longest Common Subsequence of Two Strings

- Computer ScienceInf. Process. Lett.
- 1986

Remark on the Hsu-Du New Algorithm for the Longest Common Subsequence Problem

- Computer ScienceInf. Process. Lett.
- 1987

On computing the length of longest increasing subsequences

- Computer Science, MathematicsDiscret. Math.
- 1975