Fast and practical approximate string matching
type: Item
instance of: scholarly article
title: Fast and practical approximate string matching
zbMATH Open document ID: 1046.68514
DOI: 10.1016/0020-0190(96)00083-X
author: Ricardo Baeza-Yates
author: Chris H. Perleberg
published in: Information Processing Letters
publication date: 2003-06-24T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68T10
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 1835237
MaRDI profile type: Publication
cites work: Generalized String Matching
cites work: Efficient string matching
cites work: Fast string matching with mismatches
cites work: Faster approximate string matching
cites work: Fast two-dimensional pattern matching
cites work: Q4194497
cites work: Q4055156
cites work: Q3747742
cites work: An Improved Algorithm For Approximate String Matching
cites work: Q4692507
cites work: Simple and efficient string matching with k mismatches
cites work: On saving space in parallel computation
cites work: Fast Pattern Matching in Strings
cites work: Efficient string matching with k mismatches
cites work: Fast string matching with k differences
cites work: An \(O(ND)\) difference algorithm and its variations
cites work: Augmenting the aho-corasick pattern matching machine
cites work: Boyer-Moore approach to approximate string matching
cites work: Finding approximate patterns in strings
cites work: Approximate string matching with suffix automata
cites work: A subquadratic algorithm for approximate limited expression matching
full work available at URL: 0020-0190(96)00083-x
OpenAlex ID: W1987426253
description: scientific article; zbMATH DE number 1835237