Words with simple Burrows-Wheeler transforms

zbMATH Open1183.68446MaRDI QIDQ1010806FDOQ1010806

Jamie Simpson, Simon J. Puglisi

Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/117257

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorics on words (68R15)

Cited In (16)

• On arithmetically progressed suffix arrays and related Burrows-Wheeler transforms
• Balancing and clustering of words in the Burrows-Wheeler transform
• Order Conditions for Languages
• Arithmetics on Suffix Arrays of Fibonacci Words
• When a dollar makes a BWT
• Two Combinatorial Criteria for BWT Images
• Perfectly clustering words are primitive positive elements of the free group
• Burrows-Wheeler transform and palindromic richness
• Clustering and Arnoux-Rauzy words
• The simplest binary word with only three squares
• Logarithmic equal-letter runs for BWT of purely morphic words
• Measuring the clustering effect of BWT via RLE
• Perfect balance and circularly rich words
• The Burrows-Wheeler Transform between Data Compression and Combinatorics on Words
• The alternating BWT: an algorithmic perspective
• Balanced Words Having Simple Burrows-Wheeler Transform

This page was built for publication: Words with simple Burrows-Wheeler transforms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010806)