Skip to Content

5 Results Found

  • Article
  • Open Access
6,315 Views
11 Pages

Lyndon Factorization Algorithms for Small Alphabets and Run-Length Encoded Strings

  • Sukhpal Singh Ghuman,
  • Emanuele Giaquinta and
  • Jorma Tarhio

21 June 2019

We present two modifications of Duval’s algorithm for computing the Lyndon factorization of a string. One of the algorithms has been designed for strings containing runs of the smallest character. It works best for small alphabets and it is able to s...

  • Article
  • Open Access
1 Citations
2,019 Views
9 Pages

27 December 2022

We evaluate the influence of different alphabet orderings on the Lyndon factorization of a string. Experiments with Pizza&Chili datasets show that for most alphabet reorderings, the number of Lyndon factors is usually small, and the length of the...

(This article belongs to the Section E1: Mathematics and Computer Science)
  • Feature Paper
  • Article
  • Open Access
2 Citations
1,554 Views
47 Pages

25 March 2025

The Burrows–Wheeler Transform (BWT) is a widely used reversible data compression method, forming the foundation of various compression algorithms and indexing structures. Prior research has analyzed the sensitivity of compression methods and re...

(This article belongs to the Section E: Applied Mathematics)
  • Article
  • Open Access
1 Citations
4,389 Views
33 Pages

Computing Maximal Lyndon Substrings of a String

  • Frantisek Franek and
  • Michael Liut

12 November 2020

There are two reasons to have an efficient algorithm for identifying all right-maximal Lyndon substrings of a string: firstly, Bannai et al. introduced in 2015 a linear algorithm to compute all runs of a string that relies on knowing all right-maxima...

(This article belongs to the Special Issue Combinatorial Methods for String Processing)