On suitable orders for discretizing Molecular Distance Geometry problems related to protein side chains

2012 Federated Conference on Computer Science and Information Systems, FedCSIS 2012

Volumn , Issue , 2012, Pages 379-384

  Costa, Virginia ^a   Mucherino, Antonio ^b   Lavor, Carlile ^c   Carvalho, Luiz M ^d   MacUlan, Nelson ^a  

^a FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^b UNIVERSITÉ DE RENNES 1   (France)

^c UNIVERSITY OF CAMPINAS   (Brazil)

^d STATE UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

BP ALGORITHM; COMPUTATIONAL EXPERIMENT; DISCRETIZATIONS; DISTANCE CONSTRAINTS; MOLECULAR DISTANCE GEOMETRY PROBLEM; PROTEIN BACKBONE; SCIENTIFIC LITERATURE; SIDE-CHAINS; TREE SEARCH;

AMINO ACIDS; COMPUTER SCIENCE; CONFORMATIONS; EXPERIMENTS; INFORMATION SYSTEMS;

PROTEINS;

EID: 84872556392     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. H. Berman, J. Westbrook, Z. Feng, G. Gilliland, T. Bhat, H. Weissig, I. Shindyalov, P. Bourne, The Protein Data Bank, Nucleic Acids Research 28, 235-242, 2000.
2. G. Crippen and T. Havel, Distance Geometry and Molecular Conforma-tion, John Wiley & Sons, New York, 1988.
3. C. Lavor, L. Liberti, N. Maculan, A. Mucherino, The Discretizable Molecular Distance Geometry Problem, Computational Optimization and Applications 52, 115-146, 2012.
4. C. Lavor, L. Liberti, N. Maculan, A. Mucherino, Recent Advances on the Discretizable Molecular Distance Geometry Problem, European Journal of Operational Research 219, 698-706, 2012.
5. C. Lavor, L. Liberti, A. Mucherino, The interval Branch-and-Prune Algorithm for the Discretizable Molecular Distance Geometry Problem with Inexact Distances, to appear in Journal of Global Optimization, 2011.
6. L. Liberti, C. Lavor, N. Maculan, A Branch-and-Prune Algorithm for the Molecular Distance Geometry Problem, International Transactions in Operational Research 15, 1-17, 2008.
7. L. Liberti, C. Lavor, A. Mucherino, N. Maculan, Molecular Distance Geometry Methods: from Continuous to Discrete, International Transactions in Operational Research 18, 33-51, 2010.
8. L. Liberti, B. Masson, C. Lavor, A. Mucherino, Branch-and-Prune Trees with Bounded Width, Proceedings of the 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW11), Rome, Italy, 189-193, 2011.
9. M. Nilges, A. Gronenborn, A. Brunger, G. Clore, Determination of Three-Dimensional Structures of Proteins by Simulated Annealing with Interproton Distance Restraints. Application to Crambin, Potato Carboxypeptidase Inhibitor and Barley Serine Proteinase Inhibitor 2, Protein Engineering 2, 27-38, 1988.
10. J. More, Z. Wu, Distance Geometry Optimization for Protein Structures, Journal of Global Optimization 15, 219-234, 1999.
11. A. Mucherino, C. Lavor, T. Malliavin, L. Liberti, M. Nilges, N. Maculan, Influence of Pruning Devices on the Solution of Molecular Distance Geometry Problems. In: P.M. Pardalos and S. Rebennack (Eds.), Lecture Notes in Computer Science 6630, Proceedings of the 10th International Symposium on Experimental Algorithms (SEA11), Crete, Greece, 206-217, 2011.
12. J. Saxe, Embeddability of Weighted Graphs in k-Space is Strongly NP-hard, Proceedings of 17th Allerton Conference in Communications, Control and Computing, 480-489, 1979.