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