Indexing circular patterns

Authors:
Costas S. Iliopoulos;M. Sohel Rahman
Affiliations:
Algorithm Design Group, Department of Computer Science, King's College London, London, England;Algorithm Design Group, Department of Computer Science, King's College London, London, England and Department of Computer Science and Engineering, Bangladesh University of Engineering and Technolo ...
Venue:
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
Year:
2008

Citing 12
Cited 5

Optimal canonization of all substrings of a string

Information and Computation
Suffix arrays: a new method for on-line string searches

SIAM Journal on Computing
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
A Space-Economical Suffix Tree Construction Algorithm

Journal of the ACM (JACM)
Pattern matching with swaps

Journal of Algorithms
Optimal Exact Strring Matching Based on Suffix Arrays

SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
New data structures for orthogonal range searching

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Breaking a Time-and-Space Barrier in Constructing Full-Text Indices

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)

Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
Pattern matching with address errors: rearrangement distances

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Approximate string matching using compressed suffix arrays

Theoretical Computer Science
Linear work suffix array construction

Journal of the ACM (JACM)

Optimal prefix and suffix queries on texts

Information Processing Letters
Efficient Data Structures for the Orthogonal Range Successor Problem

COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Average-optimal string matching

Journal of Discrete Algorithms
Succinct indexes for circular patterns

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Efficient algorithm for circular burrows-wheeler transform

CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 index circular patterns. This problem has applications in pattern matching in geometric and astronomical data as well as in computer graphics and bioinformatics.