The following pages link to (Q4952702):
Displaying 16 items.
- Automata evaluation and text search protocols with simulation-based security (Q290379) (← links)
- Set intersection and sequence matching with mismatch counting (Q294918) (← links)
- On approximate pattern matching with thresholds (Q522963) (← links)
- Computationally secure pattern matching in the presence of malicious adversaries (Q744607) (← links)
- Approximate string matching using compressed suffix arrays (Q818136) (← links)
- Improved approximate string matching using compressed suffix data structures (Q930602) (← links)
- Pattern matching with pair correlation distance (Q955040) (← links)
- Faster pattern matching with character classes using prime number encoding (Q1004281) (← links)
- Average-optimal string matching (Q1044048) (← links)
- Overlap matching. (Q1401926) (← 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)
- Swap and mismatch edit distance (Q2369878) (← links)
- Bit-parallel string matching under Hamming distance in \(O(n\lceil m/w\rceil)\) worst case time (Q2380069) (← links)
- Extending alignments with \(k\)-mismatches and \(\ell\)-gaps (Q2437749) (← links)
- Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance (Q2946041) (← links)
