Skip to main content
SpringerLink
Log in

Indexing Circular Patterns

  • Conference paper
WALCOM: Algorithms and Computation (WALCOM 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4921))

Included in the following conference series:

Abstract

This paper deals with the Circular Pattern Matching Problem (CPM). In CPM, we are interested in pattern matching between the text \(\mathcal T\) and the circular pattern \(\mathcal C(\mathcal P)\) of a given pattern \(\mathcal P = \mathcal P_1 \ldots \mathcal P_m\). The circular pattern \(\mathcal C(\mathcal P)\) is formed by concatenating \(\mathcal P_1\) to the right of \(\mathcal P_m\). We can view \(\mathcal C(\mathcal 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 \(\mathcal T\), we find a match for \(\mathcal C(\mathcal 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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abouelhoda, M.I., Ohlebusch, E., Kurtz, S.: Optimal exact string matching based on suffix arrays. In: Laender, A.H.F., Oliveira, A.L. (eds.) SPIRE 2002. LNCS, vol. 2476, pp. 31–43. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  2. Alstrup, S., Brodal, G.S., Rauhe, T.: New data structures for orthogonal range searching. In: FOCS, pp. 198–207 (2000)

    Google Scholar 

  3. Amir, A., Aumann, Y., Benson, G., Levy, A., Lipsky, O., Porat, E., Skiena, S., Vishne, U.: Pattern matching with address errors: rearrangement distances. In: SODA, pp. 1221–1229. ACM Press, New York (2006)

    Chapter  Google Scholar 

  4. Amir, A., Aumann, Y., Landau, G.M., Lewenstein, M., Lewenstein, N.: Pattern matching with swaps. J. Algorithms 37(2), 247–266 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  5. Apostolico, A., Crochemore, M.: Optimal canonization of all substrings of a string. Inf. Comput. 95(1), 76–95 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  6. Booth, K.S.: Lexicographically least circular substrings. Inf. Process. Lett. 10(4/5), 240–242 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  7. Crochemore, M., Hancart, C., Lecroq, T.: Algorithmique du texte. Vuibert Informatique (2001)

    Google Scholar 

  8. Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific, Singapore (2002)

    Google Scholar 

  9. Duval, J.-P.: Factorizing words over an ordered alphabet. J. Algorithms 4(4), 363–381 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  10. Gusfield, D.: Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)

    MATH  Google Scholar 

  11. Hon, W.-K., Sadakane, K., Sung, W.-K.: Breaking a time-and-space barrier in constructing full-text indices. In: FOCS, pp. 251–260. IEEE Computer Society Press, Los Alamitos (2003)

    Google Scholar 

  12. Huynh, T.N.D., Hon, W.-K., Lam, T.W., Sung, W.-K.: Approximate string matching using compressed suffix arrays. Theor. Comput. Sci. 352(1-3), 240–249 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  13. Kärkkäinen, J., Sanders, P., Burkhardt, S.: Simple linear work suffix array construction. J. ACM 53(6), 918–936 (2006)

    Article  MathSciNet  Google Scholar 

  14. Kim, D.K., Sim, J.S., Park, H., Park, K.: Constructing suffix arrays in linear time. J. Discrete Algorithms 3(2-4), 126–142 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  15. Knuth, D.E., Morris Jr., J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput. 6(2), 323–350 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  16. Ko, P., Aluru, S.: Space efficient linear time construction of suffix arrays. J. Discrete Algorithms 3(2-4), 143–156 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  17. Lothaire, M. (ed.): Applied Combinatorics on Words. In: Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge (2005)

    Google Scholar 

  18. Manber, U., Myers, E.W.: Suffix arrays: A new method for on-line string searches. SIAM J. Comput. 22(5), 935–948 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  19. McCreight, E.M.: A space-economical suffix tree construction algorithm. J. ACM 23(2), 262–272 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  20. Sadakane, K., Shibuya, T.: Indexing huge genome sequences for solving various problems. Genome Informatics 12, 175–183 (2001)

    Google Scholar 

  21. Shiloach, Y.: Fast canonization of circular strings. J. Algorithms 2(2), 107–121 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  22. Ukkonen, E.: On-line construction of suffix trees. Algorithmica 14(3), 249–260 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  23. Wagner, E.K., Hewlett, M.J.: Basic Virology, 2nd edn. Blackwell Publishing, Malden (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, King’s College London, Algorithm Design Group, Strand, London, WC2R 2LS, England

    Costas S. Iliopoulos & M. Sohel Rahman

  2. Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology, Dhaka, 1000, Bangladesh

    M. Sohel Rahman

Authors
  1. Costas S. Iliopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Sohel Rahman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Shin-ichi Nakano Md. Saidur Rahman

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Iliopoulos, C.S., Rahman, M.S. (2008). Indexing Circular Patterns. In: Nakano, Si., Rahman, M.S. (eds) WALCOM: Algorithms and Computation. WALCOM 2008. Lecture Notes in Computer Science, vol 4921. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77891-2_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-77891-2_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-77890-5

  • Online ISBN: 978-3-540-77891-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation