k-Mismatch with Don’t Cares
From MaRDI portal
Publication:3527207
DOI10.1007/978-3-540-75520-3_15zbMath1151.68735OpenAlexW1531216590MaRDI QIDQ3527207
Ely Porat, Amir Rothschild, Raphaël Clifford, Klim Efremenko
Publication date: 25 September 2008
Published in: Algorithms – ESA 2007 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-75520-3_15
Related Items (9)
On pattern matching with \(k\) mismatches and few don't cares ⋮ Improved constructions for non-adaptive threshold group testing ⋮ On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling ⋮ A Black Box for Online Approximate Pattern Matching ⋮ Mismatch sampling ⋮ On string matching with mismatches ⋮ Matching with don't-cares and a small number of mismatches ⋮ A black box for online approximate pattern matching ⋮ A faster algorithm for the computation of string convolutions using LZ78 parsing
This page was built for publication: k-Mismatch with Don’t Cares