Corpus ID: 235743000

# On Arithmetically Progressed Suffix Arrays and related Burrows-Wheeler Transforms

@article{Daykin2021OnAP,
title={On Arithmetically Progressed Suffix Arrays and related Burrows-Wheeler Transforms},
author={Jacqueline W. Daykin and Dominik K{\"o}ppl and David K{\"u}bel and Florian Stober},
journal={ArXiv},
year={2021},
volume={abs/2107.02503}
}
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… Expand

#### References

SHOWING 1-10 OF 51 REFERENCES
On Arithmetically Progressed Suffix Arrays
• Computer Science
• Stringology
• 2020
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 permutationExpand
Arithmetics on Suffix Arrays of Fibonacci Words
• Mathematics, Computer Science
• WORDS
• 2015
It is shown that the suffix array is a rotation of its inverse under certain conditions, and that the factors of the LZ77 factorization of any Fibonacci word yield again similar characteristics. Expand
Applications of V-Order: Suffix Arrays, the Burrows-Wheeler Transform & the FM-index
• Computer Science, Mathematics
• WALCOM
• 2019
This paper shows that the results describing the connection between suffix arrays and the Lyndon factorization are matched by analogous V-order processing, and applies the V-BWT to implement pattern matching in V- order after suitably modifying the FM-index. Expand
A Bijective String Sorting Transform
• Mathematics, Computer Science
• ArXiv
• 2012
The authors' experiments indicate that using their variant of the transform gives rise to better compression ratio than the original Burrows-Wheeler transform, and it is shown that both the transform and its inverse can be computed in linear time and consuming linear storage. Expand
Simple Algorithm for Sorting the Fibonacci String Rotations
• Mathematics, Computer Science
• SOFSEM
• 2006
This paper presents a simple formula that, in constant time, determines the rank of any rotation (of a given Fibonacci string) in the lexicographically-sorted list of all rotations, and deduces the character that is stored at any one location of any given Fib onacci string. Expand
Efficient pattern matching in degenerate strings with the Burrows-Wheeler transform
A new method for searching for a degenerate pattern of length m in t running in O ( m n ) time on a constant size alphabet Σ is presented, a hybrid pattern matching technique that works on both regular and degenerate strings. Expand
Binary block order Rouen Transform
Novel twin binary Burrows-Wheeler type transforms are introduced for Lyndon-like B-words which apply binary block order and it is shown that computing the B-BWT inverses is also achieved in linear time by using straightforward combinatorial arguments. Expand
Higher compression from the Burrows-Wheeler transform by modified sorting
• Computer Science
• Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225)
• 1998
It is shown that the ordering used in the sorting stage of the BWT, an aspect hitherto ignored, can have a significant impact on the size of the compressed data. Expand
Burrows-Wheeler transform and Sturmian words
• Mathematics, Computer Science
• Inf. Process. Lett.
• 2003
A reversible transformation on strings (BWT) that arouses considerable interest and curiosity in the field of Data Compression produces a permutation BWT(w) of an input string w that is easier to compress than the original one. Expand
Representing prefix and border tables: results on enumeration
• Computer Science, Mathematics
• Mathematical Structures in Computer Science
• 2015
A new upper bound on the number of prefix tables for strings of length n (on any alphabet) which is of order (1 + ϕ) n (with $\varphi=\frac{1+\sqrt{5}}{2}$ the golden mean) is given and also a corresponding lower bound is presented. Expand