Application of maximal constraint satisfaction problems to RNA folding - INRAE - Institut national de recherche pour l’agriculture, l’alimentation et l’environnement Accéder directement au contenu
Proceedings/Recueil Des Communications Année : 1997

Application of maximal constraint satisfaction problems to RNA folding

Résumé

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.
Fichier non déposé

Dates et versions

hal-02835969 , version 1 (07-06-2020)

Identifiants

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

Citer

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⟩
8 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More