Simple and efficient string matching with k mismatches
type: Item
instance of: scholarly article
title: Simple and efficient string matching with k mismatches
zbMATH Open document ID: 0689.68054
DOI: 10.1016/0020-0190(89)90188-9
author: Roberto Grossi
author: Fabrizio Luccio
published in: Information Processing Letters
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W99
zbMATH DE Number: 4130006
zbMATH Keywords: design of algorithms
zbMATH Keywords: approximate string matching
zbMATH Keywords: mismatches
zbMATH Keywords: suffix tree
MaRDI profile type: Publication
full work available at URL: 0020-0190(89)90188-9
OpenAlex ID: W2057097754
cites work: A fast string searching algorithm
cites work: Q3747742
cites work: Data structures and algorithms for approximate string matching
cites work: Q4733401
cites work: Time-space-optimal string matching
cites work: Fast Pattern Matching in Strings
cites work: Fast string matching with k differences
cites work: Fast parallel and serial approximate string matching
description: scientific article; zbMATH DE number 4130006