Pages that link to "Item:Q1313761"
From MaRDI portal
The following pages link to Fast algorithms for approximately counting mismatches (Q1313761):
Displaying 19 items.
- Mismatch sampling (Q418198) (← links)
- On approximate pattern matching with thresholds (Q522963) (← links)
- Approximate pattern matching with the \(L_1\), \(L_2\) and \(L_\infty\) metrics (Q534777) (← links)
- The approximate swap and mismatch edit distance (Q604463) (← links)
- A black box for online approximate pattern matching (Q716330) (← links)
- Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances (Q732031) (← links)
- Pattern matching with don't cares and few errors (Q847263) (← links)
- Pattern matching with address errors: rearrangement distances (Q923879) (← links)
- On string matching with mismatches (Q1736652) (← links)
- Recent advances in text-to-pattern distance algorithms (Q2106622) (← links)
- Exploiting pseudo-locality of interchange distance (Q2146144) (← links)
- Approximate periodicity (Q2343134) (← links)
- A lower-variance randomized algorithm for approximate string matching (Q2444913) (← links)
- Upper and Lower Bounds for Dynamic Data Structures on Strings (Q3304117) (← links)
- Towards Unified Approximate Pattern Matching for Hamming and L_1 Distance (Q5002739) (← links)
- Approximating Approximate Pattern Matching (Q5088905) (← links)
- A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance (Q5240425) (← links)
- (Q6062160) (← links)
- (Q6084405) (← links)
