Computing similarity of run-length encoded strings with affine gap penalty
type: Item
instance of: scholarly article
title: Computing similarity of run-length encoded strings with affine gap penalty
zbMATH Open document ID: 1142.68069
author: Jin Wook Kim
author: Amihood Amir
author: Gad M. Landau
author: Kunsoo Park
published in: Theoretical Computer Science
publication date: 2008-07-10T00:00:00Z
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 5299460
zbMATH Keywords: run-length encoding
zbMATH Keywords: affine gap penalty
zbMATH Keywords: similarity
MaRDI profile type: Publication
full work available at URL: j.tcs.2008.01.008
OpenAlex ID: W2042476538
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: A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices
cites work: Algorithms on Strings, Trees and Sequences
cites work: A time-efficient, linar-space local similarity algorithm
cites work: An efficient alignment algorithm for masked sequences
cites work: Q4547735
cites work: Approximate matching of run-length compressed strings
cites work: Some biological sequence metrics
DOI: 10.1016/J.TCS.2008.01.008
description: scientific article; zbMATH DE number 5299460