Left Lyndon tree construction

Tools

Badkobeh, Golnaz and Crochemore, Maxime. 2020. Left Lyndon tree construction. Prague Stringology, pp. 84-95. [Article]

Preview

Text
LeftLyndonTree_PSC20.pdf - Accepted Version
Available under License Creative Commons Attribution Non-commercial.
Download (232kB) | Preview

Official URL: http://www.stringology.org/event/2020/p08.html

Abstract or Description

We extend the left-to-right Lyndon factorisation of a word to the left Lyn-don tree construction of a Lyndon word. It yields an algorithm to sort the prefixes of a Lyndon word according to the infinite ordering defined by Dolce et al. (2019). A straightforward variant computes the left Lyndon forest of a word. All algorithms run in linear time on a general alphabet (letter-comparison model).

Item Type:

Article