Fast and flexible string matching by combining bit-parallelism and suffix automata
From MaRDI portal
Publication:5463398
DOI10.1145/351827.384246zbMath1071.68563OpenAlexW2092587157MaRDI QIDQ5463398
Mathieu Raffinot, Gonzalo Navarro
Publication date: 4 August 2005
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/351827.384246
Related Items
Fast exact string matching algorithms, A Bit-Parallel Exact String Matching Algorithm for Small Alphabet, Practical and flexible pattern matching over Ziv-Lempel compressed text., Bit-Parallel Approximate Matching of Circular Strings with k Mismatches, A new filtration method and a hybrid strategy for approximate string matching, Run-Length Encoded Nondeterministic KMP and Suffix Automata, A weak approach to suffix automata simulation for exact and approximate string matching, On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns, BLIM: A new bit-parallel pattern matching algorithm overcoming computer word size limitation, A compact representation of nondeterministic (suffix) automata for the bit-parallel approach, Average complexity of backward \(q\)-gram string matching algorithms, Approximate Boyer-Moore string matching for small alphabets, On a compact encoding of the swap automaton, On-line string matching algorithms: survey and experimental results, String matching with lookahead, Faster string matching based on hashing and bit-parallelism, Lyndon factorization algorithms for small alphabets and run-length encoded strings, Special factors and the combinatorics of suffix and factor automata, The wide window string matching algorithm, A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms, Improving practical exact string matching, Regular expression searching on compressed text, Average-optimal string matching, Bit-parallel (\(\delta ,\gamma\))-matching and suffix automata, Parallel String Matching
