An improved algorithm for solving the banded cyclic string-to-string correction problem
type: Item
instance of: scholarly article
title: An improved algorithm for solving the banded cyclic string-to-string correction problem
zbMATH Open document ID: 0902.68175
DOI: 10.1016/S0304-3975(97)00280-6
author: S. H. Smith
published in: Theoretical Computer Science
publication date: 1998-08-13T00:00:00Z
Mathematics Subject Classification ID: 68T10
zbMATH DE Number: 1190166
zbMATH Keywords: banded string-to-string correction
zbMATH Keywords: cyclic patterns
zbMATH Keywords: algorithms
MaRDI profile type: Publication
cites work: An algorithm for matching run-length coded strings
cites work: Efficient Huffman decoding
cites work: Q4849531
cites work: On a cyclic string-to-string correction problem
cites work: The String-to-String Correction Problem
full work available at URL: s0304-3975(97)00280-6
OpenAlex ID: W2031708572
Recommended article: On a cyclic string-to-string correction problem
Recommended article: The selective fixing algorithm for the closest string problem
Recommended article: Charge and reduce: A fixed-parameter algorithm for string-to-string correction
Recommended article: Q4733401
Recommended article: An Improved Algorithm For Approximate String Matching
Recommended article: Q4321515
Recommended article: Improved LP-based algorithms for the closest string problem
Recommended article: Q3197327
description: scientific article; zbMATH DE number 1190166