NR‐grep: a fast and flexible pattern‐matching tool
@article{Navarro2001NRgrepAF, title={NR‐grep: a fast and flexible pattern‐matching tool}, author={G. Navarro}, journal={Software: Practice and Experience}, year={2001}, volume={31} }
We present nrgrep (‘non‐deterministic reverse grep’), a new pattern‐matching tool designed for efficient search of complex patterns. Unlike previous tools of the grep family, such as agrep and Gnu grep, nrgrep is based on a single and uniform concept: the bit‐parallel simulation of a non‐deterministic suffix automaton. As a result, nrgrep can find from simple patterns to regular expressions, exactly or allowing errors in the matches, with an efficiency that degrades smoothly as the complexity… CONTINUE READING
Topics from this paper
117 Citations
PatMatch: a program for finding patterns in peptide and nucleotide sequences
- Biology, Computer Science
- Nucleic Acids Res.
- 2005
- 125
- PDF
Improving regular-expression matching on strings using negative factors
- Computer Science
- SIGMOD '13
- 2013
- 7
- PDF
Fast and flexible string matching by combining bit-parallelism and suffix automata
- Computer Science
- JEAL
- 2000
- 187
- PDF
Fast and simple character classes and bounded gaps pattern matching, with application to protein searching
- Computer Science
- RECOMB
- 2001
- 32
- PDF
Fast and Simple Character Classes and Bounded Gaps Pattern Matching, with Applications to Protein Searching
- Mathematics, Computer Science
- J. Comput. Biol.
- 2003
- 84
From Nondeterministic Suffix Automaton to Lazy Suffix Tree
- Computer Science
- Algorithms and Applications
- 2010
- PDF
Bitwise data parallelism in regular expression matching
- Computer Science
- 2014 23rd International Conference on Parallel Architecture and Compilation (PACT)
- 2014
- 20
- PDF
References
SHOWING 1-10 OF 37 REFERENCES
A Bit-Parallel Approach to Suffix Automata: Fast Extended String Matching
- Computer Science
- CPM
- 1998
- 130
- PDF
Compact DFA Representation for Fast Regular Expression Search
- Mathematics, Computer Science
- Algorithm Engineering
- 2001
- 40
- PDF
A fast bit-vector algorithm for approximate string matching based on dynamic programming
- Mathematics, Computer Science
- JACM
- 1999
- 318
- PDF
From Regular Expressions to Deterministic Automata
- Computer Science, Mathematics
- Theor. Comput. Sci.
- 1986
- 302
- PDF
String matching with k differences by finite automata
- Mathematics, Computer Science
- Proceedings of 13th International Conference on Pattern Recognition
- 1996
- 18