Fast and flexible packed string matching

DOI10.1016/J.JDA.2014.07.003MaRDI QIDQ405577zbMATH OpenOpenAlexFDO

Authors Simone Faro, M. Oğuzhan Külekci

Publication date 5 September 2014

Published in Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jda.2014.07.003

zbMATH Keywords

information retrievaltext algorithmsexact string matchingexperimental algorithmsonline searching

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Recommendations

• Efficient string matching on packed texts
• Fast Packed String Matching for Short Patterns
• Towards optimal packed string matching
• Fast Searching in Packed Strings
• Fast searching in packed strings
• Optimal packed string matching
• Fast convolutions of packed strings and pattern matching with wildcards
• Fast string matching with mismatches
• Efficient parameterized string matching
• Fast and practical approximate string matching

Cites work

• scientific article; zbMATH DE number 5725179 (Why is no real title available?)
• scientific article; zbMATH DE number 1982175 (Why is no real title available?)
• scientific article; zbMATH DE number 2087042 (Why is no real title available?)
• A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
• A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
• Average optimal string matching in packed strings
• BLIM: A new bit-parallel pattern matching algorithm overcoming computer word size limitation
• Efficient randomized pattern-matching algorithms
• Efficient variants of the backward-oracle-matching algorithm
• Fast Packed String Matching for Short Patterns
• Fast Pattern Matching in Strings
• Fast exact string matching algorithms
• Fast searching in packed strings
• Fast-search algorithms: new efficient variants of the Boyer-Moore pattern-matching algorithm
• Optimal packed string matching
• Speeding up two string-matching algorithms
• The Complexity of Pattern Matching for a Random String
• The exact online string matching problem: a review of the most recent results
• Tuning BNDM with \(q\)-grams
• Worst case efficient single and multiple string matching in the RAM model

Cited in

(13)

• Byte-aligned pattern matching in encoded genomic sequences
• The Range Automaton: an efficient approach to text-searching
• A very fast string matching algorithm based on condensed alphabets
• Efficient string matching based on a two-step simulation of the suffix automaton
• Fast Packed String Matching for Short Patterns
• Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing
• Linear and efficient string matching algorithms based on weak factor recognition
• A weak approach to suffix automata simulation for exact and approximate string matching
• The order-preserving pattern matching problem in practice
• Parallel String Matching
• Compact suffix automata representations for searching long patterns
• Towards optimal packed string matching
• Optimal packed string matching

Describes a project that uses

Uses Software

• BLIM

This page was built for publication: Fast and flexible packed string matching

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