DeepAI AI Chat
Log In Sign Up

On Arithmetically Progressed Suffix Arrays and related Burrows-Wheeler Transforms

by   Jacqueline W. Daykin, et al.

We characterize those strings whose suffix arrays are based on arithmetic progressions, in particular, arithmetically progressed permutations where all pairs of successive entries of the permutation have the same difference modulo the respective string length. We show that an arithmetically progressed permutation P coincides with the suffix array of a unary, binary, or ternary string. We further analyze the conditions of a given P under which we can find a uniquely defined string over either a binary or ternary alphabet having P as its suffix array. For the binary case, we show its connection to lower Christoffel words, balanced words, and Fibonacci words. In addition to solving the arithmetically progressed suffix array problem, we give the shape of the Burrows-Wheeler transform of those strings solving this problem. These results give rise to numerous future research directions.


page 1

page 2

page 3

page 4


Counting and Verifying Abelian Border Arrays of Binary Words

In this note, we consider the problem of counting and verifying abelian ...

An Algorithm for Automatically Updating a Forsyth-Edwards Notation String Without an Array Board Representation

We present an algorithm that correctly updates the Forsyth-Edwards Notat...

An Analysis into the Performance and Memory Usage of MATLAB Strings

MATLAB is a mathematical computing environment used by many engineers, m...

Information Processing by Nonlinear Phase Dynamics in Locally Connected Arrays

Research toward powerful information processing systems that circumvent ...

String Covering: A Survey

The study of strings is an important combinatorial field that precedes t...

Computing Covers under Substring Consistent Equivalence Relations

Covers are a kind of quasiperiodicity in strings. A string C is a cover ...

Prefix Block-Interchanges on Binary and Ternary Strings

The genome rearrangement problem computes the minimum number of operatio...