Online algorithms for constructing linear-size suffix trie

Diptarama Hendrian, Takuya Takagi, Shunsuke Inenaga

研究成果: 著書/レポートタイプへの貢献会議での発言

抄録

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.

元の言語英語
ホスト出版物のタイトル30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019
編集者Nadia Pisanti, Solon P. Pissis
出版者Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN(電子版)9783959771030
DOI
出版物ステータス出版済み - 6 1 2019
イベント30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019 - Pisa, イタリア
継続期間: 6 18 20196 20 2019

出版物シリーズ

名前Leibniz International Proceedings in Informatics, LIPIcs
128
ISSN(印刷物)1868-8969

会議

会議30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019
イタリア
Pisa
期間6/18/196/20/19

Fingerprint

Pattern matching
Data structures
Labels
Processing

All Science Journal Classification (ASJC) codes

  • Software

これを引用

Hendrian, D., Takagi, T., & Inenaga, S. (2019). Online algorithms for constructing linear-size suffix trie. : N. Pisanti, & S. P. Pissis (版), 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019 [30] (Leibniz International Proceedings in Informatics, LIPIcs; 巻数 128). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.CPM.2019.30

Online algorithms for constructing linear-size suffix trie. / Hendrian, Diptarama; Takagi, Takuya; Inenaga, Shunsuke.

30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019. 版 / Nadia Pisanti; Solon P. Pissis. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2019. 30 (Leibniz International Proceedings in Informatics, LIPIcs; 巻 128).

研究成果: 著書/レポートタイプへの貢献会議での発言

Hendrian, D, Takagi, T & Inenaga, S 2019, Online algorithms for constructing linear-size suffix trie. : N Pisanti & SP Pissis (版), 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019., 30, Leibniz International Proceedings in Informatics, LIPIcs, 巻. 128, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, Pisa, イタリア, 6/18/19. https://doi.org/10.4230/LIPIcs.CPM.2019.30
Hendrian D, Takagi T, Inenaga S. Online algorithms for constructing linear-size suffix trie. : Pisanti N, Pissis SP, 編集者, 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2019. 30. (Leibniz International Proceedings in Informatics, LIPIcs). https://doi.org/10.4230/LIPIcs.CPM.2019.30
Hendrian, Diptarama ; Takagi, Takuya ; Inenaga, Shunsuke. / Online algorithms for constructing linear-size suffix trie. 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019. 編集者 / Nadia Pisanti ; Solon P. Pissis. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2019. (Leibniz International Proceedings in Informatics, LIPIcs).
@inproceedings{54d08773daab4589af63f21d04602548,
title = "Online algorithms for constructing linear-size suffix trie",
abstract = "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.",
author = "Diptarama Hendrian and Takuya Takagi and Shunsuke Inenaga",
year = "2019",
month = "6",
day = "1",
doi = "10.4230/LIPIcs.CPM.2019.30",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Nadia Pisanti and Pissis, {Solon P.}",
booktitle = "30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019",

}

TY - GEN

T1 - Online algorithms for constructing linear-size suffix trie

AU - Hendrian, Diptarama

AU - Takagi, Takuya

AU - Inenaga, Shunsuke

PY - 2019/6/1

Y1 - 2019/6/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85068052163&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85068052163&partnerID=8YFLogxK

U2 - 10.4230/LIPIcs.CPM.2019.30

DO - 10.4230/LIPIcs.CPM.2019.30

M3 - Conference contribution

T3 - Leibniz International Proceedings in Informatics, LIPIcs

BT - 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019

A2 - Pisanti, Nadia

A2 - Pissis, Solon P.

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

ER -