Pages that link to "Item:Q1763154"
From MaRDI portal
The following pages link to Bit-parallel witnesses and their applications to approximate string matching (Q1763154):
Displaying 14 items.
- On finding \(k\)-cliques in \(k\)-partite graphs (Q360493) (← links)
- A new filtration method and a hybrid strategy for approximate string matching (Q385045) (← links)
- Approximate all-pairs suffix/prefix overlaps (Q418172) (← links)
- Faster approximate string matching for short patterns (Q692899) (← links)
- Improving the bit-parallel NFA of Baeza-Yates and Navarro for approximate string matching (Q975479) (← links)
- Average-optimal string matching (Q1044048) (← links)
- The invariant problem for binary string structures and the parallel complexity theory of queries (Q1191022) (← links)
- Run-Length Encoded Nondeterministic KMP and Suffix Automata (Q2947413) (← links)
- BIT-PARALLEL COMPUTATION OF LOCAL SIMILARITY SCORE MATRICES WITH UNITARY WEIGHTS (Q3421848) (← links)
- Nested Counters in Bit-Parallel String Matching (Q3618593) (← 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)
- Tighter Packed Bit-Parallel NFA for Approximate String Matching (Q5757239) (← links)
- String Processing and Information Retrieval (Q5897132) (← links)
