View source for Exact String Matching Task

An [[Exact String Matching Task]] is a [[string matching task]] that is required to find a place where one or more [[string pattern]]s are found within a [[data string]].
* <B>Context:</B>
** [[Task Input|Input]]s: a [[String]]; and a [[String Pattern Set]].
** It an range from being a [[Single-Pattern Exact String Matching Task]], to being a [[Finite-Pattern Set Exact String Matching Task]], to being an [[Infinite-Pattern Set Exact String Matching Task]].
** It can be solved by an [[Exact String Matching System]] (that implements an [[exact string matching algorithm]]).
** …
* <B>Example(s):</B>
** Finding a specific phrase in a book.
** Locating specific DNA sequences within a larger genome sequence.
** …
* <B>Counter-Example(s):</B>
** [[Approximate String Matching]], allows for mismatches or errors in the pattern.
* <B>See:</B> [[String Searching Algorithm]], [[Pattern Matching]], [[Regular Expression]].

----
----