{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T14:06:16Z","timestamp":1648994776872},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T00:00:00Z","timestamp":1133395200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2005,12]]},"DOI":"10.1007\/s11227-005-1168-0","type":"journal-article","created":{"date-parts":[[2005,9,7]],"date-time":"2005-09-07T08:26:12Z","timestamp":1126081572000},"page":"243-271","source":"Crossref","is-referenced-by-count":1,"title":["Cluster Computing for Determining Three-Dimensional Protein Structure"],"prefix":"10.1007","volume":"34","author":[{"given":"Paulius","family":"Micikevicius","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Narsingh","family":"Deo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1168_CR1","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1126\/science.181.4096.223","volume":"181","author":"C. B. Anfinsen","year":"1973","unstructured":"C. B. Anfinsen. Principles that govern the protein folding chains. Science, 181:233\u2013230, 1973.","journal-title":"Science"},{"key":"1168_CR2","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1006\/jmbi.1995.0436","volume":"251","author":"A. Asz\u00f6di","year":"1995","unstructured":"A. Asz\u00f6di, M. J. Gradwell, and W. R. Taylor. Global fold determination from a small number of distance restraints. Journal of Molecular Biology, 251:308\u2013326, 1995.","journal-title":"Journal of Molecular Biology"},{"key":"1168_CR3","first-page":"91","volume-title":"Infinite and Finite Sets","author":"Z. Baranyai","year":"1975","unstructured":"Z. Baranyai. On the factorisation of the complete uniform hypergraph. In Infinite and Finite Sets, A. Hajnal, T. Rado, and V. T. Sos, eds., pp. 91\u2013108. North-Holland, Amsterdam, 1975."},{"key":"1168_CR4","unstructured":"D. J. Becker, T. Sterling, D. Savarese, E. Dorband, U. A. Ranawake, and C. V. Packer. BEOWULF: A Parallel Workstation for Scientific Computation. In Proceedings of the 1995 International Conference on Parallel Processing (ICPP), pp. 11\u201314, 1995."},{"key":"1168_CR5","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1093\/nar\/28.1.235","volume":"28","author":"H. M. Berman","year":"2000","unstructured":"H. M. Berman, J. Westbrook, Z. Feng, G. Gilliland, T. N. Bhat, H. 1Weissig, I. Shindyalov, and P. E. Bourne. The protein data bank. Nucleic Acids Research, 28:235\u2013242, 2000.","journal-title":"Nucleic Acids Research"},{"key":"1168_CR6","first-page":"105","volume":"29","author":"T. Beth","year":"1974","unstructured":"T. Beth. Algebraishce Aufl\u00f6gsalorithmen f\u00fcr einige unendliche Familien von 3-Designs. Le Matematiche, 29:105\u2013135, 1974.","journal-title":"Le Matematiche"},{"key":"1168_CR7","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511549533","volume-title":"Design Theory","author":"T. Beth","year":"1999","unstructured":"T. Beth, D. Jungnickel, and H. Lenz. Design Theory. Cambridge University Press, Cambridge, 1999."},{"key":"1168_CR8","volume-title":"Theory and Applications of Distance Geometry","author":"L. M. Blumenthal","year":"1970","unstructured":"L. M. Blumenthal. Theory and Applications of Distance Geometry. Chelsea Publishing Company, Bronx, New York, 1970."},{"key":"1168_CR9","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0097-3165(79)90105-5","volume":"26","author":"A. E. Brouwer","year":"1979","unstructured":"A. E. Brouwer. Optimal packings of K4\u2019s into a Kn. Journal of Combinatorial Theory, 26:278\u2013297, 1979.","journal-title":"Journal of Combinatorial Theory"},{"key":"1168_CR10","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1017\/S0033583500003966","volume":"26","author":"A. T. Br\u00fcnger","year":"1993","unstructured":"A. T. Br\u00fcnger and M. Nilges. Computational challenges for macromolecular structure determination by X-ray crystallography and solution NMR-spectroscopy. Quarterly Review of Biophysics, 26:49\u2013125, 1993.","journal-title":"Quarterly Review of Biophysics"},{"key":"1168_CR11","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1145\/358690.358717","volume":"25","author":"K. M. Chandy","year":"1982","unstructured":"K. M. Chandy and J. Misra. Distributed computation on graphs: Shortest path algorithms. Communications of the ACM, 25:833\u2013837, 1982.","journal-title":"Communications of the ACM"},{"key":"1168_CR12","first-page":"111","volume":"2","author":"Y. M. Chee","year":"1990","unstructured":"Y. M. Chee, C. J. Colbourn, S. C. Furino, and D. L. Kreher. Large sets of disjoint t-designs. Australian Journal of Combinatorics, 2:111\u2013119, 1990.","journal-title":"Australian Journal of Combinatorics"},{"key":"1168_CR13","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0012-365X(83)90045-6","volume":"45","author":"L. G. Chouinard","year":"1983","unstructured":"L. G. Chouinard. Partitions of the 4-subsets of a 13-set into disjoint projective planes. Discrete Mathematics, 45:297\u2013300, 1983.","journal-title":"Discrete Mathematics"},{"key":"1168_CR14","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1007\/978-1-4613-1571-1_17","volume-title":"Prediction of Protein Structure and the Principles of Protein Conformation","author":"F. E. Cohen","year":"1989","unstructured":"F. E. Cohen and I. D. Kuntz. Tertiary structure prediction. In G. D. Fasman, ed., Prediction of Protein Structure and the Principles of Protein Conformation, pp. 647\u2013705. Plenum Press, New York, 1989."},{"key":"1168_CR15","unstructured":"T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, 1996."},{"key":"1168_CR16","unstructured":"T. E. Creighton. Proteins Structures and Molecular Properties. W. F. Freeman, 1992."},{"key":"1168_CR17","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/0021-9991(77)90112-7","volume":"24","author":"G. M. Crippen","year":"1977","unstructured":"G. M. Crippen. A novel approach to the calculation of conformation: Distance geometry. Journal of Computational Physiology, 24:96\u2013107, 1977.","journal-title":"Journal of Computational Physiology"},{"key":"1168_CR18","volume-title":"Distance Geometry and Molecular Conformation","author":"G. M. Crippen","year":"1988","unstructured":"G. M. Crippen and T. F. Havel. Distance Geometry and Molecular Conformation. Research Studies Press Ltd., Taunton, Somerset, England, 1988."},{"key":"1168_CR19","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1137\/0210049","volume":"10","author":"E. Dekel","year":"1981","unstructured":"E. Dekel, D. Nassimi, and S. Sahni. Parallel matrix and graph algorithms. SIAM Journal of Computing, 10:657\u2013675, 1981.","journal-title":"SIAM Journal of Computing"},{"key":"1168_CR20","first-page":"81","volume":"143","author":"N. Deo","year":"2000","unstructured":"N. Deo and P. Micikevicius. Generating edge-disjoint sets of quadruples in parallel for the molecular conformation problem. Congressus Numerantium, 143:81\u201396, 2000.","journal-title":"Congressus Numerantium"},{"key":"1168_CR21","unstructured":"N. Deo and P. Micikevicius. On cyclic one-factorization of complete 3-uniform hypergraphs. Congressus Numerantium, to appear, 2003."},{"key":"1168_CR22","unstructured":"N. Deo, C. Y. Pang, and P. E. Lord. Two parallel algorithms for shortest path problems. In Proceedings of the International Conference on Parallel Computing pp. 244\u2013253, 1980."},{"key":"1168_CR23","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E. W. Dijkstra","year":"1959","unstructured":"E. W. Dijkstra. A note on two problems in connection with graphs. Numerische Mathematik, Vol. 1, pp. 269\u2013271, 1959.","journal-title":"Numerische Mathematik"},{"key":"1168_CR24","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0166-218X(88)90009-1","volume":"19","author":"A. W. M. Dress","year":"1988","unstructured":"A. W. M. Dress and T. F. Havel. Shortest-path problems and molecular conformation. Discrete Applied Mathematics, 19:129\u201314, 1988.","journal-title":"Discrete Applied Mathematics"},{"key":"1168_CR25","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF02458843","volume":"51","author":"P. L. Easthope","year":"1989","unstructured":"P. L. Easthope and T. F. Havel. Computational experience with an algorithm for tetrangle-inequality bound-smoothing. Bulletin of Mathematical Biology, 51:173\u2013194, 1989.","journal-title":"Bulletin of Mathematical Biology"},{"issue":"6","key":"1168_CR26","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"R. W. Floyd","year":"1962","unstructured":"R. W. Floyd. Algorithm 97 (SHORTEST PATH). Communications of the ACM, 5(6):345, 1962.","journal-title":"Communications of the ACM"},{"key":"1168_CR27","unstructured":"A. Grama, A. Gupta, G. Karypis, and V. Kumar. An Introduction to Parallel Computing: Design and Analysis of Algorithms, 2nd ed. Pearson Addison Wesley, 2003."},{"key":"1168_CR28","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1017\/S0033583598003436","volume":"31","author":"P. G\u00fcntert","year":"1998","unstructured":"P. G\u00fcntert. Structure calculation of biological macromolecules from NMR data. Quarterly Reviews of Biophysics, 31:145\u2013237, 1998.","journal-title":"Quarterly Reviews of Biophysics"},{"key":"1168_CR29","volume-title":"Protein NMR Techniques 2nd ed.","author":"P. G\u00fcntert","year":"2004","unstructured":"P. G\u00fcntert. Automated NMR protein structure calculation with CYANA. In (A. K. Downing ed.) Protein NMR Techniques 2nd ed. Humana Press, Totowa, New Jersey, 2004."},{"key":"1168_CR30","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1002\/bip.360291207","volume":"29","author":"T. F. Havel","year":"1990","unstructured":"T. F. Havel. The sampling properties of some distance geometry algorithms applied to unconstrained polypeptide chains: A study of 1830 independently computed conformations. Biopolymers, 29:1565\u20131585, 1990.","journal-title":"Biopolymers"},{"key":"1168_CR31","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0079-6107(91)90007-F","volume":"56","author":"T. F. Havel","year":"1991","unstructured":"T. F. Havel. An evaluation of computational strategies for use in the determination of protein structure from distance constraints obtained by nuclear magnetic resonance. Prog. Biophys. Mol. Biol., 56:43\u201378, 1991.","journal-title":"Prog. Biophys. Mol. Biol."},{"key":"1168_CR32","doi-asserted-by":"crossref","first-page":"s37","DOI":"10.1002\/mrc.1242","volume":"41","author":"T. F. Havel","year":"2003","unstructured":"T. F. Havel. Metric matrix embedding in protein structure calculations, NMR spectra analysis, and relaxation theory. Magnetic Resonance in Chemistry, 41:s37\u2013s50, 2003.","journal-title":"Magnetic Resonance in Chemistry"},{"key":"1168_CR33","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1007\/BF02460044","volume":"45","author":"T. F. Havel","year":"1983","unstructured":"T. F. Havel, I. D. Kuntz, and G. M. Crippen. The theory and practice of distance geometry. Bulletin of Mathematical Biology, 45:665\u2013720, 1983.","journal-title":"Bulletin of Mathematical Biology"},{"key":"1168_CR34","first-page":"673","volume":"46","author":"T. F. Havel","year":"1984","unstructured":"T. F. Havel and K. W\u00fcthrich. A distance geometry program for determining the structures of small proteins and other macromolecules from nuclear magnetic resonance measurements of intramolecular 1H-1H proximities in solution. Bull. Math. Biol., 46:673\u2013698, 1984.","journal-title":"Bull. Math. Biol."},{"key":"1168_CR35","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1137\/0805040","volume":"5","author":"B. A. Hendrickson","year":"1995","unstructured":"B. A. Hendrickson. The molecule problem: Exploiting structure in global optimizations. SIAM Journal on Optimization, 5:835\u2013857, 1955.","journal-title":"SIAM Journal on Optimization"},{"key":"1168_CR36","first-page":"15","volume":"117","author":"N. Kumar","year":"1996","unstructured":"N. Kumar, N. Deo, and R. Addanki. Empirical study of a tetrangle-inequality bound-smoothing algorithm. Congressus Numerantium, 117:15\u201331, 1996.","journal-title":"Congressus Numerantium"},{"key":"1168_CR37","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/0743-7315(91)90083-L","volume":"13","author":"V. Kumar","year":"1991","unstructured":"V. Kumar and V. Singh. Scalability of parallel algorithms for all-pairs shortest-path problem. Journal of Parallel and Distributed Computing, 13:124\u2013138, 1991.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"1168_CR38","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1017\/CBO9780511526114.014","volume-title":"Geometry, Combinatorial Designs and Related Structures","author":"R. Mathon","year":"1997","unstructured":"R. Mathon. Searching for spreads and packings. In Geometry, Combinatorial Designs and Related Structures, J. W. P. Hirschfield, S. S. Magliveras, and M. S. de Resmini, eds., pp. 161\u2013176. Cambridge University Press, Cambridge, 1997."},{"key":"1168_CR39","doi-asserted-by":"crossref","first-page":"721","DOI":"10.2307\/2371222","volume":"53","author":"K. Menger","year":"1931","unstructured":"K. Menger. New foundation of Euclidean geometry. Amer. J. Math., 53:721\u201345, 1931.","journal-title":"Amer. J. Math."},{"key":"1168_CR40","volume-title":"Parallel graph algorithms for molecular conformation and tree codes","author":"P. Micikevicius","year":"2002","unstructured":"P. Micikevicius. Parallel graph algorithms for molecular conformation and tree codes. Ph.D. Thesis, University of Central Florida, Orlando, FL., 2002."},{"issue":"39","key":"1168_CR41","doi-asserted-by":"crossref","first-page":"12026","DOI":"10.1021\/ja035440f","volume":"125","author":"S. B. Nabuurs","year":"2003","unstructured":"S. B. Nabuurs, C. A. E. M. Spronk, E. Krieger, H. Maassen, G. Vriend, and G. W. Vuister. Quantitative evaluation of experimental NMR restraints. Journal of American Chemical Society, 125(39):12026\u201312034, 2003.","journal-title":"Journal of American Chemical Society"},{"key":"1168_CR42","unstructured":"R. C. Paige and C. P. Kruskal. Parallel algorithms for shortest path problems. In Proceedings of International Conference on Parallel Processing, pp. 14\u201319, 1989."},{"key":"1168_CR43","volume-title":"Parallel algorithms for the molecular conformation problem","author":"K. Rajan","year":"1999","unstructured":"K. Rajan. Parallel algorithms for the molecular conformation problem. PhD thesis, University of Central Florida, Orlando, FL., 1999."},{"key":"1168_CR44","unstructured":"K. Rajan and N. Deo. A parallel algorithm for bound-smoothing using tetrangle inequality. In Proceedings of the Tenth IASTED International Conference on Parallel and Distributed Computing and Systems, pp. 298\u2013304, 28\u201331, Las Vegas, Nevada, Oct. 1998."},{"key":"1168_CR45","doi-asserted-by":"crossref","unstructured":"K. Rajan and N. Deo. A parallel algorithm for bound-smoothing. In Proceedings of the 13th International Parallel Processing Symposium, pp. 645\u2013652. San Juan, Puerto Rico, April 12\u201316, 1999.","DOI":"10.1109\/IPPS.1999.760545"},{"issue":"5","key":"1168_CR46","doi-asserted-by":"crossref","first-page":"987","DOI":"10.1006\/bulm.1999.0123","volume":"61","author":"K. Rajan","year":"1999","unstructured":"K. Rajan and N. Deo. Computational experience with a parallel algorithm for tetrangle inequality bound smoothing. Bulletin of Mathematical Biology, 61(5):987\u20131008, 1999.","journal-title":"Bulletin of Mathematical Biology"},{"key":"1168_CR47","first-page":"211","volume":"124","author":"K. Rajan","year":"1997","unstructured":"K. Rajan, N. Deo, and N. Kumar. Parallel tetrangle-inequality bound smoothing on a cluster of workstations. Congressus Numerantium, 124:211\u2013220, 1997.","journal-title":"Congressus Numerantium"},{"key":"1168_CR48","first-page":"5","volume":"131","author":"K. Rajan","year":"1998","unstructured":"K. Rajan, N. Deo, and N. Kumar. Generating disjoint t-(v, k, 1) packings in parallel. Congressus Numerantium, 131:5\u201318, 1998.","journal-title":"Congressus Numerantium"},{"key":"1168_CR49","doi-asserted-by":"crossref","unstructured":"D. Ridge, D. Becker, P. Merkey, and T. Sterling. Beowulf: Harnessing the power of parallelism in a pile-of-PCs. In Proceedings of IEEE Aerospace Conference, 1997.","DOI":"10.1109\/AERO.1997.577619"},{"key":"1168_CR50","doi-asserted-by":"crossref","unstructured":"D. K. Searls. Grand challenges in computational biology. In S. L. 2Salzberg, D. K. Searls, and S. Kasif, eds. Computational Models in Molecular Biology, Elsevier, 1998.","DOI":"10.1016\/S0167-7306(08)60458-5"},{"issue":"3","key":"1168_CR51","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1155\/1997\/532130","volume":"6","author":"D. J. Skillicorn","year":"1997","unstructured":"D. J. Skillicorn, M. D. Hill, and W. F. McColl. Questions and answers about BSP. Scientific Programming, 6(3):249\u2013274, 1997.","journal-title":"Scientific Programming"},{"key":"1168_CR52","volume-title":"MPI: The Complete Reference","author":"M. Snir","year":"1996","unstructured":"M. Snir, S. Otto, S. Huss-Lederman, D. Walker, and J. Dongarra. MPI: The Complete Reference. MIT Press, Cambridge, Massachusetts, 1996."},{"key":"1168_CR53","unstructured":"T. Sterling, J. Salmon, D. Becker, and D. F. Savarese. How to Build a Beowulf. MIT Press, 1999."},{"key":"1168_CR54","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1007\/3-540-48311-X_6","volume":"1685","author":"T. Sterling","year":"1999","unstructured":"T. Sterling and D. Savarese. A coming of age for Beowulf-class computing. Lecture Notes in Computer Science, 1685:78\u201388, 1999.","journal-title":"Lecture Notes in Computer Science"},{"issue":"8","key":"1168_CR55","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"L. G. Valiant","year":"1990","unstructured":"L. G. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8):103\u2013111, 1990.","journal-title":"Communications of the ACM"},{"key":"1168_CR56","volume-title":"Combinatorial Designs","author":"W. D. Wallis","year":"1998","unstructured":"W. D. Wallis. Combinatorial Designs. Marcel Dekker, Inc., New York, 1998."},{"key":"1168_CR57","unstructured":"M. S. Warren, D. J. Becker, M. P. Goda, J. K. Salmon, and T. Sterling. Parallel supercomputing with commodity components. In H. R. Arabnia, ed., In Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA\u201997), pp. 1372\u20131381, 1997."}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-005-1168-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-005-1168-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-005-1168-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T10:24:56Z","timestamp":1559384696000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-005-1168-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,12]]},"references-count":57,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,12]]}},"alternative-id":["1168"],"URL":"https:\/\/doi.org\/10.1007\/s11227-005-1168-0","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,12]]}}}