Multiple String Search: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 36: | Line 36: | ||
|} | |} | ||
== Time Complexity | == Time Complexity Graph == | ||
[[File:String Search - Multiple String Search - Time.png|1000px]] | [[File:String Search - Multiple String Search - Time.png|1000px]] | ||
== Space Complexity | == Space Complexity Graph == | ||
[[File:String Search - Multiple String Search - Space.png|1000px]] | [[File:String Search - Multiple String Search - Space.png|1000px]] | ||
== Pareto | == Pareto Frontier Improvements Graph == | ||
[[File:String Search - Multiple String Search - Pareto Frontier.png|1000px]] | [[File:String Search - Multiple String Search - Pareto Frontier.png|1000px]] | ||
Revision as of 14:04, 15 February 2023
Description
Multiple string search algorithms try to find a place where one or several strings (also called patterns) are found within a larger string or text.
Related Problems
Related: Single String Search
Parameters
$m$: longest pattern length
$n$: length of searchable text
$s$: size of the alphabet
$k$: number of patterns to search for
$z$: number of matches
Table of Algorithms
| Name | Year | Time | Space | Approximation Factor | Model | Reference |
|---|---|---|---|---|---|---|
| Commentz-Walter Algorithm | 1979 | $O(mn)$ | $O(km)$ | Exact | Deterministic | Time |
| Aho–Corasick (AC) Algorithm | 1975 | $O(n + m + z)$ | $O(km)$ | Exact | Deterministic | Time |
| Wu and Manber, Fuzzy String Matching | 1992 | $O(nk \lceil m/w \rceil)$ | $O(ms + k \lceil m/w \rceil)$ | Levensthein Distance = k | Deterministic | Time & Space |
Time Complexity Graph
Space Complexity Graph
Pareto Frontier Improvements Graph
