Searching BWT compressed text with the Boyer-Moore algorithm and binary search

Data Compression Conference Proceedings

Volumn 2002-January, Issue , 2002, Pages 112-121

  Bell, T ^a   Powell, M ^a   Mukherjee, A ^b   Adjeroh, D ^c  

^a UNIVERSITY OF CANTERBURY   (New Zealand)

^b UNIVERSITY OF CENTRAL FLORIDA   (United States)

^c West Virginia University   (United States)

Author keywords

Computer science; Data compression; Encoding; Image coding; Pattern matching; USA Councils

Indexed keywords

ALGORITHMS; BINS; COMPUTER SCIENCE; ENCODING (SYMBOLS); IMAGE CODING; IMAGE MATCHING; PATTERN MATCHING;

BINARY SEARCH; BOYER-MOORE ALGORITHMS; BURROWS WHEELER TRANSFORM; EXACT-PATTERN MATCHING; SUB-STRINGS; USA COUNCILS;

DATA COMPRESSION;

EID: 84948415150     PISSN: 10680314     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DCC.2002.999949     Document Type: Conference Paper

References (14)

1. Bell, T., Adjeroh, D. & Mukherjee, A. (2001), Pattern matching in compressed texts and images. Draft of May 23, 2001 (Submitted to ACM Computing Surveys).
2. Bentley, J. L., Sleator, D. D., Tarjan, R. E. & Wei, V. K. (1986), 'A locally adaptive data compression scheme', Communications of the ACM 29(4), 320-330.
3. Boyer, R. S. & Moore, J. S. (1977), 'A fast string searching algorithm', Communications of the ACM 20(10), 762-772.
4. Bratley, P. & Choueka, Y. (1982), 'Processing truncated terms in document retrieval systems', Information Processing and Management 18(5), 257-266.
5. Burrows, M. & Wheeler, D. (1994), A block-sorting lossless data compression algorithm, Technical report, Digital Equipment Corporation.
6. Fenwick, P. M. (1996), Block sorting text compression - final report, Technical Report 130, Department of Computer Science, The University of Auckland.
7. Ferragina, P. & Manzini, G. (2000), Opportunistic data structures with applications, in 'IEEE Symposium on Foundations of Computer Science'.
8. Ferragina, P. & Manzini, G. (2001), An experimental study of a compressed index. Part of this work appeared in ACM-SIAM Symposium on Discrete Algorithms.
9. Knuth, D. E., Morris, Jr, J. H. & Pratt, V. R. (1977), 'Fast pattern matching in strings', SIAM Journal of Computing 6(1), 323-350.
10. Sadakane, K. (2000), Unifying Text Search and Compression - Suffix Sorting, Block Sorting and Suffix Arrays, PhD thesis, University of Tokyo.
11. Sadakane, K. & Imai, H. (1999), A cooperative distributed text database management method unifying search and compression based on the Burrows-Wheeler transformation, in 'Advances in Database Technologies', number 1552 in 'Lecture Notes in Computer Science', pp. 434-445.
12. Witten, I. H., Moffatt, A. & Bell, T. C. (1999), Managing Gigabytes, second edn, Morgan Kaufmann.
13. Ziv, J. & Lempel, A. (1977), 'A universal algorithm for sequential data compression', IEE Transactions on Information Theory IT-23(3), 337-343.
14. Ziv, J. & Lempel, A. (1978), 'Compression of individual sequences via variable rate coding', IEE Transactions on Information Theory IT-24(5), 530-536.