The discretizable molecular distance geometry problem
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Andrea Grosso & Marco Locatelli & Fabio Schoen, 2009. "Solving molecular distance geometry problems by global optimization algorithms," Computational Optimization and Applications, Springer, vol. 43(1), pages 23-37, May.
CitationsCitations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
- Virginia Costa & Antonio Mucherino & Carlile Lavor & Andrea Cassioli & Luiz Carvalho & Nelson Maculan, 2014. "Discretization orders for protein side chains," Journal of Global Optimization, Springer, vol. 60(2), pages 333-349, October.
- repec:spr:jglopt:v:69:y:2017:i:3:d:10.1007_s10898-016-0493-6 is not listed on IDEAS
More about this item
KeywordsDistance geometry; Branch-and-prune; Molecular conformation; Protein; NMR;
StatisticsAccess and download statistics
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:coopap:v:52:y:2012:i:1:p:115-146. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: http://www.springer.com .