Recuperando una LCS en O (n ^ 2 / w) tiempo y espacio
Iliopoulos, Costas S.
Pinzón Ardila, Yoan
MetadataShow full item record
Here we make use of word-level parallelism to recover a longest common subsequence of two input strings both of length n in O(n2/w) time and space, where w is the number of bits in a machine word. For the special case where one of the input atrings is close to w its complexity is reduced to linear time and space.Keywords: Longest Common Subsequence, Bit-parallelism.