Multiple approximate string matching

DOI10.1007/3-540-63307-3_57zbMath1497.68591OpenAlexW1827776656MaRDI QIDQ5096936

Ricardo A. Baeza-Yates, Gonzalo Navarro

Publication date: 19 August 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-63307-3_57

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Online algorithms; streaming algorithms (68W27) Algorithms on strings (68W32)

Related Items (2)

A general compression algorithm that supports fast searching ⋮ Streaming Dictionary Matching with Mismatches

Cites Work

• Unnamed Item
• Unnamed Item
• Sublinear approximate string matching and biological applications
• A sublinear algorithm for approximate keyword searching
• A subquadratic algorithm for approximate limited expression matching
• An Improved Algorithm For Approximate String Matching
• Finding approximate patterns in strings
• Algorithms for approximate string matching
• The theory and computation of evolutionary distances: Pattern recognition
• Efficient string matching
• Fast parallel and serial approximate string matching
• Approximate string matching using withinword parallelism

This page was built for publication: Multiple approximate string matching