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

A string $w$ is called a minimal absent word (MAW) for another string $T$ if$w$ does not occur in $T$ but the proper substrings of $w$ occur in $T$. Forexample, let $\Sigma = \{\mathtt{a, b, c}\}$ be the alphabet. Then, the set ofMAWs for string $w = \mathtt{abaab}$ is $\{\mathtt{aaa, aaba, bab, bb, c}\}$.In this paper, we study combinatorial properties of MAWs in the sliding windowmodel, namely, how the set of MAWs changes when a sliding window of fixedlength $d$ is shifted over the input string $T$ of length $n$, where $1 \leq d< n$. We present \emph{tight} upper and lower bounds on the maximum number ofchanges in the set of MAWs for a sliding window over $T$, both in the cases ofgeneral alphabets and binary alphabets. Our bounds improve on the previouslyknown best bounds [Crochemore et al., 2020].

Combinatorics of minimal absent words for a sliding window