Shift-or string matching with super-alphabets

DOI10.1016/S0020-0190(03)00296-5zbMath1161.68409MaRDI QIDQ1014420

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

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

Related Items

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

Cites Work

• Unnamed Item
• A faster algorithm computing string edit distances
• A fast string searching algorithm
• Tuning String Matching for Huge Pattern Sets
• Fast Pattern Matching in Strings