Indexing Circular Patterns

This paper deals with the Circular Pattern Matching Problem (CPM). In CPM, we are interested in pattern matching between the text T and the circular pattern C(P) of a given pattern P = P1 . . . Pm. The circular pattern C(P) is formed by concatenating P1 to the right of Pm. We can view C(P) as a set of

• Type: Conference
• Year: 2008
• Where: WALCOM
• Authors: Costas S. Iliopoulos, M. Sohel Rahman
• Keywords: Algorithms, Circular Pattern, Pattern Matching, Pattern Matching Problem, WALCOM 2008