Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Algorithms and Computation

ISAAC 2011: Algorithms and Computation pp 673–682Cite as

Succinct Indexes for Circular Patterns

  • Conference paper

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

Abstract

Circular patterns are those patterns whose circular permutations are also valid patterns. These patterns arise naturally in bioinformatics and computational geometry. In this paper, we consider succinct indexing schemes for a set of d circular patterns of total length n, with each character drawn from an alphabet of size σ. Our method is by defining the popular Burrows-Wheeler transform (BWT) on circular patterns, based on which we achieve succinct indexes with space nlogσ(1 + o(1)) + O(n) + O(dlogn) bits, while pattern matching or dictionary matching queries can be supported efficiently.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho, A., Corasick, M.: Efficient String Matching: An Aid to Bibliographic Search. Communications of the ACM 18(6), 333–340 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  2. Belazzougui, D.: Succinct Dictionary Matching With No Slowdown. In: Amir, A., Parida, L. (eds.) CPM 2010. LNCS, vol. 6129, pp. 88–100. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  3. Bender, M.A., Farach-Colton, M.: The Level Ancestor Problem Simplified. Theoretical Computer Science 321(1), 5–12 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  4. Burrows, M., Wheeler, D.J.: A Block-Sorting Lossless Data Compression Algorithm, Technical Report 124, Digital Equipment Corporation, USA (1994)

    Google Scholar 

  5. Chan, H.L., Hon, W.K., Lam, T.W., Sadakane, K.: Compressed Indexes for Dynamic Text Collections. ACM Transactions on Algorithms 3(2) (2007)

    Google Scholar 

  6. Eisen, J.A.: Environmental Shotgun Sequencing: Its Potential and Challenges for Studying the Hidden World of Microbes. PLoS Biology 5(3), e82 (2007)

    Article  Google Scholar 

  7. Ferragina, P., Manzini, G.: Indexing Compressed Text. Journal of the ACM 52(4), 552–581 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  8. Ferragina, P., Venturini, R.: The Compressed Permuterm Index. ACM Transactions on Algorithms 7(1) (2010)

    Google Scholar 

  9. Grossi, R., Vitter, J.S.: Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching. SIAM Journal on Computing 35(2), 378–407 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  10. Grossi, R., Gupta, A., Vitter, J.S.: High-Order Entropy-Compressed Text Indexes. In: SODA, pp. 841–850 (2003)

    Google Scholar 

  11. Hon, W.K., Ku, T.H., Shah, R., Thankachan, S.V., Vitter, J.S.: Faster Compressed Dictionary Matching. In: Chavez, E., Lonardi, S. (eds.) SPIRE 2010. LNCS, vol. 6393, pp. 191–200. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  12. Hon, W.K., Lam, T.W., Shah, R., Tam, S.L., Vitter, J.S.: Compressed Index for Dictionary Matching. In: DCC, pp. 23–32 (2008)

    Google Scholar 

  13. Hon, W.K., Shah, R., Vitter, J.S.: Compression, Indexing, and Retrieval for Massive String Data. In: Amir, A., Parida, L. (eds.) CPM 2010. LNCS, vol. 6129, pp. 260–274. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  14. 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)

    Chapter  Google Scholar 

  15. Kasai, T., Lee, G., Arimura, H., Arikawa, S., Park, K.: Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol. 2089, pp. 181–192. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  16. Manber, U., Myers, G.: Suffix Arrays: A New Method for On-Line String Searches. SIAM Journal on Computing 22(5), 935–948 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  17. Munro, J.I., Raman, V.: Succinct Representation of Balanced Parentheses and Static Trees. SIAM Journal on Computing 31(3), 762–776 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  18. Raman, R., Raman, V., Rao, S.S.: Succinct Indexable Dictionaries with Applications to Encoding k-ary Trees, Prefix Sums and Multisets. ACM Transactions on Algorithms 3(4) (2007)

    Google Scholar 

  19. Sadakane, K.: Compressed Suffix Trees with Full Functionality. Theory of Computing Systems, pp. 589–607 (2007)

    Google Scholar 

  20. Simon, C., Daniel, R.: Metagenomic Analyses: Past and Future Trends. Applied and Environmental Microbiology 77(4), 1153–1161 (2011)

    Article  Google Scholar 

  21. Strang, B.L., Stow, N.D.: Circularization of the Herpes Simplex Virus Type 1 Genome upon Lytic Infection. Journal of Virology 79(19), 12487–12494 (2005)

    Article  Google Scholar 

  22. Weiner, P.: Linear Pattern Matching Algorithms. In: Proceedings of Symposium on Switching and Automata Theory, pp. 1–11 (1973)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. National Tsing Hua University, Taiwan

    Wing-Kai Hon

  2. Academia Sinica, Taiwan

    Chen-Hua Lu

  3. Louisiana State University, USA

    Rahul Shah & Sharma V. Thankachan

Authors
  1. Wing-Kai Hon
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chen-Hua Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rahul Shah
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Sharma V. Thankachan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Chuo University, Kasuga, Bunkyo-ku, 112-8551, Tokyo, Japan

    Takao Asano

  2. Gunma University, 1-5-1 Tenjin-Cho, 376-8515, Kiryu-Shi, Japan

    Shin-ichi Nakano

  3. Japan Advanced Institute of Science and Technology, 1-1 Asahidai, 923-1292, Nomi, Ishikawa, Japan

    Yoshio Okamoto

  4. Tokyo Institute of Technology, 2-12-1 Ookayama, Meguro-ku, 152-8552, Tokyo, Japan

    Osamu Watanabe

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hon, WK., Lu, CH., Shah, R., Thankachan, S.V. (2011). Succinct Indexes for Circular Patterns. In: Asano, T., Nakano, Si., Okamoto, Y., Watanabe, O. (eds) Algorithms and Computation. ISAAC 2011. Lecture Notes in Computer Science, vol 7074. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25591-5_69

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25591-5_69

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25590-8

  • Online ISBN: 978-3-642-25591-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation