String Processing Algorithm

A String Processing Algorithm is a Data Processing Algorithm that deals with string items.

• AKA: String Algorithm.
• Example(s):
  • a String Manipulation Algorithm,
  • a String Matching Algorithm,
  • a String Sorting Algorithm,
  • a String Parsing Algorithm,
  • a Sequence Mining Algorithm.
  • …
• Counter-Example(s):
  • a Natural Language Processing Algorithm,
  • a Data Retrieval Algorithm,
  • a Data Analysis Algorithm.
• See: Pattern Recognition Task, String Function Sequence-to-Sequence Network, Zvi Galil, Algorithm, Analysis of Algorithms, Sorting Algorithm, Regular Expression, Parser, Sequence Mining, Suffix Tree, Finite State Machine.

---

---

References

2020a

• (Wikipedia, 2020) ⇒ https://en.wikipedia.org/wiki/String_(computer_science)#String_processing_algorithms Retrieved:2020-2-23.
  • There are many algorithms for processing strings, each with various trade-offs. Competing algorithms can be analyzed with respect to run time, storage requirements, and so forth.

    Some categories of algorithms include:

    • String searching algorithms for finding a given substring or pattern
    • String manipulation algorithms.
    • Sorting algorithms.
    • Regular expression algorithms
    • Parsing a string
    • Sequence mining.
  • Advanced string algorithms often employ complex mechanisms and data structures, among the suffix trees and finite state machines.

    The name stringology was coined in 1984 by computer scientist Zvi Galil for the issue of algorithms and data structures used for string processing.

---