Fast Searching in Packed Strings

DOI10.1007/978-3-642-02441-2_11zbMath1247.68068arXiv0907.3135OpenAlexW2570324816MaRDI QIDQ3637108

Philip Bille

Publication date: 7 July 2009

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0907.3135

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Algorithms on strings (68W32)

Related Items

Worst-case efficient single and multiple string matching on packed texts in the word-RAM model ⋮ Worst Case Efficient Single and Multiple String Matching in the RAM Model

Cites Work

• Let sleeping files lie: Pattern matching in Z-compressed files.
• Shift-or string matching with super-alphabets
• A faster algorithm computing string edit distances
• A fast string searching algorithm
• Accelerating Boyer Moore Searches on Binary Texts
• EFFICIENT VARIANTS OF THE BACKWARD-ORACLE-MATCHING ALGORITHM
• Efficient randomized pattern-matching algorithms
• Fast Pattern Matching in Strings
• Algorithms on Strings, Trees and Sequences
• A Four Russians algorithm for regular expression pattern matching
• A Subquadratic Algorithm for Approximate Regular Expression Matching
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item