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

In this note, we studied the asymptotic behaviour of the length of thelongest common substring for run-length encoded sequences. When the originalsequences are generated by an $\alpha$-mixing process with exponential decay(or $\psi$-mixing with polynomial decay), we proved that this length growslogarithmically with a coefficient depending on the R\'enyi entropy of thepushforward measure. For Bernoulli processes and Markov chains, thiscoefficient is computed explicitly.

R\'enyi entropy and pattern matching for run-length encoded sequences