On-Line Construction of Parameterized Suffix Trees

Authors:
Taehyung Lee;Joong Chae Na;Kunsoo Park
Affiliations:
School of Computer Science and Engineering, Seoul National University, Seoul, South Korea 151-742;Department of Computer Science and Engineering, Sejong University, Seoul, South Korea 143-747;School of Computer Science and Engineering, Seoul National University, Seoul, South Korea 151-742
Venue:
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Year:
2009

Citing 9
Cited 3

A theory of parameterized pattern matching: algorithms and applications

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A Generalization of the Suffix Tree to Square Matrices, with Applications

SIAM Journal on Computing
Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance

SIAM Journal on Computing
A Space-Economical Suffix Tree Construction Algorithm

Journal of the ACM (JACM)
On the sorting-complexity of suffix tree construction

Journal of the ACM (JACM)
Faster algorithms for the construction of parameterized suffix trees

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Faster Suffix Tree Construction with Missing Suffix Links

SIAM Journal on Computing
Generalization of a Suffix Tree for RNA Structural Pattern Matching

Algorithmica
Linear pattern matching algorithms

SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)

p-Suffix sorting as arithmetic coding

IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Variations of the parameterized longest previous factor

Journal of Discrete Algorithms
p-Suffix sorting as arithmetic coding

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider on-line construction of a 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.