Mismatch sampling

DOI10.1016/J.IC.2012.02.007MaRDI QIDQ418198zbMATH OpenOpenAlexFDO

Authors Klim Efremenko, Benny Porat, Ely Porat, Amir Rothschild, Raphaël Clifford

Publication date 24 May 2012

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2012.02.007

zbMATH Keywords

Hamming distancepattern matchingmismatch

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Recommendations

• Fast algorithms for approximately counting mismatches
• Simple and efficient string matching with k mismatches
• On string matching with mismatches
• Faster algorithms for string matching with k mismatches
• scientific article; zbMATH DE number 1445379

Cites work

• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 3249395 (Why is no real title available?)
• Approximating general metric distances between a pattern and a text
• Efficient string matching with k mismatches
• Fast algorithms for approximately counting mismatches
• Faster algorithms for string matching with k mismatches
• From coding theory to efficient pattern matching
• Generalized String Matching
• k-Mismatch with Don’t Cares

Cited in

(8)

• A linear-time algorithm for the 1-mismatch problem
• scientific article; zbMATH DE number 2116999 (Why is no real title available?)
• On pattern matching with \(k\) mismatches and few don't cares
• On string matching with mismatches
• A randomized numerical aligner (rNA)
• A randomized numerical aligner (rNA)
• Metropolized Knockoff Sampling
• A simple algorithm for approximating the text-to-pattern Hamming distance

This page was built for publication: Mismatch sampling

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