Pages that link to "Item:Q2569398"
From MaRDI portal
The following pages link to Bit-parallel approximate string matching algorithms with transposition (Q2569398):
Displaying 13 items.
- On finding \(k\)-cliques in \(k\)-partite graphs (Q360493) (← links)
- Improving the bit-parallel NFA of Baeza-Yates and Navarro for approximate string matching (Q975479) (← links)
- Average-optimal string matching (Q1044048) (← links)
- Bit-parallel witnesses and their applications to approximate string matching (Q1763154) (← links)
- Computing the Burrows-Wheeler transform of a string and its reverse in parallel (Q2442813) (← links)
- Bit-Parallel Approximate Matching of Circular Strings with <i>k</i> Mismatches (Q4577948) (← links)
- A Bit-Parallel Exact String Matching Algorithm for Small Alphabet (Q5321726) (← links)
- String Processing and Information Retrieval (Q5393957) (← links)
- Transposition invariant string matching (Q5692274) (← links)
- Experimental and Efficient Algorithms (Q5710037) (← links)
- Tighter Packed Bit-Parallel NFA for Approximate String Matching (Q5757239) (← links)
- String Processing and Information Retrieval (Q5897132) (← links)
- String Processing and Information Retrieval (Q5897134) (← links)