Matching for run-length encoded strings
type: Item
instance of: scholarly article
title: Matching for run-length encoded strings
zbMATH Open document ID: 0921.68041
author: Gad M. Landau
author: Alberto Apostolico
author: Steven Skiena
published in: Journal of Complexity
publication date: 1999-05-11T00:00:00Z
full work available at URL: https://docs.lib.purdue.edu/cgi/viewcontent.cgi
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 1286772
zbMATH Keywords: pattern matching
MaRDI profile type: Publication
OpenAlex ID: W1968328322
cites work: Bounds on the Complexity of the Longest Common Subsequence Problem
cites work: An improved algorithm for computing the edit distance of run-length coded strings
cites work: An information-theoretic lower bound for the longest common subsequence problem
cites work: A linear space algorithm for computing maximal common subsequences
cites work: The set-set LCS problem
cites work: A faster algorithm computing string edit distances
cites work: On the Set LCS and Set-Set LCS Problems
DOI: 10.1006/JCOM.1998.0493
description: scientific article; zbMATH DE number 1286772