Fast algorithms for approximately counting mismatches
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4152425 (Why is no real title available?)
- scientific article; zbMATH DE number 3670509 (Why is no real title available?)
- scientific article; zbMATH DE number 3750146 (Why is no real title available?)
- scientific article; zbMATH DE number 3471577 (Why is no real title available?)
- Addendum to “simple constructions of almost k-wise independent random variables”
- Generalized String Matching
- Simple Constructions of Almost k-wise Independent Random Variables
Cited in
(34)- Faster algorithms for string matching with k mismatches
- Pattern matching with address errors: rearrangement distances
- A linear-time algorithm for the 1-mismatch problem
- scientific article; zbMATH DE number 1875416 (Why is no real title available?)
- scientific article; zbMATH DE number 1445379 (Why is no real title available?)
- Fast average-case pattern matching by multiplexing sparse tables
- On string matching with mismatches
- A randomized numerical aligner (rNA)
- Approximating Approximate Pattern Matching
- scientific article; zbMATH DE number 2052914 (Why is no real title available?)
- Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances
- scientific article; zbMATH DE number 7758348 (Why is no real title available?)
- A lower-variance randomized algorithm for approximate string matching
- Towards unified approximate pattern matching for Hamming and \(L_1\) distance
- A randomized algorithm for approximate string matching
- The \(k\)-mismatch problem revisited
- Finding approximate repetitions under Hamming distance.
- scientific article; zbMATH DE number 7758337 (Why is no real title available?)
- The approximate swap and mismatch edit distance
- A randomized numerical aligner (rNA)
- A black box for online approximate pattern matching
- Pattern matching with don't cares and few errors
- An efficient mapping for computing the score of string matching
- Mismatch sampling
- From coding theory to efficient pattern matching
- Recent advances in text-to-pattern distance algorithms
- On approximate pattern matching with thresholds
- Upper and lower bounds for dynamic data structures on strings
- A simple algorithm for approximating the text-to-pattern Hamming distance
- Approximate pattern matching with the \(L_1\), \(L_2\) and \(L_\infty\) metrics
- Set intersection and sequence matching with mismatch counting
- Exploiting pseudo-locality of interchange distance
- Approximate periodicity
- A unified view to string matching algorithms
This page was built for publication: Fast algorithms for approximately counting mismatches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1313761)
