Arithmetics on Suffix Arrays of Fibonacci Words

DOI10.1007/978-3-319-23660-5_12zbMath1333.68221OpenAlexW2222762190MaRDI QIDQ3449364

Dominik Köppl, Tomohiro I.

Publication date: 4 November 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-23660-5_12

zbMATH Keywords

Burrows-Wheeler transformsuffix arrayFibonacci word

Mathematics Subject Classification ID

Combinatorics on words (68R15) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Cites Work

• Unnamed Item
• Unnamed Item
• The structure of subword graphs and suffix trees of Fibonacci words
• Burrows-Wheeler transform and Sturmian words
• Words with simple Burrows-Wheeler transforms
• A combinatorial property of the Fibonacci words
• Palindromes in the Fibonacci word
• Fibonacci numbers and words
• A characterization of the squares in a Fibonacci string
• Compressed suffix trees with full functionality
• Fast BWT in small space by blockwise suffix sorting
• Entropy of the symbolic sequence for critical circle maps
• Indexing compressed text
• A universal algorithm for sequential data compression
• LZ77-Based Self-indexing with Faster Pattern Matching
• COMBINATORIAL PROPERTIES OF STURMIAN PALINDROMES
• Crochemore Factorization of Sturmian and Other Infinite Words
• SOFSEM 2006: Theory and Practice of Computer Science
• Some properties of the singular words of the Fibonacci word

This page was built for publication: Arithmetics on Suffix Arrays of Fibonacci Words