A new class of string transformations for compressed text indexing

Introduced about thirty years ago in the field of data compression, the Burrows-Wheeler Transform (BWT) is a string transformation that, besides being a booster of the performance of memoryless compressors, plays a fundamental role in the design of efficient self-indexing compressed data structures....

Full description

Bibliographic Details

Published in:	Information and computation Vol. 294; p. 105068
Main Authors:	Giancarlo, Raffaele, Manzini, Giovanni, Restivo, Antonio, Rosone, Giovanna, Sciortino, Marinella
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.10.2023
Subjects:	Burrows-Wheeler transformation Combinatorics on words Data indexing and compression Data indexing and compression Burrows-Wheeler transformation Combinatorics on words
ISSN:	0890-5401
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!