Shift-or string matching with super-alphabets

DOI10.1016/S0020-0190(03)00296-5MaRDI QIDQ1014420zbMATH OpenFDO

Authors Kimmo Fredriksson

Publication date 28 April 2009

Published in Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

algorithmsstring matchingbit-parallelism

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Recommendations

• A Bit-Parallel Exact String Matching Algorithm for Small Alphabet
• Alternative algorithms for bit-parallel string matching.
• On-line string matching algorithms: survey and experimental results
• Increased bit-parallelism for approximate and multiple string matching
• Fast and flexible string matching by combining bit-parallelism and suffix automata

Cites work

• scientific article; zbMATH DE number 1615279 (Why is no real title available?)
• A fast string searching algorithm
• A faster algorithm computing string edit distances
• Fast Pattern Matching in Strings
• Tuning string matching for huge pattern sets

Cited in

(10)

• A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
• Fast searching in packed strings
• A general compression algorithm that supports fast searching
• A Bit-Parallel Exact String Matching Algorithm for Small Alphabet
• Improving practical exact string matching
• Fast BWT in small space by blockwise suffix sorting
• Towards optimal packed string matching
• Combinatorial Pattern Matching
• String matching with lookahead
• Fast Searching in Packed Strings

This page was built for publication: Shift-or string matching with super-alphabets

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