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

We introduce the Longest Common Circular Factor (LCCF) problem in which,given strings $S$ and $T$ of length $n$, we are to compute the longest factorof $S$ whose cyclic shift occurs as a factor of $T$. It is a new similaritymeasure, an extension of the classic Longest Common Factor. We show how tosolve the LCCF problem in $O(n \log^5 n)$ time.

Quasi-Linear-Time Algorithm for Longest Common Circular Factor