Longest Common Subsequence in Sublinear Space

09/18/2020

∙

by   Masashi Kiyomi, et al.

∙

0

∙

share

We present the first o(n)-space polynomial-time algorithm for computing the length of a longest common subsequence. Given two strings of length n, the algorithm runs in O(n^3) time with O(n log^1.5 n/2^√(log n)) bits of space.