Editing String (computer science) (section)

== String processing algorithms ==
{{redirect|Stringology|the physical theory|String theory}}
There are many [[algorithm]]s for processing strings, each with various trade-offs. Competing algorithms can be [[Analysis of algorithms|analyzed]] with respect to run time, storage requirements, and so forth. The name '''stringology''' was coined in 1984 by computer scientist [[Zvi Galil]] for the theory of algorithms and data structures used for string processing.<ref>{{cite web|url=http://www.stringology.org/|title=The Prague Stringology Club|work=stringology.org|access-date=23 May 2015|url-status=live|archive-url=https://web.archive.org/web/20150601001757/http://www.stringology.org/|archive-date=1 June 2015}}</ref><ref>{{cite web |last1=Evarts |first1=Holly |title=Former Dean Zvi Galil Named a Top 10 Most Influential Computer Scientist in the Past Decade |url=https://www.engineering.columbia.edu/news/zvi-galil-top-10-computer-scientist |website=Columbia Engineering |language=en |date=18 March 2021 |quote=He invented the terms 'stringology,' which is a subfield of string algorithms,}}</ref><ref>{{cite book |last1=Crochemore |first1=Maxime |title=Jewels of stringology |date=2002 |location=Singapore |isbn=981-02-4782-6 |page=v |quote=The term stringology is a popular nickname for string algorithms as well as for text algorithms.}}</ref>

Some categories of algorithms include:
* [[String searching algorithm]]s for finding a given substring or pattern
* [[String manipulation algorithm]]s
* [[Sorting algorithm]]s
* [[Regular expression]] algorithms
* [[Parser|Parsing]] a string
* [[Sequence mining]]

Advanced string algorithms often employ complex mechanisms and data structures, among them [[suffix tree]]s and [[finite-state machine]]s.