String matching in Lempel-Ziv compressed strings

DOI10.1007/PL00009202zbMath0899.68046OpenAlexW2019724649WikidataQ59831029 ScholiaQ59831029MaRDI QIDQ1386349

Mikkel Thorup, Martin Farach

Publication date: 24 May 1998

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00009202

zbMATH Keywords

compressionstring matching

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (15)

Fingerprints in compressed strings ⋮ Time-space trade-offs for Lempel-Ziv compressed indexing ⋮ Efficient retrieval of approximate palindromes in a run-length encoded string ⋮ A FULLY COMPRESSED PATTERN MATCHING ALGORITHM FOR SIMPLE COLLAGE SYSTEMS ⋮ Efficient on-line repetition detection ⋮ An experimental study of a compressed index ⋮ Direct merging of delta encoded files ⋮ THE INCLUSION PROBLEM OF CONTEXT-FREE LANGUAGES: SOME TRACTABLE CASES ⋮ The Inclusion Problem of Context-Free Languages: Some Tractable Cases ⋮ One-Dimensional Staged Self-assembly ⋮ Regular expression searching on compressed text ⋮ Approximate string matching on Ziv--Lempel compressed text ⋮ Bicriteria Data Compression ⋮ Orthogonal Range Searching for Text Indexing ⋮ One-dimensional staged self-assembly

This page was built for publication: String matching in Lempel-Ziv compressed strings