Binary jumbled string matching for highly run-length compressible texts
نویسندگان
چکیده
منابع مشابه
Binary jumbled string matching for highly run-length compressible texts
The Binary Jumbled String Matching problem is defined as: Given a string s over {a, b} of length n and a query (x, y), with x, y non-negative integers, decide whether s has a substring t with exactly x a’s and y b’s. Previous solutions created an index of size O(n) in a pre-processing step, which was then used to answer queries in constant time. The fastest algorithms for construction of this i...
متن کاملNew algorithms for binary jumbled pattern matching
Given a pattern P and a text T , both strings over a binary alphabet, the binary jumbled string matching problem consists in telling whether any permutation of P occurs in T . The indexed version of this problem, i.e., preprocessing a string to efficiently answer such permutation queries, is hard and has been studied in the last few years. Currently the best bounds for this problem are O(n/ log...
متن کاملFast and Simple Jumbled Indexing for Binary Run-Length Encoded Strings
Important papers have appeared recently on the problem of indexing binary strings for jumbled pattern matching, and further lowering the time bounds in terms of the input size would now be a breakthrough with broad implications. We can still make progress on the problem, however, by considering other natural parameters. Badkobeh et al. (IPL, 2013) and Amir et al. (TCS, 2016) gave algorithms tha...
متن کاملGrammar-Based Construction of Indexes for Binary Jumbled Pattern Matching
We show how, given a straight-line program with g rules for a binary string B of length n, in O ( gn ) time we can build a (2nH0(B)+ o(n))-bit index such that, given m and c, in O(1) time we can determine whether there is a substring of B with length m containing exactly c copies of 1. If we use O(n log n) bits for the index, then we can list all such substrings using O(m) time per substring.
متن کاملBinary Jumbled Pattern Matching via All-Pairs Shortest Paths
In binary jumbled pattern matching we wish to preprocess a binary string S in order to answer queries (i, j) which ask for a substring of S that is of size i and has exactly j 1-bits. The problem naturally generalizes to node-labeled trees and graphs by replacing “substring” with “connected subgraph”. In this paper, we give an n/2 n/ log log n) 1/2 time solution for both strings and trees. This...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2013
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2013.05.007