Block sorting-based transformations on words: beyond the magic BWT

DOI10.1007/978-3-319-98654-8_1MaRDI QIDQ1622940zbMATH OpenOpenAlexFDO

Authors R. Giancarlo, Giovanni Manzini, Antonio Restivo, Giovanna Rosone, M. Sciortino

Publication date 22 November 2018

Full work available at URL http://hdl.handle.net/11568/946104

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Combinatorics on words (68R15) Algorithms on strings (68W32)

Recommendations

• The alternating BWT: an algorithmic perspective
• The Burrows-Wheeler transform between data compression and combinatorics on words
• From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization
• scientific article; zbMATH DE number 2051173
• Investigation of block-sorting of multiset permutations

Cited in

(9)

• A survey of string orderings and their application to the Burrows-Wheeler transform
• On the possible patterns of inputs for block sorting in the Burrows-Wheeler transformation
• The alternating BWT: an algorithmic perspective
• From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization
• Binary block order Rouen transform
• Some variations on Lyndon words (invited talk)
• A new class of searchable and provably highly compressible string transformations
• scientific article; zbMATH DE number 7651154 (Why is no real title available?)
• A new class of string transformations for compressed text indexing

This page was built for publication: Block sorting-based transformations on words: beyond the magic BWT

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