Accéder directement au contenu Accéder directement à la navigation
Direction d'ouvrage ou d'actes

Application of maximal constraint satisfaction problems to RNA folding

Abstract : The formalism of constraint satisfaction problems (CSP) applies very well in a number of various applications. However, when it is not possible to compute a complete assignment of variables, Partial CSP or dynamic CSP solving is the alternative. Generally, Branch Bound based algorithms allow to compute solutions maximizing requirements when a cost functiong is available. In this paper, we propose an efficient algorithm allowing to compute all the partial solutions of a CSP in which all the constraints are satisfied when a cost functiong is not available and a given subset of variables must appear in the final assignment. The algorithm is described and experimental results are given for RNA structure determination.
Type de document :
Direction d'ouvrage ou d'actes
Liste complète des métadonnées

https://hal.inrae.fr/hal-02835969
Déposant : Migration Prodinra <>
Soumis le : dimanche 7 juin 2020 - 10:41:15
Dernière modification le : jeudi 16 juillet 2020 - 11:58:02

Identifiants

  • HAL Id : hal-02835969, version 1
  • PRODINRA : 135912

Collections

Citation

Christine Gaspin, J.C. Régin. Application of maximal constraint satisfaction problems to RNA folding. Workshop on Constraints and Bioinformatics/Biocomputing, Oct 1997, Austria. 12 p., 1997. ⟨hal-02835969⟩

Partager

Métriques

Consultations de la notice

2