The Parikh vector p (s) of a string s over a finite ordered alphabet Σ={a1,…, aσ} is defined as
the vector of multiplicities of the characters, p (s)=(p1,…, pσ), where pi=|{j| sj= ai}|. Parikh …

The Parikh vector of a string s over a finite ordered alphabet Σ={a1,..., aσ} is defined as the
vector of multiplicities of the characters, ie p (s)=(p1,..., pσ), where pi=|{j| sj= ai}|. Parikh …

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 …

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 …

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 …

We present a new class of binary words: the prefix normal words. They are defined by the
property that for any given length k, no factor of length k has more a's than the prefix of the …

Given a sequence of n numbers, the MAXIMUM CONSECUTIVE SUBSUMS PROBLEM
(MCSP) asks for the maximum consecutive sum of lengths ℓ for each ℓ= 1,…, n. No algorithm …

We consider succinct, or highly space-efficient, representations of a (static) string consisting
of n pairs of balanced parentheses, that support natural operations such as finding the …

We study the problem of decomposing a positive integer M over a (fixed and finite) weighted
alphabet Σ: We want to find non-negative integers ci such that M= c 1 a 1+...+ ckak, where …

We present a novel approach for computing all maximum consecutive subsums in a
sequence of positive integers in near linear time. Solutions for this problem over binary …