Improved single and multiple approximate string matching

DOI10.1007/978-3-540-27801-6_35MaRDI QIDQ5315353zbMATH OpenFDO

Authors Kimmo Fredriksson, Gonzalo Navarro

Publication date 7 September 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-27801-6_35

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05) Analysis of algorithms (68W40)

Recommendations

• Average-optimal single and multiple approximate string matching
• Average-optimal multiple approximate string matching
• Multiple approximate string matching
• Faster approximate string matching
• A fast bit-vector algorithm for approximate string matching based on dynamic programming

Cited in

(13)

• Improved approximate pattern matching on hypertext
• Average complexity of exact and approximate multiple string matching
• Fast string matching for DNA sequences
• Approximate regular expression matching with multi-strings
• Very fast and simple approximate string matching
• Average-optimal multiple approximate string matching
• scientific article; zbMATH DE number 1094183 (Why is no real title available?)
• New and faster filters for multiple approximate string matching
• Boosting the Quality of Approximate String Matching by Synonyms
• Multiple approximate string matching
• A graph approach to the threshold all-against-all substring matching problem
• Average-optimal single and multiple approximate string matching
• A fast algorithm for approximate string matching on gene sequences

This page was built for publication: Improved single and multiple approximate string matching

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