TY - JOUR
T1 - Fast and Simple Computation of All Longest Common Subsequences
AU - Greenberg, Ronald I.
N1 - Ronald I. Greenberg. Fast and simple computation of all longest common subsequences. Technical report, Computer Science Research Repository (http://arXiv.org), 2011. Article ID cs/0211001v2.
PY - 2011/3/1
Y1 - 2011/3/1
N2 - This paper shows that a simple algorithm produces the 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.
AB - This paper shows that a simple algorithm produces the 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.
KW - longest common subsequences
KW - edit distance
KW - shortest common supersequences
UR - https://ecommons.luc.edu/cs_facpubs/178
UR - https://arxiv.org/pdf/cs/0211001.pdf
M3 - Article
JO - Computer Science: Faculty Publications and Other Works
JF - Computer Science: Faculty Publications and Other Works
ER -