An algorithm for matching run-length coded strings

DOI10.1007/BF02243873zbMath0780.94004OpenAlexW14091147MaRDI QIDQ685867

Horst Bunke, János A. Csirik

Publication date: 20 December 1993

Published in: Computing (Search for Journal in Brave)

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

zbMATH Keywords

time complexitystring matchinglongest common subsequencerun-length coded strings

Mathematics Subject Classification ID

Dynamic programming (90C39) Parallel algorithms in computer science (68W10) Prefix, length-variable, comma-free codes (94A45)

Related Items (5)

A fast algorithm for stereo matching ⋮ A GENERALIZED MAPPING OF 2-D ARRAY PROCESSOR TO LINEAR ARRAY PROCESSOR AND ITS APPLICATIONS ⋮ An improved algorithm for solving the banded cyclic string-to-string correction problem ⋮ An improved algorithm for computing the edit distance of run-length coded strings ⋮ Unnamed Item

Cites Work

• An \(O(ND)\) difference algorithm and its variations
• A faster algorithm computing string edit distances
• Algorithms for approximate string matching
• A fast algorithm for computing longest common subsequences
• The String-to-String Correction Problem
• Unnamed Item
• Unnamed Item

This page was built for publication: An algorithm for matching run-length coded strings