TY - GEN
T1 - Fully-online Construction of Suffix Trees for Multiple Texts
AU - Takagi, Takuya
AU - Inenaga, Shunsuke
AU - Arimura, Hiroki
N1 - Publisher Copyright:
© 2016 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. All rights reserved.
PY - 2016/6/1
Y1 - 2016/6/1
N2 - We consider fully-online construction of indexing data structures for multiple texts. Let T = {T1, . . . , TK} be a collection of texts. By fully-online, we mean that a new character can be appended to any text in T at any time. This is a natural generalization of semi-online construction of indexing data structures for multiple texts in which, after a new character is appended to the kth text Tk, then its previous texts T1, . . . , Tk-1 will remain static. Our fully-online scenario arises when we maintain dynamic indexes for multi-sensor data. Let N and σ denote the total length of texts in T and the alphabet size, respectively. We first show that the algorithm by Blumer et al. [Theoretical Computer Science, 40:31-55, 1985] to construct the directed acyclic word graph (DAWG) for T can readily be extended to our fully-online setting, retaining O(N log σ)-time and O(N)-space complexities. Then, we give a sophisticated fully-online algorithm which constructs the suffix tree for T in O(N log σ) time and O(N) space. A key idea of this algorithm is synchronized maintenance of the DAWG and the suffix tree.
AB - We consider fully-online construction of indexing data structures for multiple texts. Let T = {T1, . . . , TK} be a collection of texts. By fully-online, we mean that a new character can be appended to any text in T at any time. This is a natural generalization of semi-online construction of indexing data structures for multiple texts in which, after a new character is appended to the kth text Tk, then its previous texts T1, . . . , Tk-1 will remain static. Our fully-online scenario arises when we maintain dynamic indexes for multi-sensor data. Let N and σ denote the total length of texts in T and the alphabet size, respectively. We first show that the algorithm by Blumer et al. [Theoretical Computer Science, 40:31-55, 1985] to construct the directed acyclic word graph (DAWG) for T can readily be extended to our fully-online setting, retaining O(N log σ)-time and O(N)-space complexities. Then, we give a sophisticated fully-online algorithm which constructs the suffix tree for T in O(N log σ) time and O(N) space. A key idea of this algorithm is synchronized maintenance of the DAWG and the suffix tree.
UR - http://www.scopus.com/inward/record.url?scp=85081709893&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85081709893&partnerID=8YFLogxK
U2 - 10.4230/LIPIcs.CPM.2016.22
DO - 10.4230/LIPIcs.CPM.2016.22
M3 - Conference contribution
AN - SCOPUS:85081709893
T3 - Leibniz International Proceedings in Informatics, LIPIcs
BT - 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016
A2 - Grossi, Roberto
A2 - Lewenstein, Moshe
PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
T2 - 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016
Y2 - 27 June 2016 through 29 June 2016
ER -