Skip to main content
SpringerLink
Log in

Time and Space Efficient Search for Small Alphabets with Suffix Arrays

  • Conference paper
Book cover Fuzzy Systems and Knowledge Discovery (FSKD 2005)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3613))

Included in the following conference series:

  • 1456 Accesses

Abstract

To search a pattern P in a text, index data structures such as suffix trees and suffix arrays are widely used. It is known that searching with suffix trees is faster than with suffix arrays in the aspect of time complexity. But recently, a few linear-time search algorithms for constant-size alphabet in suffix arrays have been suggested. One of such algorithms proposed by Sim et al. uses Burrows-Wheeler transform and takes O(|P|log|Σ|) time. But this algorithm needs too much space compared to Abouelhoda et al.’s algorithm to search a pattern.

In this paper we present an improved version for Sim et al.’s algorithm. It needs only 2n bytes at most if a given alphabet is sufficiently small.

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 119.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. Burkhardt, S., Kärkkäinen, J.: Fast lightweight suffix array construction and checking. In: Baeza-Yates, R., Chávez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol. 2676, pp. 55–69. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  3. Choi, Y.W., Sim, J.S., Park, K.: Time and space efficinet search with suffix arrays. Journal of Korea Information Science Society (accepted)

    Google Scholar 

  4. Farach, M.: Optimal suffix tree construction with large alphabets. In: FOCS, pp. 137–143 (1997)

    Google Scholar 

  5. Farach-Colton, M., Ferragina, P., Muthukrishnan, S.: On the sorting-complexity of suffix tree construction. JACM 47, 987–1011 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  6. Ferragina, P., Manzini, G.: Opportunistic data structures with applications. In: FOCS, pp. 390–398 (2001)

    Google Scholar 

  7. Gonnet, G., Baeza-Yates, R., Snider, T.: New indices for text: Pat trees and pat arrays. In: Frakes, W.B., Baeza-Yates, R.A. (eds.) Information Retrieval: Data Structures & Algorithms, pp. 66–82. Prentice Hall, Englewood Cliffs (1992)

    Google Scholar 

  8. Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Cambridge Univ. Press, Cambridge (1997)

    Book  MATH  Google Scholar 

  9. D. Gusfield: An Increment-by-one approach to suffix arrays and trees (1990) (manuscript)

    Google Scholar 

  10. Hariharan, R.: Optimal parallel suffix tree construction. J. Comput. Syst. Sci. 55, 44–69 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  11. Hon, W., Sadakane, K., Sung, W.: Breaking a time-and-space barrier in constructing full-text indices. In: FOCS (2003) (accepted)

    Google Scholar 

  12. Kärkkäinen, J., Sanders, P.: Simple linear work suffix array construction. In: James, A., Younas, M., Lings, B. (eds.) BNCOD 2003. LNCS, vol. 2712, pp. 943–955. Springer, Heidelberg (2003)

    Google Scholar 

  13. Kim, D., Sim, J.S., Park, H., Park, K.: Linear-time construction of suffix arrays. Journal of Discrete Algorithms 3/2-4, 126–142 (2005)

    Article  MathSciNet  Google Scholar 

  14. Ko, P., Aluru, S.: Space efficient linear time construction of suffix arrays. In: Baeza-Yates, R., Chávez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol. 2676, pp. 200–210. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  15. Manber, U., Myers, G.: Suffix arrays: A new method for on-line string searches. SIAM J. Comput. 22, 935–938 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  16. McCreight, E.M.: A space-economical suffix tree construction algorithm. JACM 23, 262–272 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  17. Sadakane, K.: Succinct representation of lcp information and improvement in the compressed suffix arrays. In: SODA, pp. 225–232 (2002)

    Google Scholar 

  18. Sim, J.S., Kim, D.K., Park, H., Park, K.: Linear-time search in suffix arrays. Journal of Korea Information Science Society (accepted)

    Google Scholar 

  19. Weiner, P.: Linear pattern matching algorithms. In: Proc. 14th IEEE Symp. Switching and Automata Theory, pp. 1–11 (1973)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Engineering, Inha University, Incheon, Korea

    Jeong Seop Sim

Authors
  1. Jeong Seop Sim
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Electrical and Electronic Engineering, Nanyang Technological University, Block S1, Nanyang Avenue, 639798, Singapore

    Lipo Wang

  2. Honda Research Institute Europe GmbH, Offenbach/Main, Germany

    Yaochu Jin

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sim, J.S. (2005). Time and Space Efficient Search for Small Alphabets with Suffix Arrays. In: Wang, L., Jin, Y. (eds) Fuzzy Systems and Knowledge Discovery. FSKD 2005. Lecture Notes in Computer Science(), vol 3613. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11539506_136

Download citation

  • DOI: https://doi.org/10.1007/11539506_136

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28312-6

  • Online ISBN: 978-3-540-31830-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation