2013 World Congress on Nature and Biologically Inspired Computing 2013
DOI: 10.1109/nabic.2013.6617861
|View full text |Cite
|
Sign up to set email alerts
|

Improving block sorting compression using Simulated Annealing

Abstract: Data compression becomes a common technique with large data processing these days. Burrows-Wheeler trans formation 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 … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 23 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?