BOM (Backward Oracle Matching) (Single String Search String Search)

From Algorithm Wiki
Revision as of 11:14, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(m)$ + $O(mn)$ == Space Complexity == $O(m)$ words (https://link.springer.com/content/pdf/10.1007/3-540-47849-3_18.pdf) == Description == Automaton-based oracle == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1999 == Reference == https://link.springer.com/chapter/10.1007/3-540-47849-3_18")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(m)$ + $O(mn)$

Space Complexity

$O(m)$ words

(https://link.springer.com/content/pdf/10.1007/3-540-47849-3_18.pdf)

Description

Automaton-based oracle

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1999

Reference

https://link.springer.com/chapter/10.1007/3-540-47849-3_18

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=BOM_(Backward_Oracle_Matching)_(Single_String_Search_String_Search)&oldid=45245"