Approximate Boyer-Moore string matching for small alphabets
type: Item
instance of: scholarly article
title: Approximate Boyer-Moore string matching for small alphabets
zbMATH Open document ID: 1198.68122
author: Leena Salmela
author: Jorma Tarhio
author: Petri Kalsi
published in: Algorithmica
publication date: 2010-09-27T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5791711
zbMATH Keywords: Approximate string matching
zbMATH Keywords: Edit distance
zbMATH Keywords: Hamming distance
zbMATH Keywords: Complexity of algorithms
zbMATH Keywords: Biological sequences
describes a project that uses: EMBOSS
MaRDI profile type: Publication
full work available at URL: s00453-009-9286-3
OpenAlex ID: W1964804652
cites work: Fast string matching with mismatches
cites work: Fast and practical approximate string matching
cites work: A fast string searching algorithm
cites work: Average-optimal single and multiple approximate string matching
cites work: Combinatorial Pattern Matching
cites work: A faster algorithm computing string edit distances
cites work: A fast bit-vector algorithm for approximate string matching based on dynamic programming
cites work: Fast and flexible string matching by combining bit-parallelism and suffix automata
cites work: Q2723965
cites work: Approximate Boyer–Moore String Matching
cites work: A subquadratic algorithm for approximate limited expression matching
DOI: 10.1007/S00453-009-9286-3
description: scientific article; zbMATH DE number 5791711