The modification of the lexicographic data-string sorting algorithm

摘要

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