Kuo and Cross (LCS Longest Common Subsequence)

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O(p + n(r+\log n)$)

Space Complexity

$O(p + n)$ words

(https://dl.acm.org/doi/10.1145/74697.74702, Same space complexity as Hunt and Szymanski.)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1989

Reference

https://dl.acm.org/citation.cfm?id=74702

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