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’.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Berstel, J.: Fibonacci Words—a Survey. In: Rozenberg, G., Salomaa, A. (eds.) The Book of L, pp. 13–27. Springer, Heidelberg (1986)
Knuth, D.E.: The Art of Computer Programming, 3rd edn., vol. 1. Addison-Wesley, Reading (1997)
Cummings, L.J., Smyth, W.F.: Weak Repetitions in Strings. The Journal of Combinatorial Mathematics and Combinatorial Computing 24, 33–48 (1997)
Burrows, M., Wheeler, D.: A Block-Sorting Lossless Data Compression Algorithm. Technical Report 124, Digital Equipment Corporation (1994)
Mantaci, S., Restivo, A., Sciortino, M.: Burrows–Wheeler Transform and Sturmian Words. Information Processing Letters 86, 241–246 (2003)
Iliopoulos, C.S., Moore, D., Smyth, W.F.: A Characterization of the Squares in a Fibonacci String. Theoretical Computer Science 172, 281–291 (1997)
Eccles, P.: An Introduction to Mathematical Reasoning: Numbers, Sets and Functions. Cambridge University Press, Cambridge (1997)
Koshy, T.: Elementary Number Theory with Applications. Elsevier, Amsterdam (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Christodoulakis, M., Iliopoulos, C.S., Ardila, Y.J.P. (2006). Simple Algorithm for Sorting the Fibonacci String Rotations. In: Wiedermann, J., Tel, G., Pokorný, J., Bieliková, M., Štuller, J. (eds) SOFSEM 2006: Theory and Practice of Computer Science. SOFSEM 2006. Lecture Notes in Computer Science, vol 3831. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11611257_19
Download citation
DOI: https://doi.org/10.1007/11611257_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31198-0
Online ISBN: 978-3-540-32217-7
eBook Packages: Computer ScienceComputer Science (R0)