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/

Zendy Plus

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

Zendy Tools

Zendy Open

Let $S_{T}(k)$ denote the set of distinct substrings of length $k$ in astring $T$, then the $k$-th substring complexity is defined by its cardinality$|S_{T}(k)|$. Recently, $\delta = \max \{ |S_{T}(k)| / k : k \ge 1 \}$ is shownto be a good compressibility measure of highly-repetitive strings. In thispaper, given $T$ of length $n$ in the run-length compressed form of size $r$,we show that $\delta$ can be computed in $\mathit{C}_{\mathsf{sort}}(r, n)$time and $O(r)$ space, where $\mathit{C}_{\mathsf{sort}}(r, n) = O(\min (r\lg\lg r, r \lg_{r} n))$ is the time complexity for sorting $r$ $O(\lg n)$-bitintegers in $O(r)$ space in the Word-RAM model with word size $\Omega(\lg n)$.

Substring Complexities on Run-length Compressed Strings