Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Sue, Mizuki"'
In this paper, we present the first study of the computational complexity of converting an automata-based text index structure, called the Compact Directed Acyclic Word Graph (CDAWG), of size $e$ for a text $T$ of length $n$ into other text indexing
Externí odkaz:
http://arxiv.org/abs/2308.02269
