Live briefing
Everything about Two-way string-matching algorithm
String-searching algorithm
In computer science, the two-way string-matching algorithm (or Crochemore-Perrin string-matching algorithm) is a string-searching algorithm, discovered by Maxime Crochemore and Dominique Perrin in 1991. It searches for copies of a "needle" of length m in a "haystack" of length n. After preprocessing the needle in time O(m), the actual search takes time O(n) linear in the length of the haystack. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Two-way string-matching algorithmA 5-minute orientation
- Pick up a classic book: Introduction to Computing Using PythonThe most-reprinted book on the subject
- Go sideways: String-searching algorithmA closely related topic
- Go sideways: Boyer–Moore–Horspool algorithmA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
- No matching papers found.
đź“š Books worth reading
Introduction to Computing Using PythonLjubomir Perkovic · 2011
Fundamentals of data structures in CEllis Horowitz · 1993
Data structures & algorithms in JavaRobert Lafore · 2003
Schaum's outline of theory and problems of data structuresSeymour Lipschutz · 1986
BIOINFORMATICS ALGORITHMS,VOL.IIPhillip Compeau, Pavel Pevzner · 2015
Fundamentals of data structures in CEllis Horowitz · 2008
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- String-searching algorithm A string-searching algorithm, sometimes called string-matching algorithm, is an algorithm that searches a body of text for portions that match by pattern…
- 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…
- LCP array 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…
- Suffix automaton In computer science, a suffix automaton is an efficient data structure for representing the substring index of a given string which allows the storage…
- 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…
- Generalized suffix array In computer science, a generalized suffix array (GSA) is a suffix array containing all suffixes for a set of strings. Given the set of strings S = S 1…
- 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…