scientific article; zbMATH DE number 140453
From MaRDI portal
Publication:4028869
Recommendations
- Fast text searching for regular expressions or automaton searching on tries
- scientific article; zbMATH DE number 1962812
- New techniques for regular expression searching
- Fast and compact regular expression matching
- Fast pattern matching in indexed texts
- Faster Regular Expression Matching
- Regular expression searching on compressed text
- Efficient parameterized string matching
- Efficient Submatch Extraction for Practical Regular Expressions
Cited in
(14)- Byte-aligned pattern matching in encoded genomic sequences
- Efficient Submatch Extraction for Practical Regular Expressions
- NR-grep: A fast and flexible pattern-matching tool
- Fast two-dimensional pattern matching
- A new regular grammar pattern matching algorithm.
- Bit-Parallel Approximate Matching of Circular Strings with k Mismatches
- Fast searching in packed strings
- New techniques for regular expression searching
- Multiple filtration and approximate pattern matching
- Average running time of the Boyer-Moore-Horspool algorithm
- An algorithm for string matching with a sequence of don't cares
- Bit-parallel string matching under Hamming distance in \(O(n\lceil m/w\rceil)\) worst case time
- Boyer-Moore approach to approximate string matching
- Fast pattern matching in indexed texts
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4028869)
