Live briefing
Everything about String-searching algorithm
Searching for patterns in text
A string-searching algorithm, sometimes called string-matching algorithm, is an algorithm that searches a body of text for portions that match by pattern. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: String-searching algorithmA 5-minute orientation
- Skim a recent paper: Knuth Morris Pratt String Matching Algorithm in Searching for Zakat Information and Social ActivitiesInfluential work since 2022
- Pick up a classic book: Fundamentals of Computer Programming with CSharp Free Book (by Nakov & Co.)The most-reprinted book on the subject
- Read the landmark paper: A fast string searching algorithmCited 1,583 times
- Go sideways: Boyer–Moore–Horspool algorithmA closely related topic
- Go sideways: Boyer–Moore string-search algorithmA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
A fast string searching algorithm
On the Worst-Case Behavior of String-Searching Algorithms
Tuning the boyer‐moore‐horspool string searching algorithm
A Correct Preprocessing Algorithm for Boyer–Moore String-Searching
A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm
Occurrences Algorithm for String Searching Based on Brute-force Algorithm
Algorithms for string searching
On Simon's string searching algorithm
🆕 Influential since 2022
Knuth Morris Pratt String Matching Algorithm in Searching for Zakat Information and Social Activities
Revolutionizing Accreditation System: Basis for Proposing a Databank System Using Two-Factor Authentication and String Searching Algorithm
Detection of Similar Melodies by Repurposing Algorithms for Sequence Alignment and String Searching
📚 Books worth reading
Fundamentals of Computer Programming with CSharp Free Book (by Nakov & Co.)Svetlin Nakov · 2013
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Boyer–Moore–Horspool algorithm In computer science, the Boyer–Moore–Horspool algorithm or Horspool's algorithm is an algorithm for finding substrings in strings. It was published by…
- Boyer–Moore string-search algorithm In computer science, the Boyer–Moore string-search algorithm is an efficient string-searching algorithm that is the standard benchmark for practical string-sear…
- Two-way string-matching algorithm In computer science, the two-way string-matching algorithm (or Crochemore-Perrin string-matching algorithm) is a string-searching algorithm, discovered…
- Knuth–Morris–Pratt algorithm In computer science, the Knuth–Morris–Pratt algorithm (or KMP algorithm) is a string-searching algorithm that searches for occurrences of a "word" W within…
- Suffix tree In computer science, a suffix tree (also called PAT tree or, in an earlier form, position tree) is a compressed trie containing all the suffixes of the…
- Suffix array 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-compres…
- Approximate string matching In computer science, approximate string matching (often colloquially referred to as fuzzy string searching) is the technique of finding strings that match…
- Commentz-Walter algorithm In computer science, the Commentz-Walter algorithm is a string searching algorithm invented by Beate Commentz-Walter. Like the Aho–Corasick string matching…