Combinatoire and Bio-informatique : Comparaison de structures d'ARN et calcul de distances intergénomiques

Abstract : We present a set of results concerning two types of biological problems: (1) RNA structure comparison and (2) intergenomic distance computation con- sidering non trivial genomes. In this thesis, we determine the algorithmic complexity of a set of problems linked to either RNA structure comparison (edit distance, APS problem, 2-interval pattern extraction, RNA design), or genomic rearrangements (breakpoints and conserved intervals distances). For each studied problem, we try to find an exact and fast algorithm resolving it. If we do not find such an algorithm, we try to prove that it is impossible to find one. To do so, we prove that the corresponding problem is difficult. Finally, we continue the study of each difficult problem by proposing three types of results: (1) Approximation, (2) Parameterized complexity, (3) Heuris- tic. We use in this thesis notions of combinatorics, mathematics, graph theory and algorithmics.
Complete list of metadatas

Cited literature [113 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-00491593
Contributor : Guillaume Blin <>
Submitted on : Sunday, June 13, 2010 - 2:01:29 PM
Last modification on : Thursday, April 5, 2018 - 10:36:49 AM
Long-term archiving on : Friday, September 17, 2010 - 1:43:17 PM

Identifiers

  • HAL Id : tel-00491593, version 1

Collections

Citation

Guillaume Blin. Combinatoire and Bio-informatique : Comparaison de structures d'ARN et calcul de distances intergénomiques. Informatique [cs]. Université de Nantes, 2005. Français. ⟨tel-00491593⟩

Share

Metrics

Record views

453

Files downloads

940