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}
}
  • G. Navarro
  • Published 2001
  • Computer Science
  • Software: Practice and Experience
  • 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
    117 Citations
    PatMatch: a program for finding patterns in peptide and nucleotide sequences
    • 125
    • PDF
    Negative Factor: Improving Regular-Expression Matching in Strings
    • 11
    From Nondeterministic Suffix Automaton to Lazy Suffix Tree
    • PDF
    New Techniques for Regular Expression Searching
    • 37
    • PDF
    Survey of Global Regular Expression Print (grep) Tools
    • 16
    Bitwise data parallelism in regular expression matching
    • 20
    • PDF

    References

    SHOWING 1-10 OF 37 REFERENCES
    Faster Approximate String Matching
    • 145
    • PDF
    Compact DFA Representation for Fast Regular Expression Search
    • 40
    • PDF
    GLIMPSE: A Tool to Search Through Entire File Systems
    • 355
    • PDF
    Fast Pattern Matching in Strings
    • 2,927
    • PDF
    A fast bit-vector algorithm for approximate string matching based on dynamic programming
    • E. Myers
    • Mathematics, Computer Science
    • JACM
    • 1999
    • 318
    • PDF
    From Regular Expressions to Deterministic Automata
    • 302
    • PDF
    A fast string searching algorithm
    • 2,415
    • PDF
    Fast text searching: allowing errors
    • 828
    String matching with k differences by finite automata
    • B. Melichar
    • Mathematics, Computer Science
    • Proceedings of 13th International Conference on Pattern Recognition
    • 1996
    • 18