Soutenance de Pierre Marcus
| When |
Jul 18, 2024
from 02:00 to 04:00 |
|---|---|
| Where | Salle des thèses |
| Contact Name | Pierre Marcus |
| Attendees |
Pierre Marcus |
| Add event to calendar |
vCal
iCal
|
The DNA computing field consists in using DNA as dynamic building blocks to implement small algorithms and effectively compute.
Many successful approaches were made, but all the current approaches face the challenge of scalability.
In this thesis, we want to solve this scalability issue on the particular problem of maze solving. This problem was already solved in both in a non-reversible and non-scalable fashion. We propose to implement a reversible random walk walker on a DNA origami. Our point is twofold. First, we can make a design with only four different strands, no matter the size of the maze. Most importantly, using reversibility is a key factor, as it can harness randomness to reverse hybridization errors.
In the first part, we conducted experiments where we attached static paths made of DNA strands on a DNA origami. We will validate our ability to both conduct, observe and process these experiments. In the second part, we propose an implementation of a reversible random walk using a variation of the toehold mediated strand displacement technique. We have conducted and developed experiments on this variation using a bottom-up approach. Our experiments led to preliminary results of the technique on a DNA origami.
The jury will be composed of:
- Yann PONTY Directeur de recherche Ecole Polytechnique (Rapporteur)
- Damien WOODS Professeur Maynooth University (Rapporteur)
- Jérémie CHALOPIN Directeur de recherche Aix Marseille Université (Examinateur)
- Cendrine MOSKALENKO Professeure des universités Ecole normale supérieure de Lyon (Examinatrice et co-encadrante)
- Raluca TIRON Directrice de recherche Université Grenoble Alpes (Examinatrice)
- Nicolas SCHABANEL Directeur de recherche Ecole normale supérieure de Lyon (Directeur de thèse)