On the complexity of finding common approximate substrings.
type: Item
instance of: scholarly article
title: On the complexity of finding common approximate substrings.
zbMATH Open document ID: 1060.68048
DOI: 10.1016/S0304-3975(03)00320-7
author: Patricia A. Evans
author: Andrew D. Smith
author: H. Todd Wareham
published in: Theoretical Computer Science
publication date: 2004-03-14T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 2056808
zbMATH Keywords: Parameterized complexity
zbMATH Keywords: Pattern matching
zbMATH Keywords: Common approximate substring
Wikidata QID: Q106509296
MaRDI profile type: Publication
cites work: The parameterized complexity of sequence alignment and consensus
cites work: Q4393480
cites work: Q4736845
cites work: On covering problems of codes
cites work: Q4198056
cites work: Q4474112
cites work: On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
cites work: Q4252342
cites work: Finding similar regions in many strings
cites work: Q2723943
cites work: The Complexity of Some Problems on Subsequences and Supersequences
cites work: Pattern recognition in several sequences: Consensus and alignment
full work available at URL: s0304-3975(03)00320-7
OpenAlex ID: W2062088872
description: scientific article; zbMATH DE number 2056808