Circular Bit-Vector-Mismatches: A New Approximate Circular String Matching with k-Mismatches
ThienLuan Ho, Seung‐Rohk Oh, HyunJin Kim · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · 2016
This paper proposes a circular bit-vector-mismatches (CBVM) algorithm for approximate circular string matching with k-mismatches. We develop the proposed CBVM algorithm based on the rotation feature of the circular pattern. By reusing the matching information of the previous substring, the next substring of the input string can be processed in parallel.