A note on the Burrows-Wheeler transformation
نویسندگان
چکیده
We relate the Burrows-Wheeler transformation with a result in combinatorics on words known as the Gessel-Reutenauer transformation.
منابع مشابه
A note on Sturmian words
We describe an algorithm which, given a factor of a Sturmian word, computes the next factor of the same length in the lexicographic order in linear time. It is based on a combinatorial property of Sturmian words which is related with the Burrows-Wheeler transformation.
متن کاملUniversal Data Compression Based on the Burrows-Wheeler Transformation: Theory and Practice
ÐA very interesting recent development in data compression is the Burrows-Wheeler Transformation [1]. The idea is to permute the input sequence in such a way that characters with a similar context are grouped together. We provide a thorough analysis of the Burrows-Wheeler Transformation from an information theoretic point of view. Based on this analysis, the main part of the paper systematicall...
متن کاملVerlustlose Datenkompression auf Grundlage der Burrows-Wheeler-Transformation
Die verlustfreie Datenkompression auf Grundlage der Burrows-Wheeler-Transformation ist in den letzten Jahren aufgrund Ihrer Effizienz und bemerkenswerten Eleganz auf ein großes Interesse gestoßen. Selbst einfache Implementierungen erreichen Geschwindigkeiten und Kompressionsraten von bekannten kommerziellen Pr ogrammen. Die Burrows-Wheeler-Transformation basiert auf einer Permutation von Eingab...
متن کاملHigh-performance BWT-based Encoders
In 1994, Burrows and Wheeler [5] developed a data compression algorithm which performs significantly better than Lempel-Ziv based algorithms. Since then, a lot of work has been done in order to improve their algorithm, which is based on a reversible transformation of the input string, called BWT (the Burrows-Wheeler transformation). In this paper, we propose a compression scheme based on BWT, M...
متن کاملLossless Compression of Ecg Signals
In this paper we study the compression techniques for electrocardiogram (ECG) signals based on Block Sorting Techniques. We introduce a new and faster block transformation than the Burrows and Wheeler Transformation (BWT), and later compare them for ECG data compression. We show that our algorithm yields better compression gain than the Burrows and Wheeler’s algorithm (BWA), Gzip and the Shorte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/cs/0502073 شماره
صفحات -
تاریخ انتشار 2005