activity
20092026
most citedInverse Lyndon words and Inverse Lyndon factorizations of words

20 citations · 38 across the 8 of their papers we have counts for

collaborators

9 papers

cs.DS2026

The Inverse Lyndon Array

Clelia De Felice, Pietro Negri, Manuel Sica +2

The Lyndon array stores, at each position of a word, the length of the longest Lyndon factor starting at that position and plays an important role in combinatorics on words, for ex…

cs.DS2026

The Inverse Lyndon Array: Definition, Properties, and Linear-Time Construction

Pietro Negri, Manuel Sica, Rocco Zaccagnino +1

The Lyndon array stores, at each position of a word, the length of the longest maximal Lyndon subword starting at that position, and plays an important role in combinatorics on wor…

cs.FL2024

Unveiling the connection between the Lyndon factorization and the Canonical Inverse Lyndon factorization via a border property

Paola Bonizzoni, Clelia De Felice, Brian Riccardi +2

The notion of Lyndon word and Lyndon factorization has shown to have unexpected applications in theory as well in developing novel algorithms on words. A counterpart to these notio…

math.CO2024

From the Lyndon factorization to the Canonical Inverse Lyndon factorization: back and forth

Paola Bonizzoni, Clelia De Felice, Rocco Zaccagnino +1

The notion of inverse Lyndon word is related to the classical notion of Lyndon word. More precisely, inverse Lyndon words are all and only the nonempty prefixes of the powers of th…

q-bio.GN2022★ 7 cited

Numeric Lyndon-based feature embedding of sequencing reads for machine learning approaches

Paola Bonizzoni, Matteo Costantini, Clelia De Felice +7

Feature embedding methods have been proposed in literature to represent sequences as numeric vectors to be used in some bioinformatics investigations, such as family classification…

cs.FL2019★ 6 cited

Lyndon words versus inverse Lyndon words: queries on suffixes and bordered words

Paola Bonizzoni, Clelia De Felice, Rocco Zaccagnino +1

Lyndon words have been largely investigated and showned to be a useful tool to prove interesting combinatorial properties of words. In this paper we state new properties of both Ly…

cs.FL2017★ 20 cited

Inverse Lyndon words and Inverse Lyndon factorizations of words

Paola Bonizzoni, Clelia De Felice, Rocco Zaccagnino +1

Motivated by applications to string processing, we introduce variants of the Lyndon factorization called inverse Lyndon factorizations. Their factors, named inverse Lyndon words, a…

cs.FL2015★ 2 cited

Splicing Systems from Past to Future: Old and New Challenges

Luc Boasson, Paola Bonizzoni, Clelia De Felice +4

A splicing system is a formal model of a recombinant behaviour of sets of double stranded DNA molecules when acted on by restriction enzymes and ligase. In this survey we will conc…

cs.FL2009★ 3 cited

Circular Languages Generated by Complete Splicing Systems and Pure Unitary Languages

Paola Bonizzoni, Clelia De Felice, Rosalba Zizza

Circular splicing systems are a formal model of a generative mechanism of circular words, inspired by a recombinant behaviour of circular DNA. Some unanswered questions are related…