Skip to main content
SpringerLink
Log in

On the construction of classes of suffix trees for square matrices: Algorithms and applications

  • Algorithms I
  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1995)

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

Included in the following conference series:

Abstract

Given an n × n TEXT matrix with entries defined over an ordered alphabet σ, we introduce 4n−1 classes of index data structures for TEXT. Those indices are informally the two-dimensional analog of the suffix tree of a string [15], allowing on-line searches and statistics to be performed on TEXT. We provide one simple algorithm that efficiently builds any chosen index in those classes in O(n2 log n) worst case time using O(n 2) space. The algorithm can be modified to require optimal O(n 2) expected time for bounded σ.

The work of this author is partially supported by MURST Grant “Algoritmi, Modelli di Calcolo e Strutture Informative”. This work was done while the author was with AT&T Bell Laboratories, Murray Hill, NJ. U.S.A.

Work supported by MURST of Italy. Part of this work was done while the author was visiting AT&T Bell Laboratories.

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, Reading, MA., 1974.

    Google Scholar 

  2. A. Apostolico, C. Iliopoulos, G. Landau, B. Schieber, and U. Vishkin. Parallel construction of a suffix tree with applications. Algorithmica, 3:347–365, 1988.

    Google Scholar 

  3. R. Bayer and E.M. McCreight. Organization and maintenance of large ordered indices. Acta Informatica, 1:173–189, 1972.

    Google Scholar 

  4. R. Giancarlo. An index data structure for matrices, with applications to fast two-dimensional pattern matching. In Proc. of Workshop on Algorithms and Data Structures, LNCS-Springer-Verlag, pages 337–348, 1993.

    Google Scholar 

  5. R. Giancarlo. The suffix tree of a square matrix, with applications. In Proc. Fourth Symposium on Discrete Algorithms, pages 402–411. ACM-SIAM, 1993. To appear in SIAM J. on Computing, 1995.

    Google Scholar 

  6. R. Giancarlo and R. Grossi. Parallel construction and query of suffix trees for two-dimensional matrices. In Proc. of the 5-th ACM Symposium on Parallel Algorithms and Architectures, pages 86–97, 1993.

    Google Scholar 

  7. R. Giancarlo and R. Grossi. On the construction of classes of index data structure for square matrices: algorithms and applications. AT&T Bell Labs. Technical Memorandum 11272-940110-03, 1994.

    Google Scholar 

  8. G.H. Gonnet. Efficient searching of text and pictures-Extended Abstract. Technical report, University Of Waterloo-OED-88-02, 1988.

    Google Scholar 

  9. L.J. Guibas and R. Sedgewick. A dichromatic framework for balanced trees. In Proc. 19th Symposium on Foundations of Computer Science, pages 8–21. IEEE, 1978.

    Google Scholar 

  10. R. Jain. Workshop report on visual information systems. Technical report, National Science Foundation, 1992.

    Google Scholar 

  11. P. Johansen. Combinatorial pattern recognition, the method and the program package. Technical report, DIKU 94/10, 1994.

    Google Scholar 

  12. R.M. Karp, R. Miller, and A. Rosenberg. Rapid identification of repeated patterns in strings, arrays and trees. In Proc. 4th Symposium on Theory of Computing, pages 125–136. ACM, 1972.

    Google Scholar 

  13. U. Manber and E. Myers. Suffix arrays: a new method for on-line string searches. SIAM Journal of Computing 22, 5 (1993), 935–948.

    Google Scholar 

  14. D.M. Mark. Neighbor-based properties of some orderings of two-dimensional space. Geographical Analysis, 22:145–157, 1990.

    Google Scholar 

  15. E.M. McCreight. A space economical suffix tree construction algorithm. J. of ACM, 23:262–272, 1976.

    Google Scholar 

  16. A. Rosenfeld and A.C. Kak. Digital Picture Processing. Academic Press, 1982.

    Google Scholar 

  17. H. Samet. The Design and Analysis of Spatial Data Structures. Addison-Wesley, NY, 1990.

    Google Scholar 

  18. J.A. Storer. Two dimensional suffix tries and their use in lossless sliding window image compression. In Proc. 6th Symposium on Combinatorial Pattern Matching. To appear, LNCS, 1995.

    Google Scholar 

  19. W. Szpankowski. A generalized suffix tree and its (un)expected asymptotic behaviour. SIAM J. on Computing, 22:1176–1198, 1993.

    Google Scholar 

  20. W. Szpankowski. Private communication.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Matematica ed Applicazioni, Università di Palermo, Italy

    Raffaele Giancarlo

  2. Dipartimento di Sistemi e Informatica, Università di Firenze, Italy

    Roberto Grossi

Authors
  1. Raffaele Giancarlo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Roberto Grossi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Zoltán Fülöp Ferenc Gécseg

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Giancarlo, R., Grossi, R. (1995). On the construction of classes of suffix trees for square matrices: Algorithms and applications. In: Fülöp, Z., Gécseg, F. (eds) Automata, Languages and Programming. ICALP 1995. Lecture Notes in Computer Science, vol 944. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60084-1_67

Download citation

  • DOI: https://doi.org/10.1007/3-540-60084-1_67

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60084-8

  • Online ISBN: 978-3-540-49425-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation