Fast and flexible packed string matching
From MaRDI portal
Publication:405577
DOI10.1016/j.jda.2014.07.003zbMath1305.68381OpenAlexW2010580909MaRDI QIDQ405577
Simone Faro, M. Oğuzhan Külekci
Publication date: 5 September 2014
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2014.07.003
Related Items
The Range Automaton: an efficient approach to text-searching ⋮ A weak approach to suffix automata simulation for exact and approximate string matching ⋮ Compact suffix automata representations for searching long patterns ⋮ Linear and Efficient String Matching Algorithms Based on Weak Factor Recognition ⋮ Unnamed Item ⋮ The order-preserving pattern matching problem in practice ⋮ A Very Fast String Matching Algorithm Based on Condensed Alphabets ⋮ Parallel String Matching ⋮ Efficient string matching based on a two-step simulation of the suffix automaton
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
- Fast searching in packed strings
- BLIM: A new bit-parallel pattern matching algorithm overcoming computer word size limitation
- Fast exact string matching algorithms
- Speeding up two string-matching algorithms
- The exact online string matching problem
- Optimal Packed String Matching
- Worst Case Efficient Single and Multiple String Matching in the RAM Model
- A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel Approach
- EFFICIENT VARIANTS OF THE BACKWARD-ORACLE-MATCHING ALGORITHM
- Efficient randomized pattern-matching algorithms
- The Complexity of Pattern Matching for a Random String
- Fast Pattern Matching in Strings
- Average Optimal String Matching in Packed Strings
- Fast Packed String Matching for Short Patterns
- Tuning BNDM withq-Grams
