scientific article; zbMATH DE number 826062

MaRDI QIDQ4858448zbMATH OpenFDO

Authors Esko Ukkonen

Publication date 13 December 1995

zbMATH Keywords

\(k\)-differences problemstring-matching

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• Approximate string-matching with q-grams and maximal matches
• On using q-gram locations in approximate string matching
• Average-case linear-time similar substring searching by the q-gram distance
• scientific article; zbMATH DE number 1342989
• scientific article; zbMATH DE number 3845091

Cited in

(9)

• Reversal distance for strings with duplicates: linear time approximation using hitting set
• A new distance metric on strings computable in linear time
• Approximate string-matching with q-grams and maximal matches
• Average-case linear-time similar substring searching by the q-gram distance
• scientific article; zbMATH DE number 1342989 (Why is no real title available?)
• Average complexity of backward \(q\)-gram string matching algorithms
• scientific article; zbMATH DE number 2149348 (Why is no real title available?)
• String Processing and Information Retrieval
• Fast and linear-time string matching algorithms based on the distances of q-gram occurrences

This page was built for publication:

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