String matching with lookahead

DOI10.1016/j.dam.2013.10.034zbMath1329.68316OpenAlexW2050498978MaRDI QIDQ496556

Jorma Tarhio, Hannu Peltola

Publication date: 22 September 2015

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.10.034

zbMATH Keywords

string matchingbit-parallelismBNDM\(q\)-grams2-byte read

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Related Items (1)

Faster string matching based on hashing and bit-parallelism

Cites Work

• Unnamed Item
• Fast exact string matching algorithms
• Improving practical exact string matching
• Shift-or string matching with super-alphabets
• NR‐grep: a fast and flexible pattern‐matching tool
• A fast string searching algorithm
• EFFICIENT VARIANTS OF THE BACKWARD-ORACLE-MATCHING ALGORITHM
• Fast and flexible string matching by combining bit-parallelism and suffix automata
• String Processing and Information Retrieval

This page was built for publication: String matching with lookahead