Simple algorithm for sorting the fibonacci string rotations

Authors:
Manolis Christodoulakis;Costas S. Iliopoulos;Yoan José Pinzón Ardila
Affiliations:
Department of Computer Science, King’s College London, London, UK;Department of Computer Science, King’s College London, London, UK;Department of Computer Science, King’s College London, London, UK
Venue:
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Year:
2006

Citing 2
Cited 0

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Burrows--Wheeler transform and Sturmian words

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we focus on the combinatorial properties of the Fibonacci strings rotations. We first present 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. We then use this information to deduce, also in constant time, the character that is stored at any one location of any given Fibonacci string. Finally, we study the output of the Burrows-Wheeler Transform (BWT) on Fibonacci strings to prove that when BWT is applied to Fibonacci strings it always produces a sequence of ‘b’s’ followed by a sequence of ‘a’s’.