The paper presents an algorithm to propagate an n-ary constraint (with n greater than 2) specifying the relative positions of points in a three-dimensional rigid group. The variables to restrict are the positions (x, y, and z coordinates) of the points, and we assume the variable domains are cuboids, with the faces orthogonal to the coordinate axes. This algorithm is part of PSICO (Processing Structural Information with Constraint programming and Optimisation), a method we are developing to integrate experimental and theoretical data to solve protein structures [1,2]. We also present some preliminary results, and explain how this algorithm can be used to combine theoretical information such as secondary structure prediction or homology modelling with Nuclear Magnetic Resonance (NMR) data. © Springer-Verlag 2003.
CITATION STYLE
Krippahl, L., & Barahona, P. (2003). Propagating N-Ary rigid-body constraints. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2833, 452–465. https://doi.org/10.1007/978-3-540-45193-8_31
Mendeley helps you to discover research relevant for your work.