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

From Algorithm Wiki

Revision as of 10:38, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(mn)$ == Space Complexity == $O(m + s)$ words (https://www.cs.utexas.edu/users/moore/publications/fstrpos.pdf) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1991 == Reference == http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.13.9460&rep=rep1&type=pdf")

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

Jump to navigation Jump to search

Time Complexity

$O(mn)$

Space Complexity

$O(m + s)$ words

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

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1991

Reference

http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.13.9460&rep=rep1&type=pdf

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Tuned_Boyer-Moore_algorithm_(Single_String_Search_String_Search)&oldid=44651"