Zobrazeno 1 - 10
of 101
pro vyhledávání: '"Clelia De Felice"'
Publikováno v:
Theoretical Computer Science. 894:79-90
The circular splicing operation is a language-theoretic operation introduced by Head to model biological phenomena on circular DNA and RNAs. It acts on pairs of circular words under conditions defined by a set of rules. A circular splicing system S i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2499c89c0b4c63402002ba208745c60c
https://doi.org/10.1016/j.tcs.2021.08.037
https://doi.org/10.1016/j.tcs.2021.08.037
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 9, Iss Proc. DCM 2009, Pp 22-31 (2009)
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 to the computational power of such systems, and finding a characteriz
Externí odkaz:
https://doaj.org/article/5d1305ae837641d4811fa6a5a5cf21a6
Autor:
Paola Bonizzoni, Alessia Petescia, Rosalba Zizza, Rocco Zaccagnino, Raffaella Rizzi, Jens Stoye, Clelia De Felice, Yuri Pirola
Publikováno v:
ORCID
BOA-Bicocca Open Archive
Publications at Bielefeld University
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Algorithms for Computational Biology
Algorithms for Computational Biology (AlCoB 2021)
Algorithms for Computational Biology ISBN: 9783030744311
AlCoB
PUB-Publications at Bielefeld University
BOA-Bicocca Open Archive
Publications at Bielefeld University
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Algorithms for Computational Biology
Algorithms for Computational Biology (AlCoB 2021)
Algorithms for Computational Biology ISBN: 9783030744311
AlCoB
PUB-Publications at Bielefeld University
Representations of biological sequences facilitating sequence comparison are crucial in several bioinformatics tasks. Recently, the Lyndon factorization has been proved to preserve common factors in overlapping reads, thus leading to the idea of usin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4458c18e31d61dc5ddf9e2736d550dc9
The Lyndon factorization of a word has been largely studied and recently variants of it have been introduced and investigated with different motivations. In particular, the canonical inverse Lyndon factorization ICFL ( w ) of a word w, introduced in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4b42387ffbeac6ea627a315f34b3782f
http://hdl.handle.net/10281/295802
http://hdl.handle.net/10281/295802
Circular splicing systems are a mathematical model, inspired by a recombinant behaviour of circular DNA. They are defined by a finite alphabet A, an initial set I of circular words, and a set R of rules. A circular splicing language is a language gen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::91bf0af12088b8a9e3d806839ea7f334
http://hdl.handle.net/11386/4729300
http://hdl.handle.net/11386/4729300
Autor:
Roberto De Prisco, Rosalba Zizza, Clelia De Felice, Gianluca Zaccagnino, Rocco Zaccagnino, Delfina Malandrino
Publikováno v:
Information Sciences. :196-212
Splicing systems were introduced by Tom Head (1987) as a formal model of a recombination process between DNA molecules. The existing literature on splicing systems mainly focuses on the computational power of these systems and on the properties of th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::298c5b36b6a4b1986a17b6129d754ed9
https://doi.org/10.1016/j.ins.2017.01.004
https://doi.org/10.1016/j.ins.2017.01.004
Publikováno v:
Language and Automata Theory and Applications
Language and Automata Theory and Applications ISBN: 9783030406073
LATA
Language and Automata Theory and Applications ISBN: 9783030406073
LATA
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9868d9a44eb1b2cac77b2f4c3509ee86
In this paper we focus on the decomposition of rational and maximal prefix codes. We present an effective procedure that allows us to decide whether such a code is decomposable. In this case, the procedure also produces the factors of some of its dec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::194941261edb11160858994306c71c10
http://hdl.handle.net/10447/230629
http://hdl.handle.net/10447/230629
Publikováno v:
European Journal of Combinatorics
European Journal of Combinatorics, Elsevier, 2012, 33 (7), pp.1386-1401
European Journal of Combinatorics, 2012, 33 (7), pp.1386-1401
European Journal of Combinatorics, Elsevier, 2012, 33 (7), pp.1386-1401
European Journal of Combinatorics, 2012, 33 (7), pp.1386-1401
International audience; We give a simplified presentation of groups in transformation monoids. We use this presentation to describe two recent results on syntactic groups of prefix codes. The first one uses Sturmian words to build finite bifix codes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::929325e617d866daace4311d981b4f38
https://doi.org/10.1016/j.ejc.2012.03.004
https://doi.org/10.1016/j.ejc.2012.03.004