Apostolico and Guerra (Algorithm 2) (LCS Longest Common Subsequence)

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O(rm + sn + n \log s)$

Space Complexity

$O(p + sn)$ words

(https://link.springer.com/content/pdf/10.1007/BF01840365.pdf)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1987

Reference

https://link.springer.com/article/10.1007/BF01840365

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Apostolico_and_Guerra_(Algorithm_2)_(LCS_Longest_Common_Subsequence)&oldid=44821"