Parallel string matching with k mismatches
type: Item
instance of: scholarly article
title: Parallel string matching with k mismatches
zbMATH Open document ID: 0636.68084
DOI: 10.1016/0304-3975(87)90042-9
author: R. Giancarlo
author: Zvi Galil
published in: Theoretical Computer Science
publication date: 1987-01-01T00:00:00Z
review text: Two improved algorithms for string matching with k mismatches are presented. One algorithm is based on fast integer multiplication algorithms whereas the other follows more closely classic string-matching techniques.
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68T10
zbMATH DE Number: 4037237
zbMATH Keywords: pattern recognition
zbMATH Keywords: algorithms for string matching
MaRDI profile type: Publication
full work available at URL: 0304-3975(87)90042-9
OpenAlex ID: W1965815538
cites work: Q4055156
cites work: Q3747742
cites work: An Efficient General-Purpose Parallel Computer
cites work: Fast Algorithms for Finding Nearest Common Ancestors
cites work: Efficient string matching with k mismatches
cites work: A Space-Economical Suffix Tree Construction Algorithm
description: scientific article; zbMATH DE number 4037237