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_other. Université Paul Sabatier - Toulouse III, 2004. French
Domain :


https://tel.archives-ouvertes.fr/tel-00011452
Contributor : Patricia Thebault <>
Submitted on : Tuesday, January 24, 2006 - 11:54:08 AM
Last modification on : Tuesday, January 24, 2006 - 2:12:30 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. French. <tel-00011452>

Export

Share

Metrics

Consultation de
la notice

117

Téléchargement du document

58