Burrows-Wheeler transform and palindromic richness

DOI10.1016/j.tcs.2009.03.008zbMath1173.68055OpenAlexW2017965217MaRDI 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 transformcombinatorics on wordspalindromesrich words

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items

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

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item