Approximate String Matching with Address Bit Errors
From MaRDI portal
Recommendations
Cites work
- An Extension of the String-to-String Correction Problem
- Approximate swapped matching.
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 3551946 (Why is no real title available?)
- scientific article; zbMATH DE number 1820639 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- Overlap matching.
- Pattern matching with address errors
- Sorting by Transpositions
- Sorting permutations by block-interchanges
- Verifying candidate matches in sparse and wildcard matching
Cited in
(9)- Approximate string matching with address bit errors
- On the hardness of optimal vertex relabeling and restricted vertex relabeling
- LCS Approximation via Embedding into Local Non-repetitive Strings
- A simple algorithm for approximating the text-to-pattern Hamming distance
- Approximate string matching with stuck address bits
- LCS approximation via embedding into locally non-repetitive strings
- Interchange rearrangement: the element-cost model
- Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances
- Pattern matching with address errors: rearrangement distances
This page was built for publication: Approximate String Matching with Address Bit Errors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3506947)