Fast searching on compressed text allowing errors
- 1 August 1998
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 298-306
- https://doi.org/10.1145/290941.291013
Abstract
No abstract availableThis publication has 19 references indexed in Scilit:
- A text compression scheme that allows fast searching directly in the compressed fileACM Transactions on Information Systems, 1997
- Let Sleeping Files Lie: Pattern Matching in Z-Compressed FilesJournal of Computer and System Sciences, 1996
- Adding compression to a full‐text retrieval systemSoftware: Practice and Experience, 1995
- Fast text searchingCommunications of the ACM, 1992
- Average running time of the Boyer-Moore-Horspool algorithmTheoretical Computer Science, 1992
- A very fast substring search algorithmCommunications of the ACM, 1990
- A locally adaptive data compression schemeCommunications of the ACM, 1986
- Compression of individual sequences via variable-rate codingIEEE Transactions on Information Theory, 1978
- A universal algorithm for sequential data compressionIEEE Transactions on Information Theory, 1977
- On the Complexity of Finite SequencesIEEE Transactions on Information Theory, 1976