Abstract
The problem of circular pattern matching is to find all rotations of a given pattern P in text T, both over a common alphabet. The pattern and any of its rotations are also called conjugates in the literature. For the online version of this problem we present a new general approach and use several matching techniques as components, based on bit-parallelism and filtering. The experimental results show the effectiveness of the method, with matching speeds reaching 7-8 GB/s for long patterns and natural language or protein data.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Baeza-Yates, R.A., Gonnet, G.H.: A new approach to text searching. Communications of the ACM 35(10), 74–82 (1992)
Chen, K.H., Huang, G.S., Lee, R.C.T.: Exact circular pattern matching using the BNDM algorithm. In: Proceedings of the 28th Workshop on Combinatorial Mathematics and Computation Theory, pp. 152–161. National Penghu University of Science and Technology, Penghu (2011)
Chen, K.H., Huang, G.S., Lee, R.C.T.: Exact circular pattern matching using bit-parallelism and q-gram technique. In: Proceedings of the 29th Workshop on Combinatorial Mathematics and Computation Theory, pp. 18–27. National Taipei College of Business, Institute of Information and Decision Sciences, Taipei (2012)
Chen, K.H., Huang, G.S., Lee, R.C.T.: Bit-parallel algorithms for exact circular string matching. The Computer Journal (2013)
Fredriksson, K., Grabowski, S.: Average-optimal string matching. Journal of Discrete Algorithms 7(4), 579–594 (2009)
Fredriksson, K., Mäkinen, V., Navarro, G.: Flexible music retrieval in sublinear time. International Journal of Foundations of Computer Science 17(6), 1345–1364 (2006)
Grossi, R., Luccio, F.: Simple and efficient string matching with k mismatches. Information Processing Letters 33(3), 113–120 (1989)
Iliopoulos, C.S., Rahman, M.S.: Indexing circular patterns. In: Nakano, S.-I., Rahman, M.S. (eds.) WALCOM 2008. LNCS, vol. 4921, pp. 46–57. Springer, Heidelberg (2008)
Jokinen, P., Tarhio, J., Ukkonen, E.: A comparison of approximate string matching algorithms. Software Practice and Experience 26(12), 1439–1458 (1996)
Lothaire, M.: Applied Combinatorics on Words. Cambridge University Press (2005)
Navarro, G., Raffinot, M.: Fast and flexible string matching by combining bit-parallelism and suffix automata. Journal of Experimental Algorithms 5(4) (2000)
Nong, G., Zhang, S., Chan, W.H.: Two efficient algorithms for linear time suffix array construction. IEEE Transactions on Computers 60(10), 1471–1484 (2011)
Ružić, M.: Constructing efficient dictionaries in close to sorting time. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 84–95. Springer, Heidelberg (2008)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Susik, R., Grabowski, S., Deorowicz, S. (2014). Fast and Simple Circular Pattern Matching. In: Gruca, D., Czachórski, T., Kozielski, S. (eds) Man-Machine Interactions 3. Advances in Intelligent Systems and Computing, vol 242. Springer, Cham. https://doi.org/10.1007/978-3-319-02309-0_59
Download citation
DOI: https://doi.org/10.1007/978-3-319-02309-0_59
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-02308-3
Online ISBN: 978-3-319-02309-0
eBook Packages: EngineeringEngineering (R0)