Pages that link to "Item:Q3558261"
From MaRDI portal
The following pages link to A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches (Q3558261):
Displaying 7 items.
- Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching (Q1761497) (← links)
- A parallel multistart algorithm for the closest string problem (Q2483510) (← links)
- Accurate and Efficient Methods to Improve Multiple Circular Sequence Alignment (Q2948308) (← links)
- (Q4412091) (← links)
- Bit-Parallel Approximate Matching of Circular Strings with <i>k</i> Mismatches (Q4577948) (← links)
- On the lower bound for parallel string matching (Q4844575) (← links)
- String Processing and Information Retrieval (Q5897132) (← links)