Approximate matching of run-length compressed strings
type: Item
instance of: scholarly article
title: Approximate matching of run-length compressed strings
zbMATH Open document ID: 1045.68059
author: Veli Mäkinen
author: Esko Ukkonen
author: Gonzalo Navarro
published in: Algorithmica
publication date: 2003-08-19T00:00:00Z
Mathematics Subject Classification ID: 68P30
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 1967764
zbMATH Keywords: Compressed pattern matching
zbMATH Keywords: Run-length encoding
zbMATH Keywords: Levenshtein distance
zbMATH Keywords: Longest common subsequence
zbMATH Keywords: Weighted edit distance
MaRDI profile type: Publication
Wikidata QID: Q58054198
full work available at URL: s00453-002-1005-2
OpenAlex ID: W2049170719
DOI: 10.1007/S00453-002-1005-2
Recommended article: Q4547735
Recommended article: Approximate string matching using compressed suffix arrays
Recommended article: Combinatorial Pattern Matching
Recommended article: Approximate string matching with compressed indexes
Recommended article: Compressed Indexes for Approximate String Matching
Recommended article: Compressed indexes for approximate string matching
Recommended article: Approximate string matching on Ziv--Lempel compressed text
Recommended article: Q4549402
Recommended article: Q2723951
Recommended article: Algorithms and Computation
description: scientific article; zbMATH DE number 1967764