Searching BWT Compressed Text with the Boyer-Moore Algorithm and Binary Search

@inproceedings{Bell2002SearchingBC,
  title={Searching BWT Compressed Text with the Boyer-Moore Algorithm and Binary Search},
  author={Timothy C. Bell and Matt Powell and Amar Mukherjee and Donald A. Adjeroh},
  booktitle={DCC},
  year={2002}
}
This paper explores two techniques for on-line exact pattern matching in files that have been compressed using the Burrows-Wheeler transform. We investigate two approaches. The first is an application of the Boyer-Moore algorithm (Boyer & Moore 1977) to a transformed string. The second approach is based on the observation that the transform effectively contains a sorted list of all substrings of the original text, which can be exploited for very rapid searching using a variant of binary search… CONTINUE READING
Highly Cited
This paper has 32 citations. REVIEW CITATIONS
23 Citations
14 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 23 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 14 references

Pattern matching in compressed texts and images

  • T. Bell, D. Adjeroh, A. Mukherjee
  • Draft of May
  • 2001

Unifying Text Search and Compression—Suffix Sorting, Block Sorting and Suffix Arrays, PhD thesis, University of Tokyo

  • K. Sadakane
  • 2000
1 Excerpt

Managing Gigabytes, second edn

  • I. H. Witten, A. Moffatt, T. C. Bell
  • 1999
2 Excerpts

Similar Papers

Loading similar papers…