Václav Blazej

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
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 advantage of the bit parallelism of bitwise machine instructions. We point out a fatal flaw in the algorithm proposed by Ahmed et al. [The swap matching(More)
  • 1