Burrows-Wheeler transform and palindromic richness

DOI10.1016/j.tcs.2009.03.008zbMath1173.68055MaRDI QIDQ2271441

Antonio Restivo, Giovanna Rosone

Publication date: 7 August 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.03.008

zbMATH Keywords

Burrows-Wheeler transform; combinatorics on words; palindromes; rich words

Mathematics Subject Classification ID

68R15: Combinatorics on words

Related Items

The repetition threshold for binary rich words, The Burrows-Wheeler Transform between Data Compression and Combinatorics on Words, Perfect balance and circularly rich words, Palindrome pattern matching, Palindromic richness for languages invariant under more symmetries, Extensions of rich words, Counting distinct palindromes in a word in linear time, Balancing and clustering of words in the Burrows-Wheeler transform, Measuring the clustering effect of BWT via RLE, When a dollar makes a BWT, The alternating BWT: an algorithmic perspective, Rich square-free words, Palindrome Pattern Matching, Balanced Words Having Simple Burrows-Wheeler Transform

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Palindromic richness
• Burrows-Wheeler transform and Sturmian words
• Words with simple Burrows-Wheeler transforms
• A new characteristic property of rich words
• A connection between palindromic and factor complexity using return words
• Episturmian words and some constructions of de Luca and Rauzy