Alternative algorithms for bit-parallel string matching.

DOI10.1007/B14038MaRDI QIDQ5897133zbMATH OpenOpenAlexFDO

Authors Hannu Peltola, Jorma Tarhio

Publication date 9 February 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b14038

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Recommendations

• Fast and flexible string matching by combining bit-parallelism and suffix automata
• Improving practical exact string matching
• Tuning BNDM with \(q\)-grams
• On-line string matching algorithms: survey and experimental results
• Efficient variants of the backward-oracle-matching algorithm

Cited in

(30)

• Shift-or string matching with super-alphabets
• Average-optimal string matching
• Bit-parallel witnesses and their applications to approximate string matching
• The wide window string matching algorithm
• Efficient string matching based on a two-step simulation of the suffix automaton
• The Range Automaton: an efficient approach to text-searching
• Fast string matching for DNA sequences
• A weak approach to suffix automata simulation for exact and approximate string matching
• Compact suffix automata representations for searching long patterns
• On-line string matching algorithms: survey and experimental results
• A fast suffix automata based algorithm for exact online string matching
• Run-Length Encoded Nondeterministic KMP and Suffix Automata
• A Method to Overcome Computer Word Size Limitation in Bit-Parallel Pattern Matching
• Nested Counters in Bit-Parallel String Matching
• Efficient variants of the backward-oracle-matching algorithm
• A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
• Bit-Parallel Approximate Matching of Circular Strings with k Mismatches
• String matching with lookahead
• Fast pattern matching method for a bitstream
• Faster string matching based on hashing and bit-parallelism
• Tuning BNDM with \(q\)-grams
• A Bit-Parallel Exact String Matching Algorithm for Small Alphabet
• Multi-pattern matching algorithm with wildcards based on bit-parallelism
• Fast and flexible string matching by combining bit-parallelism and suffix automata
• Parallel String Matching
• String Processing and Information Retrieval
• BLIM: A new bit-parallel pattern matching algorithm overcoming computer word size limitation
• Accelerating Boyer-Moore searches on binary texts
• Fast pattern-matching on indeterminate strings
• Improving practical exact string matching

This page was built for publication: Alternative algorithms for bit-parallel string matching.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897133)