The article describes the structural and algorithmic relations between Cartesian trees and Lyndon trees. This leads to a uniform presentation of the Lyndon table of a word corresponding to the Next Nearest Smaller table of a sequence of numbers. It shows how to efficiently compute runs, that is, maximal periodicities occurring in a word.

中文翻译：

---

笛卡尔树和林登树

本文介绍了笛卡尔树和Lyndon树之间的结构和算法关系。这导致统一显示单词的Lyndon表，该单词对应于数字序列的Next Nearest Smaller表。它显示了如何有效地计算游程，即单词中出现的最大周期性。