The modification of the lexicographic data-string sorting algorithm

摘要

A modified version of the algorithm known as the Burrows-Wheeler Transformation based on the standard lexicographic data string sorting and determination of the sequence of the strings without the sorting of the strings themselves is proposed. Proposed version of the algorithm allows the compression of data at faster rates than the original ones without any loss of compression ratio.