Improving block sorting compression using simulated annealing

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F13%3A86088866" target="_blank" >RIV/61989100:27240/13:86088866 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1109/NaBIC.2013.6617861" target="_blank" >http://dx.doi.org/10.1109/NaBIC.2013.6617861</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/NaBIC.2013.6617861" target="_blank" >10.1109/NaBIC.2013.6617861</a>

Result language
angličtina
Original language name
Improving block sorting compression using simulated annealing
Original language description
Data compression becomes a common technique with large data processing these days. Burrows-Wheeler transformation is one of the last algorithms developed for text compression. This algorithm uses lexicographic sorting of the block of data and produces sequences of sequences of same symbols. These sequences are long, but may be longer when we modify the sorting to group symbols which has the same predecessors. The problem is that the number of possible permutations is huge and cannot be simply searched by the exhaustive search. Therefore, we test Simulated Annealing as a searching algorithm.
Czech name
—
Czech description
—

Project
<a href="/en/project/GPP202%2F11%2FP142" target="_blank" >GPP202/11/P142: Optimization and parallelization of compression methods</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
2013 World Congress on Nature and Biologically Inspired Computing, NaBIC 2013
ISBN
978-1-4799-1415-9
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
194-199
Publisher name
Elsevier
Place of publication
New York
Event location
Fargo
Event date
Aug 12, 2013
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)