Burrows-Wheeler transform and palindromic richness

Authors:
Antonio Restivo;Giovanna Rosone
Affiliations:
University of Palermo, Dipartimento di Matematica ed Applicazioni, Via Archirafi 34, 90123 Palermo, Italy;University of Palermo, Dipartimento di Matematica ed Applicazioni, Via Archirafi 34, 90123 Palermo, Italy
Venue:
Theoretical Computer Science
Year:
2009

Citing 5
Cited 5

Combinatorics of words

Handbook of formal languages, vol. 1
Episturmian words and some constructions of de Luca and Rauzy

Theoretical Computer Science
Burrows--Wheeler transform and Sturmian words

Information Processing Letters
Palindromic richness

European Journal of Combinatorics
A new characteristic property of rich words

Theoretical Computer Science

Counting distinct palindromes in a word in linear time

Information Processing Letters
Balancing and clustering of words in the Burrows-Wheeler transform

Theoretical Computer Science
Palindrome pattern matching

CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Palindrome pattern matching

Theoretical Computer Science
Palindromic richness for languages invariant under more symmetries

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

The investigation of the extremal case of the Burrows-Wheeler transform leads to study the words w over an ordered alphabet A={a"1,a"2,...,a"k}, with a"1