The following pages link to A fast string searching algorithm (Q3090391):
Displayed 50 items.
- A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms (Q988198) (← links)
- Improving practical exact string matching (Q990135) (← links)
- Faster pattern matching with character classes using prime number encoding (Q1004281) (← links)
- Shift-or string matching with super-alphabets (Q1014420) (← links)
- Disjunctive partial deduction of a right-to-left string-matching algorithm (Q1014430) (← links)
- Fast parameterized matching with \(q\)-grams (Q1018090) (← links)
- Real two dimensional scaled matching (Q1024780) (← links)
- The factors analysis and algorithm implementation of single-pattern matching (Q1028393) (← links)
- Average-optimal string matching (Q1044048) (← links)
- Two-dimensional pattern matching by two-dimensional on-line tessellation acceptors (Q1054480) (← links)
- The smallest automaton recognizing the subwords of a text (Q1063423) (← links)
- Structural properties of the string statistics problem (Q1076522) (← links)
- Efficient string matching with k mismatches (Q1079377) (← links)
- On two-dimensional pattern-matching languages and their decision problems (Q1093378) (← links)
- Data structures and algorithms for approximate string matching (Q1104103) (← links)
- Remarks on string-matching and one-way multihead automata (Q1108049) (← links)
- Fast string matching with k differences (Q1109574) (← links)
- Matching patterns in strings subject to multi-linear transformations (Q1115200) (← links)
- La reconnaissance des facteurs d'un langage fini dans un texte en temps linéaire. (Recognition of the factors of a finite language in a text in linear time) (Q1115203) (← links)
- Unification theory (Q1124375) (← links)
- A string searching algorithm (Q1136227) (← links)
- Fast string searching by finding subkeys in subtext (Q1149781) (← links)
- String overlaps, pattern matching, and nontransitive games (Q1149796) (← links)
- Periods in strings (Q1154284) (← links)
- Worst-case behavior of string-searching algorithms (Q1158765) (← links)
- Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays (Q1177175) (← links)
- Correctness and efficiency of pattern matching algorithms (Q1183611) (← links)
- String-matching on ordered alphabets (Q1190451) (← links)
- A variation on the Boyer-Moore algorithm (Q1190458) (← links)
- Fast average-case pattern matching by multiplexing sparse tables (Q1190461) (← links)
- Identifying periodic occurrences of a template with applications to protein structure (Q1209310) (← links)
- Fast two-dimensional pattern matching (Q1209318) (← links)
- Two-dimensional dictionary matching (Q1209347) (← links)
- An improved algorithm to check for polygon similarity (Q1245010) (← links)
- On polygon similarity (Q1256866) (← links)
- Optimal parallel two dimensional text searching on a CREW PRAM (Q1271473) (← links)
- Three one-way heads cannot do string matching (Q1318467) (← links)
- Alphabet dependence in parameterized matching (Q1318756) (← links)
- An optimal algorithm to compute all the covers of a string (Q1329417) (← links)
- Single character searching methods and the shift-or pattern-matching algorithm (Q1329424) (← links)
- Dynamic dictionary matching with failure functions (Q1331942) (← links)
- Speeding up two string-matching algorithms (Q1336956) (← links)
- On Boyer-Moore automata (Q1336957) (← links)
- A sublinear algorithm for approximate keyword searching (Q1336965) (← links)
- Dynamic dictionary matching (Q1337462) (← links)
- Efficient matching of nonrectangular shapes. (Q1354075) (← links)
- Saving comparisons in the Crochemore-Perrin string-matching algorithm (Q1365685) (← links)
- A filtering algorithm for \(k\)-mismatch with don't cares (Q1675785) (← links)
- A fast algorithm for the all-pairs suffix-prefix problem (Q1676303) (← links)
- Dictionary matching with a bounded gap in pattern or in text (Q1709592) (← links)