Optimal Partitions of Strings: A New Class of Burrows-Wheeler Compression Algorithms
From MaRDI portal
Publication:3550832
DOI10.1007/3-540-44888-8_10zbMath1279.68367OpenAlexW1515706989MaRDI QIDQ3550832
Marinella Sciortino, Raffaele Giancarlo
Publication date: 6 April 2010
Published in: Combinatorial Pattern Matching (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-44888-8_10
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithms on strings (68W32)
Related Items
The Burrows-Wheeler Transform between Data Compression and Combinatorics on Words, On optimally partitioning a text to improve its compression