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

We show how, given a straight-line program with $g$ rules for a binary string$B$ of length $n$, in $O(g^{2 / 3} n^{4 / 3})$ time we can build a linear-spaceindex such that, given $m$ and $c$, in O(1) time we can determine whether thereis a substring of $B$ with length $m$ containing exactly $c$ copies of 1. If weuse $O(n \log n)$ space for the index, then we can list all such substringsusing $O(m)$ time per substring.

Grammar-Based Construction of Indexes for Binary Jumbled Pattern Matching