Efficient Computation of All Longest Common Subsequences

Authors:
Claus Rick
Affiliations:
-
Venue:
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Year:
2000

Citing 10
Cited 1

Searching subsequences

Theoretical Computer Science
A fast algorithm for computing longest common subsequences of small alphabet size

Journal of Information Processing
Sparse dynamic programming I: linear cost functions

Journal of the ACM (JACM)
Serial computations of Levenshtein distances

Pattern matching algorithms
The String-to-String Correction Problem

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

Journal of the ACM (JACM)
Speeding up dynamic programming without omitting any optimal solution and some applications in molecular biology

Journal of Algorithms
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
A new flexible algorithm for the longest common subsequence problem

Nordic Journal of Computing

RNA multiple structural alignment with longest common subsequences

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many efficient algorithms have been developed to compute the length of a longest common subsequence (LCS) between two strings. In general, an LCS is not unique but current methods only recover a single LCS. We investigate the problem of finding all longest common subsequences. A simple extension of the reconstruction method used by existing algorithms would seriously harm their time complexities. We present observations on a symmetry of the LCS problem which allow us to develop a general method to obtain a representation of all longest common subsequences while preserving the favorable time bounds of known algorithms.