대표적인 문자열 안에서 단어를 찾는 문자열 탐색 알고리즘
라빈-카프 알고리즘 :
보이어-무어 알고리즘 :
KMP 알고리즘 :
아호-코라식 알고리즘 :
Suffix Array 맨버-마이어스 알고리즘 :
LCP Array :
https://en.wikipedia.org/wiki/Rabin%E2%80%93Karp_algorithm
Rabin–Karp algorithm - Wikipedia
From Wikipedia, the free encyclopedia String searching algorithm In computer science, the Rabin–Karp algorithm or Karp–Rabin algorithm is a string-searching algorithm created by Richard M. Karp and Michael O. Rabin (1987) that uses hashing to find an
en.wikipedia.org
https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string-search_algorithm
Boyer–Moore string-search algorithm - Wikipedia
From Wikipedia, the free encyclopedia String searching algorithm For the Boyer–Moore theorem prover, see Nqthm. In computer science, the Boyer–Moore string-search algorithm is an efficient string-searching algorithm that is the standard benchmark for p
en.wikipedia.org
https://en.wikipedia.org/wiki/Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm
Knuth–Morris–Pratt algorithm - Wikipedia
From Wikipedia, the free encyclopedia Algorithm for finding sub-text location(s) inside a given sentence in Big O(n) time In computer science, the Knuth–Morris–Pratt algorithm (or KMP algorithm) is a string-searching algorithm that searches for occurre
en.wikipedia.org
https://en.wikipedia.org/wiki/Aho%E2%80%93Corasick_algorithm
Aho–Corasick algorithm - Wikipedia
From Wikipedia, the free encyclopedia String-searching algorithm Aho—Corasick AlgorithmA diagram of an Aho—Corasick automatonClassString Searching, String MatchingData structureFinite-state machine of strings In computer science, the Aho—Corasick a
en.wikipedia.org
https://en.wikipedia.org/wiki/Suffix_array
Suffix array - Wikipedia
From Wikipedia, the free encyclopedia Data structure for a string In computer science, a suffix array is a sorted array of all suffixes of a string. It is a data structure used in, among others, full-text indices, data-compression algorithms, and the field
en.wikipedia.org
https://en.wikipedia.org/wiki/LCP_array
LCP array - Wikipedia
From Wikipedia, the free encyclopedia In computer science, the longest common prefix array (LCP array) is an auxiliary data structure to the suffix array. It stores the lengths of the longest common prefixes (LCPs) between all pairs of consecutive suffixes
en.wikipedia.org
https://namu.wiki/w/%EB%AC%B8%EC%9E%90%EC%97%B4%20%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98
문자열 알고리즘
말 그대로 문자열과 관련된 알고리즘 이다. 가장 대표적인 것이 문자열 검색(string search) 알고리즘이며
namu.wiki
'IT기술관련 > 알고리즘관련' 카테고리의 다른 글
| 정렬 알고리즘 (0) | 2024.04.29 |
|---|---|
| 배열과 리스트 차이 (0) | 2023.07.07 |
| Baekjoon : Backtracking (0) | 2022.06.06 |
| Baekjoon : Binary Search (0) | 2022.05.22 |
| Baekjoon : Divide and Conquer (0) | 2022.05.22 |