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

The article describes the structural and algorithmic relations betweenCartesian trees and Lyndon Trees. This leads to a uniform presentation of theLyndon table of a word corresponding to the Next Nearest Smaller table of asequence of numbers. It shows how to efficiently compute runs, that is, maximalperiodicities occurring in a word.

Cartesian trees and Lyndon trees