Approximate string matching on Ziv--Lempel compressed text
type: Item
instance of: scholarly article
title: Approximate string matching on Ziv--Lempel compressed text
zbMATH Open document ID: 1100.68127
DOI: 10.1016/S1570-8667(03)00032-7
author: Juha Kärkkäinen
author: Gonzalo Navarro
author: Esko Ukkonen
published in: Journal of Discrete Algorithms
publication date: 2004-08-06T00:00:00Z
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 68P30
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 2082307
zbMATH Keywords: Ziv--Lempel compression
zbMATH Keywords: Collage systems
zbMATH Keywords: Edit distance
zbMATH Keywords: Dynamic programming
zbMATH Keywords: Compressed pattern matching
MaRDI profile type: Publication
cites work: Let sleeping files lie: Pattern matching in Z-compressed files.
cites work: Q4347080
cites work: Faster approximate string matching
cites work: Q4849531
cites work: String matching in Lempel-Ziv compressed strings
cites work: An Improved Algorithm For Approximate String Matching
cites work: A Method for the Construction of Minimum-Redundancy Codes
cites work: Q2723951
cites work: Q3024794
cites work: A fast bit-vector algorithm for approximate string matching based on dynamic programming
cites work: Q3024795
cites work: Q2723949
cites work: The theory and computation of evolutionary distances: Pattern recognition
cites work: Q2723950
cites work: Applications of Path Compression on Balanced Trees
cites work: Finding approximate patterns in strings
cites work: A universal algorithm for sequential data compression
cites work: Compression of individual sequences via variable-rate coding
description: scientific article; zbMATH DE number 2082307