[{"status":"public","volume":24,"type":"journal_article","date_published":"1997-07-01T00:00:00Z","citation":{"apa":"Henzinger, M. H. (1997). A static 2-approximation algorithm for vertex connectivity and incremental approximation algorithms for edge and vertex connectivity. <i>Journal of Algorithms</i>. Elsevier. <a href=\"https://doi.org/10.1006/jagm.1997.0855\">https://doi.org/10.1006/jagm.1997.0855</a>","ista":"Henzinger MH. 1997. A static 2-approximation algorithm for vertex connectivity and incremental approximation algorithms for edge and vertex connectivity. Journal of Algorithms. 24(1), 194–220.","ieee":"M. H. Henzinger, “A static 2-approximation algorithm for vertex connectivity and incremental approximation algorithms for edge and vertex connectivity,” <i>Journal of Algorithms</i>, vol. 24, no. 1. Elsevier, pp. 194–220, 1997.","short":"M.H. Henzinger, Journal of Algorithms 24 (1997) 194–220.","mla":"Henzinger, Monika H. “A Static 2-Approximation Algorithm for Vertex Connectivity and Incremental Approximation Algorithms for Edge and Vertex Connectivity.” <i>Journal of Algorithms</i>, vol. 24, no. 1, Elsevier, 1997, pp. 194–220, doi:<a href=\"https://doi.org/10.1006/jagm.1997.0855\">10.1006/jagm.1997.0855</a>.","ama":"Henzinger MH. A static 2-approximation algorithm for vertex connectivity and incremental approximation algorithms for edge and vertex connectivity. <i>Journal of Algorithms</i>. 1997;24(1):194-220. doi:<a href=\"https://doi.org/10.1006/jagm.1997.0855\">10.1006/jagm.1997.0855</a>","chicago":"Henzinger, Monika H. “A Static 2-Approximation Algorithm for Vertex Connectivity and Incremental Approximation Algorithms for Edge and Vertex Connectivity.” <i>Journal of Algorithms</i>. Elsevier, 1997. <a href=\"https://doi.org/10.1006/jagm.1997.0855\">https://doi.org/10.1006/jagm.1997.0855</a>."},"intvolume":"        24","oa_version":"None","article_type":"original","publication":"Journal of Algorithms","_id":"11765","date_updated":"2022-09-12T09:15:38Z","title":"A static 2-approximation algorithm for vertex connectivity and incremental approximation algorithms for edge and vertex connectivity","publisher":"Elsevier","doi":"10.1006/jagm.1997.0855","abstract":[{"lang":"eng","text":"This paper presents insertions-only algorithms for maintaining the exact and/or approximate size of the minimum edge cut and the minimum vertex cut of a graph. The algorithms output the approximate or exact sizekin timeO(1) and a cut of sizekin time linear in its size. For the minimum edge cut problem and for any 0 < ε ≤ 1, the amortized time per insertion isO(1/ε2) for a (2 + ε)-approximation,O((log λ)((log n)/ε)2) for a (1 + ε)-approximation, andO(λ log n) for the exact size, wherenis the number of nodes in the graph and λ is the size of the minimum cut. The (2 + ε)-approximation algorithm and the exact algorithm are deterministic; the (1 + ε)-approximation algorithm is randomized. We also present a static 2-approximation algorithm for the size κ of the minimum vertex cut in a graph, which takes time. This is a factor of κ faster than the best algorithm for computing the exact size, which takes time. We give an insertions-only algorithm for maintaining a (2 + ε)-approximation of the minimum vertex cut with amortized insertion timeO(n/ε)."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","extern":"1","quality_controlled":"1","month":"07","page":"194-220","issue":"1","author":[{"orcid":"0000-0002-5008-6530","last_name":"Henzinger","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H"}],"publication_status":"published","day":"01","publication_identifier":{"issn":["0196-6774"]},"date_created":"2022-08-08T12:18:38Z","year":"1997","language":[{"iso":"eng"}],"scopus_import":"1"},{"language":[{"iso":"eng"}],"year":"1997","author":[{"orcid":"0000-0002-5008-6530","last_name":"Henzinger","full_name":"Henzinger, Monika H","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"full_name":"Klein, Philip","first_name":"Philip","last_name":"Klein"},{"first_name":"Satish","full_name":"Rao, Satish","last_name":"Rao"},{"first_name":"Sairam","full_name":"Subramanian, Sairam","last_name":"Subramanian"}],"page":"3-23","date_created":"2022-08-08T12:28:45Z","day":"01","publication_status":"published","article_processing_charge":"No","date_updated":"2022-09-12T10:46:21Z","publisher":"Elsevier","doi":"10.1006/jcss.1997.1493","publication":"Journal of Computer and System Sciences","month":"08","quality_controlled":"1","oa":1,"extern":"1","date_published":"1997-08-01T00:00:00Z","type":"journal_article","volume":55,"article_type":"original","oa_version":"Published Version","scopus_import":"1","issue":"1","publication_identifier":{"issn":["0022-0000"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"We give a linear-time algorithm for single-source shortest paths in planar graphs with nonnegative edge-lengths. Our algorithm also yields a linear-time algorithm for maximum flow in a planar graph with the source and sink on the same face. For the case where negative edge-lengths are allowed, we give an algorithm requiringO(n4/3 log(nL)) time, whereLis the absolute value of the most negative length. This algorithm can be used to obtain similar bounds for computing a feasible flow in a planar network, for finding a perfect matching in a planar bipartite graph, and for finding a maximum flow in a planar graph when the source and sink are not on the same face. We also give parallel and dynamic versions of these algorithms."}],"title":"Faster shortest-path algorithms for planar graphs","_id":"11767","status":"public","citation":{"ista":"Henzinger MH, Klein P, Rao S, Subramanian S. 1997. Faster shortest-path algorithms for planar graphs. Journal of Computer and System Sciences. 55(1), 3–23.","apa":"Henzinger, M. H., Klein, P., Rao, S., &#38; Subramanian, S. (1997). Faster shortest-path algorithms for planar graphs. <i>Journal of Computer and System Sciences</i>. Elsevier. <a href=\"https://doi.org/10.1006/jcss.1997.1493\">https://doi.org/10.1006/jcss.1997.1493</a>","ieee":"M. H. Henzinger, P. Klein, S. Rao, and S. Subramanian, “Faster shortest-path algorithms for planar graphs,” <i>Journal of Computer and System Sciences</i>, vol. 55, no. 1. Elsevier, pp. 3–23, 1997.","short":"M.H. Henzinger, P. Klein, S. Rao, S. Subramanian, Journal of Computer and System Sciences 55 (1997) 3–23.","ama":"Henzinger MH, Klein P, Rao S, Subramanian S. Faster shortest-path algorithms for planar graphs. <i>Journal of Computer and System Sciences</i>. 1997;55(1):3-23. doi:<a href=\"https://doi.org/10.1006/jcss.1997.1493\">10.1006/jcss.1997.1493</a>","mla":"Henzinger, Monika H., et al. “Faster Shortest-Path Algorithms for Planar Graphs.” <i>Journal of Computer and System Sciences</i>, vol. 55, no. 1, Elsevier, 1997, pp. 3–23, doi:<a href=\"https://doi.org/10.1006/jcss.1997.1493\">10.1006/jcss.1997.1493</a>.","chicago":"Henzinger, Monika H, Philip Klein, Satish Rao, and Sairam Subramanian. “Faster Shortest-Path Algorithms for Planar Graphs.” <i>Journal of Computer and System Sciences</i>. Elsevier, 1997. <a href=\"https://doi.org/10.1006/jcss.1997.1493\">https://doi.org/10.1006/jcss.1997.1493</a>."},"intvolume":"        55","main_file_link":[{"url":"https://doi.org/10.1006/jcss.1997.1493","open_access":"1"}]},{"day":"01","publication_status":"published","date_created":"2022-08-11T13:35:06Z","publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"eisbn":["9783540691945"],"isbn":["9783540631651"]},"conference":{"location":"Bologna, Italy","end_date":"1997-07-11","start_date":"1997-07-07","name":"ICALP: International Colloquium on Automata, Languages, and Programming"},"page":"594–604","alternative_title":["LNCS"],"author":[{"first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","last_name":"Henzinger","orcid":"0000-0002-5008-6530"},{"last_name":"King","first_name":"Valerie","full_name":"King, Valerie"}],"language":[{"iso":"eng"}],"year":"1997","scopus_import":"1","intvolume":"      1256","citation":{"ista":"Henzinger MH, King V. 1997. Maintaining minimum spanning trees in dynamic graphs. 24th International Colloquium on Automata, Languages and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LNCS, vol. 1256, 594–604.","apa":"Henzinger, M. H., &#38; King, V. (1997). Maintaining minimum spanning trees in dynamic graphs. In <i>24th International Colloquium on Automata, Languages and Programming</i> (Vol. 1256, pp. 594–604). Bologna, Italy: Springer Nature. <a href=\"https://doi.org/10.1007/3-540-63165-8_214\">https://doi.org/10.1007/3-540-63165-8_214</a>","short":"M.H. Henzinger, V. King, in:, 24th International Colloquium on Automata, Languages and Programming, Springer Nature, 1997, pp. 594–604.","ieee":"M. H. Henzinger and V. King, “Maintaining minimum spanning trees in dynamic graphs,” in <i>24th International Colloquium on Automata, Languages and Programming</i>, Bologna, Italy, 1997, vol. 1256, pp. 594–604.","ama":"Henzinger MH, King V. Maintaining minimum spanning trees in dynamic graphs. In: <i>24th International Colloquium on Automata, Languages and Programming</i>. Vol 1256. Springer Nature; 1997:594–604. doi:<a href=\"https://doi.org/10.1007/3-540-63165-8_214\">10.1007/3-540-63165-8_214</a>","mla":"Henzinger, Monika H., and Valerie King. “Maintaining Minimum Spanning Trees in Dynamic Graphs.” <i>24th International Colloquium on Automata, Languages and Programming</i>, vol. 1256, Springer Nature, 1997, pp. 594–604, doi:<a href=\"https://doi.org/10.1007/3-540-63165-8_214\">10.1007/3-540-63165-8_214</a>.","chicago":"Henzinger, Monika H, and Valerie King. “Maintaining Minimum Spanning Trees in Dynamic Graphs.” In <i>24th International Colloquium on Automata, Languages and Programming</i>, 1256:594–604. Springer Nature, 1997. <a href=\"https://doi.org/10.1007/3-540-63165-8_214\">https://doi.org/10.1007/3-540-63165-8_214</a>."},"oa_version":"None","status":"public","date_published":"1997-07-01T00:00:00Z","type":"conference","volume":1256,"quality_controlled":"1","extern":"1","month":"07","doi":"10.1007/3-540-63165-8_214","date_updated":"2023-02-14T07:49:03Z","title":"Maintaining minimum spanning trees in dynamic graphs","publisher":"Springer Nature","_id":"11803","publication":"24th International Colloquium on Automata, Languages and Programming","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","abstract":[{"lang":"eng","text":"We present the first fully dynamic algorithm for maintaining a minimum spanning tree in time o(√n) per operation. To be precise, the algorithm uses O(n 1/3 log n) amortized time per update operation. The algorithm is fairly simple and deterministic. An immediate consequence is the first fully dynamic deterministic algorithm for maintaining connectivity and, bipartiteness in amortized time O(n 1/3 log n) per update, with O(1) worst case time per query."}]},{"author":[{"full_name":"Anderson, Jennifer M.","first_name":"Jennifer M.","last_name":"Anderson"},{"first_name":"Lance M.","full_name":"Berc, Lance M.","last_name":"Berc"},{"last_name":"Dean","full_name":"Dean, Jeffrey","first_name":"Jeffrey"},{"last_name":"Ghemawat","first_name":"Sanjay","full_name":"Ghemawat, Sanjay"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger"},{"first_name":"Shun-Tak A.","full_name":"Leung, Shun-Tak A.","last_name":"Leung"},{"last_name":"Sites","first_name":"Richard L.","full_name":"Sites, Richard L."},{"last_name":"Vandevoorde","full_name":"Vandevoorde, Mark T.","first_name":"Mark T."},{"full_name":"Waldspurger, Carl A.","first_name":"Carl A.","last_name":"Waldspurger"},{"last_name":"Weihl","full_name":"Weihl, William E.","first_name":"William E."}],"page":"1-14","date_created":"2022-08-16T07:07:03Z","publication_status":"published","day":"01","year":"1997","language":[{"iso":"eng"}],"related_material":{"record":[{"id":"11849","status":"public","relation":"earlier_version"}]},"volume":31,"type":"journal_article","date_published":"1997-12-01T00:00:00Z","article_type":"original","oa_version":"Published Version","article_processing_charge":"No","publication":"ACM SIGOPS Operating Systems Review","doi":"10.1145/269005.266637","publisher":"Association for Computing Machinery","date_updated":"2023-02-21T16:30:27Z","month":"12","extern":"1","oa":1,"quality_controlled":"1","issue":"5","publication_identifier":{"issn":["0163-5980"]},"scopus_import":"1","status":"public","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1145/269005.266637"}],"citation":{"mla":"Anderson, Jennifer M., et al. “Continuous Profiling: Where Have All the Cycles Gone?” <i>ACM SIGOPS Operating Systems Review</i>, vol. 31, no. 5, Association for Computing Machinery, 1997, pp. 1–14, doi:<a href=\"https://doi.org/10.1145/269005.266637\">10.1145/269005.266637</a>.","ama":"Anderson JM, Berc LM, Dean J, et al. Continuous profiling: Where have all the cycles gone? <i>ACM SIGOPS Operating Systems Review</i>. 1997;31(5):1-14. doi:<a href=\"https://doi.org/10.1145/269005.266637\">10.1145/269005.266637</a>","chicago":"Anderson, Jennifer M., Lance M. Berc, Jeffrey Dean, Sanjay Ghemawat, Monika H Henzinger, Shun-Tak A. Leung, Richard L. Sites, Mark T. Vandevoorde, Carl A. Waldspurger, and William E. Weihl. “Continuous Profiling: Where Have All the Cycles Gone?” <i>ACM SIGOPS Operating Systems Review</i>. Association for Computing Machinery, 1997. <a href=\"https://doi.org/10.1145/269005.266637\">https://doi.org/10.1145/269005.266637</a>.","apa":"Anderson, J. M., Berc, L. M., Dean, J., Ghemawat, S., Henzinger, M. H., Leung, S.-T. A., … Weihl, W. E. (1997). Continuous profiling: Where have all the cycles gone? <i>ACM SIGOPS Operating Systems Review</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/269005.266637\">https://doi.org/10.1145/269005.266637</a>","ista":"Anderson JM, Berc LM, Dean J, Ghemawat S, Henzinger MH, Leung S-TA, Sites RL, Vandevoorde MT, Waldspurger CA, Weihl WE. 1997. Continuous profiling: Where have all the cycles gone? ACM SIGOPS Operating Systems Review. 31(5), 1–14.","short":"J.M. Anderson, L.M. Berc, J. Dean, S. Ghemawat, M.H. Henzinger, S.-T.A. Leung, R.L. Sites, M.T. Vandevoorde, C.A. Waldspurger, W.E. Weihl, ACM SIGOPS Operating Systems Review 31 (1997) 1–14.","ieee":"J. M. Anderson <i>et al.</i>, “Continuous profiling: Where have all the cycles gone?,” <i>ACM SIGOPS Operating Systems Review</i>, vol. 31, no. 5. Association for Computing Machinery, pp. 1–14, 1997."},"intvolume":"        31","abstract":[{"lang":"eng","text":"This paper describes the DIGlTAL Continuous Profiling Infrastmcture, a sampling-based profiling system designed to run continuously on production systems. The system supports multiprocessors, works on unmodified executable& and collects profiles for entire systems, including user programs, shared libraries, and the operating system kernel. Samples are collected at a high rate (over 5200 samples/secper333-MHz processor), yet with low overhead (l-3% slowdown for most workloads). Analysis tools supplied with the profiling system use the sample data to produce an accurate accounting, down to the level of pipeline stalls incurred by individual instructions, of where time is being spent. When instructions incur stalls, the tools identify possible reasons, such as cache misses, branch mispredictions, and functional unit contention. The fine-grained instruction-level analysis guides users and automated optimizers to the causes of performance\r\nproblems and provides important insights for fixing them. "}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11849","title":"Continuous profiling: Where have all the cycles gone?"},{"article_type":"original","oa_version":"None","citation":{"ama":"Henzinger MH, Thorup M. Sampling to provide or to bound: With applications to fully dynamic graph algorithms. <i>Random Structures and Algorithms</i>. 1997;11(4):369-379. doi:<a href=\"https://doi.org/10.1002/(sici)1098-2418(199712)11:4&#60;369::aid-rsa5&#62;3.0.co;2-x\">10.1002/(sici)1098-2418(199712)11:4&#60;369::aid-rsa5&#62;3.0.co;2-x</a>","mla":"Henzinger, Monika H., and Mikkel Thorup. “Sampling to Provide or to Bound: With Applications to Fully Dynamic Graph Algorithms.” <i>Random Structures and Algorithms</i>, vol. 11, no. 4, Wiley, 1997, pp. 369–79, doi:<a href=\"https://doi.org/10.1002/(sici)1098-2418(199712)11:4&#60;369::aid-rsa5&#62;3.0.co;2-x\">10.1002/(sici)1098-2418(199712)11:4&#60;369::aid-rsa5&#62;3.0.co;2-x</a>.","chicago":"Henzinger, Monika H, and Mikkel Thorup. “Sampling to Provide or to Bound: With Applications to Fully Dynamic Graph Algorithms.” <i>Random Structures and Algorithms</i>. Wiley, 1997. <a href=\"https://doi.org/10.1002/(sici)1098-2418(199712)11:4&#60;369::aid-rsa5&#62;3.0.co;2-x\">https://doi.org/10.1002/(sici)1098-2418(199712)11:4&#60;369::aid-rsa5&#62;3.0.co;2-x</a>.","ista":"Henzinger MH, Thorup M. 1997. Sampling to provide or to bound: With applications to fully dynamic graph algorithms. Random Structures and Algorithms. 11(4), 369–379.","apa":"Henzinger, M. H., &#38; Thorup, M. (1997). Sampling to provide or to bound: With applications to fully dynamic graph algorithms. <i>Random Structures and Algorithms</i>. Wiley. <a href=\"https://doi.org/10.1002/(sici)1098-2418(199712)11:4&#60;369::aid-rsa5&#62;3.0.co;2-x\">https://doi.org/10.1002/(sici)1098-2418(199712)11:4&#60;369::aid-rsa5&#62;3.0.co;2-x</a>","short":"M.H. Henzinger, M. Thorup, Random Structures and Algorithms 11 (1997) 369–379.","ieee":"M. H. Henzinger and M. Thorup, “Sampling to provide or to bound: With applications to fully dynamic graph algorithms,” <i>Random Structures and Algorithms</i>, vol. 11, no. 4. Wiley, pp. 369–379, 1997."},"intvolume":"        11","volume":11,"type":"journal_article","date_published":"1997-12-07T00:00:00Z","status":"public","month":"12","extern":"1","quality_controlled":"1","abstract":[{"lang":"eng","text":"In dynamic graph algorithms the following provide-or-bound problem has to be solved quickly: Given a set S containing a subset R and a way of generating random elements from S testing for membership in R, either (i) provide an element of R, or (ii) give a (small) upper bound on the size of R that holds with high probability. We give an optimal algorithm for this problem. This algorithm improves the time per operation for various dynamic graph algorithms by a factor of O(log n). For example, it improves the time per update for fully dynamic connectivity from O(log3n) to O(log2n)."}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"Random Structures and Algorithms","_id":"11883","doi":"10.1002/(sici)1098-2418(199712)11:4<369::aid-rsa5>3.0.co;2-x","date_updated":"2023-02-17T14:05:02Z","title":"Sampling to provide or to bound: With applications to fully dynamic graph algorithms","publisher":"Wiley","publication_identifier":{"eissn":["1098-2418"],"issn":["1042-9832"]},"date_created":"2022-08-17T07:21:55Z","publication_status":"published","day":"07","author":[{"orcid":"0000-0002-5008-6530","last_name":"Henzinger","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H"},{"first_name":"Mikkel","full_name":"Thorup, Mikkel","last_name":"Thorup"}],"issue":"4","page":"369-379","scopus_import":"1","year":"1997","language":[{"iso":"eng"}]},{"intvolume":"         2","citation":{"ista":"Sazanov LA, Burrows P, Nixon PJ. 1996. Presence of a large protein complex containing the ndhK gene product and possessing NADH-specific dehydrogenase activity in thylakoid membranes of higher plant chloroplasts. IPC: International Photosynthesis Congress, Photosynthesis: from light to biosphere, vol. 2, 705–708.","apa":"Sazanov, L. A., Burrows, P., &#38; Nixon, P. J. (1996). Presence of a large protein complex containing the ndhK gene product and possessing NADH-specific dehydrogenase activity in thylakoid membranes of higher plant chloroplasts (Vol. 2, pp. 705–708). Presented at the IPC: International Photosynthesis Congress, Kluwer.","ieee":"L. A. Sazanov, P. Burrows, and P. J. Nixon, “Presence of a large protein complex containing the ndhK gene product and possessing NADH-specific dehydrogenase activity in thylakoid membranes of higher plant chloroplasts,” presented at the IPC: International Photosynthesis Congress, 1996, vol. 2, pp. 705–708.","short":"L.A. Sazanov, P. Burrows, P.J. Nixon, in:, Kluwer, 1996, pp. 705–708.","ama":"Sazanov LA, Burrows P, Nixon PJ. Presence of a large protein complex containing the ndhK gene product and possessing NADH-specific dehydrogenase activity in thylakoid membranes of higher plant chloroplasts. In: Vol 2. Kluwer; 1996:705-708.","mla":"Sazanov, Leonid A., et al. <i>Presence of a Large Protein Complex Containing the NdhK Gene Product and Possessing NADH-Specific Dehydrogenase Activity in Thylakoid Membranes of Higher Plant Chloroplasts</i>. Vol. 2, Kluwer, 1996, pp. 705–08.","chicago":"Sazanov, Leonid A, P Burrows, and P J Nixon. “Presence of a Large Protein Complex Containing the NdhK Gene Product and Possessing NADH-Specific Dehydrogenase Activity in Thylakoid Membranes of Higher Plant Chloroplasts,” 2:705–8. Kluwer, 1996."},"status":"public","date_published":"1996-01-01T00:00:00Z","type":"conference","volume":2,"quality_controlled":0,"extern":1,"month":"01","date_updated":"2021-01-12T06:54:14Z","title":"Presence of a large protein complex containing the ndhK gene product and possessing NADH-specific dehydrogenase activity in thylakoid membranes of higher plant chloroplasts","publisher":"Kluwer","_id":"1942","day":"01","publist_id":"5143","publication_status":"published","date_created":"2018-12-11T11:54:50Z","conference":{"name":"IPC: International Photosynthesis Congress"},"alternative_title":["Photosynthesis: from light to biosphere"],"page":"705 - 708","author":[{"id":"338D39FE-F248-11E8-B48F-1D18A9856A87","first_name":"Leonid A","full_name":"Leonid Sazanov","orcid":"0000-0002-0977-7989","last_name":"Sazanov"},{"last_name":"Burrows","first_name":"P","full_name":"Burrows, P"},{"last_name":"Nixon","full_name":"Nixon, P J","first_name":"P J"}],"year":"1996"},{"intvolume":"        24","citation":{"ista":"Sazanov LA, Burrows P, Nixon P. 1996. Detection and characterization of a complex I-like NADH-specific dehydrogenase from pea thylakoids. Biochemical Society Transactions. 24(3), 739–743.","apa":"Sazanov, L. A., Burrows, P., &#38; Nixon, P. (1996). Detection and characterization of a complex I-like NADH-specific dehydrogenase from pea thylakoids. <i>Biochemical Society Transactions</i>. Portland Press. <a href=\"https://doi.org/10.1042/bst0240739\">https://doi.org/10.1042/bst0240739</a>","short":"L.A. Sazanov, P. Burrows, P. Nixon, Biochemical Society Transactions 24 (1996) 739–743.","ieee":"L. A. Sazanov, P. Burrows, and P. Nixon, “Detection and characterization of a complex I-like NADH-specific dehydrogenase from pea thylakoids,” <i>Biochemical Society Transactions</i>, vol. 24, no. 3. Portland Press, pp. 739–743, 1996.","ama":"Sazanov LA, Burrows P, Nixon P. Detection and characterization of a complex I-like NADH-specific dehydrogenase from pea thylakoids. <i>Biochemical Society Transactions</i>. 1996;24(3):739-743. doi:<a href=\"https://doi.org/10.1042/bst0240739\">10.1042/bst0240739</a>","mla":"Sazanov, Leonid A., et al. “Detection and Characterization of a Complex I-like NADH-Specific Dehydrogenase from Pea Thylakoids.” <i>Biochemical Society Transactions</i>, vol. 24, no. 3, Portland Press, 1996, pp. 739–43, doi:<a href=\"https://doi.org/10.1042/bst0240739\">10.1042/bst0240739</a>.","chicago":"Sazanov, Leonid A, Paul Burrows, and Peter Nixon. “Detection and Characterization of a Complex I-like NADH-Specific Dehydrogenase from Pea Thylakoids.” <i>Biochemical Society Transactions</i>. Portland Press, 1996. <a href=\"https://doi.org/10.1042/bst0240739\">https://doi.org/10.1042/bst0240739</a>."},"status":"public","pmid":1,"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","title":"Detection and characterization of a complex I-like NADH-specific dehydrogenase from pea thylakoids","_id":"1951","publication_identifier":{"issn":["0300-5127"]},"issue":"3","scopus_import":"1","oa_version":"None","external_id":{"pmid":["8878837"]},"article_type":"original","type":"journal_article","date_published":"1996-01-01T00:00:00Z","volume":24,"month":"01","quality_controlled":"1","extern":"1","article_processing_charge":"No","doi":"10.1042/bst0240739","publisher":"Portland Press","date_updated":"2022-08-16T08:25:02Z","publication":"Biochemical Society Transactions","date_created":"2018-12-11T11:54:53Z","day":"01","publication_status":"published","publist_id":"5131","author":[{"first_name":"Leonid A","id":"338D39FE-F248-11E8-B48F-1D18A9856A87","full_name":"Sazanov, Leonid A","orcid":"0000-0002-0977-7989","last_name":"Sazanov"},{"last_name":"Burrows","full_name":"Burrows, Paul","first_name":"Paul"},{"last_name":"Nixon","full_name":"Nixon, Peter","first_name":"Peter"}],"page":"739 - 743","year":"1996","language":[{"iso":"eng"}]},{"date_created":"2018-12-11T11:54:53Z","day":"11","publication_status":"published","publist_id":"5132","author":[{"last_name":"Bizouarn","full_name":"Bizouarn, Tania","first_name":"Tania"},{"full_name":"Sazanov, Leonid A","id":"338D39FE-F248-11E8-B48F-1D18A9856A87","first_name":"Leonid A","orcid":"0000-0002-0977-7989","last_name":"Sazanov"},{"last_name":"Aubourg","full_name":"Aubourg, Sébastien","first_name":"Sébastien"},{"full_name":"Jackson, Julie","first_name":"Julie","last_name":"Jackson"}],"page":"4 - 12","language":[{"iso":"eng"}],"year":"1996","oa_version":"None","external_id":{"pmid":["8573594 "]},"article_type":"original","date_published":"1996-01-11T00:00:00Z","type":"journal_article","volume":1273,"month":"01","quality_controlled":"1","extern":"1","article_processing_charge":"No","date_updated":"2022-08-16T12:35:22Z","publisher":"Elsevier","doi":"10.1016/0005-2728(95)00125-5","publication":"Biochimica et Biophysica Acta - Bioenergetics","publication_identifier":{"issn":["0005-2728"]},"issue":"1","citation":{"chicago":"Bizouarn, Tania, Leonid A Sazanov, Sébastien Aubourg, and Julie Jackson. “Estimation of the H+/H- Ratio of the Reaction Catalysed by the Nicotinamide Nucleotide Transhydrogenase in Chromatophores from over-Expressing Strains of Rhodospirillum Rubrum and in Liposomes Inlaid with the Purified Bovine Enzyme.” <i>Biochimica et Biophysica Acta - Bioenergetics</i>. Elsevier, 1996. <a href=\"https://doi.org/10.1016/0005-2728(95)00125-5\">https://doi.org/10.1016/0005-2728(95)00125-5</a>.","mla":"Bizouarn, Tania, et al. “Estimation of the H+/H- Ratio of the Reaction Catalysed by the Nicotinamide Nucleotide Transhydrogenase in Chromatophores from over-Expressing Strains of Rhodospirillum Rubrum and in Liposomes Inlaid with the Purified Bovine Enzyme.” <i>Biochimica et Biophysica Acta - Bioenergetics</i>, vol. 1273, no. 1, Elsevier, 1996, pp. 4–12, doi:<a href=\"https://doi.org/10.1016/0005-2728(95)00125-5\">10.1016/0005-2728(95)00125-5</a>.","ama":"Bizouarn T, Sazanov LA, Aubourg S, Jackson J. Estimation of the H+/H- ratio of the reaction catalysed by the nicotinamide nucleotide transhydrogenase in chromatophores from over-expressing strains of Rhodospirillum rubrum and in liposomes inlaid with the purified bovine enzyme. <i>Biochimica et Biophysica Acta - Bioenergetics</i>. 1996;1273(1):4-12. doi:<a href=\"https://doi.org/10.1016/0005-2728(95)00125-5\">10.1016/0005-2728(95)00125-5</a>","ieee":"T. Bizouarn, L. A. Sazanov, S. Aubourg, and J. Jackson, “Estimation of the H+/H- ratio of the reaction catalysed by the nicotinamide nucleotide transhydrogenase in chromatophores from over-expressing strains of Rhodospirillum rubrum and in liposomes inlaid with the purified bovine enzyme,” <i>Biochimica et Biophysica Acta - Bioenergetics</i>, vol. 1273, no. 1. Elsevier, pp. 4–12, 1996.","short":"T. Bizouarn, L.A. Sazanov, S. Aubourg, J. Jackson, Biochimica et Biophysica Acta - Bioenergetics 1273 (1996) 4–12.","apa":"Bizouarn, T., Sazanov, L. A., Aubourg, S., &#38; Jackson, J. (1996). Estimation of the H+/H- ratio of the reaction catalysed by the nicotinamide nucleotide transhydrogenase in chromatophores from over-expressing strains of Rhodospirillum rubrum and in liposomes inlaid with the purified bovine enzyme. <i>Biochimica et Biophysica Acta - Bioenergetics</i>. Elsevier. <a href=\"https://doi.org/10.1016/0005-2728(95)00125-5\">https://doi.org/10.1016/0005-2728(95)00125-5</a>","ista":"Bizouarn T, Sazanov LA, Aubourg S, Jackson J. 1996. Estimation of the H+/H- ratio of the reaction catalysed by the nicotinamide nucleotide transhydrogenase in chromatophores from over-expressing strains of Rhodospirillum rubrum and in liposomes inlaid with the purified bovine enzyme. Biochimica et Biophysica Acta - Bioenergetics. 1273(1), 4–12."},"intvolume":"      1273","status":"public","pmid":1,"acknowledgement":"L.A.S. would like to thank the Wellcome Trust, and T.B., the Biotechnology and Biological Sciences Research Council, for financial support. We are very grateful to Nick Cotton for helpful advice.","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"lang":"eng","text":"Two strains of Rhodospirillum rubrum were constructed in which, by a gene dosage effect, the transhydrogenase activity of isolated chromatophores was increased 7-10-fold and 15-20-fold, respectively. The H+/H- ratio (the ratio of protons translocated per hydride ion equivalent transferred from NADPH to an NAD+ analogue, acetyl pyridine adenine dinucleotide), determined by a spectroscopic technique, was approximately 1.0 for chromatophores from the over-expressing strains, but was only approximately 0.6 for wild-type chromatophores. Highly-coupled proteoliposomes were prepared containing purified transhydrogenase from beef-heart mitochondria. Using the same technique, the H+/H- ratio was close to 1.0 for these proteoliposomes. It is suggested that the mechanistic H+/H- ratio is indeed unity, but that a low ratio is obtained in wild-type chromatophores because of inhomogeneity in the vesicle population."}],"title":"Estimation of the H+/H- ratio of the reaction catalysed by the nicotinamide nucleotide transhydrogenase in chromatophores from over-expressing strains of Rhodospirillum rubrum and in liposomes inlaid with the purified bovine enzyme","_id":"1952"},{"issue":"2","publication_identifier":{"issn":["00166731"]},"abstract":[{"text":"The tra-1 gene is a terminal regulator of somatic sex in Caenorhabditis elegans: high tra-1 activity elicits female development, low tra-1 activity elicits male development. To investigate the function and evolution of tra- 1, we examined the tra-1 gene from the closely related nematode C. briggsae. Ce-tra-1 and Cb-tra-1 are unusually divergent. Each gene generates two transcripts, but only one of these is present in both species. This common transcript encodes TRA-1A, which shows only 44% amino acid identity between the species, a figure much lower than that for previously compared genes. A Cb-tra-1 transgene rescues many tissues of tra-1(null) mutants of C. elegans but not the somatic gonad or germ line. This transgene also causes nongonadal feminization of XO animals, indicating incorrect sexual regulation. Alignment of Ce-TRA-1A and Cb-TRA-1A defined several conserved regions likely to be important for tra-1 function. The phenotype differences between Ce-tra- 1(null) mutants rescued by Cb-tra-1 transgenes and wild-type C. elegans indicate significant divergence of regulatory regions. These molecular and functional studies suggest that evolution of sex determination in nematodes is rapid and genetically complex.","lang":"eng"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"6161","title":"Evolution of sex determination in Caenorhabditis: Unusually high divergence of tra-1 and its functional consequences","pmid":1,"status":"public","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC1207552/"}],"citation":{"mla":"de Bono, Mario, and J. Hodgkin. “Evolution of Sex Determination in Caenorhabditis: Unusually High Divergence of Tra-1 and Its Functional Consequences.” <i>Genetics</i>, vol. 144, no. 2, Genetics Society of America, 1996, pp. 587–95.","ama":"de Bono M, Hodgkin J. Evolution of sex determination in Caenorhabditis: Unusually high divergence of tra-1 and its functional consequences. <i>Genetics</i>. 1996;144(2):587-595.","chicago":"Bono, Mario de, and J. Hodgkin. “Evolution of Sex Determination in Caenorhabditis: Unusually High Divergence of Tra-1 and Its Functional Consequences.” <i>Genetics</i>. Genetics Society of America, 1996.","apa":"de Bono, M., &#38; Hodgkin, J. (1996). Evolution of sex determination in Caenorhabditis: Unusually high divergence of tra-1 and its functional consequences. <i>Genetics</i>. Genetics Society of America.","ista":"de Bono M, Hodgkin J. 1996. Evolution of sex determination in Caenorhabditis: Unusually high divergence of tra-1 and its functional consequences. Genetics. 144(2), 587–595.","short":"M. de Bono, J. Hodgkin, Genetics 144 (1996) 587–595.","ieee":"M. de Bono and J. Hodgkin, “Evolution of sex determination in Caenorhabditis: Unusually high divergence of tra-1 and its functional consequences,” <i>Genetics</i>, vol. 144, no. 2. Genetics Society of America, pp. 587–595, 1996."},"intvolume":"       144","year":"1996","language":[{"iso":"eng"}],"keyword":["amino acid sequence","article","caenorhabditis elegans","evolution","genetic variability","nonhuman","priority journal","sex determination","Amino Acid Sequence","Animals","Animals","Genetically Modified","Base Sequence","Caenorhabditis","Caenorhabditis elegans","Caenorhabditis elegans Proteins","DNA","Helminth","DNA-Binding Proteins","Evolution","Molecular","Female","Helminth Proteins","Membrane Proteins","Molecular Sequence Data","Mutagenesis","RNA","Messenger","Sequence Homology","Amino Acid","Sex Determination (Analysis)","Transcription Factors","Transgenes","Turner Syndrome","Animalia","Caenorhabditis","Caenorhabditis briggsae","Caenorhabditis elegans","Nematoda"],"author":[{"orcid":"0000-0001-8347-0443","last_name":"de Bono","first_name":"Mario","id":"4E3FF80E-F248-11E8-B48F-1D18A9856A87","full_name":"de Bono, Mario"},{"first_name":"J.","full_name":"Hodgkin, J.","last_name":"Hodgkin"}],"page":"587-595","date_created":"2019-03-21T11:50:37Z","publication_status":"published","day":"01","publication":"Genetics","date_updated":"2021-01-12T08:06:28Z","publisher":"Genetics Society of America","month":"10","extern":"1","quality_controlled":"1","oa":1,"volume":144,"date_published":"1996-10-01T00:00:00Z","type":"journal_article","external_id":{"pmid":["8889522"]},"oa_version":"Published Version"},{"author":[{"full_name":"Melcher, Thorsten","first_name":"Thorsten","last_name":"Melcher"},{"last_name":"Geiger","full_name":"Geiger, Jörg","first_name":"Jörg"},{"first_name":"Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","full_name":"Jonas, Peter M","orcid":"0000-0001-5001-4804","last_name":"Jonas"},{"last_name":"Monyer","full_name":"Monyer, Hannah","first_name":"Hannah"}],"page":"141 - 144","date_created":"2018-12-11T12:03:27Z","publist_id":"2925","publication_status":"published","day":"01","language":[{"iso":"eng"}],"year":"1996","volume":28,"date_published":"1996-02-01T00:00:00Z","type":"journal_article","external_id":{"pmid":["8719701 "]},"article_type":"original","oa_version":"None","article_processing_charge":"No","publication":"Neurochemistry International","date_updated":"2022-08-11T09:42:29Z","publisher":"Elsevier","doi":"10.1016/0197-0186(95)00077-1","month":"02","extern":"1","quality_controlled":"1","issue":"2","publication_identifier":{"issn":["0197-0186"]},"scopus_import":"1","status":"public","citation":{"short":"T. Melcher, J. Geiger, P.M. Jonas, H. Monyer, Neurochemistry International 28 (1996) 141–144.","ieee":"T. Melcher, J. Geiger, P. M. Jonas, and H. Monyer, “Analysis of molecular determinants in native AMPA receptors,” <i>Neurochemistry International</i>, vol. 28, no. 2. Elsevier, pp. 141–144, 1996.","apa":"Melcher, T., Geiger, J., Jonas, P. M., &#38; Monyer, H. (1996). Analysis of molecular determinants in native AMPA receptors. <i>Neurochemistry International</i>. Elsevier. <a href=\"https://doi.org/10.1016/0197-0186(95)00077-1\">https://doi.org/10.1016/0197-0186(95)00077-1</a>","ista":"Melcher T, Geiger J, Jonas PM, Monyer H. 1996. Analysis of molecular determinants in native AMPA receptors. Neurochemistry International. 28(2), 141–144.","chicago":"Melcher, Thorsten, Jörg Geiger, Peter M Jonas, and Hannah Monyer. “Analysis of Molecular Determinants in Native AMPA Receptors.” <i>Neurochemistry International</i>. Elsevier, 1996. <a href=\"https://doi.org/10.1016/0197-0186(95)00077-1\">https://doi.org/10.1016/0197-0186(95)00077-1</a>.","mla":"Melcher, Thorsten, et al. “Analysis of Molecular Determinants in Native AMPA Receptors.” <i>Neurochemistry International</i>, vol. 28, no. 2, Elsevier, 1996, pp. 141–44, doi:<a href=\"https://doi.org/10.1016/0197-0186(95)00077-1\">10.1016/0197-0186(95)00077-1</a>.","ama":"Melcher T, Geiger J, Jonas PM, Monyer H. Analysis of molecular determinants in native AMPA receptors. <i>Neurochemistry International</i>. 1996;28(2):141-144. doi:<a href=\"https://doi.org/10.1016/0197-0186(95)00077-1\">10.1016/0197-0186(95)00077-1</a>"},"intvolume":"        28","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"3462","title":"Analysis of molecular determinants in native AMPA receptors","pmid":1},{"year":"1996","language":[{"iso":"eng"}],"page":"35-41 and - 193-194","conference":{"location":"Hong Kong","end_date":"1996-07-04","start_date":"1996-07-01","name":"VRST: Symposium on Virtual Reality Software and Technology"},"author":[{"last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Fu","full_name":"Fu, Ping","first_name":"Ping"},{"last_name":"Quian","first_name":"Jiang","full_name":"Quian, Jiang"}],"publication_status":"published","publist_id":"2832","day":"01","date_created":"2018-12-11T12:03:56Z","publication_identifier":{"isbn":["9780897918251"]},"publication":"Proceedings of the ACM Symposium on Virtual Reality Software and Technology","_id":"3553","publisher":"ACM","doi":"10.1145/3304181.3304190","date_updated":"2022-08-10T13:42:02Z","title":"Geometric modeling in CAVE","abstract":[{"lang":"eng","text":"Virtual environments open up new opportunities and challenges for geometric modeling systems. A general approach to geometric modeling suitable for the Cave Automatic Virtual Environment is described. The approach is based on alpha complexes, and some of its capabilities are demonstrated by applying it to the study of biomolecules."}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_processing_charge":"No","acknowledgement":"We thank Ernst Miicke and Michael Facello for their work on the Alpha shape library, and Nataraj Akkiraju for his work on the surface triangulation library. We thank NCSA for providing access to the CAVE.","extern":"1","quality_controlled":"1","month":"07","status":"public","type":"conference","date_published":"1996-07-01T00:00:00Z","citation":{"ista":"Edelsbrunner H, Fu P, Quian J. 1996. Geometric modeling in CAVE. Proceedings of the ACM Symposium on Virtual Reality Software and Technology. VRST: Symposium on Virtual Reality Software and Technology, 35-41 and-193–194.","apa":"Edelsbrunner, H., Fu, P., &#38; Quian, J. (1996). Geometric modeling in CAVE. In <i>Proceedings of the ACM Symposium on Virtual Reality Software and Technology</i> (pp. 35-41 and-193–194). Hong Kong: ACM. <a href=\"https://doi.org/10.1145/3304181.3304190\">https://doi.org/10.1145/3304181.3304190</a>","ieee":"H. Edelsbrunner, P. Fu, and J. Quian, “Geometric modeling in CAVE,” in <i>Proceedings of the ACM Symposium on Virtual Reality Software and Technology</i>, Hong Kong, 1996, pp. 35-41 and-193–194.","short":"H. Edelsbrunner, P. Fu, J. Quian, in:, Proceedings of the ACM Symposium on Virtual Reality Software and Technology, ACM, 1996, pp. 35-41 and-193–194.","ama":"Edelsbrunner H, Fu P, Quian J. Geometric modeling in CAVE. In: <i>Proceedings of the ACM Symposium on Virtual Reality Software and Technology</i>. ACM; 1996:35-41 and-193-194. doi:<a href=\"https://doi.org/10.1145/3304181.3304190\">10.1145/3304181.3304190</a>","mla":"Edelsbrunner, Herbert, et al. “Geometric Modeling in CAVE.” <i>Proceedings of the ACM Symposium on Virtual Reality Software and Technology</i>, ACM, 1996, pp. 35-41 and-193–94, doi:<a href=\"https://doi.org/10.1145/3304181.3304190\">10.1145/3304181.3304190</a>.","chicago":"Edelsbrunner, Herbert, Ping Fu, and Jiang Quian. “Geometric Modeling in CAVE.” In <i>Proceedings of the ACM Symposium on Virtual Reality Software and Technology</i>, 35-41 and-193–94. ACM, 1996. <a href=\"https://doi.org/10.1145/3304181.3304190\">https://doi.org/10.1145/3304181.3304190</a>."},"oa_version":"None"},{"intvolume":"       351","citation":{"mla":"Barton, Nicholas H., and James Mallet. “Natural Selection and Random Genetic Drift as Causes of Evolution on Islands.” <i>Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences</i>, vol. 351, no. 1341, Royal Society of London, 1996, pp. 785–95, doi:<a href=\"https://doi.org/10.1098/rstb.1996.0073\">10.1098/rstb.1996.0073</a>.","ama":"Barton NH, Mallet J. Natural selection and random genetic drift as causes of evolution on islands. <i>Philosophical Transactions of the Royal Society of London Series B, Biological Sciences</i>. 1996;351(1341):785-795. doi:<a href=\"https://doi.org/10.1098/rstb.1996.0073\">10.1098/rstb.1996.0073</a>","chicago":"Barton, Nicholas H, and James Mallet. “Natural Selection and Random Genetic Drift as Causes of Evolution on Islands.” <i>Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences</i>. Royal Society of London, 1996. <a href=\"https://doi.org/10.1098/rstb.1996.0073\">https://doi.org/10.1098/rstb.1996.0073</a>.","apa":"Barton, N. H., &#38; Mallet, J. (1996). Natural selection and random genetic drift as causes of evolution on islands. <i>Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences</i>. Royal Society of London. <a href=\"https://doi.org/10.1098/rstb.1996.0073\">https://doi.org/10.1098/rstb.1996.0073</a>","ista":"Barton NH, Mallet J. 1996. Natural selection and random genetic drift as causes of evolution on islands. Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences. 351(1341), 785–795.","ieee":"N. H. Barton and J. Mallet, “Natural selection and random genetic drift as causes of evolution on islands,” <i>Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences</i>, vol. 351, no. 1341. Royal Society of London, pp. 785–795, 1996.","short":"N.H. Barton, J. Mallet, Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences 351 (1996) 785–795."},"status":"public","pmid":1,"title":"Natural selection and random genetic drift as causes of evolution on islands","_id":"3634","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"text":"The evolutionary processes responsible for adaptation and speciation on islands differ in several ways from those on the mainland. Most attention has been given to the random genetic drift that arises when a population is founded from just a few colonizing genomes. Theoretical obstacles to 'founder effect speciation' are discussed, together with recent proposals for avoiding them. It is argued that although certain kinds of epistasis can facilitate the evolution of strong reproductive isolation, this favours divergence by selection as much as by random drift.","lang":"eng"}],"publication_identifier":{"issn":["0962-8436"]},"issue":"1341","scopus_import":"1","oa_version":"None","external_id":{"pmid":["8693020"]},"article_type":"original","date_published":"1996-06-29T00:00:00Z","type":"journal_article","volume":351,"quality_controlled":"1","extern":"1","month":"06","publisher":"Royal Society of London","date_updated":"2022-08-10T12:57:10Z","doi":"10.1098/rstb.1996.0073","publication":"Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences","article_processing_charge":"No","day":"29","publist_id":"2749","publication_status":"published","date_created":"2018-12-11T12:04:21Z","page":"785 - 795","author":[{"full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","last_name":"Barton","orcid":"0000-0002-8548-5240"},{"first_name":"James","full_name":"Mallet, James","last_name":"Mallet"}],"language":[{"iso":"eng"}],"year":"1996"},{"article_processing_charge":"No","publication":"Genetical Research","date_updated":"2022-08-10T12:38:51Z","doi":"10.1017/S0016672300033450","publisher":"Cambridge University Press","month":"02","extern":"1","quality_controlled":"1","volume":67,"type":"journal_article","date_published":"1996-02-01T00:00:00Z","oa_version":"None","external_id":{"pmid":["8919888 "]},"article_type":"original","language":[{"iso":"eng"}],"year":"1996","author":[{"full_name":"Charlesworth, Brian","first_name":"Brian","last_name":"Charlesworth"},{"last_name":"Barton","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H"}],"page":"27 - 41","date_created":"2018-12-11T12:04:21Z","publication_status":"published","publist_id":"2748","day":"01","abstract":[{"lang":"eng","text":"Experiments on Drosophila suggest that genetic recombination may result in lowered fitness of progeny (a 'recombination load'). This has been interpreted as evidence either for a direct effect of recombination on fitness, or for the maintenance of linkage disequilibria by epistatic selection. Here we show that such a recombination load is to be expected even if selection favours increased genetic recombination. This is because of the fact that, although a modifier may suffer an immediate loss of fitness if it increases recombination, it eventually becomes associated with a higher additive genetic variance in fitness, which allows a faster response to direction selection. This argument applies to mutation-selection balance with synergistic epistasis, directional selection on quantitative traits, and ectopic exchange among transposable elements. Further experiments are needed to determine whether the selection against recombination due to the immediate load is outweighed by the increased additive variance in fitness produced by recombination."}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"3635","title":"Recombination load associated with selection for increased recombination","pmid":1,"status":"public","intvolume":"        67","citation":{"mla":"Charlesworth, Brian, and Nicholas H. Barton. “Recombination Load Associated with Selection for Increased Recombination.” <i>Genetical Research</i>, vol. 67, no. 1, Cambridge University Press, 1996, pp. 27–41, doi:<a href=\"https://doi.org/10.1017/S0016672300033450\">10.1017/S0016672300033450</a>.","ama":"Charlesworth B, Barton NH. Recombination load associated with selection for increased recombination. <i>Genetical Research</i>. 1996;67(1):27-41. doi:<a href=\"https://doi.org/10.1017/S0016672300033450\">10.1017/S0016672300033450</a>","chicago":"Charlesworth, Brian, and Nicholas H Barton. “Recombination Load Associated with Selection for Increased Recombination.” <i>Genetical Research</i>. Cambridge University Press, 1996. <a href=\"https://doi.org/10.1017/S0016672300033450\">https://doi.org/10.1017/S0016672300033450</a>.","apa":"Charlesworth, B., &#38; Barton, N. H. (1996). Recombination load associated with selection for increased recombination. <i>Genetical Research</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/S0016672300033450\">https://doi.org/10.1017/S0016672300033450</a>","ista":"Charlesworth B, Barton NH. 1996. Recombination load associated with selection for increased recombination. Genetical Research. 67(1), 27–41.","ieee":"B. Charlesworth and N. H. Barton, “Recombination load associated with selection for increased recombination,” <i>Genetical Research</i>, vol. 67, no. 1. Cambridge University Press, pp. 27–41, 1996.","short":"B. Charlesworth, N.H. Barton, Genetical Research 67 (1996) 27–41."},"scopus_import":"1","issue":"1","publication_identifier":{"issn":["0016-6723"]}},{"author":[{"first_name":"Marileen","full_name":"Dogterom, Marileen","last_name":"Dogterom"},{"last_name":"Felix","first_name":"M.","full_name":"Felix, M."},{"last_name":"Guet","orcid":"0000-0001-6220-2052","full_name":"Guet, Calin C","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","first_name":"Calin C"},{"last_name":"Leibler","full_name":"Leibler, Stanislas","first_name":"Stanislas"}],"page":"125 - 140","date_created":"2018-12-11T12:05:00Z","day":"01","publication_status":"published","publist_id":"2473","language":[{"iso":"eng"}],"year":"1996","date_published":"1996-01-01T00:00:00Z","type":"journal_article","volume":133,"external_id":{"pmid":["8601601"]},"article_type":"original","oa_version":"Published Version","article_processing_charge":"No","publisher":"Rockefeller University Press","doi":"doi: 10.1083/jcb.133.1.125 ","date_updated":"2022-08-09T14:20:13Z","publication":"Journal of Cell Biology","month":"01","oa":1,"quality_controlled":"1","extern":"1","issue":"1","publication_identifier":{"issn":["0021-9525"]},"scopus_import":"1","status":"public","intvolume":"       133","citation":{"ama":"Dogterom M, Felix M, Guet CC, Leibler S. Influence of M-phase chromatin on the anisotropy of microtubule asters. <i>Journal of Cell Biology</i>. 1996;133(1):125-140. doi:<a href=\"https://doi.org/doi: 10.1083/jcb.133.1.125 \">doi: 10.1083/jcb.133.1.125 </a>","mla":"Dogterom, Marileen, et al. “Influence of M-Phase Chromatin on the Anisotropy of Microtubule Asters.” <i>Journal of Cell Biology</i>, vol. 133, no. 1, Rockefeller University Press, 1996, pp. 125–40, doi:<a href=\"https://doi.org/doi: 10.1083/jcb.133.1.125 \">doi: 10.1083/jcb.133.1.125 </a>.","chicago":"Dogterom, Marileen, M. Felix, Calin C Guet, and Stanislas Leibler. “Influence of M-Phase Chromatin on the Anisotropy of Microtubule Asters.” <i>Journal of Cell Biology</i>. Rockefeller University Press, 1996. <a href=\"https://doi.org/doi: 10.1083/jcb.133.1.125 \">https://doi.org/doi: 10.1083/jcb.133.1.125 </a>.","ista":"Dogterom M, Felix M, Guet CC, Leibler S. 1996. Influence of M-phase chromatin on the anisotropy of microtubule asters. Journal of Cell Biology. 133(1), 125–140.","apa":"Dogterom, M., Felix, M., Guet, C. C., &#38; Leibler, S. (1996). Influence of M-phase chromatin on the anisotropy of microtubule asters. <i>Journal of Cell Biology</i>. Rockefeller University Press. <a href=\"https://doi.org/doi: 10.1083/jcb.133.1.125 \">https://doi.org/doi: 10.1083/jcb.133.1.125 </a>","ieee":"M. Dogterom, M. Felix, C. C. Guet, and S. Leibler, “Influence of M-phase chromatin on the anisotropy of microtubule asters,” <i>Journal of Cell Biology</i>, vol. 133, no. 1. Rockefeller University Press, pp. 125–140, 1996.","short":"M. Dogterom, M. Felix, C.C. Guet, S. Leibler, Journal of Cell Biology 133 (1996) 125–140."},"main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2120784/"}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"lang":"eng","text":"In many eukaryotic cells going through M-phase, a bipolar spindle is formed by microtubules nucleated from centrosomes. These microtubules, in addition to being `'captured” by kinetochores, may be stabilized by chromatin in two different ways: short-range stabilization effects may affect microtubules in close contact with the chromatin, while long-range stabilization effects may `'guide” microtubule growth towards the chromatin (e.g., by introducing a diffusive gradient of an enzymatic activity that affects microtubule assembly). Here, we use both meiotic and mitotic extracts from Xenopus laevis eggs to study microtubule aster formation and microtubule dynamics in the presence of chromatin. In `'low-speed” meiotic extracts, in the presence of salmon sperm chromatin, we find that short-range stabilization effects lead to a strong anisotropy of the microtubule asters. Analysis of the dynamic parameters of microtubule growth shows that this anisotropy arises from a decrease in the catastrophe frequency, an increase in the rescue frequency and a decrease in the growth velocity. In this system we also find evidence for long-range `'guidance” effects, which lead to a weak anisotropy of the asters. Statistically relevant results on these long-range effects are obtained in `'high-speed” mitotic extracts in the presence of artificially constructed chromatin stripes. We find that aster anisotropy is biased in the direction of the chromatin and that the catastrophe frequency is reduced in its vicinity. In this system we also find a surprising dependence of the catastrophe and the rescue frequencies on the length of microtubules nucleated from centrosomes: the catastrophe frequency increases and the rescue frequency decreases with microtubule length."}],"title":"Influence of M-phase chromatin on the anisotropy of microtubule asters","_id":"3756","pmid":1,"acknowledgement":"We would like to thank T. Holy and T. Mitchison for providing us with centrosomes; M. Glotzer and T. Mitchison for giving us the plasmid for A90 cyclin B; J. Stock and members of his laboratory for help with biochemical preparations; R. Zimmerman for help with the biotinylation of DNA; J. Shepard for help with the patterning of surfaces; D. Tsui for use\r\nof his clean room facility, and D. Fygenson, T. Holy, E. Karsenti, E. Kennedy, A. Levine, T. Mitchison, and G. Waters for valuable discussions, constant encouragement and technical help. This work was partially supported by the National Institutes of Health (Grant No. GM-50712) and the Human Frontier Science Program."},{"oa_version":"None","article_type":"original","date_published":"1996-07-01T00:00:00Z","type":"journal_article","volume":16,"quality_controlled":"1","extern":"1","month":"07","date_updated":"2022-08-09T13:32:21Z","publisher":"IEEE","doi":"10.1109/38.511855","publication":"IEEE Computer Graphics and Applications","article_processing_charge":"No","day":"01","publication_status":"published","publist_id":"2101","date_created":"2018-12-11T12:06:30Z","page":"58 - 61","author":[{"full_name":"Akkiraju, Nataraj","first_name":"Nataraj","last_name":"Akkiraju"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"},{"last_name":"Fu","full_name":"Fu, Ping","first_name":"Ping"},{"full_name":"Qian, Jiang","first_name":"Jiang","last_name":"Qian"}],"year":"1996","language":[{"iso":"eng"}],"citation":{"ama":"Akkiraju N, Edelsbrunner H, Fu P, Qian J. Viewing geometric protein structures from inside a CAVE. <i>IEEE Computer Graphics and Applications</i>. 1996;16(4):58-61. doi:<a href=\"https://doi.org/10.1109/38.511855\">10.1109/38.511855</a>","mla":"Akkiraju, Nataraj, et al. “Viewing Geometric Protein Structures from inside a CAVE.” <i>IEEE Computer Graphics and Applications</i>, vol. 16, no. 4, IEEE, 1996, pp. 58–61, doi:<a href=\"https://doi.org/10.1109/38.511855\">10.1109/38.511855</a>.","chicago":"Akkiraju, Nataraj, Herbert Edelsbrunner, Ping Fu, and Jiang Qian. “Viewing Geometric Protein Structures from inside a CAVE.” <i>IEEE Computer Graphics and Applications</i>. IEEE, 1996. <a href=\"https://doi.org/10.1109/38.511855\">https://doi.org/10.1109/38.511855</a>.","ista":"Akkiraju N, Edelsbrunner H, Fu P, Qian J. 1996. Viewing geometric protein structures from inside a CAVE. IEEE Computer Graphics and Applications. 16(4), 58–61.","apa":"Akkiraju, N., Edelsbrunner, H., Fu, P., &#38; Qian, J. (1996). Viewing geometric protein structures from inside a CAVE. <i>IEEE Computer Graphics and Applications</i>. IEEE. <a href=\"https://doi.org/10.1109/38.511855\">https://doi.org/10.1109/38.511855</a>","ieee":"N. Akkiraju, H. Edelsbrunner, P. Fu, and J. Qian, “Viewing geometric protein structures from inside a CAVE,” <i>IEEE Computer Graphics and Applications</i>, vol. 16, no. 4. IEEE, pp. 58–61, 1996.","short":"N. Akkiraju, H. Edelsbrunner, P. Fu, J. Qian, IEEE Computer Graphics and Applications 16 (1996) 58–61."},"intvolume":"        16","status":"public","title":"Viewing geometric protein structures from inside a CAVE","_id":"4024","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"lang":"eng","text":"We have developed general modeling software for a Cave Automatic Virtual Environment (CAVE); one of its applications is modeling 3D protein structures, generating both outside-in and inside-out views of geometric models. An advantage of the CAVE over other virtual environments is that multiple viewers can observe the same scene at the same time and place. Our software is scalable-from high-end virtual environments such as the CAVE, to mid-range immersive desktop systems, down to low-end graphics workstations. In the current configuration, a parallel Silicon Graphics Power Challenge supercomputer architecture performs the computationally intensive construction of surface patches remotely, and sends the results through the I-WAY (Information Wide Area Year) using VBNS (Very-high-Bandwidth Network Systems) to the graphics machines that drive the CAVE and our graphics visualization software, Valvis (Virtual ALpha shapes VISualizer)."}],"publication_identifier":{"issn":["0018-9162"]},"issue":"4","scopus_import":"1"},{"page":"5 - 22","author":[{"full_name":"Akkiraju, Nataraj","first_name":"Nataraj","last_name":"Akkiraju"},{"full_name":"Edelsbrunner, Herbert","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"}],"publication_status":"published","publist_id":"2102","day":"05","date_created":"2018-12-11T12:06:30Z","language":[{"iso":"eng"}],"year":"1996","volume":71,"type":"journal_article","date_published":"1996-12-05T00:00:00Z","oa_version":"Published Version","article_type":"original","publication":"Discrete Applied Mathematics","doi":"10.1016/S0166-218X(96)00054-6","publisher":"Elsevier","date_updated":"2022-08-09T14:06:12Z","article_processing_charge":"No","extern":"1","quality_controlled":"1","oa":1,"month":"12","issue":"1-3","publication_identifier":{"issn":["0166-218X"]},"scopus_import":"1","status":"public","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/S0166218X96000546?via%3Dihub","open_access":"1"}],"intvolume":"        71","citation":{"ieee":"N. Akkiraju and H. Edelsbrunner, “Triangulating the surface of a molecule,” <i>Discrete Applied Mathematics</i>, vol. 71, no. 1–3. Elsevier, pp. 5–22, 1996.","short":"N. Akkiraju, H. Edelsbrunner, Discrete Applied Mathematics 71 (1996) 5–22.","ista":"Akkiraju N, Edelsbrunner H. 1996. Triangulating the surface of a molecule. Discrete Applied Mathematics. 71(1–3), 5–22.","apa":"Akkiraju, N., &#38; Edelsbrunner, H. (1996). Triangulating the surface of a molecule. <i>Discrete Applied Mathematics</i>. Elsevier. <a href=\"https://doi.org/10.1016/S0166-218X(96)00054-6\">https://doi.org/10.1016/S0166-218X(96)00054-6</a>","chicago":"Akkiraju, Nataraj, and Herbert Edelsbrunner. “Triangulating the Surface of a Molecule.” <i>Discrete Applied Mathematics</i>. Elsevier, 1996. <a href=\"https://doi.org/10.1016/S0166-218X(96)00054-6\">https://doi.org/10.1016/S0166-218X(96)00054-6</a>.","ama":"Akkiraju N, Edelsbrunner H. Triangulating the surface of a molecule. <i>Discrete Applied Mathematics</i>. 1996;71(1-3):5-22. doi:<a href=\"https://doi.org/10.1016/S0166-218X(96)00054-6\">10.1016/S0166-218X(96)00054-6</a>","mla":"Akkiraju, Nataraj, and Herbert Edelsbrunner. “Triangulating the Surface of a Molecule.” <i>Discrete Applied Mathematics</i>, vol. 71, no. 1–3, Elsevier, 1996, pp. 5–22, doi:<a href=\"https://doi.org/10.1016/S0166-218X(96)00054-6\">10.1016/S0166-218X(96)00054-6</a>."},"_id":"4025","title":"Triangulating the surface of a molecule","abstract":[{"text":"Questions of chemical reactivity can often be cast as questions of molecular geometry. Common geometric models for proteins and other molecules are the space-filling diagram, the solvent accessible surface and the molecular surface. In this paper we present a new approach to triangulating the surface of a molecule under the three models, which is fast, robust, and results in topologically correct triangulations. Our computations are based on a simplicial complex dual to the molecule models. All proposed algorithms are parallelizable.","lang":"eng"}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","acknowledgement":"The research of both authors is partially supported by the Office of Naval Research. Herbert Edelsbrunner is also supported through the Alan T. Waterman award, grant CCR-9118874. "},{"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"lang":"eng","text":"A set of n weighted points in general position in R(d) defines a unique regular triangulation. This paper proves that if the points are added one by one, then flipping in a topological order will succeed in constructing this triangulation. If, in addition, the points are added in a random sequence and the history of the flips is used for locating the next point, then the algorithm takes expected time at most O(n log n + n(inverted left perpendicular d/2 inverted right perpendicular)). Under the assumption that the points and weights are independently and identically distributed, the expected running time is between proportional to and a factor log n more than the expected size of the regular triangulation. The expectation is over choosing the points and over independent coin-flips performed by the algorithm."}],"title":"Incremental topological flipping works for regular triangulations","_id":"4026","acknowledgement":"National Science Foundation under Grant CCR-8921421, Alan T. Waterman award, Grant CCR-9118874.","status":"public","citation":{"mla":"Edelsbrunner, Herbert, and Nimish Shah. “Incremental Topological Flipping Works for Regular Triangulations.” <i>Algorithmica</i>, vol. 15, no. 3, Springer, 1996, pp. 223–41, doi:<a href=\"https://doi.org/10.1007/BF01975867\">10.1007/BF01975867</a>.","ama":"Edelsbrunner H, Shah N. Incremental topological flipping works for regular triangulations. <i>Algorithmica</i>. 1996;15(3):223-241. doi:<a href=\"https://doi.org/10.1007/BF01975867\">10.1007/BF01975867</a>","chicago":"Edelsbrunner, Herbert, and Nimish Shah. “Incremental Topological Flipping Works for Regular Triangulations.” <i>Algorithmica</i>. Springer, 1996. <a href=\"https://doi.org/10.1007/BF01975867\">https://doi.org/10.1007/BF01975867</a>.","apa":"Edelsbrunner, H., &#38; Shah, N. (1996). Incremental topological flipping works for regular triangulations. <i>Algorithmica</i>. Springer. <a href=\"https://doi.org/10.1007/BF01975867\">https://doi.org/10.1007/BF01975867</a>","ista":"Edelsbrunner H, Shah N. 1996. Incremental topological flipping works for regular triangulations. Algorithmica. 15(3), 223–241.","ieee":"H. Edelsbrunner and N. Shah, “Incremental topological flipping works for regular triangulations,” <i>Algorithmica</i>, vol. 15, no. 3. Springer, pp. 223–241, 1996.","short":"H. Edelsbrunner, N. Shah, Algorithmica 15 (1996) 223–241."},"intvolume":"        15","scopus_import":"1","issue":"3","publication_identifier":{"issn":["0178-4617"]},"article_processing_charge":"No","doi":"10.1007/BF01975867","publisher":"Springer","date_updated":"2022-08-09T09:46:07Z","publication":"Algorithmica","month":"03","quality_controlled":"1","extern":"1","type":"journal_article","date_published":"1996-03-01T00:00:00Z","volume":15,"oa_version":"None","article_type":"original","year":"1996","language":[{"iso":"eng"}],"author":[{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"},{"last_name":"Shah","full_name":"Shah, Nimish","first_name":"Nimish"}],"page":"223 - 241","date_created":"2018-12-11T12:06:31Z","day":"01","publist_id":"2099","publication_status":"published"},{"acknowledgement":"Work on this paper by Bernard Chazelle has been supported by NSF Grant CCR-87-00917. Work on this paper by Herbert Edelsbrunner has been supported by NSF Grant CCR-87-14565. Work on this paper by Leonidas Guibas has been supported by grants from the Mitsubishi and Toshiba Corporations. Work on this paper by Micha Sharir has been supported by ONR Grant N00014-87-K-0129, by NSF Grants DCR-83-20085 and CCR-89-01484, and by grants from the U.S.-Israeli Binational Science Foundation, the NCRD — the Israeli National Council for Research and Development, and the EMET Fund of the Israeli Academy of Sciences.","_id":"4027","title":"Lines in space: Combinatorics and algorithms","abstract":[{"lang":"eng","text":"Questions about lines in space arise frequently as subproblems in three-dimensional computational geometry. In this paper we study a number of fundamental combinatorial and algorithmic problems involving arrangements of n lines in three-dimensional space. Our main results include: 1. A tight Θ(n2) bound on the maximum combinatorial description complexity of the set of all oriented lines that have specified orientations relative to the n given lines. 2. A similar bound of Θ(n3) for the complexity of the set of all lines passing above the n given lines. 3. A preprocessing procedure using O(n2+ε) time and storage, for any ε &gt; 0, that builds a structure supporting O(logn)-time queries for testing if a line lies above all the given lines. 4. An algorithm that tests the &quot;towering property&quot; in O(n4/3+ε) time, for any ε &gt; 0: do n given red lines lie all above n given blue lines? The tools used to obtain these and other results include Plücker coordinates for lines in space and ε-nets for various geometric range spaces."}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","citation":{"chicago":"Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, Micha Sharir, and Jorge Stolfi. “Lines in Space: Combinatorics and Algorithms.” <i>Algorithmica</i>. Springer, 1996. <a href=\"https://doi.org/10.1007/BF01955043\">https://doi.org/10.1007/BF01955043</a>.","mla":"Chazelle, Bernard, et al. “Lines in Space: Combinatorics and Algorithms.” <i>Algorithmica</i>, vol. 15, no. 5, Springer, 1996, pp. 428–47, doi:<a href=\"https://doi.org/10.1007/BF01955043\">10.1007/BF01955043</a>.","ama":"Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Stolfi J. Lines in space: Combinatorics and algorithms. <i>Algorithmica</i>. 1996;15(5):428-447. doi:<a href=\"https://doi.org/10.1007/BF01955043\">10.1007/BF01955043</a>","short":"B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, J. Stolfi, Algorithmica 15 (1996) 428–447.","ieee":"B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, and J. Stolfi, “Lines in space: Combinatorics and algorithms,” <i>Algorithmica</i>, vol. 15, no. 5. Springer, pp. 428–447, 1996.","apa":"Chazelle, B., Edelsbrunner, H., Guibas, L., Sharir, M., &#38; Stolfi, J. (1996). Lines in space: Combinatorics and algorithms. <i>Algorithmica</i>. Springer. <a href=\"https://doi.org/10.1007/BF01955043\">https://doi.org/10.1007/BF01955043</a>","ista":"Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Stolfi J. 1996. Lines in space: Combinatorics and algorithms. Algorithmica. 15(5), 428–447."},"intvolume":"        15","status":"public","scopus_import":"1","publication_identifier":{"issn":["0178-4617"]},"issue":"5","extern":"1","quality_controlled":"1","month":"05","publication":"Algorithmica","date_updated":"2022-08-09T09:55:46Z","doi":"10.1007/BF01955043","publisher":"Springer","article_processing_charge":"No","oa_version":"None","article_type":"original","volume":15,"date_published":"1996-05-01T00:00:00Z","type":"journal_article","language":[{"iso":"eng"}],"year":"1996","publication_status":"published","publist_id":"2100","day":"01","date_created":"2018-12-11T12:06:31Z","page":"428 - 447","author":[{"first_name":"Bernard","full_name":"Chazelle, Bernard","last_name":"Chazelle"},{"last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Leonidas","full_name":"Guibas, Leonidas","last_name":"Guibas"},{"last_name":"Sharir","first_name":"Micha","full_name":"Sharir, Micha"},{"full_name":"Stolfi, Jorge","first_name":"Jorge","last_name":"Stolfi"}]},{"page":"A224 - A224","issue":"2, Part 2","author":[{"last_name":"Liang","first_name":"Jie","full_name":"Liang, Jie"},{"orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"},{"first_name":"Shankar","full_name":"Subramaniam, Shankar","last_name":"Subramaniam"}],"day":"19","publist_id":"2097","publication_status":"published","date_created":"2018-12-11T12:06:32Z","year":"1996","language":[{"iso":"eng"}],"status":"public","type":"conference_poster","date_published":"1996-02-19T00:00:00Z","volume":70,"intvolume":"        70","citation":{"ista":"Liang J, Edelsbrunner H, Subramaniam S. 1996. Effects of molecular shape representations on boundary element method for protein electrostatics computations, Cell Press,p.","apa":"Liang, J., Edelsbrunner, H., &#38; Subramaniam, S. (1996). <i>Effects of molecular shape representations on boundary element method for protein electrostatics computations</i>. <i>Fortieth Annual Meeting</i> (Vol. 70, pp. A224–A224). Cell Press. <a href=\"https://doi.org/10.1016/S0006-3495(96)79664-9\">https://doi.org/10.1016/S0006-3495(96)79664-9</a>","short":"J. Liang, H. Edelsbrunner, S. Subramaniam, Effects of Molecular Shape Representations on Boundary Element Method for Protein Electrostatics Computations, Cell Press, 1996.","ieee":"J. Liang, H. Edelsbrunner, and S. Subramaniam, <i>Effects of molecular shape representations on boundary element method for protein electrostatics computations</i>, vol. 70, no. 2, Part 2. Cell Press, 1996, pp. A224–A224.","ama":"Liang J, Edelsbrunner H, Subramaniam S. <i>Effects of Molecular Shape Representations on Boundary Element Method for Protein Electrostatics Computations</i>. Vol 70. Cell Press; 1996:A224-A224. doi:<a href=\"https://doi.org/10.1016/S0006-3495(96)79664-9\">10.1016/S0006-3495(96)79664-9</a>","mla":"Liang, Jie, et al. “Effects of Molecular Shape Representations on Boundary Element Method for Protein Electrostatics Computations.” <i>Fortieth Annual Meeting</i>, vol. 70, no. 2, Part 2, Cell Press, 1996, pp. A224–A224, doi:<a href=\"https://doi.org/10.1016/S0006-3495(96)79664-9\">10.1016/S0006-3495(96)79664-9</a>.","chicago":"Liang, Jie, Herbert Edelsbrunner, and Shankar Subramaniam. <i>Effects of Molecular Shape Representations on Boundary Element Method for Protein Electrostatics Computations</i>. <i>Fortieth Annual Meeting</i>. Vol. 70. Cell Press, 1996. <a href=\"https://doi.org/10.1016/S0006-3495(96)79664-9\">https://doi.org/10.1016/S0006-3495(96)79664-9</a>."},"main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/S0006349596796649?via%3Dihub","open_access":"1"}],"oa_version":"None","doi":"10.1016/S0006-3495(96)79664-9","publisher":"Cell Press","title":"Effects of molecular shape representations on boundary element method for protein electrostatics computations","date_updated":"2022-08-08T10:22:38Z","_id":"4030","publication":"Fortieth Annual Meeting","article_processing_charge":"No","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","oa":1,"acknowledgement":"article M-Pos412","extern":"1","month":"02"},{"status":"public","volume":70,"date_published":"1996-02-21T00:00:00Z","type":"conference_poster","main_file_link":[{"open_access":"1","url":"https://www.sciencedirect.com/science/article/pii/S0006349596796704?via%3Dihub"}],"intvolume":"        70","citation":{"chicago":"Liang, Jie, Herbert Edelsbrunner, Sudhakar Pamidghantam, and Shankar Subramaniam. <i>Analytical Method for Molecular Shapes: Area, Volume, Cavities, Interface and Pockets</i>. <i>Fortieth Annual Meeting</i>. Vol. 70. Cell Press, 1996. <a href=\"https://doi.org/10.1016/S0006-3495(96)79670-4\">https://doi.org/10.1016/S0006-3495(96)79670-4</a>.","mla":"Liang, Jie, et al. “Analytical Method for Molecular Shapes: Area, Volume, Cavities, Interface and Pockets.” <i>Fortieth Annual Meeting</i>, vol. 70, no. 2, Part 2, Cell Press, 1996, pp. A377–A377, doi:<a href=\"https://doi.org/10.1016/S0006-3495(96)79670-4\">10.1016/S0006-3495(96)79670-4</a>.","ama":"Liang J, Edelsbrunner H, Pamidghantam S, Subramaniam S. <i>Analytical Method for Molecular Shapes: Area, Volume, Cavities, Interface and Pockets</i>. Vol 70. Cell Press; 1996:A377-A377. doi:<a href=\"https://doi.org/10.1016/S0006-3495(96)79670-4\">10.1016/S0006-3495(96)79670-4</a>","ieee":"J. Liang, H. Edelsbrunner, S. Pamidghantam, and S. Subramaniam, <i>Analytical method for molecular shapes: Area, volume, cavities, interface and pockets</i>, vol. 70, no. 2, Part 2. Cell Press, 1996, pp. A377–A377.","short":"J. Liang, H. Edelsbrunner, S. Pamidghantam, S. Subramaniam, Analytical Method for Molecular Shapes: Area, Volume, Cavities, Interface and Pockets, Cell Press, 1996.","apa":"Liang, J., Edelsbrunner, H., Pamidghantam, S., &#38; Subramaniam, S. (1996). <i>Analytical method for molecular shapes: Area, volume, cavities, interface and pockets</i>. <i>Fortieth Annual Meeting</i> (Vol. 70, pp. A377–A377). Cell Press. <a href=\"https://doi.org/10.1016/S0006-3495(96)79670-4\">https://doi.org/10.1016/S0006-3495(96)79670-4</a>","ista":"Liang J, Edelsbrunner H, Pamidghantam S, Subramaniam S. 1996. Analytical method for molecular shapes: Area, volume, cavities, interface and pockets, Cell Press,p."},"oa_version":"None","_id":"4031","publication":"Fortieth Annual Meeting","publisher":"Cell Press","title":"Analytical method for molecular shapes: Area, volume, cavities, interface and pockets","doi":"10.1016/S0006-3495(96)79670-4","date_updated":"2022-08-08T10:21:56Z","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_processing_charge":"No","extern":"1","acknowledgement":"article W-AM-L6","oa":1,"month":"02","page":"A377 - A377","author":[{"last_name":"Liang","first_name":"Jie","full_name":"Liang, Jie"},{"orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Pamidghantam","first_name":"Sudhakar","full_name":"Pamidghantam, Sudhakar"},{"first_name":"Shankar","full_name":"Subramaniam, Shankar","last_name":"Subramaniam"}],"issue":"2, Part 2","publication_status":"published","publist_id":"2098","day":"21","date_created":"2018-12-11T12:06:32Z","year":"1996","language":[{"iso":"eng"}]}]