Towards a Complete Perspective on Labeled Tree Indexing: New Size Bounds, Efficient Constructions, and Beyond

Abstract

A labeled tree (or a trie) is a natural generalization of a string which can also be seen as a compact representation of a set of strings. This paper considers the labeled tree indexing problem, and provides a number of new results on space bound analysis and on algorithms for efficient construction and pattern matching queries. Kosaraju [FOCS 1989] was the first to consider the labeled tree indexing problem and he proposed the suffix tree for a backward trie, where the strings in the trie are read in the leaf-to-root direction. In contrast to a backward trie, we call an ordinary trie as a forward trie. Despite a few follow-up works after Kosaraju's paper, indexing forward/backward tries is not well understood yet. In this paper, we show a full perspective on the sizes of indexing structures such as suffix trees, DAWGs, CDAWGs, suffix arrays, affix trees, affix arrays for forward and backward tries. Some of them take O(n) space in the size n of the input trie, while the others can occupy O(n 2 ) space in the worst case. In particular, we show that the size of the DAWG for a forward trie with n nodes is Ω(σn), where σ is the number of distinct characters in the trie. This becomes Ω(n 2 ) for an alphabet of size σ = Θ(n). Still, we show that there is a compact O(n)-space implicit representation of the DAWG for a forward trie, whose space requirement is independent of the alphabet size. This compact representation allows for simulating each DAWG edge traversal in O(log σ) time, and can be constructed in O(n) time and space over any integer alphabet of size O(n). In addition, this readily extends to the first indexing structure that permits bidirectional pattern searches over a trie within linear space in the input trie size. We also discuss the size of the DAWG built on a labeled DAG or on an acyclic DFA, and present a quadratic lower bound for its size.

Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets

“…Fici and Gawrychowski [32] showed an optimal O(N + |MAW(T )|)-time algorithm for computing all MAWs for a rooted tree T of size N in the case of integer alphabets. It is known that the DAWG of a tree of size N can have Ω(N 2 ) edges while its number of nodes is still O(N ) [33,34]. Instead of explicitly building the DAWG for T , the algorithm of Fici and Gawrychowski [32] simulates DAWG transitions by cleverly using lowest common ancestor queries on the suffix tree of the reversed input tree T .…”