{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,12]],"date-time":"2025-08-12T21:47:30Z","timestamp":1755035250270},"reference-count":25,"publisher":"Wiley","issue":"6","license":[{"start":{"date-parts":[[2004,9,7]],"date-time":"2004-09-07T00:00:00Z","timestamp":1094515200000},"content-version":"vor","delay-in-days":3386,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comput Chem"],"published-print":{"date-parts":[[1995,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We address the problem of marking points on a grid lattice of arbitrary size and spacing as either accessible or inaccessible to a solvent\u2010sized spherical probe. It is shown that an analytical description of the solvent\u2010accessible volume suitable for rapidly testing a large number of lattice points can be constructed from relatively simple geometric elements. By first constructing these basic analytical elements and storing them in suitable data structures, any number of subsequent lattice markings can be carried out. This approach leads to increased computational efficiency whenever a multiple calculation using different lattice sizes and scales is necessary on the same molecular geometry. We also present an algorithm for determining the analytical volume elements. Some aspects of this algorithm, particularly the method for finding all sterically allowed probe positions in which the probe simultaneously contacts three atoms, may also be useful for improving the speed and reliability of analytical surface area calculations. An object\u2010oriented implementation of these algorithms written in C + + is freely available via Internet. \u00a9 1995 by John Wiley &amp; Sons, Inc.<\/jats:p>","DOI":"10.1002\/jcc.540160610","type":"journal-article","created":{"date-parts":[[2005,1,2]],"date-time":"2005-01-02T01:09:55Z","timestamp":1104628195000},"page":"743-757","source":"Crossref","is-referenced-by-count":21,"title":["An analytical algorithm for the rapid determination of the solvent accessibility of points in a three\u2010dimensional lattice around a solute molecule"],"prefix":"10.1002","volume":"16","author":[{"given":"Tony","family":"You","sequence":"first","affiliation":[]},{"given":"Donald","family":"Bashford","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2004,9,7]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1002\/jcc.540090407"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1002\/jcc.540110911"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1002\/jcc.540110315"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2836(85)90399-7"},{"key":"e_1_2_1_6_2","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1002\/jcc.540140114","volume":"14","author":"You T. J.","year":"1993","journal-title":"J. Comp. Chem."},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/0021-9991(91)90043-K"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2836(91)80222-G"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1002\/jcc.540130412"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1146\/annurev.bb.06.060177.001055"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1126\/science.6879170"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1002\/prot.340010109"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1021\/bi00496a010"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2836(91)90859-5"},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1002\/jcc.540140114"},{"key":"e_1_2_1_16_2","unstructured":"M. L.Connolly Ph.D. thesis University of California Berkeley 1981."},{"key":"e_1_2_1_17_2","first-page":"75","volume":"1","author":"Connolly M. L.","year":"1981","journal-title":"QCPE Bull."},{"key":"e_1_2_1_18_2","doi-asserted-by":"publisher","DOI":"10.1107\/S0021889883010985"},{"key":"e_1_2_1_19_2","doi-asserted-by":"publisher","DOI":"10.1002\/jcc.540141103"},{"key":"e_1_2_1_20_2","volume-title":"The C + + Programming Language","author":"Stroustrup B.","year":"1991"},{"key":"e_1_2_1_21_2","doi-asserted-by":"publisher","DOI":"10.1021\/bi00082a027"},{"key":"e_1_2_1_22_2","volume-title":"Advanced C + + Programming Styles and Idioms","author":"Coplien J. O.","year":"1992"},{"key":"e_1_2_1_23_2","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2836(78)90185-7"},{"key":"e_1_2_1_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-2836(77)80200-3"},{"key":"e_1_2_1_25_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-2836(05)80271-2"},{"key":"e_1_2_1_26_2","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1038\/361176a0","volume":"361","author":"Fish A. J.","year":"1993","journal-title":"Nature"}],"container-title":["Journal of Computational Chemistry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjcc.540160610","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jcc.540160610","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,27]],"date-time":"2023-10-27T00:03:50Z","timestamp":1698365030000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jcc.540160610"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,6]]},"references-count":25,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1995,6]]}},"alternative-id":["10.1002\/jcc.540160610"],"URL":"https:\/\/doi.org\/10.1002\/jcc.540160610","archive":["Portico"],"relation":{},"ISSN":["0192-8651","1096-987X"],"issn-type":[{"value":"0192-8651","type":"print"},{"value":"1096-987X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,6]]}}}