String matching in Lempel-Ziv compressed strings
From MaRDI portal
Publication:1386349
DOI10.1007/PL00009202zbMath0899.68046WikidataQ59831029 ScholiaQ59831029MaRDI QIDQ1386349
Publication date: 24 May 1998
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00009202
68W10: Parallel algorithms in computer science
Related Items
Bicriteria Data Compression, A FULLY COMPRESSED PATTERN MATCHING ALGORITHM FOR SIMPLE COLLAGE SYSTEMS, An experimental study of a compressed index, One-dimensional staged self-assembly, Efficient retrieval of approximate palindromes in a run-length encoded string, Efficient on-line repetition detection, Time-space trade-offs for Lempel-Ziv compressed indexing, Regular expression searching on compressed text, Approximate string matching on Ziv--Lempel compressed text, Direct merging of delta encoded files, Fingerprints in compressed strings, Orthogonal Range Searching for Text Indexing, THE INCLUSION PROBLEM OF CONTEXT-FREE LANGUAGES: SOME TRACTABLE CASES, One-Dimensional Staged Self-assembly, The Inclusion Problem of Context-Free Languages: Some Tractable Cases