Fast and flexible packed string matching
From MaRDI portal
Publication:405577
DOI10.1016/J.JDA.2014.07.003zbMATH Open1305.68381OpenAlexW2010580909MaRDI QIDQ405577FDOQ405577
Authors: 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
Recommendations
- Efficient string matching on packed texts
- Fast Packed String Matching for Short Patterns
- Towards optimal packed string matching
- Fast Searching in Packed Strings
- Fast searching in packed strings
- Optimal packed string matching
- Fast convolutions of packed strings and pattern matching with wildcards
- Fast string matching with mismatches
- Efficient parameterized string matching
- Fast and practical approximate string matching
Cites Work
- BLIM: A new bit-parallel pattern matching algorithm overcoming computer word size limitation
- Efficient randomized pattern-matching algorithms
- Speeding up two string-matching algorithms
- Fast Pattern Matching in Strings
- Title not available (Why is that?)
- The exact online string matching problem: a review of the most recent results
- 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
- The Complexity of Pattern Matching for a Random String
- A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
- Title not available (Why is that?)
- Title not available (Why is that?)
- Average optimal string matching in packed strings
- Fast Packed String Matching for Short Patterns
- Tuning BNDM with \(q\)-grams
- Fast searching in packed strings
- Fast-search algorithms: new efficient variants of the Boyer-Moore pattern-matching algorithm
- Fast exact string matching algorithms
Cited In (13)
- Fast Packed String Matching for Short Patterns
- The order-preserving pattern matching problem in practice
- Linear and efficient string matching algorithms based on weak factor recognition
- Parallel String Matching
- Efficient string matching based on a two-step simulation of the suffix automaton
- The Range Automaton: an efficient approach to text-searching
- A weak approach to suffix automata simulation for exact and approximate string matching
- A very fast string matching algorithm based on condensed alphabets
- Towards optimal packed string matching
- Optimal packed string matching
- Compact suffix automata representations for searching long patterns
- Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing
- Byte-aligned pattern matching in encoded genomic sequences
Uses Software
This page was built for publication: Fast and flexible packed string matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q405577)
