Mukhopadhyay (LCS Longest Common Subsequence)

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

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

Space Complexity

$O(p + n)$ words

(https://www.sciencedirect.com/science/article/pii/0020025580900250)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1980

Reference

https://www.sciencedirect.com/science/article/pii/0020025580900250

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