DeepAI AI Chat
Log In Sign Up

Practical evaluation of Lyndon factors via alphabet reordering

08/11/2021
by   Marcelo K. Albertini, et al.
UFU
0

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 longest Lyndon factor can be as large as the input string, which is unfavorable for algorithms and indexes that depend on the number of Lyndon factors. We present results with randomized alphabet permutations that can be used as a baseline to assess the effectiveness of heuristics and methods designed to modify the Lyndon factorization of a string via alphabet reordering.

READ FULL TEXT
02/10/2020

Palindromic k-Factorization in Pure Linear Time

Given a string s of length n over a general alphabet and an integer k, t...
06/15/2018

Enhanced string factoring from alphabet orderings

In this note we consider the concept of alphabet ordering in the context...
02/14/2023

Compressibility-Aware Quantum Algorithms on Strings

Sublinear time quantum algorithms have been established for many fundame...
06/02/2021

Counting Lyndon Subsequences

Counting substrings/subsequences that preserve some property (e.g., pali...
06/24/2019

Dynamic Palindrome Detection

Lately, there is a growing interest in dynamic string matching problems....
04/03/2020

Enumeration of LCP values, LCP intervals and Maximal repeats in BWT-runs Bounded Space

Lcp-values, lcp-intervals, and maximal repeats are powerful tools in var...
01/08/2021

Cantor Mapping Technique

A new technique specific to String ordering utilizing a method called "C...