Beating $\mathcal{O}(nm)$ in Approximate LZW-Compressed Pattern Matching

DOI10.1007/978-3-642-45030-3_8zbMath1329.68313arXiv1308.6509OpenAlexW2592880556MaRDI QIDQ2872073

Paweł Gawrychowski, Damian Straszak

Publication date: 14 January 2014

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1308.6509

zbMATH Keywords

Lempel-Zivedit distanceapproximate pattern matching

Mathematics Subject Classification ID

Approximation algorithms (68W25) Algorithms on strings (68W32)

Related Items (2)

Circular pattern matching with \(k\) mismatches ⋮ Approximate pattern matching in LZ77-compressed texts

This page was built for publication: Beating $\mathcal{O}(nm)$ in Approximate LZW-Compressed Pattern Matching