Fast string matching with mismatches

DOI10.1006/inco.1994.1007zbMath0804.68064OpenAlexW1980578908MaRDI QIDQ1322483

Ricardo A. Baeza-Yates, Gaston H. Gonnet

Publication date: 5 May 1994

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/4666e37dfad05844ebb8feda0eb645269393197c

zbMATH Keywords

string matching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)

Related Items

On-Line Approximate String Searching Algorithms: Survey and Experimental Results ⋮ Indexing a sequence for mapping reads with a single mismatch ⋮ Approximate Boyer-Moore string matching for small alphabets ⋮ Bit-parallel (\(\delta ,\gamma\))-matching and suffix automata ⋮ Fast and practical approximate string matching