Apostolico and Guerra (HS1 Algorithm) (LCS Longest Common Subsequence): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    15 February 2023

    • curprev 10:4210:42, 15 February 2023‎ Admin talk contribs‎ 372 bytes +372‎ Created page with "== Time Complexity == $O(m \log n +p \log({2}mn/p)$) == Space Complexity == $O(p + n)$ words (https://link-springer-com.ezproxy.canberra.edu.au/article/10.1007/BF01840365) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1987 == Reference == https://link-springer-com.ezproxy.canberra.edu.au/article/10.1007/BF01840365"
Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/wiki/Apostolico_and_Guerra_(HS1_Algorithm)_(LCS_Longest_Common_Subsequence)"