A fast and lightweight filter-based algorithm for circular pattern matching
Md Aashikur Rahman Azim, Costas S. Iliopoulos, M. Sohel Rahman, M. Samiruzzaman · 2014
Exact Circular Pattern Matching (ECPM) problem consists in finding all occurrences of the rotations of a pattern P of length m in a text T of length n. In this paper we present a fast filter-based algorithm for this problem.