Rick (LCS Longest Common Subsequence)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O(sn + \min\{rm, sd\})$

Space Complexity

$O(sn + p)$ words

(https://link.springer.com/chapter/10.1007/3-540-60044-2_53)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1995

Reference

https://link.springer.com/chapter/10.1007/3-540-60044-2_53