Average-optimal multiple approximate string matching

DOI10.1007/3-540-44888-8_9MaRDI QIDQ3550831zbMATH OpenOpenAlexFDO

Authors Kimmo Fredriksson, Gonzalo Navarro

Publication date 6 April 2010

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44888-8_9

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Recommendations

• Average-optimal single and multiple approximate string matching
• Combinatorial Pattern Matching
• Multiple approximate string matching
• Average-optimal string matching
• Average complexity of exact and approximate multiple string matching

Cited in

(10)

• Average-optimal single and multiple approximate string matching
• Multiple approximate string matching
• On Minimizing Pattern Splitting in Multi-track String Matching
• Combinatorial Pattern Matching
• scientific article; zbMATH DE number 5777888 (Why is no real title available?)
• Average-optimal string matching
• Average complexity of exact and approximate multiple string matching
• Optimal spaced seeds for faster approximate string matching
• Approximate regular expression matching with multi-strings
• Average-case optimal approximate circular string matching

This page was built for publication: Average-optimal multiple approximate string matching

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