Hirschberg (LCS Longest Common Subsequence)
Jump to navigation
Jump to search
Time Complexity
$O(rn + n \log n)$
Space Complexity
$O(n + p)$ words
(https://link.springer.com/content/pdf/10.1007/BF01840365.pdf)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1977