Skip to content
Search

Search algorithms

lastmod 2018-08-17created 2014-09-155 edits

In computer science, a search algorithm is an algorithm for finding an item with specified properties among a collection of items. The items may be stored individually as records in a database; or may be elements of a search space defined by a mathematical formula or procedure, such as the roots of an equation with integer variables; or a combination of the two, such as the Hamiltonian circuits of a graph.

Parttern matching algorithms

String matching algorithms

  • Brute Force algorithm
    • The simplest string pattern search algorithm
  • Deterministic Finite Automaton algorithm
  • Karp-Rabin algorithm
    • An algorithm for librarian search
  • Shift Or algorithm
  • Morris-Pratt algorithm
  • Knuth-Morris-Pratt algorithm
  • Simon algorithm
  • Colussi algorithm
  • Galil-Giancarlo algorithm
  • Apostolico-Crochemore algorithm
  • Not So Naive algorithm
  • Boyer Moore algorithm
  • Turbo BM algorithm
  • Apostolico-Giancarlo algorithm
  • Reverse Colussi algorithm
  • Horspool algorithm
  • Quick Search algorithm
  • Tuned Boyer-Moore algorithm
  • Zhu-Takaoka algorithm
  • Berry-Ravindran algorithm
  • Smith algorithm
  • Raita algorithm
  • Reverse Factor algorithm
  • Turbo Reverse Factor algorithm
  • Forward Dawg Matching algorithm
  • Backward Nondeterministic Dawg Matching algorithm
  • Backward Oracle Matching algorithm
  • Galil-Seiferas algorithm
  • Two Way algorithm
  • String Matching on Ordered Alphabets algorithm
  • Optimal Mismatch algorithm
  • Maximal Shift algorithm
  • Skip Search algorithm
  • KMP Skip Search algorithm
  • Alpha Skip Search algorithm

Favorite site

References

  1. Igm.univ-mlv.fr.zip ↩

sitemap