English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this paper, we present the first study of the computational complexity ofconverting an automata-based text index structure, called the Compact DirectedAcyclic Word Graph (CDAWG), of size $e$ for a text $T$ of length $n$ into othertext indexing structures for the same text, suitable for highly repetitivetexts: the run-length BWT of size $r$, the irreducible PLCP array of size $r$,and the quasi-irreducible LPF array of size $e$, as well as the lex-parse ofsize $O(r)$ and the LZ77-parse of size $z$, where $r, z \le e$. As mainresults, we showed that the above structures can be optimally computed fromeither the CDAWG for $T$ stored in read-only memory or its self-index versionof size $e$ without a text in $O(e)$ worst-case time and words of workingspace. To obtain the above results, we devised techniques for enumerating aparticular subset of suffixes in the lexicographic and text orders using theforward and backward search on the CDAWG by extending the results byBelazzougui et al. in 2015.

Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph