A Simple Construction of Two-Dimensional Suffix Trees in Linear Time

(Extended Abstract)
  • Dong Kyue Kim
  • Joong Chae Na
  • Jeong Seop Sim
  • Kunsoo Park
Conference paper

DOI: 10.1007/978-3-540-73437-6_35

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4580)
Cite this paper as:
Kim D.K., Na J.C., Sim J.S., Park K. (2007) A Simple Construction of Two-Dimensional Suffix Trees in Linear Time. In: Ma B., Zhang K. (eds) Combinatorial Pattern Matching. CPM 2007. Lecture Notes in Computer Science, vol 4580. Springer, Berlin, Heidelberg

Abstract

The two-dimensional suffix tree of a matrix A is a compacted trie that represents all square submatrices of A. There exists a linear-time construction of two-dimensional suffix trees using the odd-even scheme. This algorithm has the drawback that the merging step is quite complicated. In this paper, we propose a new and simple algorithm to construct two-dimensional suffix trees in linear time by applying the skew scheme to square matrices. To do this, we present a simple algorithm to merge two Isuffix trees in linear time.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Dong Kyue Kim
    • 1
  • Joong Chae Na
    • 2
  • Jeong Seop Sim
    • 3
  • Kunsoo Park
    • 4
  1. 1.Division of Electronics and Computer Engineering, Hanyang UniversityKorea
  2. 2.Department of Advanced Technology Fusion, Konkuk UniversityKorea
  3. 3.School of Computer Science and Engineering, Inha UniversityKorea
  4. 4.School of Computer Science and Engineering, Seoul National UniversityKorea

Personalised recommendations