Algorithms for computing variants of the longest common subsequence problem

Authors:
M. Sohel Rahman;Costas S. Iliopoulos
Affiliations:
Algorithm Design Group, Department of Computer Science, King's College London, London, England;Algorithm Design Group, Department of Computer Science, King's College London, London, England
Venue:
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Year:
2006

Citing 5
Cited 3

The String-to-String Correction Problem

Journal of the ACM (JACM)
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
On the longest common rigid subsequence problem

CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Lossless filter for finding long multiple approximate repetitions using a new data structure, the bi-factor array

SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval

New efficient algorithms for the LCS and constrained LCS problems

Information Processing Letters
A New Efficient Algorithm for Computing the Longest Common Subsequence

AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Algorithms for computing the longest parameterized common subsequence

CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching

Quantified Score

Hi-index	0.00

Visualization

Abstract

The longest common subsequence(LCS) problem is one of the classical and well-studied problems in computer science. The computation of the LCS is a frequent task in DNA sequence analysis, and has applications to genetics and molecular biology. In this paper we define new variants, introducing the notion of gap-constraints in LCS problem and present efficient algorithms to solve them.