A fast algorithm for string matching with mismatches

DOI10.1016/0020-0190(95)00043-CMaRDI QIDQ672410zbMATH OpenOpenAlexFDO

Authors 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

algorithmsdesign of algorithmsinformation retrievalstring matching

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Cites work

• A fast algorithm for string matching with mismatches
• A fast string searching algorithm
• An Improved Algorithm For Approximate String Matching
• Efficient randomized pattern-matching algorithms
• Efficient string matching with k mismatches
• Fast Pattern Matching in Strings
• scientific article; zbMATH DE number 3984596 (Why is no real title available?)

Cited in

(4)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672410)