Mismatch sampling
From MaRDI portal
Publication:418198
DOI10.1016/J.IC.2012.02.007zbMATH Open1237.68267OpenAlexW2913549935MaRDI QIDQ418198FDOQ418198
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fast algorithms for approximately counting mismatches
- Generalized String Matching
- From coding theory to efficient pattern matching
- Faster algorithms for string matching with k mismatches
- k-Mismatch with Don’t Cares
- Efficient string matching with k mismatches
- Approximating general metric distances between a pattern and a text
Cited In (8)
- A linear-time algorithm for the 1-mismatch problem
- A randomized numerical aligner (rNA)
- A randomized numerical aligner (rNA)
- On pattern matching with \(k\) mismatches and few don't cares
- Metropolized Knockoff Sampling
- A simple algorithm for approximating the text-to-pattern Hamming distance
- On string matching with mismatches
- Title not available (Why is that?)
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)
