On-line construction of parameterized suffix trees for large alphabets

  • Authors:
  • Taehyung Lee;Joong Chae Na;Kunsoo Park

  • Affiliations:
  • School of Computer Science and Engineering, Seoul National University, 599 Gwanak-ro, Gwanak-gu, Seoul 151-742, South Korea;Department of Computer Science and Engineering, Sejong University, 98 Gunja-dong, Gwangjin-gu, Seoul 143-747, South Korea;School of Computer Science and Engineering, Seoul National University, 599 Gwanak-ro, Gwanak-gu, Seoul 151-742, South Korea

  • Venue:
  • Information Processing Letters
  • Year:
  • 2011

Quantified Score

Hi-index 0.89

Visualization

Abstract

We consider on-line construction of the suffix tree for a parameterized string, where we always have the suffix tree of the input string read so far. This situation often arises from source code management systems where, for example, a source code repository is gradually increasing in its size as users commit new codes into the repository day by day. We present an on-line algorithm which constructs a parameterized suffix tree in randomized O(n) time, where n is the length of the input string. Our algorithm is the first randomized linear time algorithm for the on-line construction problem.