Modifications in Burrows-Wheeler Compression Algorithm

Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F01%3A00001044" target="_blank" >RIV/61989100:27240/01:00001044 - isvavai.cz</a>
Výsledek na webu
—
DOI - Digital Object Identifier
—

Jazyk výsledku
angličtina
Název v původním jazyce
Modifications in Burrows-Wheeler Compression Algorithm
Popis výsledku v původním jazyce
In 1994 Burrows and Wheeler presented a new algorithm for loss less data compression. The compression ratio that can be achieved using their algorithm is comparable with the best known algorithms, whilst its complexity is relatively small. In this paperwe explain the internals of this algorithm and its word-based version. Word-based version is useful for fulltext systems for storing of textual databases. Experimental results are also presented.
Název v anglickém jazyce
Modifications in Burrows-Wheeler Compression Algorithm
Popis výsledku anglicky
In 1994 Burrows and Wheeler presented a new algorithm for loss less data compression. The compression ratio that can be achieved using their algorithm is comparable with the best known algorithms, whilst its complexity is relatively small. In this paperwe explain the internals of this algorithm and its word-based version. Word-based version is useful for fulltext systems for storing of textual databases. Experimental results are also presented.

Rok uplatnění
2001
Kód důvěrnosti údajů
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Podobné výsledky(10)