The Burrows-Wheeler Transform: Theory and Practice-Reference-Cited by-同舟云学术

The Burrows-Wheeler Transform: Theory and Practice

Published:1999 Issue: Volume: Page:34-47
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Manzini Giovanni

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-48340-3_4

Reference39 articles.

1. A. Andersson and S. Nilsson. Efficient implementation of suffix trees. Software — Practice and Experience, 25(2):129–141, 1995.

2. R. Arnold and T. Bell. The Canterbury corpus home page, http://corpus.canterbury.ac.nz .

3. S. Kurtz B. Balkenhol. Universal data compression based on the burrows and wheeler transformation: Theory and practice. Technical Report 98-069, Universitat Bielefeld, 1998. http://www.mathematik.uni-bielefeld.de/sfb343/preprints/ .

4. Y. M. Shtarkov B. Balkenhol, S. Kurtz. Modification of the burrows and wheeler data compression algorithm. In DCC: Data Compression Conference. IEEE Computer Society TCC, 1999.

5. J. Bentley and R. Sedgewick. Fast algorithms for sorting and searching strings. In Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 360–369, New Orleans, Louisiana, 1997.

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Co-lexicographically Ordering Automata and Regular Languages - Part I;Journal of the ACM;2023-08-12

2. Complexity Evaluation of Feature Models and Meta-Programs;Advanced Information and Knowledge Processing;2012-06-07

3. Bidirectional Search in a String with Wavelet Trees;Combinatorial Pattern Matching;2010

4. A New Combinatorial Approach to Sequence Comparison;Theory of Computing Systems;2007-10-30

5. The Effects of XML Compression on SOAP Performance;World Wide Web;2007-07-26