On a cyclic string-to-string correction problem
type: Item
instance of: scholarly article
title: On a cyclic string-to-string correction problem
zbMATH Open document ID: 0697.68044
DOI: 10.1016/0020-0190(90)90109-B
author: Maurice Maes
published in: Information Processing Letters
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 4143439
zbMATH Keywords: pattern matching
zbMATH Keywords: analysis of algorithms
zbMATH Keywords: string-to-string correction problem
zbMATH Keywords: cyclic strings
MaRDI profile type: Publication
cites work: The String-to-String Correction Problem
cites work: Optimal matching of deformed patterns with positional influence
cites work: Stochastic Error-Correcting Syntax Analysis for Recognition of Noisy Patterns
cites work: A linear space algorithm for computing maximal common subsequences
full work available at URL: 0020-0190(90)90109-b
OpenAlex ID: W2021202955
Recommended article: An improved algorithm for solving the banded cyclic string-to-string correction problem
Recommended article: Q4321515
Recommended article: The selective fixing algorithm for the closest string problem
Recommended article: Q3197327
Recommended article: A linear time algorithm for shortest cyclic cover of strings
Recommended article: On cyclic strings avoiding a pattern
Recommended article: Q4995289
Recommended article: On the closest string and substring problems
Recommended article: Fixed-parameter algorithms for CLOSEST STRING and related problems
description: scientific article; zbMATH DE number 4143439