Oct 23, 2012 · Abstract:Given a pattern P and a text T, both strings over a binary alphabet, the binary jumbled string matching problem consists in telling ...

Two new algorithms for binary jumbled pattern matching. •. We present the first solution for this problem based on word-level parallelism.

Two new algorithms for binary jumbled pattern matching. •. We present the first solution for this problem based on word-level parallelism.

This paper proposes a new and very simple algorithm that also runs in O(n + r^2) time and can be extended either so that the index returns the position of a ...

New algorithms for binary jumbled pattern matching · 1 Introduction · 2 Basic notions and definitions · 3 A variant of the Badkobeh et al. index.

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 ...

Giaquinta, Emanuele ; Grabowski, Szymon. / New algorithms for binary jumbled pattern matching. In: Information Processing Letters. 2013 ; Vol. 113, No. 14-16.

This problem is called semi-dynamic dictionary matching if only insertions are allowed. In this paper, we propose two efficient algorithms. ... This algorithm is ...

Sep 16, 2019 · Emanuele Giaquinta , Szymon Grabowski : New algorithms for binary jumbled pattern matching. Inf. Process. Lett. 113(14-16): 538-542 (2013).

Binary jumbled pattern matching asks to preprocess a binary string S in order to answer queries (i,j) which ask for a substring of S that is of length i and ...