[{"volume":2,"status":"public","intvolume":"         2","quality_controlled":0,"publisher":"Kluwer","publication_status":"published","date_published":"1996-01-01T00:00:00Z","_id":"1942","date_created":"2018-12-11T11:54:50Z","extern":1,"month":"01","page":"705 - 708","date_updated":"2021-01-12T06:54:14Z","alternative_title":["Photosynthesis: from light to biosphere"],"year":"1996","author":[{"orcid":"0000-0002-0977-7989","id":"338D39FE-F248-11E8-B48F-1D18A9856A87","last_name":"Sazanov","first_name":"Leonid A","full_name":"Leonid Sazanov"},{"first_name":"P","full_name":"Burrows, P","last_name":"Burrows"},{"full_name":"Nixon, P J","first_name":"P J","last_name":"Nixon"}],"type":"conference","day":"01","publist_id":"5143","conference":{"name":"IPC: International Photosynthesis Congress"},"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","citation":{"short":"L.A. Sazanov, P. Burrows, P.J. Nixon, in:, Kluwer, 1996, pp. 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.","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.","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.","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.","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.","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."}},{"pmid":1,"language":[{"iso":"eng"}],"doi":"10.1042/bst0240739","citation":{"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>.","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.","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.","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>.","short":"L.A. Sazanov, P. Burrows, P. Nixon, Biochemical Society Transactions 24 (1996) 739–743.","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>","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>"},"title":"Detection and characterization of a complex I-like NADH-specific dehydrogenase from pea thylakoids","day":"01","type":"journal_article","author":[{"last_name":"Sazanov","full_name":"Sazanov, Leonid A","first_name":"Leonid A","orcid":"0000-0002-0977-7989","id":"338D39FE-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Paul","full_name":"Burrows, Paul","last_name":"Burrows"},{"first_name":"Peter","full_name":"Nixon, Peter","last_name":"Nixon"}],"publisher":"Portland Press","publication":"Biochemical Society Transactions","quality_controlled":"1","intvolume":"        24","status":"public","page":"739 - 743","month":"01","extern":"1","date_created":"2018-12-11T11:54:53Z","scopus_import":"1","external_id":{"pmid":["8878837"]},"date_updated":"2022-08-16T08:25:02Z","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_identifier":{"issn":["0300-5127"]},"article_type":"original","publist_id":"5131","oa_version":"None","year":"1996","publication_status":"published","volume":24,"article_processing_charge":"No","issue":"3","date_published":"1996-01-01T00:00:00Z","_id":"1951"},{"issue":"1","article_processing_charge":"No","date_published":"1996-01-11T00:00:00Z","_id":"1952","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."}],"publication_status":"published","volume":1273,"publist_id":"5132","article_type":"original","oa_version":"None","year":"1996","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","date_updated":"2022-08-16T12:35:22Z","external_id":{"pmid":["8573594 "]},"publication_identifier":{"issn":["0005-2728"]},"page":"4 - 12","extern":"1","month":"01","date_created":"2018-12-11T11:54:53Z","publisher":"Elsevier","quality_controlled":"1","publication":"Biochimica et Biophysica Acta - Bioenergetics","intvolume":"      1273","status":"public","citation":{"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>","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>","short":"T. Bizouarn, L.A. Sazanov, S. Aubourg, J. Jackson, Biochimica et Biophysica Acta - Bioenergetics 1273 (1996) 4–12.","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>.","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.","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.","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>."},"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","day":"11","type":"journal_article","author":[{"last_name":"Bizouarn","full_name":"Bizouarn, Tania","first_name":"Tania"},{"last_name":"Sazanov","first_name":"Leonid A","full_name":"Sazanov, Leonid A","id":"338D39FE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0977-7989"},{"last_name":"Aubourg","first_name":"Sébastien","full_name":"Aubourg, Sébastien"},{"full_name":"Jackson, Julie","first_name":"Julie","last_name":"Jackson"}],"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.","pmid":1,"language":[{"iso":"eng"}],"doi":"10.1016/0005-2728(95)00125-5"},{"doi":"10.1007/3-540-61474-5","date_updated":"2022-07-06T07:38:10Z","language":[{"iso":"eng"}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","title":" 8th International Conference on Computer Aided Verification","conference":{"location":"New Brunswick, NJ, United States of America","name":"CAV: Computer Aided Verification","end_date":"1996-08-03","start_date":"1996-07-31"},"editor":[{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724"},{"last_name":"Alur","first_name":"Rajeev","full_name":"Alur, Rajeev"}],"citation":{"ieee":"T. A. Henzinger and R. Alur, Eds., <i> 8th International Conference on Computer Aided Verification</i>, vol. 1102. Springer, 1996.","ista":"Henzinger TA, Alur R eds. 1996.  8th International Conference on Computer Aided Verification, Springer,p.","chicago":"Henzinger, Thomas A, and Rajeev Alur, eds. <i> 8th International Conference on Computer Aided Verification</i>. Vol. 1102. Springer, 1996. <a href=\"https://doi.org/10.1007/3-540-61474-5\">https://doi.org/10.1007/3-540-61474-5</a>.","mla":"Henzinger, Thomas A., and Rajeev Alur, editors. <i> 8th International Conference on Computer Aided Verification</i>. Vol. 1102, Springer, 1996, doi:<a href=\"https://doi.org/10.1007/3-540-61474-5\">10.1007/3-540-61474-5</a>.","short":"T.A. Henzinger, R. Alur, eds.,  8th International Conference on Computer Aided Verification, Springer, 1996.","apa":"Henzinger, T. A., &#38; Alur, R. (Eds.). (1996). <i> 8th International Conference on Computer Aided Verification</i> (Vol. 1102). Presented at the CAV: Computer Aided Verification, New Brunswick, NJ, United States of America: Springer. <a href=\"https://doi.org/10.1007/3-540-61474-5\">https://doi.org/10.1007/3-540-61474-5</a>","ama":"Henzinger TA, Alur R, eds. <i> 8th International Conference on Computer Aided Verification</i>. Vol 1102. Springer; 1996. doi:<a href=\"https://doi.org/10.1007/3-540-61474-5\">10.1007/3-540-61474-5</a>"},"type":"conference_editor","oa_version":"None","alternative_title":["LNCS"],"year":"1996","publist_id":"122","day":"01","main_file_link":[{"url":"https://link.springer.com/book/10.1007/3-540-61474-5"}],"publication_status":"published","publisher":"Springer","status":"public","intvolume":"      1102","volume":1102,"article_processing_charge":"No","date_published":"1996-01-01T00:00:00Z","_id":"4585","date_created":"2018-12-11T12:09:36Z","month":"01","extern":"1"},{"status":"public","publication":"Proceedings 11th Annual IEEE Symposium on Logic in Computer Science","quality_controlled":"1","main_file_link":[{"url":"https://ieeexplore.ieee.org/document/561320"}],"publication_status":"published","publisher":"IEEE","date_published":"1996-01-01T00:00:00Z","_id":"4588","abstract":[{"lang":"eng","text":"We present a formal model for concurrent systems. The model represents synchronous and asynchronous components in a uniform framework that supports compositional (assume-guarantee) and hierarchical (stepwise refinement) reasoning. While synchronous models are based on a notion of atomic computation step, and asynchronous models remove that notion by introducing stuttering, our model is based on a flexible notion of what constitutes a computation step: by applying an abstraction operator to a system, arbitrarily many consecutive steps can be collapsed into a single step. The abstraction operator, which may turn an asynchronous system into a synchronous one, allows us to describe systems at various levels of temporal detail. For describing systems at various levels of spatial detail, we use a hiding operator that may turn a synchronous system into an asynchronous one. We illustrate the model with diverse examples from synchronous circuits, asynchronous shared-memory programs, and synchronous message passing"}],"date_created":"2018-12-11T12:09:37Z","month":"01","extern":"1","article_processing_charge":"No","page":"207 - 218","publication_identifier":{"issn":["0018-9162"]},"doi":"10.1109/LICS.1996.561320","scopus_import":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","language":[{"iso":"eng"}],"date_updated":"2022-07-04T14:51:40Z","author":[{"last_name":"Alur","full_name":"Alur, Rajeev","first_name":"Rajeev"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger"}],"type":"conference","oa_version":"None","year":"1996","day":"01","publist_id":"121","title":"Reactive modules","conference":{"location":"New Brunswick, NJ, USA","name":"LICS: Logic in Computer Science","start_date":"1996-07-27","end_date":"1996-07-30"},"citation":{"ieee":"R. Alur and T. A. Henzinger, “Reactive modules,” in <i>Proceedings 11th Annual IEEE Symposium on Logic in Computer Science</i>, New Brunswick, NJ, USA, 1996, pp. 207–218.","ista":"Alur R, Henzinger TA. 1996. Reactive modules. Proceedings 11th Annual IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 207–218.","chicago":"Alur, Rajeev, and Thomas A Henzinger. “Reactive Modules.” In <i>Proceedings 11th Annual IEEE Symposium on Logic in Computer Science</i>, 207–18. IEEE, 1996. <a href=\"https://doi.org/10.1109/LICS.1996.561320\">https://doi.org/10.1109/LICS.1996.561320</a>.","mla":"Alur, Rajeev, and Thomas A. Henzinger. “Reactive Modules.” <i>Proceedings 11th Annual IEEE Symposium on Logic in Computer Science</i>, IEEE, 1996, pp. 207–18, doi:<a href=\"https://doi.org/10.1109/LICS.1996.561320\">10.1109/LICS.1996.561320</a>.","short":"R. Alur, T.A. Henzinger, in:, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science, IEEE, 1996, pp. 207–218.","apa":"Alur, R., &#38; Henzinger, T. A. (1996). Reactive modules. In <i>Proceedings 11th Annual IEEE Symposium on Logic in Computer Science</i> (pp. 207–218). New Brunswick, NJ, USA: IEEE. <a href=\"https://doi.org/10.1109/LICS.1996.561320\">https://doi.org/10.1109/LICS.1996.561320</a>","ama":"Alur R, Henzinger TA. Reactive modules. In: <i>Proceedings 11th Annual IEEE Symposium on Logic in Computer Science</i>. IEEE; 1996:207-218. doi:<a href=\"https://doi.org/10.1109/LICS.1996.561320\">10.1109/LICS.1996.561320</a>"}},{"main_file_link":[{"url":"https://dl.acm.org/doi/10.1145/227595.227602"}],"publication_status":"published","volume":43,"article_processing_charge":"No","issue":"1","date_published":"1996-01-01T00:00:00Z","_id":"4610","abstract":[{"lang":"eng","text":"The most natural, compositional, way of modeling real-time systems uses a dense domain for time. The satisfiability of timing constraints that are capable of expressing punctuality in this model, however, is known to be undecidable. We introduce a temporal language that can constrain the time difference between events only with finite, yet arbitrary, precision and show the resulting logic to be EXPSPACE-complete. This result allows us to develop an algorithm for the verification of timing properties of real-time systems with a dense semantics."}],"publication_identifier":{"issn":["0004-5411"]},"scopus_import":"1","date_updated":"2022-07-04T12:38:01Z","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","oa_version":"None","year":"1996","article_type":"original","publist_id":"95","publisher":"ACM","status":"public","intvolume":"        43","publication":"Journal of the ACM","quality_controlled":"1","page":"116 - 146","date_created":"2018-12-11T12:09:44Z","month":"01","extern":"1","acknowledgement":"We wish to thank an anonymous referee for pointing out the PSPACE-fragment of Section 4.5. ","doi":"10.1145/227595.227602","language":[{"iso":"eng"}],"title":"The benefits of relaxing punctuality","citation":{"short":"R. Alur, T. Feder, T.A. Henzinger, Journal of the ACM 43 (1996) 116–146.","apa":"Alur, R., Feder, T., &#38; Henzinger, T. A. (1996). The benefits of relaxing punctuality. <i>Journal of the ACM</i>. ACM. <a href=\"https://doi.org/10.1145/227595.227602\">https://doi.org/10.1145/227595.227602</a>","ama":"Alur R, Feder T, Henzinger TA. The benefits of relaxing punctuality. <i>Journal of the ACM</i>. 1996;43(1):116-146. doi:<a href=\"https://doi.org/10.1145/227595.227602\">10.1145/227595.227602</a>","ieee":"R. Alur, T. Feder, and T. A. Henzinger, “The benefits of relaxing punctuality,” <i>Journal of the ACM</i>, vol. 43, no. 1. ACM, pp. 116–146, 1996.","ista":"Alur R, Feder T, Henzinger TA. 1996. The benefits of relaxing punctuality. Journal of the ACM. 43(1), 116–146.","chicago":"Alur, Rajeev, Tomás Feder, and Thomas A Henzinger. “The Benefits of Relaxing Punctuality.” <i>Journal of the ACM</i>. ACM, 1996. <a href=\"https://doi.org/10.1145/227595.227602\">https://doi.org/10.1145/227595.227602</a>.","mla":"Alur, Rajeev, et al. “The Benefits of Relaxing Punctuality.” <i>Journal of the ACM</i>, vol. 43, no. 1, ACM, 1996, pp. 116–46, doi:<a href=\"https://doi.org/10.1145/227595.227602\">10.1145/227595.227602</a>."},"type":"journal_article","author":[{"last_name":"Alur","first_name":"Rajeev","full_name":"Alur, Rajeev"},{"last_name":"Feder","full_name":"Feder, Tomás","first_name":"Tomás"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A"}],"day":"01"},{"status":"public","intvolume":"        22","quality_controlled":"1","publication":"IEEE Transactions on Software Engineering","publisher":"IEEE","date_created":"2018-12-11T12:09:45Z","extern":"1","month":"03","page":"181 - 201","doi":"10.1109/32.489079","language":[{"iso":"eng"}],"acknowledgement":"We thank Costas Courcoubetis, Nicolas Halbwachs, Peter Kopke, Joseph Sifakis, and Howard Wong-Toi for helpful\r\ndiscussions and valuable comments. Thomas A. Henzinger's research was supported in part by the U.S. Office of Naval Research Young Investigator award N00014-95-1-0520, by the National Science Foundation CAREER award CCR-9501708, by National Science Foundation grants CCR-9200794 and CCR-9504469, by U.S. Air Force Office of Scientific Research contract F49620-93-1- 0056, and by Advanced Research Projects Agency grant NAG2-892. ","author":[{"full_name":"Alur, Rajeev","first_name":"Rajeev","last_name":"Alur"},{"last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"first_name":"Pei","full_name":"Ho, Pei","last_name":"Ho"}],"type":"journal_article","day":"01","title":"Automatic symbolic verification of embedded systems","citation":{"chicago":"Alur, Rajeev, Thomas A Henzinger, and Pei Ho. “Automatic Symbolic Verification of Embedded Systems.” <i>IEEE Transactions on Software Engineering</i>. IEEE, 1996. <a href=\"https://doi.org/10.1109/32.489079\">https://doi.org/10.1109/32.489079</a>.","ista":"Alur R, Henzinger TA, Ho P. 1996. Automatic symbolic verification of embedded systems. IEEE Transactions on Software Engineering. 22(3), 181–201.","ieee":"R. Alur, T. A. Henzinger, and P. Ho, “Automatic symbolic verification of embedded systems,” <i>IEEE Transactions on Software Engineering</i>, vol. 22, no. 3. IEEE, pp. 181–201, 1996.","mla":"Alur, Rajeev, et al. “Automatic Symbolic Verification of Embedded Systems.” <i>IEEE Transactions on Software Engineering</i>, vol. 22, no. 3, IEEE, 1996, pp. 181–201, doi:<a href=\"https://doi.org/10.1109/32.489079\">10.1109/32.489079</a>.","short":"R. Alur, T.A. Henzinger, P. Ho, IEEE Transactions on Software Engineering 22 (1996) 181–201.","ama":"Alur R, Henzinger TA, Ho P. Automatic symbolic verification of embedded systems. <i>IEEE Transactions on Software Engineering</i>. 1996;22(3):181-201. doi:<a href=\"https://doi.org/10.1109/32.489079\">10.1109/32.489079</a>","apa":"Alur, R., Henzinger, T. A., &#38; Ho, P. (1996). Automatic symbolic verification of embedded systems. <i>IEEE Transactions on Software Engineering</i>. IEEE. <a href=\"https://doi.org/10.1109/32.489079\">https://doi.org/10.1109/32.489079</a>"},"volume":22,"main_file_link":[{"url":"https://ecommons.cornell.edu/handle/1813/7170","open_access":"1"}],"oa":1,"publication_status":"published","abstract":[{"text":"Presents a model-checking procedure and its implementation for the automatic verification of embedded systems. The system components are described as hybrid automata-communicating machines with finite control and real-valued variables that represent continuous environment parameters such as time, pressure and temperature. The system requirements are specified in a temporal logic with stop-watches, and verified by symbolic fixpoint computation. The verification procedure-implemented in the Cornell Hybrid Technology tool, HyTech-applies to hybrid automata whose continuous dynamics is governed by linear constraints on the variables and their derivatives. We illustrate the method and the tool by checking safety, liveness, time-bounded and duration requirements of digital controllers, schedulers and distributed algorithms","lang":"eng"}],"_id":"4611","date_published":"1996-03-01T00:00:00Z","issue":"3","article_processing_charge":"No","publication_identifier":{"issn":["0018-9162"]},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","date_updated":"2022-07-04T12:47:05Z","scopus_import":"1","oa_version":"Published Version","year":"1996","publist_id":"96","article_type":"original"},{"type":"book_editor","year":"1996","oa_version":"None","alternative_title":["LNCS"],"day":"01","publist_id":"97","title":"Hybrid Systems III: Verification and Control","editor":[{"first_name":"Rajeev","full_name":"Alur, Rajeev","last_name":"Alur"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Sontag","first_name":"Eduardo D","full_name":"Sontag, Eduardo D"}],"citation":{"ista":"Alur R, Henzinger TA, Sontag ED eds. 1996. Hybrid Systems III: Verification and Control, Berlin ; Heidelberg: Springer, IX, 619p.","ieee":"R. Alur, T. A. Henzinger, and E. D. Sontag, Eds., <i>Hybrid Systems III: Verification and Control</i>, vol. 1066. Berlin ; Heidelberg: Springer, 1996.","chicago":"Alur, Rajeev, Thomas A Henzinger, and Eduardo D Sontag, eds. <i>Hybrid Systems III: Verification and Control</i>. Vol. 1066. Lecture Notes in Computer Science. Berlin ; Heidelberg: Springer, 1996. <a href=\"https://doi.org/10.1007/BFb0020931\">https://doi.org/10.1007/BFb0020931</a>.","mla":"Alur, Rajeev, et al., editors. <i>Hybrid Systems III: Verification and Control</i>. Vol. 1066, Springer, 1996, doi:<a href=\"https://doi.org/10.1007/BFb0020931\">10.1007/BFb0020931</a>.","short":"R. Alur, T.A. Henzinger, E.D. Sontag, eds., Hybrid Systems III: Verification and Control, Springer, Berlin ; Heidelberg, 1996.","apa":"Alur, R., Henzinger, T. A., &#38; Sontag, E. D. (Eds.). (1996). <i>Hybrid Systems III: Verification and Control</i> (Vol. 1066). Berlin ; Heidelberg: Springer. <a href=\"https://doi.org/10.1007/BFb0020931\">https://doi.org/10.1007/BFb0020931</a>","ama":"Alur R, Henzinger TA, Sontag ED, eds. <i>Hybrid Systems III: Verification and Control</i>. Vol 1066. Berlin ; Heidelberg: Springer; 1996. doi:<a href=\"https://doi.org/10.1007/BFb0020931\">10.1007/BFb0020931</a>"},"publication_identifier":{"issn":["0302-9743"],"isbn":["978-3-540-61155-4"]},"doi":"10.1007/BFb0020931","date_updated":"2021-12-22T13:57:33Z","language":[{"iso":"eng"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","_id":"4612","series_title":"Lecture Notes in Computer Science","date_published":"1996-01-01T00:00:00Z","date_created":"2018-12-11T12:09:45Z","month":"01","place":"Berlin ; Heidelberg","extern":"1","article_processing_charge":"No","page":"IX, 619","intvolume":"      1066","status":"public","volume":1066,"quality_controlled":"1","publication_status":"published","publisher":"Springer"},{"pmid":1,"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"],"language":[{"iso":"eng"}],"citation":{"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.","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.","short":"M. de Bono, J. Hodgkin, Genetics 144 (1996) 587–595.","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.","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.","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.","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."},"title":"Evolution of sex determination in Caenorhabditis: Unusually high divergence of tra-1 and its functional consequences","day":"01","author":[{"last_name":"de Bono","full_name":"de Bono, Mario","first_name":"Mario","orcid":"0000-0001-8347-0443","id":"4E3FF80E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"J.","full_name":"Hodgkin, J.","last_name":"Hodgkin"}],"type":"journal_article","publisher":"Genetics Society of America","publication":"Genetics","quality_controlled":"1","intvolume":"       144","status":"public","page":"587-595","month":"10","extern":"1","date_created":"2019-03-21T11:50:37Z","external_id":{"pmid":["8889522"]},"date_updated":"2021-01-12T08:06:28Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"issn":["00166731"]},"oa_version":"Published Version","year":"1996","publication_status":"published","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC1207552/"}],"oa":1,"volume":144,"issue":"2","abstract":[{"lang":"eng","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."}],"_id":"6161","date_published":"1996-10-01T00:00:00Z"},{"citation":{"apa":"Henzinger, M. H., &#38; Telle, J. A. (1996). Faster algorithms for the nonemptiness of streett automata and for communication protocol pruning. In <i>5th Scandinavian Workshop on Algorithm Theory</i> (Vol. 1097, pp. 16–27). Reykjavik, Iceland: Springer Nature. <a href=\"https://doi.org/10.1007/3-540-61422-2_117\">https://doi.org/10.1007/3-540-61422-2_117</a>","ama":"Henzinger MH, Telle JA. Faster algorithms for the nonemptiness of streett automata and for communication protocol pruning. In: <i>5th Scandinavian Workshop on Algorithm Theory</i>. Vol 1097. Springer Nature; 1996:16–27. doi:<a href=\"https://doi.org/10.1007/3-540-61422-2_117\">10.1007/3-540-61422-2_117</a>","short":"M.H. Henzinger, J.A. Telle, in:, 5th Scandinavian Workshop on Algorithm Theory, Springer Nature, 1996, pp. 16–27.","mla":"Henzinger, Monika H., and Jan Arne Telle. “Faster Algorithms for the Nonemptiness of Streett Automata and for Communication Protocol Pruning.” <i>5th Scandinavian Workshop on Algorithm Theory</i>, vol. 1097, Springer Nature, 1996, pp. 16–27, doi:<a href=\"https://doi.org/10.1007/3-540-61422-2_117\">10.1007/3-540-61422-2_117</a>.","ieee":"M. H. Henzinger and J. A. Telle, “Faster algorithms for the nonemptiness of streett automata and for communication protocol pruning,” in <i>5th Scandinavian Workshop on Algorithm Theory</i>, Reykjavik, Iceland, 1996, vol. 1097, pp. 16–27.","ista":"Henzinger MH, Telle JA. 1996. Faster algorithms for the nonemptiness of streett automata and for communication protocol pruning. 5th Scandinavian Workshop on Algorithm Theory. SWAT: Scandinavian Workshop on Algorithm Theory, LNCS, vol. 1097, 16–27.","chicago":"Henzinger, Monika H, and Jan Arne Telle. “Faster Algorithms for the Nonemptiness of Streett Automata and for Communication Protocol Pruning.” In <i>5th Scandinavian Workshop on Algorithm Theory</i>, 1097:16–27. Springer Nature, 1996. <a href=\"https://doi.org/10.1007/3-540-61422-2_117\">https://doi.org/10.1007/3-540-61422-2_117</a>."},"conference":{"location":"Reykjavik, Iceland","end_date":"1996-07-05","start_date":"1996-07-03","name":"SWAT: Scandinavian Workshop on Algorithm Theory"},"title":"Faster algorithms for the nonemptiness of streett automata and for communication protocol pruning","day":"01","oa_version":"None","year":"1996","alternative_title":["LNCS"],"author":[{"last_name":"Henzinger","first_name":"Monika H","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530"},{"first_name":"Jan Arne","full_name":"Telle, Jan Arne","last_name":"Telle"}],"type":"conference","date_updated":"2023-02-14T07:52:17Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"scopus_import":"1","doi":"10.1007/3-540-61422-2_117","publication_identifier":{"isbn":["9783540614227"],"issn":["0302-9743"],"eissn":["1611-3349"],"eisbn":["9783540685296"]},"page":"16–27","article_processing_charge":"No","extern":"1","month":"07","_id":"11804","date_published":"1996-07-01T00:00:00Z","abstract":[{"lang":"eng","text":"This paper shows how a general technique, called lock-step search, used in dynamic graph algorithms, can be used to improve the running time of two problems arising in program verification and communication protocol design.\r\n(1)We consider the nonemptiness problem for Streett automata: We are given a directed graph G = (V, E) with n = ¦V¦ and m = ¦E¦, and a collection of pairs of subsets of vertices, called Streett pairs,〈L i , U i 〉, i = 1.k. The question is whether G has a cycle (not necessarily simple) which, for each 1 ≤ i ≤ k, if it contains a vertex from L i then it also contains a vertex of U i . Let b=Σ i=1..k |L i |+|U i |. The previously best algorithm takes time O((m + b) min{n, k}). We present an algorithm that takes time 𝑂(𝑚min{𝑚𝑙𝑜𝑔𝑛,‾‾‾‾‾‾√𝑘,𝑛}+𝑏𝑚𝑖𝑛{𝑙𝑜𝑔𝑛,𝑘}).\r\n(2)In communication protocol pruning we are given a directed graph G = (V, E) with l special vertices. The problem is to efficiently maintain the strongly-connected components of the special vertices on a restricted set of edge deletions. Let m i be the number of edges in the strongly connected component of the ith special vertex. The previously best algorithm repeatedly recomputes the strongly-connected components which leads to a running time of O(Σ i m 2i). We present an algorithm with time 𝑂(𝑙√∑𝑖𝑚1.5𝑖)."}],"date_created":"2022-08-11T13:42:42Z","publication_status":"published","publisher":"Springer Nature","quality_controlled":"1","publication":"5th Scandinavian Workshop on Algorithm Theory","volume":1097,"intvolume":"      1097","status":"public"},{"scopus_import":"1","date_updated":"2023-02-14T07:57:14Z","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"eissn":["1611-3349"],"isbn":["9783540614401"],"issn":["0302-9743"],"eisbn":["9783540685807"]},"doi":"10.1007/3-540-61440-0_136","citation":{"mla":"Henzinger, Monika H., and Mikkel Thorup. “Improved Sampling with Applications to Dynamic Graph Algorithms.” <i>23rd International Colloquium on Automata, Languages, and Programming</i>, vol. 1099, Springer Nature, 1996, pp. 290–99, doi:<a href=\"https://doi.org/10.1007/3-540-61440-0_136\">10.1007/3-540-61440-0_136</a>.","chicago":"Henzinger, Monika H, and Mikkel Thorup. “Improved Sampling with Applications to Dynamic Graph Algorithms.” In <i>23rd International Colloquium on Automata, Languages, and Programming</i>, 1099:290–99. Springer Nature, 1996. <a href=\"https://doi.org/10.1007/3-540-61440-0_136\">https://doi.org/10.1007/3-540-61440-0_136</a>.","ista":"Henzinger MH, Thorup M. 1996. Improved sampling with applications to dynamic graph algorithms. 23rd International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LNCS, vol. 1099, 290–299.","ieee":"M. H. Henzinger and M. Thorup, “Improved sampling with applications to dynamic graph algorithms,” in <i>23rd International Colloquium on Automata, Languages, and Programming</i>, Paderborn, Germany, 1996, vol. 1099, pp. 290–299.","ama":"Henzinger MH, Thorup M. Improved sampling with applications to dynamic graph algorithms. In: <i>23rd International Colloquium on Automata, Languages, and Programming</i>. Vol 1099. Springer Nature; 1996:290-299. doi:<a href=\"https://doi.org/10.1007/3-540-61440-0_136\">10.1007/3-540-61440-0_136</a>","apa":"Henzinger, M. H., &#38; Thorup, M. (1996). Improved sampling with applications to dynamic graph algorithms. In <i>23rd International Colloquium on Automata, Languages, and Programming</i> (Vol. 1099, pp. 290–299). Paderborn, Germany: Springer Nature. <a href=\"https://doi.org/10.1007/3-540-61440-0_136\">https://doi.org/10.1007/3-540-61440-0_136</a>","short":"M.H. Henzinger, M. Thorup, in:, 23rd International Colloquium on Automata, Languages, and Programming, Springer Nature, 1996, pp. 290–299."},"title":"Improved sampling with applications to dynamic graph algorithms","conference":{"end_date":"1996-07-12","start_date":"1996-07-08","name":"ICALP: International Colloquium on Automata, Languages, and Programming","location":"Paderborn, Germany"},"day":"01","type":"conference","author":[{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","first_name":"Monika H","full_name":"Henzinger, Monika H","last_name":"Henzinger"},{"last_name":"Thorup","full_name":"Thorup, Mikkel","first_name":"Mikkel"}],"oa_version":"None","year":"1996","alternative_title":["LNCS"],"publication_status":"published","publisher":"Springer Nature","publication":"23rd International Colloquium on Automata, Languages, and Programming","quality_controlled":"1","intvolume":"      1099","status":"public","volume":1099,"page":"290-299","article_processing_charge":"No","month":"07","extern":"1","abstract":[{"text":"We state a new sampling lemma and use it to improve the running time of dynamic graph algorithms.\r\n\r\nFor the dynamic connectivity problem the previously best randomized algorithm takes expected time O(log3 n) per update, amortized over Ω(m) updates. Using the new sampling lemma, we improve its running time to O(log2 n). There exists a lower bound in the cell probe model for the time per operation of Ω(log n/ log log n) for this problem.\r\n\r\nSimilarly improved running times are achieved for 2-edge connectivity, k-weight minimum spanning tree, and bipartiteness.","lang":"eng"}],"_id":"11910","date_published":"1996-07-01T00:00:00Z","date_created":"2022-08-18T06:42:24Z"},{"citation":{"chicago":"Henzinger, Monika H, Valerie King, and Tandy Warnow. “Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology.” In <i>7th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 333–40. Society for Industrial and Applied Mathematics, 1996.","ista":"Henzinger MH, King V, Warnow T. 1996. Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology. 7th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 333–340.","ieee":"M. H. Henzinger, V. King, and T. Warnow, “Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology,” in <i>7th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Atlanta, GA, United States, 1996, pp. 333–340.","mla":"Henzinger, Monika H., et al. “Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology.” <i>7th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Society for Industrial and Applied Mathematics, 1996, pp. 333–40.","short":"M.H. Henzinger, V. King, T. Warnow, in:, 7th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 1996, pp. 333–340.","ama":"Henzinger MH, King V, Warnow T. Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology. In: <i>7th Annual ACM-SIAM Symposium on Discrete Algorithms</i>. Society for Industrial and Applied Mathematics; 1996:333-340.","apa":"Henzinger, M. H., King, V., &#38; Warnow, T. (1996). Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology. In <i>7th Annual ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 333–340). Atlanta, GA, United States: Society for Industrial and Applied Mathematics."},"conference":{"name":"SODA: Symposium on Discrete Algorithms","end_date":"1996-01-30","start_date":"1996-01-28","location":"Atlanta, GA, United States"},"title":"Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology","day":"28","oa_version":"Published Version","year":"1996","type":"conference","author":[{"orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","full_name":"Henzinger, Monika H","first_name":"Monika H"},{"first_name":"Valerie","full_name":"King, Valerie","last_name":"King"},{"first_name":"Tandy","full_name":"Warnow, Tandy","last_name":"Warnow"}],"related_material":{"record":[{"status":"public","relation":"later_version","id":"11679"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-21T16:24:53Z","language":[{"iso":"eng"}],"scopus_import":"1","publication_identifier":{"isbn":["0898713668"]},"page":"333 -340","article_processing_charge":"No","extern":"1","month":"01","abstract":[{"lang":"eng","text":"We are given a set 7 = {Tl , Tz, . . . , Tk} of rooted binary trees, each Ti leaf-labeled by a subset L(x) c {1,2 )...) n}. IfT is a tree on {1,2, . . , n}, we let T]L denote the subtree of T induced by the nodes of L and all their ancestors. The consensus tree problem asks whether there exists a tree T* such that for every I, T’ IC(Ti) is homeomorphic to Ti. We present algorithms which test if a given set of trees has a consensus tree and if so, construct one. The deterministic algorithm takes time min{O(mn’/‘), O(m + n2 logn)}, where m = Ci IZl and uses linear space. The randomized algorithm takes\r\ntime O(m log3 n) and uses linear space. The previous best for this problem was an 1981 O(mn) algorithm by Aho et al. Our faster deterministic algorithm uses a new efficient algorithm for the following interesting dynamic graph problem: Given a graph G with n nodes and m edges and a sequence of b batches of one or more edge deletions, then after each batch, either find a new component that has just been created or determine that there is no such component. For this\r\nproblem, we have a simple algorithm with running time O(n2 log n + be min{ n2, m log n}), where be is the number of batches which do not result in a new component. For our particular application, bc 5 1. If all edges are deleted, then the best previously known deterministic algorithm requires time O(mJ;ii) to solve this problem. computational evolutionary biology. The first application is in the problem of inferring consensus of trees when there can be disagreement[l6]. There have, been several models suggested for this problem[2, 3, 4, 8, ?, 11, 17, 181, of which one is called the Local Consensus Tree[l5]. The local consensus tree model presumes that the user provides a local consensus rule which determines the form of the output tree on (perhaps) each triple of leaves, and the objective is to determine whether a tree exists which is consistent with each of the constraints. We will show that we can construct the local consensus tree of k trees on n species in O(kn3) time, improving on the O(lcn3 + n”) running time if we use the Aho et al algorithm. The second application is a\r\nheuristic for constructing the maximum likelihood tree based upon combining solutions to small subproblems.\r\nThis is a simple and yet potentially significantly interesting approach to the evolutionary tree construction\r\nproblem. "}],"_id":"11927","date_published":"1996-01-28T00:00:00Z","date_created":"2022-08-19T06:57:47Z","publication_status":"published","publisher":"Society for Industrial and Applied Mathematics","main_file_link":[{"open_access":"1","url":"https://dl.acm.org/doi/10.5555/313852.314080"}],"oa":1,"quality_controlled":"1","publication":"7th Annual ACM-SIAM Symposium on Discrete Algorithms","status":"public"},{"publication_status":"published","volume":28,"issue":"2","article_processing_charge":"No","date_published":"1996-02-01T00:00:00Z","_id":"3462","publication_identifier":{"issn":["0197-0186"]},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","date_updated":"2022-08-11T09:42:29Z","scopus_import":"1","external_id":{"pmid":["8719701 "]},"year":"1996","oa_version":"None","publist_id":"2925","article_type":"original","publisher":"Elsevier","intvolume":"        28","status":"public","quality_controlled":"1","publication":"Neurochemistry International","page":"141 - 144","date_created":"2018-12-11T12:03:27Z","extern":"1","month":"02","pmid":1,"doi":"10.1016/0197-0186(95)00077-1","language":[{"iso":"eng"}],"title":"Analysis of molecular determinants in native AMPA receptors","citation":{"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>.","ista":"Melcher T, Geiger J, Jonas PM, Monyer H. 1996. Analysis of molecular determinants in native AMPA receptors. Neurochemistry International. 28(2), 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.","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>.","short":"T. Melcher, J. Geiger, P.M. Jonas, H. Monyer, Neurochemistry International 28 (1996) 141–144.","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>","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>"},"author":[{"last_name":"Melcher","full_name":"Melcher, Thorsten","first_name":"Thorsten"},{"last_name":"Geiger","first_name":"Jörg","full_name":"Geiger, Jörg"},{"last_name":"Jonas","full_name":"Jonas, Peter M","first_name":"Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5001-4804"},{"full_name":"Monyer, Hannah","first_name":"Hannah","last_name":"Monyer"}],"type":"journal_article","day":"01"},{"extern":"1","month":"07","date_published":"1996-07-01T00:00:00Z","_id":"3553","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."}],"date_created":"2018-12-11T12:03:56Z","page":"35-41 and - 193-194","article_processing_charge":"No","quality_controlled":"1","publication":"Proceedings of the ACM Symposium on Virtual Reality Software and Technology","status":"public","publication_status":"published","publisher":"ACM","day":"01","publist_id":"2832","year":"1996","oa_version":"None","author":[{"first_name":"Herbert","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Ping","full_name":"Fu, Ping","last_name":"Fu"},{"last_name":"Quian","first_name":"Jiang","full_name":"Quian, Jiang"}],"type":"conference","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.","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.","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>.","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>.","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.","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>","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>"},"conference":{"name":"VRST: Symposium on Virtual Reality Software and Technology","start_date":"1996-07-01","end_date":"1996-07-04","location":"Hong Kong"},"title":"Geometric modeling in CAVE","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","date_updated":"2022-08-10T13:42:02Z","language":[{"iso":"eng"}],"doi":"10.1145/3304181.3304190","publication_identifier":{"isbn":["9780897918251"]},"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."},{"article_processing_charge":"No","issue":"1341","date_published":"1996-06-29T00:00:00Z","_id":"3634","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_status":"published","volume":351,"article_type":"original","publist_id":"2749","year":"1996","oa_version":"None","scopus_import":"1","external_id":{"pmid":["8693020"]},"date_updated":"2022-08-10T12:57:10Z","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_identifier":{"issn":["0962-8436"]},"page":"785 - 795","month":"06","extern":"1","date_created":"2018-12-11T12:04:21Z","publisher":"Royal Society of London","publication":"Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences","quality_controlled":"1","intvolume":"       351","status":"public","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>.","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>.","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.","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>","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>","short":"N.H. Barton, J. Mallet, Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences 351 (1996) 785–795."},"title":"Natural selection and random genetic drift as causes of evolution on islands","day":"29","type":"journal_article","author":[{"orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton","first_name":"Nicholas H","full_name":"Barton, Nicholas H"},{"first_name":"James","full_name":"Mallet, James","last_name":"Mallet"}],"pmid":1,"language":[{"iso":"eng"}],"doi":"10.1098/rstb.1996.0073"},{"oa_version":"None","year":"1996","article_type":"original","publist_id":"2748","publication_identifier":{"issn":["0016-6723"]},"external_id":{"pmid":["8919888 "]},"scopus_import":"1","date_updated":"2022-08-10T12:38:51Z","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_processing_charge":"No","issue":"1","abstract":[{"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.","lang":"eng"}],"_id":"3635","date_published":"1996-02-01T00:00:00Z","publication_status":"published","volume":67,"title":"Recombination load associated with selection for increased recombination","citation":{"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>","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>","short":"B. Charlesworth, N.H. Barton, Genetical Research 67 (1996) 27–41.","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>.","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>.","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."},"author":[{"full_name":"Charlesworth, Brian","first_name":"Brian","last_name":"Charlesworth"},{"last_name":"Barton","full_name":"Barton, Nicholas H","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240"}],"type":"journal_article","day":"01","pmid":1,"doi":"10.1017/S0016672300033450","language":[{"iso":"eng"}],"page":"27 - 41","date_created":"2018-12-11T12:04:21Z","month":"02","extern":"1","publisher":"Cambridge University Press","intvolume":"        67","status":"public","publication":"Genetical Research","quality_controlled":"1"},{"publication_identifier":{"issn":["0021-9525"]},"external_id":{"pmid":["8601601"]},"scopus_import":"1","date_updated":"2022-08-09T14:20:13Z","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","year":"1996","oa_version":"Published Version","article_type":"original","publist_id":"2473","oa":1,"main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2120784/"}],"publication_status":"published","volume":133,"article_processing_charge":"No","issue":"1","_id":"3756","date_published":"1996-01-01T00:00:00Z","abstract":[{"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.","lang":"eng"}],"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.","doi":"doi: 10.1083/jcb.133.1.125 ","language":[{"iso":"eng"}],"title":"Influence of M-phase chromatin on the anisotropy of microtubule asters","citation":{"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>.","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.","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.","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>.","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>","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>","short":"M. Dogterom, M. Felix, C.C. Guet, S. Leibler, Journal of Cell Biology 133 (1996) 125–140."},"author":[{"full_name":"Dogterom, Marileen","first_name":"Marileen","last_name":"Dogterom"},{"last_name":"Felix","first_name":"M.","full_name":"Felix, M."},{"id":"47F8433E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6220-2052","last_name":"Guet","first_name":"Calin C","full_name":"Guet, Calin C"},{"full_name":"Leibler, Stanislas","first_name":"Stanislas","last_name":"Leibler"}],"type":"journal_article","day":"01","publisher":"Rockefeller University Press","status":"public","intvolume":"       133","publication":"Journal of Cell Biology","quality_controlled":"1","page":"125 - 140","date_created":"2018-12-11T12:05:00Z","month":"01","extern":"1"},{"article_processing_charge":"No","issue":"4","date_published":"1996-07-01T00:00:00Z","_id":"4024","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_status":"published","volume":16,"oa_version":"None","year":"1996","article_type":"original","publist_id":"2101","publication_identifier":{"issn":["0018-9162"]},"scopus_import":"1","date_updated":"2022-08-09T13:32:21Z","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","page":"58 - 61","date_created":"2018-12-11T12:06:30Z","month":"07","extern":"1","publisher":"IEEE","status":"public","intvolume":"        16","publication":"IEEE Computer Graphics and Applications","quality_controlled":"1","title":"Viewing geometric protein structures from inside a CAVE","citation":{"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.","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.","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>.","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>.","short":"N. Akkiraju, H. Edelsbrunner, P. Fu, J. Qian, IEEE Computer Graphics and Applications 16 (1996) 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>","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>"},"author":[{"first_name":"Nataraj","full_name":"Akkiraju, Nataraj","last_name":"Akkiraju"},{"last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Fu","first_name":"Ping","full_name":"Fu, Ping"},{"first_name":"Jiang","full_name":"Qian, Jiang","last_name":"Qian"}],"type":"journal_article","day":"01","doi":"10.1109/38.511855","language":[{"iso":"eng"}]},{"date_updated":"2022-08-09T14:06:12Z","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","scopus_import":"1","publication_identifier":{"issn":["0166-218X"]},"publist_id":"2102","article_type":"original","oa_version":"Published Version","year":"1996","publication_status":"published","oa":1,"main_file_link":[{"open_access":"1","url":"https://www.sciencedirect.com/science/article/pii/S0166218X96000546?via%3Dihub"}],"volume":71,"issue":"1-3","article_processing_charge":"No","_id":"4025","date_published":"1996-12-05T00:00:00Z","abstract":[{"lang":"eng","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."}],"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. ","language":[{"iso":"eng"}],"doi":"10.1016/S0166-218X(96)00054-6","citation":{"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>.","ista":"Akkiraju N, Edelsbrunner H. 1996. Triangulating the surface of a molecule. Discrete Applied Mathematics. 71(1–3), 5–22.","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.","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>.","short":"N. Akkiraju, H. Edelsbrunner, Discrete Applied Mathematics 71 (1996) 5–22.","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>","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>"},"title":"Triangulating the surface of a molecule","day":"05","type":"journal_article","author":[{"full_name":"Akkiraju, Nataraj","first_name":"Nataraj","last_name":"Akkiraju"},{"orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","first_name":"Herbert","full_name":"Edelsbrunner, Herbert"}],"publisher":"Elsevier","quality_controlled":"1","publication":"Discrete Applied Mathematics","status":"public","intvolume":"        71","page":"5 - 22","extern":"1","month":"12","date_created":"2018-12-11T12:06:30Z"},{"status":"public","intvolume":"        15","publication":"Algorithmica","quality_controlled":"1","publisher":"Springer","date_created":"2018-12-11T12:06:31Z","month":"03","extern":"1","page":"223 - 241","doi":"10.1007/BF01975867","language":[{"iso":"eng"}],"acknowledgement":"National Science Foundation under Grant CCR-8921421, Alan T. Waterman award, Grant CCR-9118874.","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","first_name":"Herbert"},{"last_name":"Shah","full_name":"Shah, Nimish","first_name":"Nimish"}],"type":"journal_article","day":"01","title":"Incremental topological flipping works for regular triangulations","citation":{"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>.","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.","ista":"Edelsbrunner H, Shah N. 1996. Incremental topological flipping works for regular triangulations. Algorithmica. 15(3), 223–241.","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>.","short":"H. Edelsbrunner, N. Shah, Algorithmica 15 (1996) 223–241.","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>","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>"},"volume":15,"publication_status":"published","_id":"4026","abstract":[{"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.","lang":"eng"}],"date_published":"1996-03-01T00:00:00Z","article_processing_charge":"No","issue":"3","publication_identifier":{"issn":["0178-4617"]},"scopus_import":"1","date_updated":"2022-08-09T09:46:07Z","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","oa_version":"None","year":"1996","article_type":"original","publist_id":"2099"}]