RNA Secondary Structure Determination and Representation Based on Constraints Satisfaction

Authors:
Christine Gaspin
Affiliations:
National Institute of Agronomical Research, Biometrics and Artificial Intelligence Department, Chemin de Borde-Rouge, Auzeville BP 27, 31326 Castanet-Tolosan, France christine.gaspin@toulo ...
Venue:
Constraints
Year:
2001

Citing 7
Cited 1

A sufficient condition for backtrack-bounded search

Journal of the ACM (JACM)
Network-based heuristics for constraint-satisfaction problems

Artificial Intelligence
Partial constraint satisfaction

Artificial Intelligence - Special volume on constraint-based reasoning
A Sufficient Condition for Backtrack-Free Search

Journal of the ACM (JACM)
Algorithm 457: finding all cliques of an undirected graph

Communications of the ACM
A Constraint Reasoning System for Automating Sequence-Specific Resonance Assignments from Multidimensional Protein NMR Spectra

Proceedings of the 1st International Conference on Intelligent Systems for Molecular Biology
Using inference to reduce arc consistency computation

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1

PSICO: Solving Protein Structures with Constraint Programming and Optimization

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

A characteristic common to several problems of molecular biology consists in the satisfaction of a set of constraints coming from different sources of biological knowledge. In this paper, we present two problems that take advantage of a constraint satisfaction formulation. The first problem deals with the representation and visualization of RNA secondary structures. The program RNASEARCH implements an original backtracking based algorithm that evaluates at each node the satisfaction of spatial constraints with the aim at drawing a representation without overlap between secondary structural elements. The second problem addresses the determination of RNA secondary structure in accordance with data. With the program SAPSSARN, the application of classic filtering algorithm is used and we discuss a new search algorithm which computes only so called saturated secondary structures. The main result certainly is the possibility to relax the constraint of the absence of secondary structural elements forbidden in secondary structures computed with dynamic programming based approaches: pseudoknots. Finally, we show how each program takes advantage from the other through a protocol driven by constraints.