Computing the Threshold for q-Gram Filters

DOI10.1007/3-540-45471-3_36MaRDI QIDQ3046510zbMATH OpenOpenAlexFDO

Authors Juha Kärkkäinen

Publication date 12 August 2004

Published in Algorithm Theory — SWAT 2002 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45471-3_36

zbMATH Keywords

approximate string matching

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 1998337
• scientific article; zbMATH DE number 1786448
• scientific article; zbMATH DE number 2087056
• BDD-BASED ANALYSIS OF GAPPED q-GRAM FILTERS
• scientific article; zbMATH DE number 3986146
• Thresholding implied by truncated quadratic regularization
• scientific article; zbMATH DE number 5150813
• Research in Computational Molecular Biology
• Approximations for nonlinear filters based on quantisation

Cited in

(9)

• Average-case linear-time similar substring searching by the q-gram distance
• scientific article; zbMATH DE number 1342989 (Why is no real title available?)
• scientific article; zbMATH DE number 1998337 (Why is no real title available?)
• scientific article; zbMATH DE number 2046074 (Why is no real title available?)
• scientific article; zbMATH DE number 1786448 (Why is no real title available?)
• scientific article; zbMATH DE number 2087056 (Why is no real title available?)
• Research in Computational Molecular Biology
• BDD-BASED ANALYSIS OF GAPPED q-GRAM FILTERS
• Generalized gapped \(k\)-mer filters for robust frequency estimation

This page was built for publication: Computing the Threshold for q-Gram Filters

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