Balanced Words Having Simple Burrows-Wheeler Transform
Authors:
- 1 January 2009
- book chapter
- Published by Springer Nature
- p. 431-442
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Palindromic richnessEuropean Journal of Combinatorics, 2009
- A connection between palindromic and factor complexity using return wordsAdvances in Applied Mathematics, 2009
- Episturmian morphisms and a Galois theorem on continued fractionsRAIRO - Theoretical Informatics and Applications, 2005
- Characterisations of balanced words via orderingsTheoretical Computer Science, 2004
- Algebraic Combinatorics on Words2002
- Episturmian words and episturmian morphismsTheoretical Computer Science, 2002
- Episturmian words and some constructions of de Luca and RauzyTheoretical Computer Science, 2001
- Balanced sequences and optimal routingJournal of the ACM, 2000
- Sturmian words: structure, combinatorics, and their arithmeticsTheoretical Computer Science, 1997
- Complementing and exactly covering sequencesJournal of Combinatorial Theory, Series A, 1973