Applying constraint programming to protein structure determination

in this paper, we propose a constraint-based approach to determining protein structures compatible with distance constraints obtained from Nuclear Magnetic Resonance (NMR) data. We compare the performance of our proposed algorithm with DYANA ("Dynamics algorithm for NMR applications" [1]) an existing commercial application based on simulated annealing. For our test case, computation time for DYANA was more than six hours, whereas the method we propose produced similar results in 8 minutes, so we show that the application of Constraint Programming (CP) technology can greatly reduce computation time. This is a major advantage because this NMR technique generally demands multiple runs of structural computation.