Bidirectional construction of suffix trees

Authors:
Shunsuke Inenaga
Affiliations:
Department of Informatics, Kyushu University 33, Fukuoka 812-8581, Japan
Venue:
Nordic Journal of Computing - Special issue: Selected papers of the Prague Stringology conference (PSC'02), September 23-24, 2002
Year:
2003

Citing 12
Cited 5

Transducers and repetitions

Theoretical Computer Science
Complete inverted files for efficient text retrieval and analysis

Journal of the ACM (JACM)
Suffix arrays: a new method for on-line string searches

SIAM Journal on Computing
Text algorithms

Text algorithms
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
The suffix tree of a tree and minimizing sequential transducers

Theoretical Computer Science
A Space-Economical Suffix Tree Construction Algorithm

Journal of the ACM (JACM)
Space-Economical Construction of Index Structures for All Suffixes of a String

MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
On Compact Directed Acyclic Word Graphs

Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht
Compact Directed Acyclic Word Graphs for a Sliding Window

SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
On-Line Construction of Compact Directed Acyclic Word Graphs

CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Optimal suffix tree construction with large alphabets

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science

Compact directed acyclic word graphs for a sliding window

Journal of Discrete Algorithms - SPIRE 2002
On-line construction of compact directed acyclic word graphs

Discrete Applied Mathematics - 12th annual symposium on combinatorial pattern matching (CPM)
On-line construction of compact directed acyclic word graphs

Discrete Applied Mathematics
Near real-time suffix tree construction via the fringe marked ancestor problem

SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
An optimal algorithm for online square detection

CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching

Quantified Score

Hi-index	0.00

Visualization

Abstract

String matching is critical in information retrieval since in many cases information is stored and manipulated as strings. Constructing and utilizing a suitable data structure for a text string, we can solve the string matching problem efficiently. Such a structure is called an index structure. Suffix trees are certainly the most widely-known and extensively-studied structure of this kind. In this paper, we present a linear-time algorithm for bidirectional construction of suffix trees. The algorithm proposed is also applicable to bidirectional construction of directed acyclic word graphs (DAWGs).