NR‐grep: a fast and flexible pattern‐matching tool

DOI10.1002/spe.411zbMath1008.68028OpenAlexW2032377275MaRDI QIDQ2785069

Gonzalo Navarro

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

zbMATH Keywords

non-deterministic reverse grepnrgreppattern-matching tool

Mathematics Subject Classification ID

Searching and sorting (68P10) Theory of programming languages (68N15)

Related Items

Fast and compact regular expression matching ⋮ Bit-Parallel Approximate Matching of Circular Strings with k Mismatches ⋮ String matching with lookahead ⋮ Unnamed Item ⋮ Improving practical exact string matching ⋮ Regular expression searching on compressed text ⋮ Average-optimal string matching ⋮ Bit-parallel approximate string matching algorithms with transposition ⋮ Elastic-Degenerate String Matching via Fast Matrix Multiplication

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