Two combinatorial criteria for BWT images

Authors:
Konstantin M. Likhomanov;Arseny M. Shur
Affiliations:
Ural State University;Ural State University
Venue:
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Year:
2011

Citing 5
Cited 0

An analysis of the Burrows—Wheeler transform

Journal of the ACM (JACM)
Burrows--Wheeler transform and Sturmian words

Information Processing Letters
A note on the Burrows-Wheeler transformation

Theoretical Computer Science
Foreword

Theoretical Computer Science
Balanced Words Having Simple Burrows-Wheeler Transform

DLT '09 Proceedings of the 13th International Conference on Developments in Language Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Burrows-Wheeler transform (BWT) is a block data transformation, i. e. a function on finite words. This function is used in lossless data compression algorithms and possesses interesting combinatorial properties. We study some of these properties. Namely, we prove two necessary and sufficient conditions concerning BWT images. The first one describes the words that are BWT images, while the second one explains which words can be converted to BWT images using a natural "pumping" procedure. Both conditions can be checked in linear time.