<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Projects | Paolo Dalena</title><link>https://paolodalena.netlify.app/project/</link><atom:link href="https://paolodalena.netlify.app/project/index.xml" rel="self" type="application/rss+xml"/><description>Projects</description><generator>Wowchemy (https://wowchemy.com)</generator><language>en-us</language><copyright>© Paolo Dalena 2026</copyright><lastBuildDate>Thu, 06 Jan 2022 00:00:00 +0000</lastBuildDate><image><url>https://paolodalena.netlify.app/images/icon_hu1791761c199c9dfcb49e5647c6a0d6e0_1206873_512x512_fill_lanczos_center_2.png</url><title>Projects</title><link>https://paolodalena.netlify.app/project/</link></image><item><title>{betteRCV}</title><link>https://paolodalena.netlify.app/project/bettercv/</link><pubDate>Thu, 06 Jan 2022 00:00:00 +0000</pubDate><guid>https://paolodalena.netlify.app/project/bettercv/</guid><description/></item><item><title>Master Thesis</title><link>https://paolodalena.netlify.app/project/master_thesis/</link><pubDate>Sun, 10 Oct 2021 00:00:00 +0000</pubDate><guid>https://paolodalena.netlify.app/project/master_thesis/</guid><description>&lt;p>This work is the result of a collaboration with the &lt;a href="https://www.cammbio.hs-mannheim.de/institute.html" target="_blank" rel="noopener">Institute of Mathematical Biology&lt;/a> (Department of Computer Science, &lt;a href="https://www.english.hs-mannheim.de/the-university.html" target="_blank" rel="noopener">Mannheim University of Applied Sciences&lt;/a>) and &lt;a href="https://www.unibo.it/sitoweb/simone.giannerini/en" target="_blank" rel="noopener">Professor Simone Giannerini&lt;/a> from the University of Bologna.&lt;/p>
&lt;p>This research has been going on for several years, is constantly evolving and covers many different fields. So, the results in my thesis are just one step.
If you are curious, you can read the &lt;a href="https://www.nature.com/articles/s41598-021-87534-y" target="_blank" rel="noopener">article&lt;/a> presenting the results immediately preceding my work that guided us in our analysis. For further information, please refer to the bibliography of the dissertation.&lt;/p>
&lt;p>Click &lt;a href="https://paolodalena.netlify.app/uploads/mscth.pdf" target="_blank">here&lt;/a> to download the pdf file. If you&amp;rsquo;re interested in further material related to this topic, don&amp;rsquo;t hesitate to contact me!&lt;/p>
&lt;h2 id="abstract">ABSTRACT:&lt;/h2>
&lt;p>The presence of error correction mechanisms involved in translation has been ascertained but
their elucidation requires a mathematical framework which is still missing. Comma-free codes are
synchronizable error correcting codes that were introduced by Sir Francis Crick in 1957 to tackle
the difficult problem of frame retrieval during translation. Despite its appeal the proposal was
discarded but in 1996, thanks to a large scale exploratory analysis of coding sequences, a weaker
form of comma-free codes, called circular codes, were hypothesized to be involved in the translation
machinery. Recent works established a connection between circular codes and group theory and
identified a set of 216 circular codes possessing desirable mathematical properties. These, in turn,
can be partitioned into 27 equivalence classes according to the 8 nucleotide transformations linked
to the dihedral group of symmetry. The coverage of a circular code is a measure of its compliance
with a specific sequence or organism. It has universal properties, is strongly correlated with
translation accuracy and behaves differently in the initial and final parts of the sequences. This
agrees with the molecular biology of the translation process and raises interesting questions. This
thesis moves from these results and studies both the codon usage and the code coverage in 24
different organisms. The analyses are carried out in the R environment and part of the work has
been devoted to collaborating at the development of the R package mathDNA, which implements
some of the functions used in the analysis. The results confirm the different behavior in terms of
code coverage and codon usage at the beginning and at the end of the sequences and proves that
there is a universal and complex relationship between the coverage of two sets of codes linked by
Keto-Amino transformation. The existence of a correlation between the length of a sequence and
the code coverage is also found.&lt;/p></description></item><item><title>{tastypie}</title><link>https://paolodalena.netlify.app/project/tastypie/</link><pubDate>Sat, 06 Feb 2021 00:00:00 +0000</pubDate><guid>https://paolodalena.netlify.app/project/tastypie/</guid><description/></item><item><title>Bachelor Thesis Book</title><link>https://paolodalena.netlify.app/project/bcs_thesis/</link><pubDate>Wed, 10 Jul 2019 00:00:00 +0000</pubDate><guid>https://paolodalena.netlify.app/project/bcs_thesis/</guid><description/></item></channel></rss>