Related papers: Computing Abelian regularities on RLE strings
We consider the task of locally correcting, and locally list-correcting, multivariate linear functions over the domain $\{0,1\}^n$ over arbitrary fields and more generally Abelian groups. Such functions form error-correcting codes of…
We describe a RAM algorithm computing all runs (maximal repetitions) of a given string of length $n$ over a general ordered alphabet in $O(n\log^{\frac{2}3} n)$ time and linear space. Our algorithm outperforms all known solutions working in…
Two finite words $u$ and $v$ are called Abelian equivalent if each letter occurs equally many times in both $u$ and $v$. The abelian closure $\mathcal{A}(\mathbf{x})$ of (the shift orbit closure of) an infinite word $\mathbf{x}$ is the set…
Run Length Encoding(RLE) is one of the oldest algorithms for data-compression available, a method used for compression of large data into smaller and therefore more compact data. It compresses by looking at the data for repetitions of the…
Classically, the edit distance of two length-$n$ strings can be computed in $O(n^2)$ time, whereas an $O(n^{2-\epsilon})$-time procedure would falsify the Orthogonal Vectors Hypothesis. If the edit distance does not exceed $k$, the running…
Mantaci et al. [TCS 2007] defined the eBWT to extend the definition of the BWT to a collection of strings, however, since this introduction, it has been used more generally to describe any BWT of a collection of strings and the fundamental…
Given a pattern string $P$ of length $n$ and a query string $T$ of length $m$, where the characters of $P$ and $T$ are drawn from an alphabet of size $\Delta$, the {\em exact string matching} problem consists of finding all occurrences of…
We say that two finite words $u$ and $v$ are abelian equivalent if and only if they have the same number of occurrences of each letter, or equivalently if they define the same Parikh vector. In this paper we investigate various abelian…
A binary string $f$ is a factor of string $u$ if $f$ appears as a sequence of $|f|$ consecutive bits of $u$, where $|f|$ denotes the length of $f$. Generalized Fibonacci cube $Q_{d}(f)$ is the graph obtained from the $d$-cube $Q_{d}$ by…
The problem of rectangle tiling binary arrays is defined as follows. Given an $n \times n$ array $A$ of zeros and ones and a natural number $p$, our task is to partition $A$ into at most $p$ rectangular tiles, so that the maximal weight of…
I present a parallel algorithm for exact probabilistic inference in Bayesian networks. For polytree networks with n variables, the worst-case time complexity is O(log n) on a CREW PRAM (concurrent-read, exclusive-write parallel…
The recently introduced longest common substring with $k$-mismatches ($k$-LCF) problem is to find, given two sequences $S_1$ and $S_2$ of length $n$ each, a longest substring $A_1$ of $S_1$ and $A_2$ of $S_2$ such that the Hamming distance…
The Abelian Sandpile generates complex and beautiful patterns and seems to display allometry. On the plane, beyond patches, patterns periodic in both dimensions, we remark the presence of structures periodic in one dimension, that we call…
Based on the Breslauer-Italiano online suffix tree construction algorithm (2013) with double logarithmic worst-case guarantees on the update time per letter, we develop near-real-time algorithms for several classical problems on strings,…
A run is an inclusion maximal occurrence in a string (as a subinterval) of a repetition $v$ with a period $p$ such that $2p \le |v|$. The exponent of a run is defined as $|v|/p$ and is $\ge 2$. We show new bounds on the maximal sum of…
The constrained LCS problem asks one to find a longest common subsequence of two input strings $A$ and $B$ with some constraints. The STR-IC-LCS problem is a variant of the constrained LCS problem, where the solution must include a given…
We present a near-linear time algorithm that approximates the edit distance between two strings within a polylogarithmic factor; specifically, for strings of length n and every fixed epsilon>0, it can compute a (log n)^O(1/epsilon)…
In this report, we consider Adelman's algorithm for generating shortest permutation strings. We introduce a new representation approach which reveals some properties of Adelman's algorithm.
In many integer factoring algorithms, one produces a sequence of integers (created in a pseudo-random way), and wishes to rapidly determine a subsequence whose product is a square (which we call a square product). In his lecture at the 1994…
In this article, we study short intervals that contain another type of "almost square", an integer $n$ which can be factored in two different ways $n = a_1 b_1 = a_2 b_2$ with $a_1, a_2, b_1, b_2$ close to $\sqrt{n}$.