{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:39:35Z","timestamp":1725565175464},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642155819"},{"type":"electronic","value":"9783642155826"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15582-6_34","type":"book-chapter","created":{"date-parts":[[2010,9,10]],"date-time":"2010-09-10T09:15:44Z","timestamp":1284110144000},"page":"186-197","source":"Crossref","is-referenced-by-count":15,"title":["MD-jeep: An Implementation of a Branch and Prune Algorithm for Distance Geometry Problems"],"prefix":"10.1007","author":[{"given":"Antonio","family":"Mucherino","sequence":"first","affiliation":[]},{"given":"Leo","family":"Liberti","sequence":"additional","affiliation":[]},{"given":"Carlile","family":"Lavor","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1093\/nar\/28.1.235","volume":"28","author":"H.M. Berman","year":"2000","unstructured":"Berman, H.M., Westbrook, J., Feng, Z., Gilliland, G., Bhat, T.N., Weissig, H., Shindyalov, I.N., Bourne, P.E.: The Protein Data Bank. Nucleic Acids Research\u00a028, 235\u2013242 (2000)","journal-title":"Nucleic Acids Research"},{"key":"34_CR2","doi-asserted-by":"crossref","first-page":"461","DOI":"10.21914\/anziamj.v42i0.608","volume":"42","author":"I.D. Coope","year":"2000","unstructured":"Coope, I.D.: Reliable Computation of the Points of Intersection of n Spheres in n-space. ANZIAM Journal\u00a042, 461\u2013477 (2000)","journal-title":"ANZIAM Journal"},{"key":"34_CR3","doi-asserted-by":"publisher","first-page":"1251","DOI":"10.1137\/05062754X","volume":"30","author":"P. Biswas","year":"2008","unstructured":"Biswas, P., Toh, K.-C., Ye, Y.: A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation. SIAM Journal on Scientific Computing\u00a030, 1251\u20131277 (2008)","journal-title":"SIAM Journal on Scientific Computing"},{"key":"34_CR4","volume-title":"Distance Geometry and Molecular Conformation","author":"G.M. Crippen","year":"1988","unstructured":"Crippen, G.M., Havel, T.F.: Distance Geometry and Molecular Conformation. John Wiley & Sons, New York (1988)"},{"key":"34_CR5","first-page":"1701","volume-title":"Encyclopedia of Nuclear Magnetic Resonance","author":"T.F. Havel","year":"1995","unstructured":"Havel, T.F.: Distance Geometry. In: Grant, D.M., Harris, R.K. (eds.) Encyclopedia of Nuclear Magnetic Resonance, pp. 1701\u20131710. Wiley, New York (1995)"},{"key":"34_CR6","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1006\/jmbi.1996.0663","volume":"264","author":"M.E. Hodsdon","year":"1996","unstructured":"Hodsdon, M.E., Ponder, J.W., Cistola, D.P.: The NMR Solution Structure of Intestinal Fatty Acid-binding Protein Complexed with Palmitate: Application of a Novel Distance Geometry Algorithm. Journal of Molecular Biology\u00a0264, 585\u2013602 (1996)","journal-title":"Journal of Molecular Biology"},{"key":"34_CR7","unstructured":"Lavor, C., Liberti, L., Maculan, N.: Discretizable Molecular Distance Geometry Problem, Tech. Rep. q-bio.BM\/0608012, arXiv (2006)"},{"key":"34_CR8","first-page":"2305","volume-title":"Encyclopedia of Optimization","author":"C. Lavor","year":"2009","unstructured":"Lavor, C., Liberti, L., Maculan, N.: Molecular Distance Geometry Problem. In: Floudas, C., Pardalos, P. (eds.) Encyclopedia of Optimization, 2nd edn., pp. 2305\u20132311. Springer, New York (2009)","edition":"2"},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"Lavor, C., Mucherino, A., Liberti, L., Maculan, N.: Discrete Approaches for Solving Molecular Distance Geometry Problems using NMR Data. International Journal of Computational Biosciences (to appear 2010)","DOI":"10.2316\/J.2010.210-1025"},{"key":"34_CR10","doi-asserted-by":"crossref","unstructured":"Lavor, C., Mucherino, A., Liberti, L., Maculan, N.: Computing Artificial Backbones of Hydrogen Atoms in order to Discover Protein Backbones. In: IEEE Conference Proceedings, International Multiconference on Computer Science and Information Technology (IMCSIT 2009), Workshop on Computational Optimization (WCO 2009), Mragowo, Poland, pp. 751\u2013756 (2009)","DOI":"10.1109\/IMCSIT.2009.5352754"},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"Lavor, C., Mucherino, A., Liberti, L., Maculan, N.: An Artificial Backbone of Hydrogens for Finding the Conformation of Protein Molecules. In: Proceedings of the Computational Structural Bioinformatics Workshop (CSBW 2009), Washington DC, USA, pp. 152\u2013155 (2009)","DOI":"10.1109\/BIBMW.2009.5332119"},{"issue":"1","key":"34_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1111\/j.1475-3995.2007.00622.x","volume":"15","author":"L. Liberti","year":"2008","unstructured":"Liberti, L., Lavor, C., Maculan, N.: A Branch-and-Prune Algorithm for the Molecular Distance Geometry Problem. International Transactions in Operational Research\u00a015(1), 1\u201317 (2008)","journal-title":"International Transactions in Operational Research"},{"key":"34_CR13","doi-asserted-by":"crossref","unstructured":"Liberti, L., Lavor, C., Mucherino, A., Maculan, N.: Molecular Distance Geometry Methods: from Continuous to Discrete. International Transactions in Operational Research (to appear 2010)","DOI":"10.1111\/j.1475-3995.2009.00757.x"},{"key":"34_CR14","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1023\/A:1008380219900","volume":"15","author":"J.J. Mor\u00e9","year":"1999","unstructured":"Mor\u00e9, J.J., Wu, Z.: Distance Geometry Optimization for Protein Structures. Journal of Global Optimization\u00a015, 219\u2013223 (1999)","journal-title":"Journal of Global Optimization"},{"key":"34_CR15","unstructured":"Mucherino, A., Lavor, C.: The Branch and Prune Algorithm for the Molecular Distance Geometry Problem with Inexact Distances. In: Proceedings of World Academy of Science, Engineering and Technology (WASET), International Conference on Bioinformatics and Biomedicine (ICBB 2009), Venice, Italy, pp. 349\u2013353 (2009)"},{"key":"34_CR16","unstructured":"Mucherino, A., Lavor, C., Liberti, L.: The Discretizable Distance Geometry Problem. Optimization Letters (in revision)"},{"key":"34_CR17","doi-asserted-by":"crossref","unstructured":"Mucherino, A., Liberti, L., Lavor, C., Maculan, N.: Comparisons between an Exact and a MetaHeuristic Algorithm for the Molecular Distance Geometry Problem. In: ACM Conference Proceedings, Genetic and Evolutionary Computation Conference (GECCO 2009), Montr\u00e9al, Canada, pp. 333\u2013340 (2009)","DOI":"10.1145\/1569901.1569948"},{"key":"34_CR18","unstructured":"Saxe, J.B.: Embeddability of Weighted Graphs in k-space is Strongly NP-hard. In: Proceedings of 17th Allerton Conference in Communications, Control, and Computing, Monticello, IL, pp. 480\u2013489 (1979)"},{"key":"34_CR19","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.pnmrs.2005.10.001","volume":"48","author":"C.D. Schwieters","year":"2006","unstructured":"Schwieters, C.D., Kuszewski, J.J., Clore, G.M.: Using Xplor-NIH for NMR Molecular Structure Determination. Progress in Nuclear Magnetic Resonance Spectroscopy\u00a048, 47\u201362 (2006)","journal-title":"Progress in Nuclear Magnetic Resonance Spectroscopy"},{"key":"34_CR20","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1007\/s10898-006-9080-6","volume":"37","author":"D. Wu","year":"2007","unstructured":"Wu, D., Wu, Z.: An Updated Geometric Build-Up Algorithm for Solving the Molecular Distance Geometry Problem with Sparse Distance Data. Journal of Global Optimization\u00a037, 661\u2013673 (2007)","journal-title":"Journal of Global Optimization"}],"container-title":["Lecture Notes in Computer Science","Mathematical Software \u2013 ICMS 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15582-6_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:10:17Z","timestamp":1606187417000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15582-6_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642155819","9783642155826"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15582-6_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}