Boyer-Moore (BM) algorithm (Single String Search String Search)

From Algorithm Wiki

Revision as of 10:33, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(mn + s)$ == Space Complexity == $O(s)$ words (https://www.cs.utexas.edu/users/moore/publications/fstrpos.pdf) == Description == Heuristics-based, bad-character and good-suffix heuristics == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1977 == Reference == https://www.cs.utexas.edu/users/moore/publications/fstrpos.pdf")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(mn + s)$

Space Complexity

$O(s)$ words

(https://www.cs.utexas.edu/users/moore/publications/fstrpos.pdf)

Description

Heuristics-based, bad-character and good-suffix heuristics

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1977

Reference

https://www.cs.utexas.edu/users/moore/publications/fstrpos.pdf

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Boyer-Moore_(BM)_algorithm_(Single_String_Search_String_Search)&oldid=44437"