A fully compressed algorithm for computing the edit distance of run-length encoded strings
type: Item
instance of: scholarly article
title: A fully compressed algorithm for computing the edit distance of run-length encoded strings
zbMATH Open document ID: 1259.68047
author: Kuan-Yu Chen
author: Kun-Mao Chao
published in: Algorithmica
publication date: 2013-03-05T00:00:00Z
Mathematics Subject Classification ID: 68P30
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 6141205
zbMATH Keywords: compressed pattern matching
zbMATH Keywords: edit distance
zbMATH Keywords: run length
MaRDI profile type: Publication
full work available at URL: s00453-011-9592-4
OpenAlex ID: W2897696602
cites work: Inplace run-length 2d compressed search.
cites work: Let sleeping files lie: Pattern matching in Z-compressed files.
cites work: Matching for run-length encoded strings
cites work: Edit distance of run-length encoded strings.
cites work: An improved algorithm for computing the edit distance of run-length coded strings
cites work: Hardness of comparing two run-length encoded strings
cites work: A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices
cites work: Q5390005
cites work: A linear space algorithm for computing maximal common subsequences
cites work: Sequence Alignment Algorithms for Run-Length-Encoded Strings
cites work: Q4347161
cites work: Edit distance for a run-length-encoded string and an uncompressed string
cites work: A faster algorithm computing string edit distances
cites work: Approximate matching of run-length compressed strings
cites work: All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings
cites work: Finding approximate patterns in strings
cites work: The String-to-String Correction Problem
DOI: 10.1007/S00453-011-9592-4
description: scientific article; zbMATH DE number 6141205