Search algorithms

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

• Aho Corasick algorithm

String matching algorithms

• Brute Force algorithm
  • 가장 간단한 문자열 패턴 검색 알고리즘
• Deterministic Finite Automaton algorithm
• Karp-Rabin algorithm
  • 사서 검색을 위한 알고리즘
• 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

• Wikipedia (en) 검색 알고리즘에 대한 설명
• Wikipedia (en) 문자열 검색 알고리즘에 대한 설명
• EXACT STRING MATCHING ALGORITHMS ¹
• KLDP 가장 빠른 문자열 매칭 알고리즘에 대한 질문
• KMP 알고리즘에 대한 설명
• 문자열 매칭 알고리즘의 종류와 비교

References