String matching with weighted errors
type: Item
instance of: scholarly article
title: String matching with weighted errors
zbMATH Open document ID: 0694.68022
DOI: 10.1016/0304-3975(90)90182-H
author: Alan A. Bertossi
author: Fabrizio Luccio
author: Elena Lodi
author: L. Pagli
published in: Theoretical Computer Science
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 68W99
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 4137312
zbMATH Keywords: approximate string matching problem
zbMATH Keywords: parallel algorithms
zbMATH Keywords: PRAM
MaRDI profile type: Publication
cites work: The Boyer–Moore–Galil String Searching Strategies Revisited
cites work: Data structures and algorithms for approximate string matching
cites work: Time-space-optimal string matching
cites work: Fast Algorithms for Finding Nearest Common Ancestors
cites work: Fast Pattern Matching in Strings
cites work: Fast string matching with k differences
cites work: A Space-Economical Suffix Tree Construction Algorithm
cites work: A faster algorithm computing string edit distances
cites work: Recognition of Noisy Subsequences Using Constrained Edit Distances
cites work: Q3315039
cites work: Finding approximate patterns in strings
cites work: Algorithms for approximate string matching
description: scientific article; zbMATH DE number 4137312