String matching with weighted errors

DOI10.1016/0304-3975(90)90182-HzbMath0694.68022MaRDI QIDQ909451

Fabrizio Luccio, Alan A. Bertossi, Elena Lodi, Linda Pagli

Publication date: 1990

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

parallel algorithmsPRAMapproximate string matching problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cites Work

• Unnamed Item
• Data structures and algorithms for approximate string matching
• Fast string matching with k differences
• A faster algorithm computing string edit distances
• Time-space-optimal string matching
• Fast Algorithms for Finding Nearest Common Ancestors
• Finding approximate patterns in strings
• Algorithms for approximate string matching
• The Boyer–Moore–Galil String Searching Strategies Revisited
• Recognition of Noisy Subsequences Using Constrained Edit Distances
• A Space-Economical Suffix Tree Construction Algorithm
• Fast Pattern Matching in Strings

This page was built for publication: String matching with weighted errors