Universal Data Compression Based on the Burrows-Wheeler Transformation: Theory and Practice
IEEE Transactions on Computers
Word-based block-sorting text compression
ACSC '01 Proceedings of the 24th Australasian conference on Computer science
A Method for Compressing Test Data Based on Burrows-Wheeler Transformation
IEEE Transactions on Computers
Searching large text collections
Handbook of massive data sets
On the Performance of BWT Sorting Algorithms
DCC '00 Proceedings of the Conference on Data Compression
Computing all repeats using suffix arrays
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the 13th Australasian workshop on combinatorial algorithms
Word-based text compression using the Burrows-Wheeler transform
Information Processing and Management: an International Journal
Detecting higher-level similarity patterns in programs
Proceedings of the 10th European software engineering conference held jointly with 13th ACM SIGSOFT international symposium on Foundations of software engineering
Lossless and Near-Lossless Compression of Ecg Signals with Block-Sorting Techniques
International Journal of High Performance Computing Applications
A taxonomy of suffix array construction algorithms
ACM Computing Surveys (CSUR)
An efficient, versatile approach to suffix sorting
Journal of Experimental Algorithmics (JEA)
Efficient Algorithms for the Inverse Sort Transform
IEEE Transactions on Computers
Theoretical Computer Science
New Frontiers in Applied Data Mining
Word-based text compression using the Burrows-Wheeler transform
Information Processing and Management: an International Journal
On the possible patterns of inputs for block sorting in the Burrows-Wheeler transformation
Information Processing Letters
A fast suffix-sorting algorithm
General Theory of Information Transfer and Combinatorics
Practical linear-time O(1)-workspace suffix sorting for constant alphabets
ACM Transactions on Information Systems (TOIS)
| Hi-index | 0.01 |