Backward Non-Deterministic DAWG Matching (BNDM) (Single String Search String Search): 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 12:1412:14, 15 February 2023‎ Admin talk contribs‎ 347 bytes +347‎ Created page with "== Time Complexity == $O(n+m)$ == Space Complexity == $O(sm)$ words (https://link.springer.com/chapter/10.1007/BFb0030778) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1998 == Reference == https://link.springer.com/chapter/10.1007/BFb0030778"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Backward_Non-Deterministic_DAWG_Matching_(BNDM)_(Single_String_Search_String_Search)"