Mismatch sampling

DOI10.1016/j.ic.2012.02.007zbMath1237.68267OpenAlexW2913549935MaRDI QIDQ418198

Ely Porat, Amir Rothschild, Benny Porat, Klim Efremenko, 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)

Related Items (3)

On pattern matching with \(k\) mismatches and few don't cares ⋮ A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance ⋮ On string matching with mismatches

Cites Work

• Efficient string matching with k mismatches
• Fast algorithms for approximately counting mismatches
• k-Mismatch with Don’t Cares
• Generalized String Matching
• Faster algorithms for string matching with k mismatches
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Mismatch sampling