56 citations · 87 across the 13 of their papers we have counts for
16 papers
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…
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…
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…
Finite maximal codes and factorizations of cyclic groups
Clelia De Felice
Variable-length codes are the bases of the free submonoids of a free monoid. There are some important longstanding open questions about the structure of finite maximal codes, namel…
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…
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…
Some conjectures on codes
Clelia De Felice
Variable-length codes are the bases of the free submonoids of a free monoid. There are some important longstanding open questions about the structure of finite maximal codes. In th…
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…
Specular sets
Valérie Berthé, Clelia De Felice, Vincent Delecroix +5
We introduce the notion of specular sets which are subsets of groups called here specular and which form a natural generalization of free groups. These sets are an abstract general…
Bifix codes and interval exchanges
Valérie Berthé, Clelia De Felice, Francesco Dolce +4
We investigate the relation between bifix codes and interval exchange transformations. We prove that the class of natural codings of regular interval echange transformations is clo…
Notes on sets of first return
Valérie Berthé, Clelia De Felice, Francesco Dolce +3
We prove in this note that, for an alphabet with three letters, the set of first return to a given word in a set satisfying the tree condition is a basis of the free group.
Maximal bifix decoding
Valérie Berthé, Clelia De Felice, Francesco Dolce +4
We introduce a class of sets of words which is a natural common generalization of Sturmian sets and of interval exchange sets. This class of sets consists of the uniformly recurren…
Acyclic, connected and tree sets
Valerie Berthé, Clelia De Felice, Francesco Dolce +4
Given a set of words, one associates to each word in an undirected graph, called its extension graph, and which describes the possible extensions of on the left and…
The finite index basis property
Valérie Berthé, Clelia De Felice, Francesco Dolce +4
We describe in this paper a connection between bifix codes, symbolic dynamical systems and free groups. This is in the spirit of the connection established previously for the symbo…
A note on the factorization conjecture
Clelia De Felice
We give partial results on the factorization conjecture on codes proposed by Schutzenberger. We consider finite maximal codes C over the alphabet A = {a, b} with C \cap a^* = a^p,…
Bifix codes and Sturmian words
Jean Berstel, Clelia De Felice, Dominique Perrin +2
We prove new results concerning the relation between bifix codes, episturmian words and subgroups offree groups. We study bifix codes in factorial sets of words. We generalize most…