Pages that link to "Item:Q1098311"
From MaRDI portal
The following pages link to Parallel string matching with k mismatches (Q1098311):
Displaying 12 items.
- Efficient string matching with k mismatches (Q1079377) (← links)
- Data structures and algorithms for approximate string matching (Q1104103) (← links)
- Covering problems for partial words and for indeterminate strings (Q1676304) (← links)
- Multiple filtration and approximate pattern matching (Q1902470) (← links)
- Efficient computation of sequence mappability (Q2134748) (← links)
- Fast parallel and serial multidimensional approximate array matching (Q2277849) (← links)
- Longest common substring with approximately \(k\) mismatches (Q2414870) (← links)
- Indexing a sequence for mapping reads with a single mismatch (Q2955639) (← 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)
- Parallel String Matching (Q5862565) (← links)
- Circular pattern matching with \(k\) mismatches (Q5918999) (← links)