Fast and Simple Computation of All Longest Common Subsequences

Abstract

This paper shows that a simple algorithm produces the {\em all-prefixes-LCSs-graph} in $O(mn)$ time for two input sequences of size $m$ and $n$. Given any prefix $p$ of the first input sequence and any prefix $q$ of the second input sequence, all longest common subsequences (LCSs) of $p$ and $q$ can be generated in time proportional to the output size, once the all-prefixes-LCSs-graph has been constructed. The problem can be solved in the context of generating all the distinct character strings that represent an LCS or in the context of generating all ways of embedding an LCS in the two input strings.

LaTeX 8 pages, 4 figures, corrected typos (especially in pseudocode in Figure 4)

Cited by in corpus (1)

• Computing the Number of Longest Common Subsequences