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

DOI10.1016/J.IPL.2008.10.016zbMATH Open1191.68896OpenAlexW2005830158MaRDI QIDQ976093FDOQ976093

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

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

zbMATH Keywords

analysis of algorithmspattern matchingapproximate wildcard matching

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

• k-Mismatch with Don’t Cares
• Self-normalised Distance with Don’t Cares
• A faster algorithm for the computation of string convolutions using LZ78 parsing
• Pattern matching with don't cares and few errors
• Approximate subset matching with don't cares
• 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)