Skip to main content
SpringerLink
Log in

Lightweight Parameterized Suffix Array Construction

  • Conference paper
Combinatorial Algorithms (IWOCA 2009)

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

Included in the following conference series:

Abstract

We present a first algorithm for direct construction of parameterized suffix arrays and parameterized longest common prefix arrays for non-binary strings. Experimental results show that our algorithm is much faster than naïve methods.

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. Baker, B.S.: A program for identifying duplicated code. Computing Science and Statistics 24, 49–57 (1992)

    Google Scholar 

  2. Baker, B.S.: Parameterized pattern matching: Algorithms and applications. Journal of Computer and System Sciences 52(1), 28–42 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  3. Fredriksson, K., Mozgovoy, M.: Efficient parameterized string matching. Information Processing Letters 100(3), 91–96 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  4. Shibuya, T.: Generalization of a suffix tree for RNA structural pattern matching. Algorithmica 39(1), 1–19 (2004)

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  6. Manber, U., Myers, G.: Suffix arrays: a new method for on-line string searches. SIAM J. Computing 22(5), 935–948 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  7. McCreight, E.M.: A space-economical suffix tree construction algorithm. Journal of the ACM 23(2), 262–272 (1976)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  9. Farach, M.: Optimal suffix tree construction with large alphabets. In: Proc. 38th Annual Symposium on Foundations of Computer Science, pp. 137–143 (1997)

    Google Scholar 

  10. Kärkkäinen, J., Sanders, P.: Simple linear work suffix array construction. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 943–955. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  11. Kim, D.K., Sim, J.S., Park, H., Park, K.: Linear-time construction of suffix arrays. In: Baeza-Yates, R., Chávez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol. 2676, pp. 186–199. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  12. 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 

  13. Abouelhoda, M.I., Kurtz, S., Ohlebusch, E.: Replacing suffix trees with enhanced suffix arrays. Journal of Discrete Algorithms 2(1), 53–86 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  14. Kim, D.K., Jeon, J.E., Park, H.: An efficient index data structure with the capabilities of suffix trees and suffix arrays for alphabets of non-negligible size. In: Apostolico, A., Melucci, M. (eds.) SPIRE 2004. LNCS, vol. 3246, pp. 138–149. Springer, Heidelberg (2004)

    Google Scholar 

  15. Kosaraju, S.: Faster algorithms for the construction of parameterized suffix trees. In: Proc. FOCS 1995, pp. 631–637 (1995)

    Google Scholar 

  16. Deguchi, S., Higashijima, F., Bannai, H., Inenaga, S., Takeda, M.: Parameterized suffix arrays for binary strings. In: Proc. PSC 2008, pp. 84–94 (2008)

    Google Scholar 

  17. 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 

  18. Amir, A., Farach, M., Muthukrishnan, S.: Alphabet dependence in parameterized matching. Information Processing Letters 49(3), 111–115 (1994)

    Article  MATH  Google Scholar 

  19. Manzini, G., Ferragina, P.: Engineering a lightweight suffix array construction algorithm. Algorithmica 40, 33–50 (2004)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, Kyushu University,  

    Tomohiro I, Satoshi Deguchi, Hideo Bannai & Masayuki Takeda

  2. Faculty of Information Science and Electrical Engineering, Kyushu University, 744 Motooka, Nishiku, Fukuoka, 819–0395, Japan

    Shunsuke Inenaga

Authors
  1. Tomohiro I
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Satoshi Deguchi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hideo Bannai
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Shunsuke Inenaga
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Masayuki Takeda
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Theoretical Computer Science and Department of Applied Mathematics, Charles University, Prague, Czech Republic

    Jiří Fiala  & Jan Kratochvíl  & 

  2. School of Electrical Engineering and Computer Science, The University of Newcastle, University Drive, NSW 2308, Callaghan, Australia

    Mirka Miller

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

I, T., Deguchi, S., Bannai, H., Inenaga, S., Takeda, M. (2009). Lightweight Parameterized Suffix Array Construction. In: Fiala, J., Kratochvíl, J., Miller, M. (eds) Combinatorial Algorithms. IWOCA 2009. Lecture Notes in Computer Science, vol 5874. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10217-2_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-10217-2_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-10216-5

  • Online ISBN: 978-3-642-10217-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation