A fast algorithm for string matching with mismatches

DOI10.1016/0020-0190(95)00043-CzbMath1022.68736OpenAlexW2027033194MaRDI QIDQ672410

A. Dermouche

Publication date: 28 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(95)00043-c

zbMATH Keywords

algorithmsinformation retrievaldesign of algorithmsstring matching

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (3)

On-Line Approximate String Searching Algorithms: Survey and Experimental Results ⋮ Indexing a sequence for mapping reads with a single mismatch ⋮ A fast algorithm for string matching with mismatches

Cites Work

• Unnamed Item
• A fast algorithm for string matching with mismatches
• Efficient string matching with k mismatches
• A fast string searching algorithm
• An Improved Algorithm For Approximate String Matching
• Efficient randomized pattern-matching algorithms
• Fast Pattern Matching in Strings

This page was built for publication: A fast algorithm for string matching with mismatches