A fast string searching algorithm
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Faster pattern matching with character classes using prime number encoding
- Shift-or string matching with super-alphabets
- Disjunctive partial deduction of a right-to-left string-matching algorithm
- Fast parameterized matching with \(q\)-grams
- Real two dimensional scaled matching
- The factors analysis and algorithm implementation of single-pattern matching
- Average-optimal string matching
- Two-dimensional pattern matching by two-dimensional on-line tessellation acceptors
- The smallest automaton recognizing the subwords of a text
- Structural properties of the string statistics problem
- Efficient string matching with k mismatches
- On two-dimensional pattern-matching languages and their decision problems
- Data structures and algorithms for approximate string matching
- Remarks on string-matching and one-way multihead automata
- Fast string matching with k differences
- Matching patterns in strings subject to multi-linear transformations
- 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)
- Unification theory
- A string searching algorithm
- Fast string searching by finding subkeys in subtext
- String overlaps, pattern matching, and nontransitive games
- Periods in strings
- Worst-case behavior of string-searching algorithms
- Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
- Correctness and efficiency of pattern matching algorithms
- String-matching on ordered alphabets
- A variation on the Boyer-Moore algorithm
- Fast average-case pattern matching by multiplexing sparse tables
- Identifying periodic occurrences of a template with applications to protein structure
- Fast two-dimensional pattern matching
- Two-dimensional dictionary matching
- An improved algorithm to check for polygon similarity
- On polygon similarity
- Optimal parallel two dimensional text searching on a CREW PRAM
- Gaining efficiency on the word-length string searching algorithm
- Three one-way heads cannot do string matching
- Alphabet dependence in parameterized matching
- An optimal algorithm to compute all the covers of a string
- Single character searching methods and the shift-or pattern-matching algorithm
- Dynamic dictionary matching with failure functions
- Speeding up two string-matching algorithms
- On Boyer-Moore automata
- A sublinear algorithm for approximate keyword searching
- Dynamic dictionary matching
- Efficient matching of nonrectangular shapes.
- Saving comparisons in the Crochemore-Perrin string-matching algorithm
- A filtering algorithm for k-mismatch with don't cares
- A fast algorithm for the all-pairs suffix-prefix problem
- Dictionary matching with a bounded gap in pattern or in text
- An algorithm to compute the character access count distribution for pattern matching algorithms
- A faster quick search algorithm
- On-line weighted pattern matching
- On the string matching with \(k\) mismatches
- A randomized numerical aligner (rNA)
- The wide window string matching algorithm
- Partial words and the critical factorization theorem
- Improved pattern-scan-order algorithms for string matching
- An improvement of the Aho-Corasick machine
- Transducers and repetitions
- Two-pattern strings. I: A recognition algorithm
- Time-space-optimal string matching
- Correctness of substring-preprocessing in Boyer-Moore's pattern matching algorithm
- Application of max-plus algebra to biological sequence comparisons
- A new regular grammar pattern matching algorithm.
- Multiple filtration and approximate pattern matching
- A subquadratic algorithm for approximate limited expression matching
- Approximate Boyer-Moore string matching for small alphabets
- Permuted pattern matching algorithms on multi-track strings
- Order-preserving pattern matching indeterminate strings
- Quantum algorithm for learning secret strings and its experimental demonstration
- The Range Automaton: an efficient approach to text-searching
- Efficient online string matching based on characters distance text sampling
- Fast algorithms for single and multiple pattern Cartesian tree matching
- A parameterized multilevel pattern matching architecture on FPGAs for network intrusion detection and prevention
- Fast parallel and serial multidimensional approximate array matching
- Milestones from the Pure Lisp Theorem Prover to ACL2
- Succinct non-overlapping indexing
- The order-preserving pattern matching problem in practice
- A brief history of parameterized matching problems
- Fast string matching for DNA sequences
- Sliding suffix tree
- Conjugacy in Artin groups of extra-large type.
- Weighted approximate parameterized string matching
- Order-preserving matching
- Towards optimal packed string matching
- Approximating the maximum consecutive subsums of a sequence
- Partial words and the critical factorization theorem revisited
- Efficient one-dimensional real scaled matching
- Prefix-free regular languages and pattern matching
- Generalized function matching
- Fast string matching by using probabilities: on an optimal mismatch variant of Horspool's algorithm
- Bit-parallel (\(\delta ,\gamma\))-matching and suffix automata
- A weak approach to suffix automata simulation for exact and approximate string matching
- Improved characters distance sampling for online and offline text searching
- On-line string matching algorithms: survey and experimental results
- Fast string matching for multiple searches
- NR-grep: A fast and flexible pattern-matching tool
- Fast string matching in stationary ergodic sources
- Efficient algorithms for the order preserving pattern matching problem
- Performance estimation using symbolic data
This page was built for publication: A fast string searching algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3090391)
