NR‐grep: a fast and flexible pattern‐matching tool
From MaRDI portal
Publication:2785069
DOI10.1002/spe.411zbMath1008.68028MaRDI QIDQ2785069
Publication date: 24 April 2002
Published in: Software: Practice and Experience (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/spe.411
Related Items
Bit-Parallel Approximate Matching of Circular Strings with k Mismatches, Unnamed Item, Elastic-Degenerate String Matching via Fast Matrix Multiplication, String matching with lookahead, Improving practical exact string matching, Average-optimal string matching, Regular expression searching on compressed text, Fast and compact regular expression matching, Bit-parallel approximate string matching algorithms with transposition
Cites Work
- Unnamed Item
- Unnamed Item
- Very fast and simple approximate string matching
- From regular expressions to deterministic automata
- Faster approximate string matching
- Speeding up two string-matching algorithms
- A fast string searching algorithm
- A fast bit-vector algorithm for approximate string matching based on dynamic programming
- Fast Pattern Matching in Strings
- Programming Techniques: Regular expression search algorithm