Online algorithms for constructing linear-size suffix trie

Diptarama Hendrian, Takuya Takagi, Shunsuke Inenaga

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Citation (Scopus)


The suffix trees are fundamental data structures for various kinds of string processing. The suffix tree of a string T of length n has O(n) nodes and edges, and the string label of each edge is encoded by a pair of positions in T. Thus, even after the tree is built, the input text T needs to be kept stored and random access to T is still needed. The linear-size suffix tries (LSTs), proposed by Crochemore et al. [Linear-size suffix tries, TCS 638:171-178, 2016], are a “stand-alone” alternative to the suffix trees. Namely, the LST of a string T of length n occupies O(n) total space, and supports pattern matching and other tasks in the same efficiency as the suffix tree without the need to store the input text T. Crochemore et al. proposed an offline algorithm which transforms the suffix tree of T into the LST of T in O(nlog σ) time and O(n) space, where σ is the alphabet size. In this paper, we present two types of online algorithms which “directly” construct the LST, from right to left, and from left to right, without constructing the suffix tree as an intermediate structure. Both algorithms construct the LST incrementally when a new symbol is read, and do not access to the previously read symbols. The right-to-left construction algorithm works in O(nlog σ) time and O(n) space and the left-to-right construction algorithm works in O(n(log σ + log n/log log n)) time and O(n) space. The main feature of our algorithms is that the input text does not need to be stored.

Original languageEnglish
Title of host publication30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019
EditorsNadia Pisanti, Solon P. Pissis
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959771030
Publication statusPublished - 2019 Jun 1
Event30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019 - Pisa, Italy
Duration: 2019 Jun 182019 Jun 20

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
ISSN (Print)1868-8969


Conference30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019


  • Indexing structure
  • Linear-size suffix trie
  • Online algorithm
  • Pattern matching


Dive into the research topics of 'Online algorithms for constructing linear-size suffix trie'. Together they form a unique fingerprint.

Cite this