Skip to Main content Skip to Navigation
Theses

Formalisme CSP (Constraint Satisfaction Problem) et localisation de motifs structurés dans les textes génomiques

Abstract : Searching RNA genes occurrences in genomic sequences is a task which
importance has been renewed by the recent discovery of numerous
fonctional RNA, often interacting with other ligands.

The constraints network formalism is well adapted to this task, for
molecules modeling as well as for the algorithmic developments it
allows. After an analysis and comparison of existing tools within the
framework of constraints networks, we show how the join use of
constraints networks solving techniques and "pattern macthing"
algorithms and data structures allows to model and efficiently search
interacting structured motifs (with numerous genomic sequences
interferring simultaneously).
Document type :
Theses
Domain :
Complete list of metadatas

Cited literature [47 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-00011452
Contributor : Patricia Thebault <>
Submitted on : Tuesday, January 24, 2006 - 11:54:08 AM
Last modification on : Friday, April 10, 2020 - 10:02:42 AM
Long-term archiving on: : Saturday, April 3, 2010 - 7:31:51 PM

Identifiers

  • HAL Id : tel-00011452, version 1

Collections

Citation

Patricia Thebault. Formalisme CSP (Constraint Satisfaction Problem) et localisation de motifs structurés dans les textes génomiques. domain_other. Université Paul Sabatier - Toulouse III, 2004. Français. ⟨tel-00011452⟩

Share

Metrics

Record views

379

Files downloads

348