scientific article; zbMATH DE number 1862357

DOI<link itemprop=identifier href="https://doi.org/10.1002/1097-024X(20001110)30:13<1465::AID-SPE345>3.0.CO;2-D" /><1465::AID-SPE345>3.0.CO;2-D 10.1002/1097-024X(20001110)30:13<1465::AID-SPE345>3.0.CO;2-DzbMath1060.68595MaRDI QIDQ4791703

Sebastian Deorowicz

Publication date: 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

data compressionlossless compressionBurrows-Wheeler transformblock-sortingCalgary corpusCanterbury corpus

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (4)

Investigation of block-sorting of multiset permutations ⋮ Second step algorithms in the Burrows-Wheeler compression algorithm ⋮ The Vcodex Platform for Data Compression ⋮ Context exhumation after the Burrows-Wheeler transform

Cites Work

• Unnamed Item
• Unnamed Item
• Average case analyses of list update algorithms, with applications to data compression
• On-line construction of suffix trees
• Suffix Arrays: A New Method for On-Line String Searches
• A locally adaptive data compression scheme
• The performance of universal encoding
• A Space-Economical Suffix Tree Construction Algorithm
• The context-tree weighting method: basic properties

This page was built for publication: