Zobrazeno 1 - 10
of 174
pro vyhledávání: '"Felice, Clelia"'
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 notions are those of inverse Lyndon word and inverse Lyndon factorization.
Externí odkaz:
http://arxiv.org/abs/2406.18473
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 the anti-Lyndon words, where an anti-Lyndon word with respect to a lexic
Externí odkaz:
http://arxiv.org/abs/2404.17969
Autor:
Bonizzoni, Paola, Costantini, Matteo, De Felice, Clelia, Petescia, Alessia, Pirola, Yuri, Previtali, Marco, Rizzi, Raffaella, Stoye, Jens, Zaccagnino, Rocco, Zizza, Rosalba
Publikováno v:
Information Sciences 607 (2022) 458-476
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 and protein structure prediction. Recent theoretical results showed t
Externí odkaz:
http://arxiv.org/abs/2202.13884
Autor:
De Felice, Clelia
Publikováno v:
Journal of Automata, Languages and Combinatorics, Vol. 28, 2023
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, namely the factorization conjecture and the triangle conjecture, proposed b
Externí odkaz:
http://arxiv.org/abs/2202.09675
Publikováno v:
Theoretical Computer Science, 2020
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 Lyndon and inverse Lyndon factorizations of a word $w$, with the aim of
Externí odkaz:
http://arxiv.org/abs/1911.01851
Publikováno v:
Advances in Applied Mathematics, Vol. 101, pp. 281-319, 2018
Motivated by applications to string processing, we introduce variants of the Lyndon factorization called inverse Lyndon factorizations. Their factors, named inverse Lyndon words, are in a class that strictly contains anti-Lyndon words, that is Lyndon
Externí odkaz:
http://arxiv.org/abs/1705.10277
Publikováno v:
In Theoretical Computer Science 26 November 2021 894:79-90
Autor:
De Felice, Clelia
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 this paper we discuss this conjectures and their relations with factoriz
Externí odkaz:
http://arxiv.org/abs/1611.04580
Publikováno v:
In Theoretical Computer Science 16 March 2021 862:24-41
Autor:
Boasson, Luc, Bonizzoni, Paola, De Felice, Clelia, Fagnot, Isabelle, Fici, Gabriele, Zaccagnino, Rocco, Zizza, Rosalba
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 concentrate on a specific behaviour of a type of splicing systems, introdu
Externí odkaz:
http://arxiv.org/abs/1510.01574