Hsu and Du (Scheme 1) (LCS Longest Common Subsequence)
Jump to navigation
Jump to search
Time Complexity
$O(rm \log(n/m)$ + rm)
Space Complexity
$O(rm)$ words
(https://www.sciencedirect.com/science/article/pii/0022000084900254)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1984
Reference
https://www.sciencedirect.com/science/article/pii/0022000084900254