default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDClelia de Felice
Person information
- affiliation: University of Salerno, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c23]Rocco Zaccagnino, Clelia De Felice, Marco Russo, Rosalba Zizza:
Visual Insights in Human Cancer Mutational Patterns: Similarity-Based Cancer Classification Using Siamese Networks. BIOSTEC (1) 2024: 462-470- [c22]Paola Bonizzoni, Clelia De Felice, Brian Riccardi
, Rocco Zaccagnino, Rosalba Zizza:
Unveiling the Connection Between the Lyndon Factorization and the Canonical Inverse Lyndon Factorization via a Border Property. MFCS 2024: 31:1-31:14 - [i14]Paola Bonizzoni, Clelia De Felice, Rocco Zaccagnino, Rosalba Zizza:
From the Lyndon factorization to the Canonical Inverse Lyndon factorization: back and forth. CoRR abs/2404.17969 (2024) - [i13]Paola Bonizzoni, Clelia De Felice, Brian Riccardi, Rocco Zaccagnino, Rosalba Zizza:
Unveiling the connection between the Lyndon factorization and the Canonical Inverse Lyndon factorization via a border property. CoRR abs/2406.18473 (2024) - 2023
- [j44]Clelia De Felice:
Finite Maximal Codes and Factorizations of Cyclic Groups. J. Autom. Lang. Comb. 28(4): 287-338 (2023) - 2022
- [j43]Paola Bonizzoni, Matteo Costantini, Clelia de Felice, Alessia Petescia, Yuri Pirola, Marco Previtali, Raffaella Rizzi, Jens Stoye, Rocco Zaccagnino, Rosalba Zizza:
Numeric Lyndon-based feature embedding of sequencing reads for machine learning approaches. Inf. Sci. 607: 458-476 (2022) - [c21]Paola Bonizzoni, Clelia De Felice, Yuri Pirola, Raffaella Rizzi, Rocco Zaccagnino, Rosalba Zizza:
Can Formal Languages Help Pangenomics to Represent and Analyze Multiple Genomes? DLT 2022: 3-12 - [i12]Clelia De Felice:
Finite maximal codes and factorizations of cyclic groups. CoRR abs/2202.09675 (2022) - [i11]Paola Bonizzoni, Matteo Costantini, Clelia De Felice, Alessia Petescia, Yuri Pirola, Marco Previtali, Raffaella Rizzi, Jens Stoye, Rocco Zaccagnino, Rosalba Zizza:
Numeric Lyndon-based feature embedding of sequencing reads for machine learning approaches. CoRR abs/2202.13884 (2022) - 2021
- [j42]Paola Bonizzoni, Clelia De Felice, Rocco Zaccagnino, Rosalba Zizza:
On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties. Theor. Comput. Sci. 862: 24-41 (2021) - [j41]Clelia De Felice, Rocco Zaccagnino, Rosalba Zizza:
Hybrid and generalized marked systems. Theor. Comput. Sci. 894: 79-90 (2021) - [c20]Paola Bonizzoni, Clelia De Felice, Alessia Petescia, Yuri Pirola, Raffaella Rizzi, Jens Stoye, Rocco Zaccagnino, Rosalba Zizza:
Can We Replace Reads by Numeric Signatures? Lyndon Fingerprints as Representations of Sequencing Reads for Machine Learning. AlCoB 2021: 16-28 - 2020
- [j40]Paola Bonizzoni, Clelia De Felice, Rocco Zaccagnino, Rosalba Zizza:
Unavoidable Sets, Prefix Graphs and Regularity of Circular Splicing Languages. Fundam. Informaticae 171(1-4): 81-95 (2020) - [j39]Clelia De Felice, Dominique Perrin, Antonio Restivo:
Aldo de Luca (1941-2018). Theor. Comput. Sci. 834: 1-2 (2020) - [c19]Paola Bonizzoni, Clelia De Felice, Rocco Zaccagnino, Rosalba Zizza:
Lyndon Words versus Inverse Lyndon Words: Queries on Suffixes and Bordered Words. LATA 2020: 385-396
2010 – 2019
- 2019
- [j38]Clelia De Felice, Gabriele Fici, Antonio Restivo:
Aldo de Luca (1941 - 2018). Bull. EATCS 127 (2019) - [i10]Paola Bonizzoni, Clelia De Felice, Rocco Zaccagnino, Rosalba Zizza:
Lyndon words versus inverse Lyndon words: queries on suffixes and bordered words. CoRR abs/1911.01851 (2019) - 2018
- [j37]Paola Bonizzoni, Clelia De Felice, Rocco Zaccagnino, Rosalba Zizza:
Inverse Lyndon words and inverse Lyndon factorizations of words. Adv. Appl. Math. 101: 281-319 (2018) - 2017
- [j36]Clelia De Felice, Roberto De Prisco, Delfina Malandrino, Gianluca Zaccagnino, Rocco Zaccagnino, Rosalba Zizza:
Splicing music composition. Inf. Sci. 385: 196-212 (2017) - [j35]Clelia De Felice, Rocco Zaccagnino, Rosalba Zizza:
Unavoidable sets and circular splicing languages. Theor. Comput. Sci. 658: 148-158 (2017) - [j34]Clelia De Felice, Sabrina Mantaci, Antonio Restivo:
On the decomposition of prefix codes. Theor. Comput. Sci. 664: 117-130 (2017) - [j33]Valérie Berthé, Clelia De Felice, Vincent Delecroix, Francesco Dolce, Julien Leroy, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone:
Specular sets. Theor. Comput. Sci. 684: 3-28 (2017) - [i9]Paola Bonizzoni, Clelia De Felice, Rocco Zaccagnino, Rosalba Zizza:
Inverse Lyndon words and Inverse Lyndon factorizations of words. CoRR abs/1705.10277 (2017) - 2016
- [i8]Clelia De Felice:
Some conjectures on codes. CoRR abs/1611.04580 (2016) - 2015
- [j32]Valérie Berthé, Clelia de Felice, Francesco Dolce, Julien Leroy, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone:
Maximal bifix decoding. Discret. Math. 338(5): 725-742 (2015) - [c18]Valérie Berthé, Clelia De Felice, Vincent Delecroix, Francesco Dolce, Julien Leroy, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone:
Specular Sets. WORDS 2015: 210-222 - [c17]Clelia De Felice, Roberto De Prisco, Delfina Malandrino, Gianluca Zaccagnino, Rocco Zaccagnino, Rosalba Zizza:
Chorale Music Splicing System: An Algorithmic Music Composer Inspired by Molecular Splicing. EvoMUSART 2015: 50-61 - [i7]Valérie Berthé, Clelia De Felice, Vincent Delecroix, Francesco Dolce, Julien Leroy, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone:
Specular sets. CoRR abs/1505.00707 (2015) - [i6]Luc Boasson, Paola Bonizzoni, Clelia De Felice, Isabelle Fagnot, Gabriele Fici, Rocco Zaccagnino, Rosalba Zizza:
Splicing Systems from Past to Future: Old and New Challenges. CoRR abs/1510.01574 (2015) - 2014
- [c16]Luc Boasson, Paola Bonizzoni, Clelia De Felice, Isabelle Fagnot, Gabriele Fici, Rocco Zaccagnino, Rosalba Zizza:
Splicing Systems from Past to Future: Old and New Challenges. Discrete Mathematics and Computer Science 2014: 51-76 - [c15]Clelia De Felice, Rocco Zaccagnino, Rosalba Zizza:
Unavoidable Sets and Regularity of Languages Generated by (1, 3)-Circular Splicing Systems. TPNC 2014: 169-180 - 2013
- [j31]Clelia De Felice:
A note on the factorization conjecture. Acta Informatica 50(7-8): 381-402 (2013) - [i5]Valérie Berthé, Clelia de Felice, Francesco Dolce, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone:
Return words in interval exchange transformations. CoRR abs/1305.0120 (2013) - [i4]Valérie Berthé, Clelia de Felice, Francesco Dolce, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone:
Bifix codes and the finite index basis property. CoRR abs/1305.0127 (2013) - [i3]Valérie Berthé, Clelia de Felice, Francesco Dolce, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone:
Bifix codes in acyclic sets. CoRR abs/1308.4260 (2013) - 2012
- [j30]Jean Berstel, Clelia de Felice, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone:
Recent results on syntactic groups of prefix codes. Eur. J. Comb. 33(7): 1386-1401 (2012) - [i2]Clelia de Felice:
A note on the factorization conjecture. CoRR abs/1205.2310 (2012) - 2011
- [j29]Arturo Carpi, Clelia de Felice:
Combinatorics on words. Theor. Comput. Sci. 412(27): 2909-2910 (2011) - 2010
- [j28]Paola Bonizzoni, Clelia de Felice, Gabriele Fici, Rosalba Zizza:
On the regularity of circular splicing languages: a survey and new developments. Nat. Comput. 9(2): 397-420 (2010) - [j27]Paola Bonizzoni, Clelia de Felice, Rosalba Zizza:
A characterization of (regular) circular languages generated by monotone complete splicing systems. Theor. Comput. Sci. 411(48): 4149-4161 (2010) - [i1]Jean Berstel, Clelia de Felice, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone:
Bifix codes and Sturmian words. CoRR abs/1011.5369 (2010)
2000 – 2009
- 2009
- [j26]Clelia de Felice, Gabriele Fici, Rosalba Zizza:
A characterization of regular circular languages generated by marked splicing systems. Theor. Comput. Sci. 410(47-49): 4937-4960 (2009) - [c14]Paola Bonizzoni, Clelia de Felice, Rosalba Zizza:
Circular Languages Generated by Complete Splicing Systems and Pure Unitary Languages. DCM 2009: 22-31 - 2007
- [j25]Clelia De Felice:
On factorizing codes: Structural properties and related decision problems. Adv. Appl. Math. 39(2): 173-196 (2007) - [j24]Clelia de Felice:
Finite Completions via Factorizing Codes. Int. J. Algebra Comput. 17(4): 715-760 (2007) - [c13]Clelia de Felice, Gabriele Fici, Rosalba Zizza:
Marked Systems and Circular Splicing. FCT 2007: 238-249 - 2006
- [j23]Paola Bonizzoni, Clelia de Felice, Giancarlo Mauri, Rosalba Zizza:
Linear splicing and syntactic monoid. Discret. Appl. Math. 154(3): 452-470 (2006) - [j22]Clelia de Felice, Antonio Restivo:
Preface. Int. J. Found. Comput. Sci. 17(3): 489-492 (2006) - [j21]Clelia de Felice:
On a complete set of operations for factorizing codes. RAIRO Theor. Informatics Appl. 40(1): 29-52 (2006) - 2005
- [j20]Paola Bonizzoni, Clelia de Felice, Giancarlo Mauri, Rosalba Zizza:
On the power of circular splicing. Discret. Appl. Math. 150(1-3): 51-66 (2005) - [j19]Paola Bonizzoni, Clelia de Felice, Rosalba Zizza:
The structure of reflexive regular splicing languages via Schützenberger constants. Theor. Comput. Sci. 334(1-3): 71-98 (2005) - [j18]Clelia de Felice:
An enhanced property of factorizing codes. Theor. Comput. Sci. 340(1): 240-256 (2005) - [c12]Paola Bonizzoni, Clelia de Felice, Giancarlo Mauri:
Recombinant DNA , Gene Splicing as Generative Devices of Formal Languages. CiE 2005: 65-67 - [e1]Clelia de Felice, Antonio Restivo:
Developments in Language Theory, 9th International Conference, DLT 2005, Palermo, Italy, July 4-8, 2005, Proceedings. Lecture Notes in Computer Science 3572, Springer 2005, ISBN 3-540-26546-5 [contents] - 2004
- [j17]Paola Bonizzoni, Clelia de Felice, Giancarlo Mauri, Rosalba Zizza:
Circular splicing and regularity. RAIRO Theor. Informatics Appl. 38(3): 189-228 (2004) - 2003
- [c11]Paola Bonizzoni, Clelia de Felice, Giancarlo Mauri, Rosalba Zizza:
Regular Languages Generated by Reflexive Finite Splicing Systems. Developments in Language Theory 2003: 134-145 - 2002
- [c10]Paola Bonizzoni, Clelia de Felice, Giancarlo Mauri, Rosalba Zizza:
Decision Problems for Linear and Circular Splicing Systems. Developments in Language Theory 2002: 78-92 - 2001
- [j16]Clelia de Felice:
On Some Schützenberger Conjectures. Inf. Comput. 168(2): 144-155 (2001) - 2000
- [c9]Paola Bonizzoni, Clelia de Felice, Giancarlo Mauri, Rosalba Zizza:
DNA and Circular Splicing. DNA Computing 2000: 117-129 - [c8]Clelia de Felice:
Factorizing Codes and Schützenberger Conjectures. MFCS 2000: 295-303
1990 – 1999
- 1999
- [j15]Clelia de Felice:
On a Property of the Factorizing Codes. Int. J. Algebra Comput. 9(3-4): 325-346 (1999) - [j14]Véronique Bruyère, Clelia de Felice:
On the Existence of Codings Between Trace Monoids. J. Autom. Lang. Comb. 4(2): 87-100 (1999) - [j13]Clelia de Felice:
Hajós Factorizations of Cyclic Groups - A Simpler Proof of a Characterization. J. Autom. Lang. Comb. 4(2): 111-116 (1999) - 1996
- [j12]Véronique Bruyère, Clelia de Felice:
Any Lifting of a Trace Coding is a Word Coding. Inf. Comput. 130(2): 183-193 (1996) - [j11]Clelia de Felice:
An Application of Hajós Factorizations to Variable-Length Codes. Theor. Comput. Sci. 164(1&2): 223-252 (1996) - 1995
- [j10]Véronique Bruyère, Clelia de Felice:
Synchronization and decomposability for a family of codes: Part 2. Discret. Math. 140(1-3): 47-77 (1995) - [j9]Véronique Bruyère, Clelia de Felice, Giovanna Guaiana:
On Some Decision Problems for Trace Codings. Theor. Comput. Sci. 148(2): 227-260 (1995) - [c7]Véronique Bruyère, Clelia de Felice:
Coding and Strong Coding in Trace Monoids. STACS 1995: 373-384 - 1994
- [c6]Véronique Bruyère, Clelia de Felice, Giovanna Guaiana:
Coding with Traces. STACS 1994: 353-364 - 1993
- [j8]Clelia de Felice:
A partial result about the factorization conjecture for finite variable-length codes. Discret. Math. 122(1-3): 137-152 (1993) - 1992
- [j7]Véronique Bruyère, Clelia de Felice:
Synchronization and Decomposability for a Family of Codes. Int. J. Algebra Comput. 2(4): 367-394 (1992) - [c5]Clelia de Felice:
On the Factorization Conjecture. STACS 1992: 545-556 - 1991
- [c4]Véronique Bruyère, Clelia de Felice:
Degree and Decomposability of Variable-Length Codes. ICALP 1991: 575-587
1980 – 1989
- 1989
- [j6]Clelia de Felice:
Construction of a Family of Finite Maximal Codes. Theor. Comput. Sci. 63(2): 157-184 (1989) - 1988
- [j5]Clelia de Felice:
On the finite completion of codes. Bull. EATCS 34: 52-54 (1988) - [j4]Clelia de Felice:
Finite Biprefix Sets of Paths in a Graph. Theor. Comput. Sci. 58: 103-128 (1988) - [c3]Clelia de Felice:
Construction of a Family of Finite Maximal Codes. STACS 1988: 159-169 - 1986
- [c2]Clelia de Felice:
Finite Biprefix Sets of Path in a Graph. ICALP 1986: 89-94 - 1985
- [j3]Clelia de Felice, Antonio Restivo:
Some Results On Finite Maximal Codes. RAIRO Theor. Informatics Appl. 19(4): 383-403 (1985) - [j2]Clelia de Felice:
Construction de Codes Factorisants. Theor. Comput. Sci. 36: 99-108 (1985) - [c1]Clelia de Felice:
Construction of a Family of Factorizing Codes. STACS 1985: 80-86 - 1982
- [j1]Clelia de Felice:
On the Triangle Conjecture. Inf. Process. Lett. 14(5): 197-200 (1982)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:59 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
