Boyer-Moore approach to approximate string matching

DOI10.1007/3-540-52846-6_103zbMath1502.68381OpenAlexW1501129459MaRDI QIDQ5056116

Esko Ukkonen, Jorma Tarhio

Publication date: 9 December 2022

Published in: SWAT 90 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-52846-6_103

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Approximation algorithms (68W25) Algorithms on strings (68W32)

Related Items (5)

Boyer-Moore approach to approximate string matching ⋮ On the string matching with \(k\) mismatches ⋮ Approximate string-matching with \(q\)-grams and maximal matches ⋮ Fast and practical approximate string matching ⋮ Application of max-plus algebra to biological sequence comparisons

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Simple and efficient string matching with k mismatches
• Approximate string matching with suffix automata
• Data structures and algorithms for approximate string matching
• Fast string matching with k differences
• A fast string searching algorithm
• Finding approximate patterns in strings
• Algorithms for approximate string matching
• The theory and computation of evolutionary distances: Pattern recognition
• Fast Pattern Matching in Strings
• Fast parallel and serial approximate string matching
• The String-to-String Correction Problem
• Boyer-Moore approach to approximate string matching

This page was built for publication: Boyer-Moore approach to approximate string matching