Skip to main content
SpringerLink
Log in

Constructing suffix arrays for multi-dimensional matrices

  • Session III
  • Conference paper
  • First Online:
Combinatorial Pattern Matching (CPM 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1448))

Included in the following conference series:

Abstract

We propose multi-dimensional index data structures that generalize suffix arrays to square matrices and cubic matrices. Giancarlo proposed a two-dimensional index data structure, the Lsuffix tree, that generalizes suffix trees to square matrices. However, the construction algorithm for Lsuffix trees maintains complicated data structures and uses a large amount of space. We present simple and practical construction algorithms for multi-dimensional suffix arrays by applying a new partitioning technique to lexicographic sorting. Our contributions are the following:

  1. (1)

    We present the first algorithm for constructing two-dimensional suffix arrays directly. Our algorithm is ten times faster and five time space-efficient than Giancarlo's algorithm for Lsuffix trees.

  2. (2)

    We present an efficient algorithm for three-dimensional suffix arrays, which is the first algorithm for constructing three-dimensional index data structures.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A.V. Aho, J.E. Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.

    Google Scholar 

  2. A. Amir and M. Farach, Two-dimensional dictionary matching, Inform. Processing Letters 21 (1992), 233–239.

    Google Scholar 

  3. A. Amir, G. Benson and M. Farach, An alphabet independent approach to twodimensional pattern matching, SIAM J. Comput. 23 (1994), 313–323.

    Google Scholar 

  4. A. Apostolico, The myriad virtues of subword trees, Combinatorial Algorithms on Words, Springer-Verlag, (1985), 85–95

    Google Scholar 

  5. M. Crochemore, An optimal algorithm for computing the repetitions in a word, Inform. Processing Letters 12 (1981), 244–250.

    Google Scholar 

  6. Z. Galil and K. Park, Alphabet-independent two-dimensional witness computation, SIAM J. Comput. 25, (1996), 907–935.

    Google Scholar 

  7. R. Giancarlo, A generalization of the suffix tree to square matrices with application, SIAM J. Comput. 24, (1995), 520–562.

    Google Scholar 

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

    Google Scholar 

  9. J.E. Hopcroft, An n log n algorithm for minimizing states in a finite automaton, in Kohavi and Paz, eds., Theory of Machines and Computations, Academic Press, New York, 1971.

    Google Scholar 

  10. C.S. Iliopoulos, D.W.G. Moore and K. Park, Covering a string, Algorithmica 16 (1996),288–297.

    Google Scholar 

  11. J. Kärkkäinen, A cross between suffix tree and suffix array, Symp. Combinatorial Pattern Matching (1995), 191–204.

    Google Scholar 

  12. G.M. Landau and U. Vishkin, Fast parallel and serial approximate string matching, J. Algorithms 10 (1989), 157–169.

    Google Scholar 

  13. S.E. Lee and K. Park, A new algorithm for constructing suffix arrays, J. Korea Information Science Society 24 (1997), 697–703 (written in Korean).

    Google Scholar 

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

    Google Scholar 

  15. E.M. McCreight, A space-economical suffix tree construction algorithms, J. ACM 23 (1976), 262–272.

    Google Scholar 

  16. R. Paige and R.E. Tarjan, Three partition refinement algorithms, SIAM J. Comput. 16, (1987),973–989.

    Google Scholar 

  17. R. Paige, R.E. Tarjan and R. Bonic, A linear time solution to the single function coarsest partition problem, Theoret. Comput. Sci. 40, (1985), 67–84.

    Google Scholar 

  18. B. Schieber and U. Vishkin, On finding lowest common ancestors: simplification and parallelization, SIAM J. Comput. 17, (1988), 1253–1262.

    Google Scholar 

  19. D.D. Sleater and R.E. Tarjan, A data structure for dynamic trees, J. Comput. System Sci. 26, (1983), 362–391.

    Google Scholar 

  20. D.D. Sleater and R.E. Tarjan, Self-adjusting binary search trees, J. ACM 32, (1985),652–686.

    Google Scholar 

  21. E. Ukkonen and D. Wood, Approximate string matching with suffix automata, Algorithmica 10 (1993), 353–364.

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, Seoul National University, 151-742, Seoul, Korea

    Dong Kyue Kim, Yoo Ah Kim & Kunsoo Park

Authors
  1. Dong Kyue Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yoo Ah Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kunsoo Park
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Martin Farach-Colton

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kim, D.K., Kim, Y.A., Park, K. (1998). Constructing suffix arrays for multi-dimensional matrices. In: Farach-Colton, M. (eds) Combinatorial Pattern Matching. CPM 1998. Lecture Notes in Computer Science, vol 1448. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030786

Download citation

  • DOI: https://doi.org/10.1007/BFb0030786

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64739-3

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation