Ondřej Suchý

A Simpler Bit-parallel Algorithm for Swap Matching.

2016 · arXiv (Cornell University)

The pattern matching problem with swaps is to find all occurrences of a pattern in a text while allowing the pattern to swap adjacent symbols. The goal is to design fast matching algorithm that takes …