Fast string matching with k differences
type: Item
instance of: scholarly article
title: Fast string matching with k differences
zbMATH Open document ID: 0655.68075
DOI: 10.1016/0022-0000(88)90045-1
author: Gad M. Landau
author: Uzi Vishkin
published in: Journal of Computer and System Sciences
publication date: 1988-01-01T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 4070341
zbMATH Keywords: string matching
Wikidata QID: Q56813211
MaRDI profile type: Publication
full work available at URL: 0022-0000(88)90045-1
OpenAlex ID: W2074707165
cites work: Q4773298
cites work: A fast string searching algorithm
cites work: Q3690247
cites work: Optimal parallel algorithms for string matching
cites work: Q3746902
cites work: Time-space-optimal string matching
cites work: Fast Algorithms for Finding Nearest Common Ancestors
cites work: RECOGNITION OF AN APPROXIMATE OCCURRENCE OF WORDS ON A TURING MACHINE IN REAL TIME
cites work: Fast Pattern Matching in Strings
cites work: Efficient randomized pattern-matching algorithms
cites work: Efficient string matching with k mismatches
cites work: Q4509227
cites work: Q3315039
cites work: Finding approximate patterns in strings
cites work: Optimal parallel pattern matching in strings
DBLP publication ID: journals/jcss/LandauV88
Recommended article: Efficient string matching with k mismatches
Recommended article: Simple and efficient string matching with k mismatches
Recommended article: Fast string matching with mismatches
Recommended article: Q4952702
Recommended article: Faster algorithms for string matching with k mismatches
Recommended article: Fast and practical approximate string matching
Recommended article: Fast exact string matching algorithms
Recommended article: Faster approximate string matching
Recommended article: Very fast and simple approximate string matching
Recommended article: Fast index for approximate string matching
description: scientific article; zbMATH DE number 4070341