A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings
type: Item
instance of: scholarly article
title: A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings
zbMATH Open document ID: 1191.68818
author: Hsing-Yen Ann
author: Chang-Biau Yang
author: Chiou-Ting Tseng
author: Chiou-Yi Hor
published in: Information Processing Letters
publication date: 2010-06-09T00:00:00Z
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 5719214
zbMATH Keywords: design of algorithms
zbMATH Keywords: longest common subsequence
zbMATH Keywords: run-length encoding
zbMATH Keywords: edit distance
MaRDI profile type: Publication
full work available at URL: j.ipl.2008.07.005
OpenAlex ID: W2111356103
cites work: Matching for run-length encoded strings
cites work: Edit distance of run-length encoded strings.
cites work: Q4508365
cites work: An improved algorithm for computing the edit distance of run-length coded strings
cites work: Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism
cites work: Fast Algorithms for Finding Nearest Common Ancestors
cites work: Algorithms for the Longest Common Subsequence Problem
cites work: A fast algorithm for computing longest common subsequences
cites work: Q5528329
cites work: Edit distance for a run-length-encoded string and an uncompressed string
cites work: Finding a longest common subsequence between a run-length-encoded string and an uncompressed string
cites work: Simple and fast linear space computation of longest common subsequences
cites work: A unifying look at data structures
cites work: The String-to-String Correction Problem
DOI: 10.1016/J.IPL.2008.07.005
Recommended article: Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism
Recommended article: Computing the Longest Common Subsequence of Two Run-Length Encoded Strings
Recommended article: A Fast Longest Common Subsequence Algorithm for Similar Strings
Recommended article: Efficient algorithms for the longest common subsequence in \(k\)-length substrings
Recommended article: A new efficient algorithm for computing the longest common subsequence
Recommended article: A New Efficient Algorithm for Computing the Longest Common Subsequence
Recommended article: Q3051687
Recommended article: Fast algorithms for computing the constrained LCS of run-length encoded strings
Recommended article: Finding a longest common subsequence between a run-length-encoded string and an uncompressed string
Recommended article: A space efficient algorithm for the longest common subsequence in \(k\)-length substrings
description: scientific article; zbMATH DE number 5719214