\(k\)-difference matching in amortized linear time for all the words in a text
type: Item
instance of: scholarly article
title: \(k\)-difference matching in amortized linear time for all the words in a text
zbMATH Open document ID: 1162.68040
author: Cinzia Pizzi
published in: Theoretical Computer Science
publication date: 2009-03-17T00:00:00Z
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5529527
zbMATH Keywords: string-matching problem
zbMATH Keywords: words with mismatches
MaRDI profile type: Publication
full work available at URL: j.tcs.2008.12.018
OpenAlex ID: W2079718285
cites work: Generalized String Matching
cites work: Motif discovery by monotone scores
cites work: Faster algorithms for string matching with k mismatches
cites work: Combinatorial Pattern Matching
cites work: Dictionary matching and indexing with errors and don't cares
cites work: Algorithms on Strings, Trees and Sequences
cites work: Efficient string matching with k mismatches
DOI: 10.1016/J.TCS.2008.12.018
description: scientific article; zbMATH DE number 5529527