Approximate string matching with stuck address bits
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 53772 (Why is no real title available?)
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- An Extension of the String-to-String Correction Problem
- Approximate String Matching with Address Bit Errors
- Approximate string matching with address bit errors
- Approximate swapped matching.
- Asynchronous Pattern Matching
- Beyond the flow decomposition barrier
- Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances
- Interchange rearrangement: the element-cost model
- On the cost of interchange rearrangement in strings
- Overlap matching.
- Pattern matching with address errors
- Pattern matching with address errors: rearrangement distances
- Sorting by Transpositions
- Sorting permutations by block-interchanges
- String rearrangement metrics: a survey
Cited in
(4)
This page was built for publication: Approximate string matching with stuck address bits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q551176)