Indexing Circular Patterns

@inproceedings{Iliopoulos2008IndexingCP,
  title={Indexing Circular Patterns},
  author={Costas S. Iliopoulos and Mohammad Sohel Rahman},
  booktitle={WALCOM},
  year={2008}
}
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 m patterns starting at positions j ∈ [1..m] and wrapping around the end and if any of these patterns matches T , we find a match for C(P). In this paper, we present two efficient data structures to… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-9 of 9 extracted citations

Fast circular dictionary-matching algorithm

Mathematical Structures in Computer Science • 2017
View 2 Excerpts

Average-optimal string matching

J. Discrete Algorithms • 2009
View 1 Excerpt

References

Publications referenced by this paper.
Showing 1-10 of 30 references

editor

M. Lothaire
Applied Combinatorics on Words. Encyclopedia of Mathematics and its Applications. Cambridge University Press, • 2005
View 2 Excerpts

Basic Virology, 2nd Edition

E. K. Wagner, M. J. Hewlett
Blackwell Publishing, • 2003
View 1 Excerpt

Cerný . Lyndon factorization of generalized words of thue

C. Hancart Crochemore
Discrete Mathematics & Theoretical Computer Science • 2002

Similar Papers

Loading similar papers…