A note on the Burrows-Wheeler transformation
type: Item
instance of: scholarly article
title: A note on the Burrows-Wheeler transformation
zbMATH Open document ID: 1070.68126
author: Dominique Perrin
author: Maxime Crochemore
author: Jacques Désarménien
published in: Theoretical Computer Science
publication date: 2005-04-06T00:00:00Z
Mathematics Subject Classification ID: 68R15
Mathematics Subject Classification ID: 68P30
zbMATH DE Number: 2153203
zbMATH Keywords: Text compression
zbMATH Keywords: Combinatorics on words
MaRDI profile type: Publication
full work available at URL: j.tcs.2004.11.014
OpenAlex ID: W2011856243
Wikidata QID: Q61677938
cites work: Mathematical Foundations of Computer Science 2003
cites work: Words over an ordered alphabet and suffix permutations
cites work: Counting permutations with given cycle structure and descent set
cites work: Q4449231
cites work: Linear-Time Construction of Suffix Arrays
cites work: Space Efficient Linear Time Construction of Suffix Arrays
cites work: Q4529547
cites work: Burrows-Wheeler transform and Sturmian words
cites work: An analysis of the Burrows—Wheeler transform
DBLP publication ID: journals/tcs/CrochemoreDP05
DOI: 10.1016/J.TCS.2004.11.014
description: scientific article; zbMATH DE number 2153203