| Article ID: | iaor2007231 |
| Country: | United States |
| Volume: | 16 |
| Issue: | 4 |
| Start Page Number: | 393 |
| End Page Number: | 405 |
| Publication Date: | Sep 2004 |
| Journal: | INFORMS Journal On Computing |
| Authors: | Andonov Rumen, Balev Stefan, Yanev Nicola |
| Keywords: | networks, programming: integer |
This paper presents a new network-flow formulation for the problem of predicting 3D protein structures using threading. Several integer-programming models based on this formulation are proposed and compared. These models allow for an efficient decomposition and for the application of a parallel branch-and-cut algorithm, significantly reducing the running time. The efficiency of our approach has been confirmed by extensive computational experiments.