Editing String-searching algorithm (section)

=== Classification by the use of preprocessing programs ===
Other classification approaches are possible. One of the most common uses preprocessing as main criteria.

{| class="wikitable"
|+Classes of string searching algorithms<ref>Melichar, Borivoj, Jan Holub, and J. Polcar. Text Searching Algorithms. Volume I: Forward String Matching. Vol. 1. 2 vols., 2005. http://stringology.org/athens/TextSearchingAlgorithms/ {{Webarchive|url=https://web.archive.org/web/20160304074815/http://stringology.org/athens/TextSearchingAlgorithms/ |date=2016-03-04 }}.</ref>
!
!Text not preprocessed
!Text preprocessed
|-
! Patterns not preprocessed
| Elementary algorithms
| Index methods
|-
! Patterns preprocessed
| Constructed search engines
| Signature methods<ref>{{citation |last1=Litwin |first1=Witold |last2=Mokadem |first2=Riad |last3=Rigaux |first3=Philippe |last4=Schwarz |first4=Thomas |url=https://www.vldb.org/conf/2007/papers/research/p207-litwin.pdf |title=Fast nGram-Based String Search Over Data Encoded Using Algebraic Signatures |year=2007 |publisher=[[International Conference on Very Large Data Bases]]}}</ref>

|}