On hardness of jumbled indexing
Jumbled indexing is the problem of indexing a text T for queries that ask whether there is a
substring of T matching a pattern represented as a Parikh vector, ie, the vector of frequency …
substring of T matching a pattern represented as a Parikh vector, ie, the vector of frequency …
Approximate circular pattern matching
P Charalampopoulos, T Kociumaka… - arXiv preprint arXiv …, 2022 - arxiv.org
We consider approximate circular pattern matching (CPM, in short) under the Hamming and
edit distance, in which we are given a length-$ n $ text $ T $, a length-$ m $ pattern $ P …
edit distance, in which we are given a length-$ n $ text $ T $, a length-$ m $ pattern $ P …
On approximate jumbled pattern matching in strings
Given a string s, the Parikh vector of s, denoted p (s), counts the multiplicity of each character
in s. Searching for a match of a Parikh vector q in the text s requires finding a substring t of s …
in s. Searching for a match of a Parikh vector q in the text s requires finding a substring t of s …
[HTML][HTML] Sub-quadratic time and linear space data structures for permutation matching in binary strings
Given a pattern P of length n and a text T of length m, the permutation matching problem
asks whether any permutation of P occurs in T. Indexing a string for permutation matching …
asks whether any permutation of P occurs in T. Indexing a string for permutation matching …
Indexing permutations for binary strings
Given a pattern P of length m and a text T of length n, the permutation matching problem
asks whether any permutation of P occurs in T. Indexing a string for permutation matching …
asks whether any permutation of P occurs in T. Indexing a string for permutation matching …
Efficient indexes for jumbled pattern matching with constant-sized alphabet
We introduce efficient data structures for an indexing problem in non-standard stringology—
jumbled pattern matching. Moosa and Rahman J. Discr. Alg., 2012 gave an index for …
jumbled pattern matching. Moosa and Rahman J. Discr. Alg., 2012 gave an index for …
Orthogonal range searching for text indexing
M Lewenstein - Space-Efficient Data Structures, Streams, and …, 2013 - Springer
Text indexing, the problem in which one desires to preprocess a (usually large) text for future
(shorter) queries, has been researched ever since the suffix tree was invented in the early …
(shorter) queries, has been researched ever since the suffix tree was invented in the early …
How hard is it to find (honest) witnesses?
I Goldstein, T Kopelowitz, M Lewenstein… - arXiv preprint arXiv …, 2017 - arxiv.org
In recent years much effort was put into developing polynomial-time conditional lower
bounds for algorithms and data structures in both static and dynamic settings. Along these …
bounds for algorithms and data structures in both static and dynamic settings. Along these …
On table arrangements, scrabble freaks, and jumbled pattern matching
Given a string s, the Parikh vector of s, denoted p (s), counts the multiplicity of each character
in s. Searching for a match of Parikh vector q (a “jumbled string”) in the text s requires to find …
in s. Searching for a match of Parikh vector q (a “jumbled string”) in the text s requires to find …
[HTML][HTML] On prefix normal words and prefix normal forms
A 1-prefix normal word is a binary word with the property that no factor has more 1s than the
prefix of the same length; a 0-prefix normal word is defined analogously. These words arise …
prefix of the same length; a 0-prefix normal word is defined analogously. These words arise …