A SPACE EFFICIENT BIT-PARALLEL ALGORITHM FOR THE MULTIPLE STRING MATCHING PROBLEM

DOI10.1142/S0129054106004388MaRDI QIDQ3421840zbMATH OpenOpenAlexFDO

Authors Domenico Cantone, Simone Faro

Publication date 8 February 2007

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054106004388

zbMATH Keywords

bit-parallelismmultiple string matchingtext searching

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Recommendations

• On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns
• A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
• A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
• Fast and flexible string matching by combining bit-parallelism and suffix automata
• Increased bit-parallelism for approximate and multiple string matching

Cites work

• A fast string searching algorithm
• Efficient string matching
• Fast Pattern Matching in Strings
• Speeding up two string-matching algorithms

Cited in

(10)

• Bit-parallel witnesses and their applications to approximate string matching
• A parallel multistart algorithm for the closest string problem
• Giant complete automaton for uncertain multiple string matching and its high speed construction algorithm
• A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
• A Method to Overcome Computer Word Size Limitation in Bit-Parallel Pattern Matching
• On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns
• A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
• scientific article; zbMATH DE number 1949653 (Why is no real title available?)
• A Bit-Parallel Exact String Matching Algorithm for Small Alphabet
• String Processing and Information Retrieval

This page was built for publication: A SPACE EFFICIENT BIT-PARALLEL ALGORITHM FOR THE MULTIPLE STRING MATCHING PROBLEM

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