An algorithm for matching run-length coded strings
type: Item
instance of: scholarly article
title: An algorithm for matching run-length coded strings
zbMATH Open document ID: 0780.94004
DOI: 10.1007/BF02243873
author: Horst Bunke
author: János Csirik
published in: Computing
publication date: 1993-12-20T00:00:00Z
Mathematics Subject Classification ID: 94A45
Mathematics Subject Classification ID: 68W10
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 425526
zbMATH Keywords: string matching
zbMATH Keywords: longest common subsequence
zbMATH Keywords: run-length coded strings
zbMATH Keywords: time complexity
MaRDI profile type: Publication
cites work: Q4509227
cites work: The String-to-String Correction Problem
cites work: A fast algorithm for computing longest common subsequences
cites work: An \(O(ND)\) difference algorithm and its variations
cites work: Algorithms for approximate string matching
cites work: A faster algorithm computing string edit distances
cites work: Q4385510
full work available at URL: https://doi.org/10.1007/bf02243873
OpenAlex ID: W14091147
description: scientific article; zbMATH DE number 425526