A constraint solver for discrete lattices, its parallelization, and application to protein structure prediction

Authors:
Alessandro Dal Palù;Agostino Dovier;Enrico Pontelli
Affiliations:
Dip. Matematica, Università di Parma, Parco Area delle Scienze 53/A, Parma 43100, Italy;Dip. Informatica, Università di Udine, Via delle Scienze 206, Udine 33100, Italy;Department of Computer Science, New Mexico State University, Box 30001, MSC CS, Las Cruces, NM 88003, U.S.A.
Venue:
Software—Practice & Experience
Year:
2007

Citing 0
Cited 9

Logic Programming Techniques in Protein Structure Determination: Methodologies and Results

LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Computing approximate solutions of the protein structure determination problem using global constraints on discrete crystal lattices

International Journal of Data Mining and Bioinformatics
An overview of AI research in Italy

Artificial intelligence
Clp-based protein fragment assembly*

Theory and Practice of Logic Programming
25 years of applications of logic programming in Italy

A 25-year perspective on logic programming
A memetic approach to protein structure prediction in triangular lattices

ICONIP'11 Proceedings of the 18th international conference on Neural Information Processing - Volume Part I
Memory-based local search for simplified protein structure prediction

Proceedings of the ACM Conference on Bioinformatics, Computational Biology and Biomedicine
A filtering technique for fragment assembly- based proteins loop modeling with constraints

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
A constraint solver for flexible protein models

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents the design, implementation and application of a constraint programming framework on 3D crystal lattices. The framework provides the flexibility to express and resolve constraints dealing with structural relationships of entities placed in a 3D lattice structure in space. Both sequential and parallel implementations of the framework are described, along with experiments that highlight its superior performance with respect to the use of more traditional frameworks (e.g. constraints on finite domains and integer programming) to model lattice constraints. The framework is motivated and applied to address the problem of solving the protein folding prediction problem, i.e. predicting the 3D structure of a protein from its primary amino acid sequence. Results and comparison with performance of other constraint-based solutions to this problem are presented. Copyright © 2007 John Wiley & Sons, Ltd.