Apostolico and Guerra (HS1 Algorithm) (LCS Longest Common Subsequence)
Revision as of 11:42, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(m \log n +p \log({2}mn/p)$) == Space Complexity == $O(p + n)$ words (https://link.springer.com/article/10.1007/BF01840365) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1987 == Reference == https://link.springer.com/article/10.1007/BF01840365")
Time Complexity
$O(m \log n +p \log({2}mn/p)$)
Space Complexity
$O(p + n)$ words
(https://link.springer.com/article/10.1007/BF01840365)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1987