Backward Non-Deterministic DAWG Matching (BNDM) (Single String Search String Search)

From Algorithm Wiki

Jump to navigation Jump to search

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/w/index.php?title=Backward_Non-Deterministic_DAWG_Matching_(BNDM)_(Single_String_Search_String_Search)&oldid=45241"