The Ruzzo–Tompa algorithm is a method for efficiently determining whether a given string contains a specific substring. This algorithm is particularly useful in the context of pattern matching in strings, specifically when the substring is short compared to the text, or when speed is of primary concern. Developed by Giuseppe Ruzzo and Daniel Tompa, the algorithm leverages techniques from theoretical computer science, particularly those surrounding deterministic finite automata (DFA) and regular expressions.

Ancestors (6)

  1. Optimization algorithms and methods
  2. Algorithms
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6. Home

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version