Multiple String Search (String Search)

From Algorithm Wiki
Revision as of 10:20, 15 February 2023 by Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Multiple String Search (String Search)}} == 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 == <pre>$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</pre> == Table of A...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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

Error creating thumbnail: Unable to save thumbnail to destination

Space Complexity graph

Error creating thumbnail: Unable to save thumbnail to destination

Pareto Decades graph

Error creating thumbnail: Unable to save thumbnail to destination

References/Citation

https://cr.yp.to/bib/1975/aho.pdf