Matching with don't-cares and a small number of mismatches

DOI10.1016/J.IPL.2008.10.016MaRDI QIDQ976093zbMATHOpenAlexFDO

Authors Chaim Linhart, Ron Shamir

Publication date 16 June 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2008.10.016

zbMATH Keywords

analysis of algorithmspattern matchingapproximate wildcard matching

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Analysis of algorithms (68W40)

Recommendations

• k-Mismatch with Don’t Cares
• Pattern matching with don't cares and few errors
• On pattern matching with \(k\) mismatches and few don't cares
• A filtering algorithm for \(k\)-mismatch with don't cares
• Approximate subset matching with don't cares

Cites work

• scientific article; zbMATH DE number 3471577 (Why is no real title available?)
• Approximate formulas for some functions of prime numbers
• Faster algorithms for string matching with k mismatches
• Generalized String Matching
• Improved Sketching of Hamming Distance with Error Correcting
• Matching patterns in strings subject to multi-linear transformations
• PRIMES is in P
• Pattern matching with address errors
• Prime sieves using binary quadratic forms
• Secure multiparty computation of approximations
• Simple deterministic wildcard matching
• Verifying candidate matches in sparse and wildcard matching
• k-Mismatch with Don’t Cares

Cited in

(6)

• A faster algorithm for the computation of string convolutions using LZ78 parsing
• Approximate subset matching with don't cares
• k-Mismatch with Don’t Cares
• Self-normalised Distance with Don’t Cares
• Pattern matching with don't cares and few errors
• A filtering algorithm for \(k\)-mismatch with don't cares

This page was built for publication: Matching with don't-cares and a small number of mismatches

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