Pages that link to "Item:Q4577948"
From MaRDI portal
The following pages link to Bit-Parallel Approximate Matching of Circular Strings with <i>k</i> Mismatches (Q4577948):
Displaying 7 items.
- A simple, fast, filter-based algorithm for circular sequence comparison (Q1641118) (← links)
- Bit-parallel witnesses and their applications to approximate string matching (Q1763154) (← links)
- A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches (Q3558261) (← links)
- Bit-Parallel Approximate Matching of Circular Strings with <i>k</i> Mismatches (Q4577948) (← links)
- Quasi-Linear-Time Algorithm for Longest Common Circular Factor (Q5088916) (← links)
- An Encoding for Order-Preserving Matching. (Q5111725) (← links)
- Circular pattern matching with \(k\) mismatches (Q5918999) (← links)