Paper Info
Title
Words with simple Burrows-Wheeler Transforms
Abstract
Mantaci et al have shown that if a word x on the alphabet {a, b} has a Burrows Wheeler Transform of the form b(i)a(j) then x is a conjugate or a power of a conjugate of a standard word. We give an alternative proof of this result and describe words on the alphabet {a, b, c} whose transforms have the form c(i)b(j)a(k). These words have some common properties with standard words. We also present some results about words on larger alphabets having similar properties.
Year
Venue
Keywords
2008
ELECTRONIC JOURNAL OF COMBINATORICS
data compression,burrows wheeler transform
Field
DocType
Volume
Discrete mathematics,Combinatorics,Burrows–Wheeler transform,Of the form,Data compression,Combinatorics on words,Mathematics,Alphabet
Journal
15.0
Issue
ISSN
Citations 
1.0
1077-8926
7
PageRank 
References 
Authors
0.63
2
2
Name
Order
Citations
PageRank
Jamie Simpson116421.41
Simon J. Puglisi2113275.14