Dec 20, 2016 · We also present an online algorithm that computes all the abelian runs with periods of norm p in w in time O ( n p ) , for any given norm p.

Jun 29, 2015 · We also present an online algorithm that computes all the abelian runs with periods of norm p in w in time O(np), for any given norm p. Finally, ...

Problem 1. Given a string w of length n and a Parikh vector P, find all the abelian runs with period P occurring in w,. → an O(n)-time and O(σ + |P|)-space ...

Fast algorithms for Abelian periods in words and greatest common divisor queries · Computer Science, Mathematics. J. Comput. Syst. Sci. · 2017.

In this paper we define an abelian run of period P in a word w as an occurrence of a substring v of w such that v is periodic with abelian period P and this ...

Our main result is an online algorithm that, given a word of length over an alphabet of cardinality and a Parikh vector , returns all the abelian runs of period ...

Our main result is an online algorithm that, given a word w of length n over an alphabet of cardinality ź and a Parikh vector P, returns all the abelian runs of ...

We also present an online algorithm that computes all the abelian runs with periods of norm $p$ in $w$ in time $O(np)$, for any given norm $p$. Finally, we give ...

Abstract. We present efficient algorithms computing all Abelian periods of two types in a word. Regular. Abelian periods are computed in O(nlog log n) ...

An algorithm is given that finds all the abelian runs of period \(\mathcal {P}\) in a word of length \(n\) in time \(O(n\times |\mathcal{P}|)\) and space ...