A New Efficient Algorithm for Computing the Longest Common Subsequence

Authors:
M. Sohel Rahman;Costas S. Iliopoulos
Affiliations:
Algorithm Design Group, Department of Computer Science, King's College London, Strand, London WC2R 2LS, England;Algorithm Design Group, Department of Computer Science, King's College London, Strand, London WC2R 2LS, England
Venue:
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Year:
2007

Citing 12
Cited 4

On the Approximation of Shortest Common Supersequencesand Longest Common Subsequences

SIAM Journal on Computing
The String-to-String Correction Problem

Journal of the ACM (JACM)
Algorithms for the Longest Common Subsequence Problem

Journal of the ACM (JACM)
The Complexity of Some Problems on Subsequences and Supersequences

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

Communications of the ACM
A sub-quadratic sequence alignment algorithm for unrestricted cost matrices

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
The LCA Problem Revisited

LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Scaling and related techniques for geometry problems

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
A Survey of Longest Common Subsequence Algorithms

SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)
The constrained longest common subsequence problem

Information Processing Letters
On the longest common rigid subsequence problem

CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Algorithms for computing variants of the longest common subsequence problem

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation

New efficient algorithms for the LCS and constrained LCS problems

Information Processing Letters
Fast computation of a longest increasing subsequence and application

Information and Computation
Finding Patterns In Given Intervals

Fundamenta Informaticae
On the generalized constrained longest common subsequence problems

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a new and efficient algorithm for solving the LCS problem for two strings. Our algorithm runs in $O(\mathcal R\log\log n + n)$ time, where $\mathcal R$ is the total number of ordered pairs of positions at which the two strings match.