Worst Case Efficient Single and Multiple String Matching in the RAM Model

DOI10.1007/978-3-642-19222-7_10zbMath1326.68371arXiv1011.3441OpenAlexW2121028531MaRDI QIDQ3000497

Djamal Belazzougui

Publication date: 19 May 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (3)

Fast and flexible packed string matching ⋮ Towards optimal packed string matching ⋮ Streaming Dictionary Matching with Mismatches

Uses Software

• MPSCAN

Cites Work

• Indexing text using the Ziv--Lempel trie
• Speeding up two string-matching algorithms
• Log-logarithmic worst-case range queries are possible in space theta(N)
• A fast string searching algorithm
• Suffix Arrays: A New Method for On-Line String Searches
• The string B-tree
• Succinct Dictionary Matching with No Slowdown
• Fast Searching in Packed Strings
• Filtering Search: A New Approach to Query-Answering
• Storing a Sparse Table with 0 (1) Worst Case Access Time
• The Complexity of Pattern Matching for a Random String
• Efficient string matching
• Design and implementation of an efficient priority queue
• Fast Pattern Matching in Strings
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Worst Case Efficient Single and Multiple String Matching in the RAM Model