Pages that link to "Item:Q2380069"

The following pages link to Bit-parallel string matching under Hamming distance in \(O(n\lceil m/w\rceil)\) worst case time (Q2380069):

Displayed 7 items.

• On finding \(k\)-cliques in \(k\)-partite graphs (Q360493) ‎ (← links)
• On approximate pattern matching with thresholds (Q522963) ‎ (← links)
• Average-optimal string matching (Q1044048) ‎ (← links)
• Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching (Q1761497) ‎ (← links)
• Pattern matching in the Hamming distance with thresholds (Q1944111) ‎ (← links)
• Approximate pattern matching with \(k\)-mismatches in packed text (Q2445229) ‎ (← links)
• Nested Counters in Bit-Parallel String Matching (Q3618593) ‎ (← links)