Worst case efficient single and multiple string matching in the RAM model

DOI10.1007/978-3-642-19222-7_10zbMATH Open1326.68371arXiv1011.3441OpenAlexW2121028531MaRDI QIDQ3000497FDOQ3000497

Authors: Djamal Belazzougui 

Publication date: 19 May 2011

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

Abstract: In this paper, we explore worst-case solutions for the problems of single and multiple matching on strings in the word RAM model with word length w. In the first problem, we have to build a data structure based on a pattern p of length m over an alphabet of size sigma such that we can answer to the following query: given a text T of length n, where each character is encoded using log(sigma) bits return the positions of all the occurrences of p in T (in the following we refer by occ to the number of reported occurrences). For the multi-pattern matching problem we have a set S of d patterns of total length m and a query on a text T consists in finding all positions of all occurrences in T of the patterns in S. As each character of the text is encoded using log sigma bits and we can read w bits in constant time in the RAM model, we assume that we can read up to (w/log sigma) consecutive characters of the text in one time step. This implies that the fastest possible query time for both problems is O((n(log sigma/w)+occ). In this paper we present several different results for both problems which come close to that best possible query time. We first present two different linear space data structures for the first and second problem: the first one answers to single pattern matching queries in time O(n(1/m+log sigma/w)+occ) while the second one answers to multiple pattern matching queries to O(n((log d+log y+log log d)/y+log sigma/w)+occ) where y is the length of the shortest pattern in the case of multiple pattern-matching. We then show how a simple application of the four russian technique permits to get data structures with query times independent of the length of the shortest pattern (the length of the only pattern in case of single string matching) at the expense of using more space.

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

Recommendations

• Worst-case efficient single and multiple string matching on packed texts in the word-RAM model
• Average optimal string matching in packed strings
• Fast Searching in Packed Strings
• Fast searching in packed strings
• Fast practical multi-pattern matching

Mathematics Subject Classification ID

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

Cites Work

• Efficient string matching
• Title not available (Why is that?)
• The string B-tree
• Filtering Search: A New Approach to Query-Answering
• Storing a Sparse Table with 0 (1) Worst Case Access Time
• 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
• Fast Pattern Matching in Strings
• Title not available (Why is that?)
• Design and implementation of an efficient priority queue
• Title not available (Why is that?)
• Succinct Dictionary Matching with No Slowdown
• Indexing text using the Ziv--Lempel trie
• Fast Searching in Packed Strings
• The Complexity of Pattern Matching for a Random String

Cited In (5)

• Fast and flexible packed string matching
• Worst-case efficient single and multiple string matching on packed texts in the word-RAM model
• Towards optimal packed string matching
• Streaming Dictionary Matching with Mismatches
• Window-accumulated subsequence matching problem is linear

Uses Software

• MPSCAN

This page was built for publication: Worst case efficient single and multiple string matching in the RAM model

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