An almost-linear time and linear space algorithm for the longest common subsequence problem

Authors:
J. Y. Guo;F. K. Hwang
Affiliations:
Department of Applied Mathematics, National Chiaotung University, Hsinchu, Taiwan, ROC 30500;Department of Applied Mathematics, National Chiaotung University, Hsinchu, Taiwan, ROC 30500
Venue:
Information Processing Letters
Year:
2005

Citing 5
Cited 0

Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings

Information Processing Letters
Regular Article: Generalized Sequence Alignment and Duality

Advances in Applied Mathematics
Algorithms for the Longest Common Subsequence Problem

Journal of the ACM (JACM)
A fast algorithm for computing longest common subsequences

Communications of the ACM
A linear space algorithm for computing maximal common subsequences

Communications of the ACM

Quantified Score

Hi-index	0.89

Visualization

Abstract

There are two general approaches to the longest common subsequence problem. The dynamic programming approach takes quadratic time but linear space, while the nondynamic-programming approach takes less time but more space. We propose a new implementation of the latter approach which seems to get the best for both time and space for the DNA application.