[{"language":[{"iso":"eng"}],"year":"1996","date_created":"2018-12-11T12:09:16Z","publication_identifier":{"issn":["1043-6871"]},"day":"01","publication_status":"published","publist_id":"213","author":[{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A"}],"conference":{"start_date":"1996-07-27","name":"LICS: Logic in Computer Science","location":"New Brunswick, NJ, United States of America","end_date":"1996-07-30"},"page":"278 - 292","month":"01","quality_controlled":"1","extern":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_processing_charge":"No","abstract":[{"text":"We summarize several recent results about hybrid automata. Our goal is to demonstrate that concepts from the theory of discrete concurrent systems can give insights into partly continuous systems, and that methods for the verification of finite-state systems can be used to analyze certain systems with uncountable state spaces","lang":"eng"}],"publisher":"IEEE","title":"The theory of hybrid automata","date_updated":"2022-07-06T07:56:28Z","doi":"10.1109/LICS.1996.561342 ","publication":"Proceedings 11th Annual IEEE Symposium on Logic in Computer Science","_id":"4519","oa_version":"None","citation":{"chicago":"Henzinger, Thomas A. “The Theory of Hybrid Automata.” In <i>Proceedings 11th Annual IEEE Symposium on Logic in Computer Science</i>, 278–92. IEEE, 1996. <a href=\"https://doi.org/10.1109/LICS.1996.561342 \">https://doi.org/10.1109/LICS.1996.561342 </a>.","ama":"Henzinger TA. The theory of hybrid automata. In: <i>Proceedings 11th Annual IEEE Symposium on Logic in Computer Science</i>. IEEE; 1996:278-292. doi:<a href=\"https://doi.org/10.1109/LICS.1996.561342 \">10.1109/LICS.1996.561342 </a>","mla":"Henzinger, Thomas A. “The Theory of Hybrid Automata.” <i>Proceedings 11th Annual IEEE Symposium on Logic in Computer Science</i>, IEEE, 1996, pp. 278–92, doi:<a href=\"https://doi.org/10.1109/LICS.1996.561342 \">10.1109/LICS.1996.561342 </a>.","ieee":"T. A. Henzinger, “The theory of hybrid automata,” in <i>Proceedings 11th Annual IEEE Symposium on Logic in Computer Science</i>, New Brunswick, NJ, United States of America, 1996, pp. 278–292.","short":"T.A. Henzinger, in:, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science, IEEE, 1996, pp. 278–292.","ista":"Henzinger TA. 1996. The theory of hybrid automata. Proceedings 11th Annual IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 278–292.","apa":"Henzinger, T. A. (1996). The theory of hybrid automata. In <i>Proceedings 11th Annual IEEE Symposium on Logic in Computer Science</i> (pp. 278–292). New Brunswick, NJ, United States of America: IEEE. <a href=\"https://doi.org/10.1109/LICS.1996.561342 \">https://doi.org/10.1109/LICS.1996.561342 </a>"},"main_file_link":[{"url":"https://ieeexplore.ieee.org/document/561342"}],"type":"conference","date_published":"1996-01-01T00:00:00Z","status":"public"},{"extern":"1","month":"01","title":" 8th International Conference on Computer Aided Verification","date_updated":"2022-07-06T07:38:10Z","publisher":"Springer","doi":"10.1007/3-540-61474-5","_id":"4585","article_processing_charge":"No","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","intvolume":"      1102","citation":{"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>","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>.","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>.","ista":"Henzinger TA, Alur R eds. 1996.  8th International Conference on Computer Aided Verification, Springer,p.","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>","ieee":"T. A. Henzinger and R. Alur, Eds., <i> 8th International Conference on Computer Aided Verification</i>, vol. 1102. Springer, 1996.","short":"T.A. Henzinger, R. Alur, eds.,  8th International Conference on Computer Aided Verification, Springer, 1996."},"editor":[{"last_name":"Henzinger","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"full_name":"Alur, Rajeev","first_name":"Rajeev","last_name":"Alur"}],"main_file_link":[{"url":"https://link.springer.com/book/10.1007/3-540-61474-5"}],"oa_version":"None","status":"public","date_published":"1996-01-01T00:00:00Z","type":"conference_editor","volume":1102,"language":[{"iso":"eng"}],"year":"1996","day":"01","publication_status":"published","publist_id":"122","date_created":"2018-12-11T12:09:36Z","conference":{"end_date":"1996-08-03","location":"New Brunswick, NJ, United States of America","name":"CAV: Computer Aided Verification","start_date":"1996-07-31"},"alternative_title":["LNCS"]},{"main_file_link":[{"url":"https://ieeexplore.ieee.org/document/561320"}],"citation":{"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.","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>","short":"R. Alur, T.A. Henzinger, in:, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science, IEEE, 1996, pp. 207–218.","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.","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>","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>.","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>."},"oa_version":"None","status":"public","type":"conference","date_published":"1996-01-01T00:00:00Z","extern":"1","quality_controlled":"1","month":"01","_id":"4588","publication":"Proceedings 11th Annual IEEE Symposium on Logic in Computer Science","publisher":"IEEE","date_updated":"2022-07-04T14:51:40Z","doi":"10.1109/LICS.1996.561320","title":"Reactive modules","abstract":[{"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","lang":"eng"}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_processing_charge":"No","publication_status":"published","publist_id":"121","day":"01","date_created":"2018-12-11T12:09:37Z","publication_identifier":{"issn":["0018-9162"]},"page":"207 - 218","conference":{"start_date":"1996-07-27","name":"LICS: Logic in Computer Science","location":"New Brunswick, NJ, USA","end_date":"1996-07-30"},"author":[{"first_name":"Rajeev","full_name":"Alur, Rajeev","last_name":"Alur"},{"orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"language":[{"iso":"eng"}],"year":"1996","scopus_import":"1"},{"type":"journal_article","date_published":"1996-01-01T00:00:00Z","volume":43,"article_type":"original","oa_version":"None","publisher":"ACM","date_updated":"2022-07-04T12:38:01Z","doi":"10.1145/227595.227602","publication":"Journal of the ACM","article_processing_charge":"No","quality_controlled":"1","extern":"1","month":"01","page":"116 - 146","author":[{"first_name":"Rajeev","full_name":"Alur, Rajeev","last_name":"Alur"},{"first_name":"Tomás","full_name":"Feder, Tomás","last_name":"Feder"},{"orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"day":"01","publist_id":"95","publication_status":"published","date_created":"2018-12-11T12:09:44Z","language":[{"iso":"eng"}],"year":"1996","status":"public","intvolume":"        43","citation":{"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.","short":"R. Alur, T. Feder, T.A. Henzinger, Journal of the ACM 43 (1996) 116–146.","ista":"Alur R, Feder T, Henzinger TA. 1996. The benefits of relaxing punctuality. Journal of the ACM. 43(1), 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>","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>.","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>","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>."},"main_file_link":[{"url":"https://dl.acm.org/doi/10.1145/227595.227602"}],"title":"The benefits of relaxing punctuality","_id":"4610","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"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.","lang":"eng"}],"acknowledgement":"We wish to thank an anonymous referee for pointing out the PSPACE-fragment of Section 4.5. ","issue":"1","publication_identifier":{"issn":["0004-5411"]},"scopus_import":"1"},{"abstract":[{"lang":"eng","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"}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"4611","title":"Automatic symbolic verification of embedded systems","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. ","status":"public","main_file_link":[{"open_access":"1","url":"https://ecommons.cornell.edu/handle/1813/7170"}],"citation":{"ista":"Alur R, Henzinger TA, Ho P. 1996. Automatic symbolic verification of embedded systems. IEEE Transactions on Software Engineering. 22(3), 181–201.","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>","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.","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>","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>.","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>."},"intvolume":"        22","scopus_import":"1","issue":"3","publication_identifier":{"issn":["0018-9162"]},"article_processing_charge":"No","publication":"IEEE Transactions on Software Engineering","doi":"10.1109/32.489079","date_updated":"2022-07-04T12:47:05Z","publisher":"IEEE","month":"03","extern":"1","quality_controlled":"1","oa":1,"volume":22,"type":"journal_article","date_published":"1996-03-01T00:00:00Z","oa_version":"Published Version","article_type":"original","year":"1996","language":[{"iso":"eng"}],"author":[{"last_name":"Alur","full_name":"Alur, Rajeev","first_name":"Rajeev"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724"},{"last_name":"Ho","first_name":"Pei","full_name":"Ho, Pei"}],"page":"181 - 201","date_created":"2018-12-11T12:09:45Z","publication_status":"published","publist_id":"96","day":"01"},{"status":"public","date_published":"1996-01-01T00:00:00Z","type":"book_editor","volume":1066,"citation":{"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>","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>.","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>.","ista":"Alur R, Henzinger TA, Sontag ED eds. 1996. Hybrid Systems III: Verification and Control, Berlin ; Heidelberg: Springer, IX, 619p.","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>","short":"R. Alur, T.A. Henzinger, E.D. Sontag, eds., Hybrid Systems III: Verification and Control, Springer, Berlin ; Heidelberg, 1996.","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."},"intvolume":"      1066","editor":[{"last_name":"Alur","first_name":"Rajeev","full_name":"Alur, Rajeev"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Sontag","full_name":"Sontag, Eduardo D","first_name":"Eduardo D"}],"oa_version":"None","doi":"10.1007/BFb0020931","publisher":"Springer","date_updated":"2021-12-22T13:57:33Z","title":"Hybrid Systems III: Verification and Control","_id":"4612","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","article_processing_charge":"No","place":"Berlin ; Heidelberg","series_title":"Lecture Notes in Computer Science","quality_controlled":"1","extern":"1","month":"01","alternative_title":["LNCS"],"page":"IX, 619","day":"01","publist_id":"97","publication_status":"published","publication_identifier":{"isbn":["978-3-540-61155-4"],"issn":["0302-9743"]},"date_created":"2018-12-11T12:09:45Z","language":[{"iso":"eng"}],"year":"1996"},{"page":"304 - 312","author":[{"id":"338D39FE-F248-11E8-B48F-1D18A9856A87","first_name":"Leonid A","full_name":"Sazanov, Leonid A","last_name":"Sazanov","orcid":"0000-0002-0977-7989"},{"full_name":"Jackson, Baz","first_name":"Baz","last_name":"Jackson"}],"publication_status":"published","publist_id":"5142","day":"10","date_created":"2018-12-11T11:54:50Z","language":[{"iso":"eng"}],"year":"1995","volume":1231,"date_published":"1995-10-10T00:00:00Z","type":"journal_article","oa_version":"Published Version","external_id":{"pmid":["7578218"]},"article_type":"original","publication":"Biochimica et Biophysica Acta - Bioenergetics","doi":"10.1016/0005-2728(95)00096-2","date_updated":"2022-06-29T15:04:47Z","publisher":"Elsevier","article_processing_charge":"No","extern":"1","oa":1,"quality_controlled":"1","month":"10","issue":"3","publication_identifier":{"issn":["0005-2728"]},"status":"public","main_file_link":[{"open_access":"1","url":"https://www.sciencedirect.com/science/article/pii/0005272895000962?via%3Dihub"}],"citation":{"ista":"Sazanov LA, Jackson B. 1995. Cyclic reactions catalysed by detergent-dispersed and reconstituted transhydrogenase from beef heart mitochondria; implications for the mechanism of proton translocation. Biochimica et Biophysica Acta - Bioenergetics. 1231(3), 304–312.","apa":"Sazanov, L. A., &#38; Jackson, B. (1995). Cyclic reactions catalysed by detergent-dispersed and reconstituted transhydrogenase from beef heart mitochondria; implications for the mechanism of proton translocation. <i>Biochimica et Biophysica Acta - Bioenergetics</i>. Elsevier. <a href=\"https://doi.org/10.1016/0005-2728(95)00096-2\">https://doi.org/10.1016/0005-2728(95)00096-2</a>","short":"L.A. Sazanov, B. Jackson, Biochimica et Biophysica Acta - Bioenergetics 1231 (1995) 304–312.","ieee":"L. A. Sazanov and B. Jackson, “Cyclic reactions catalysed by detergent-dispersed and reconstituted transhydrogenase from beef heart mitochondria; implications for the mechanism of proton translocation,” <i>Biochimica et Biophysica Acta - Bioenergetics</i>, vol. 1231, no. 3. Elsevier, pp. 304–312, 1995.","ama":"Sazanov LA, Jackson B. Cyclic reactions catalysed by detergent-dispersed and reconstituted transhydrogenase from beef heart mitochondria; implications for the mechanism of proton translocation. <i>Biochimica et Biophysica Acta - Bioenergetics</i>. 1995;1231(3):304-312. doi:<a href=\"https://doi.org/10.1016/0005-2728(95)00096-2\">10.1016/0005-2728(95)00096-2</a>","mla":"Sazanov, Leonid A., and Baz Jackson. “Cyclic Reactions Catalysed by Detergent-Dispersed and Reconstituted Transhydrogenase from Beef Heart Mitochondria; Implications for the Mechanism of Proton Translocation.” <i>Biochimica et Biophysica Acta - Bioenergetics</i>, vol. 1231, no. 3, Elsevier, 1995, pp. 304–12, doi:<a href=\"https://doi.org/10.1016/0005-2728(95)00096-2\">10.1016/0005-2728(95)00096-2</a>.","chicago":"Sazanov, Leonid A, and Baz Jackson. “Cyclic Reactions Catalysed by Detergent-Dispersed and Reconstituted Transhydrogenase from Beef Heart Mitochondria; Implications for the Mechanism of Proton Translocation.” <i>Biochimica et Biophysica Acta - Bioenergetics</i>. Elsevier, 1995. <a href=\"https://doi.org/10.1016/0005-2728(95)00096-2\">https://doi.org/10.1016/0005-2728(95)00096-2</a>."},"intvolume":"      1231","_id":"1943","title":"Cyclic reactions catalysed by detergent-dispersed and reconstituted transhydrogenase from beef heart mitochondria; implications for the mechanism of proton translocation","abstract":[{"text":"Transhydrogenase from beef-heart mitochondria was solubilised with Triton X-100 and purified by column chromatography. The detergent-dispersed enzyme catalysed the reduction of acetylpyridine adenine dinucleotide (AcPdAD+) by NADH, but only in the presence of NADP+. Experiments showed that this reaction was cyclic; NADP(H), whilst remaining bound to the enzyme, was alternately reduced by NADH and oxidised by AcPdAD+. A period of incubation of the enzyme with NADPH at pH 6.0 led to inhibition of the simple transhydrogenation reaction between AcPdAD+ and NADPH. However, after such treatment, transhydrogenase acquired the ability to catalyse the (NADPH-dependent) reduction of AcPdAD+ by NADH. It is suggested that this is a similar cycle to the one described above. Evidently, the binding affinity for NADP+ increases as a consequence of the inhibition process resulting from prolonged incubation with NADPH. The pH dependences of simple and cyclic transhydrogenation reactions are described. Though more complex than those in Escherichia coli transhydrogenase, they are consistent with the view [Hutton, M., Day, J.M., Bizouarn, T. and Jackson, J.B. (1994) Eur. J. Biochem. 219, 1041–10511] that, also in the mitochondrial enzyme, binding the release of NADP+ and NADP are accompanied by binding and release of a proton. The enzyme was successfully reconstituted into liposomes by a cholate dilution procedure. The proteoliposomes catalysed cyclic NADPH-dependent reduction of AcPdAD+ by NADH only when they were tightly coupled. However, they catalysed cyclic NADP+-dependent reduction of AcPdAD+ by NADH only when they were uncoupled eg. by addition of carbonylcyanide-p-trifluoromethoxyphenyl hydrazone. These observations are evidence that the proton binding and release which accompany NADP+ binding and release, respectively, take place on the inside of the vesicle, and that they are components of the electrogenic processes of the enzyme.","lang":"eng"}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","acknowledgement":"L.A.S. is grateful to the Wellcome Trust for a Research Fellowship. Support from the Biotechnology and Biological Sciences Research Council is also acknowledged. We thank our colleagues. Tania Bizouarn, Mike Hutton and Nick Cotton, for advice and valuable discussion. ","pmid":1},{"status":"public","date_published":"1995-01-15T00:00:00Z","type":"journal_article","volume":9,"citation":{"ama":"de Bono M, Zarkower D, Hodgkin J. Dominant feminizing mutations implicate protein-protein interactions as the main mode of regulation of the nematode sex-determining gene tra-1. <i>Genes and Development</i>. 1995;9(2):155-167. doi:<a href=\"https://doi.org/10.1101/gad.9.2.155\">10.1101/gad.9.2.155</a>","mla":"de Bono, Mario, et al. “Dominant Feminizing Mutations Implicate Protein-Protein Interactions as the Main Mode of Regulation of the Nematode Sex-Determining Gene Tra-1.” <i>Genes and Development</i>, vol. 9, no. 2, CSH Press, 1995, pp. 155–67, doi:<a href=\"https://doi.org/10.1101/gad.9.2.155\">10.1101/gad.9.2.155</a>.","chicago":"Bono, Mario de, D. Zarkower, and J. Hodgkin. “Dominant Feminizing Mutations Implicate Protein-Protein Interactions as the Main Mode of Regulation of the Nematode Sex-Determining Gene Tra-1.” <i>Genes and Development</i>. CSH Press, 1995. <a href=\"https://doi.org/10.1101/gad.9.2.155\">https://doi.org/10.1101/gad.9.2.155</a>.","ista":"de Bono M, Zarkower D, Hodgkin J. 1995. Dominant feminizing mutations implicate protein-protein interactions as the main mode of regulation of the nematode sex-determining gene tra-1. Genes and Development. 9(2), 155–167.","apa":"de Bono, M., Zarkower, D., &#38; Hodgkin, J. (1995). Dominant feminizing mutations implicate protein-protein interactions as the main mode of regulation of the nematode sex-determining gene tra-1. <i>Genes and Development</i>. CSH Press. <a href=\"https://doi.org/10.1101/gad.9.2.155\">https://doi.org/10.1101/gad.9.2.155</a>","short":"M. de Bono, D. Zarkower, J. Hodgkin, Genes and Development 9 (1995) 155–167.","ieee":"M. de Bono, D. Zarkower, and J. Hodgkin, “Dominant feminizing mutations implicate protein-protein interactions as the main mode of regulation of the nematode sex-determining gene tra-1,” <i>Genes and Development</i>, vol. 9, no. 2. CSH Press, pp. 155–167, 1995."},"intvolume":"         9","external_id":{"pmid":["7851791"]},"oa_version":"None","title":"Dominant feminizing mutations implicate protein-protein interactions as the main mode of regulation of the nematode sex-determining gene tra-1","publisher":"CSH Press","date_updated":"2021-01-12T08:06:29Z","doi":"10.1101/gad.9.2.155","_id":"6162","publication":"Genes and Development","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"The tra-1 gene is the terminal global selector of somatic sex in Caenorhabditis elegans: High tra-1 activity elicits female somatic development while low tra-1 activity elicits male development. Previous genetic studies defined a cascade of negatively interacting genes that regulates tra-1 activity in response to the primary sex-determining signal. Here, we investigate the last step in this regulatory cascade, by studying rare gain-of-function (gf) mutations of tra-1 that direct female somatic development irrespective of the upstream sex-determining signal. These mutations appear to abolish negative regulation of tra-1 in male tissues. We identify the lesions associated with 29 of these mutations and find that all affect a short stretch of amino acid residues present in both protein products of the tra-1 gene. Twenty-six alleles are associated with single nonconservative amino acid substitutions. Two alleles affect tra-1 RNA splicing and generate messages that omit part or all of the exon encoding this short stretch. These results suggest that sexual regulation of tra-1 is achieved post-translationally, by an inhibitory protein-protein interaction. The amino acid stretch altered by the tra-1(gf) mutations may define a site of interaction for negative regulators of tra-1. The stretch includes a potential phosphorylation site for glycogen synthase kinase 3 and may be conserved in the human gene GLI3, a homolog of tra-1 identified previously."}],"quality_controlled":"1","extern":"1","month":"01","pmid":1,"page":"155-167","issue":"2","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":"D.","full_name":"Zarkower, D.","last_name":"Zarkower"},{"last_name":"Hodgkin","first_name":"J.","full_name":"Hodgkin, J."}],"day":"15","publication_status":"published","date_created":"2019-03-21T11:57:40Z","publication_identifier":{"issn":["08909369"]},"year":"1995","language":[{"iso":"eng"}]},{"scopus_import":"1","year":"1995","language":[{"iso":"eng"}],"issue":"6","author":[{"full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger"}],"page":"503-538","date_created":"2022-07-27T14:50:46Z","publication_identifier":{"issn":["0178-4617"],"eissn":["1432-0541"]},"day":"01","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","abstract":[{"lang":"eng","text":"We present an algorithm for maintaining the biconnected components of a graph during a sequence of edge insertions and deletions. It requires linear storage and preprocessing time. The amortized running time for insertions and for deletions isO(m 2/3 ), wherem is the number of edges in the graph. Any query of the form ‘Are the verticesu andv biconnected?’ can be answered in timeO(1). This is the first sublinear algorithm for this problem. We can also output all articulation points separating any two vertices efficiently.\r\n\r\nIf the input is a plane graph, the amortized running time for insertions and deletions drops toO(√n logn) and the query time isO(log2 n), wheren is the number of vertices in the graph. The best previously known solution takes timeO(n 2/3 ) per update or query."}],"title":"Fully dynamic biconnectivity in graphs","publisher":"Springer Nature","date_updated":"2022-09-12T09:00:14Z","doi":"10.1007/bf01189067","_id":"11677","publication":"Algorithmica","month":"06","quality_controlled":"1","extern":"1","date_published":"1995-06-01T00:00:00Z","type":"journal_article","volume":13,"status":"public","oa_version":"None","article_type":"original","intvolume":"        13","citation":{"ama":"Henzinger MH. Fully dynamic biconnectivity in graphs. <i>Algorithmica</i>. 1995;13(6):503-538. doi:<a href=\"https://doi.org/10.1007/bf01189067\">10.1007/bf01189067</a>","mla":"Henzinger, Monika H. “Fully Dynamic Biconnectivity in Graphs.” <i>Algorithmica</i>, vol. 13, no. 6, Springer Nature, 1995, pp. 503–38, doi:<a href=\"https://doi.org/10.1007/bf01189067\">10.1007/bf01189067</a>.","chicago":"Henzinger, Monika H. “Fully Dynamic Biconnectivity in Graphs.” <i>Algorithmica</i>. Springer Nature, 1995. <a href=\"https://doi.org/10.1007/bf01189067\">https://doi.org/10.1007/bf01189067</a>.","ista":"Henzinger MH. 1995. Fully dynamic biconnectivity in graphs. Algorithmica. 13(6), 503–538.","apa":"Henzinger, M. H. (1995). Fully dynamic biconnectivity in graphs. <i>Algorithmica</i>. Springer Nature. <a href=\"https://doi.org/10.1007/bf01189067\">https://doi.org/10.1007/bf01189067</a>","ieee":"M. H. Henzinger, “Fully dynamic biconnectivity in graphs,” <i>Algorithmica</i>, vol. 13, no. 6. Springer Nature, pp. 503–538, 1995.","short":"M.H. Henzinger, Algorithmica 13 (1995) 503–538."}},{"scopus_import":"1","year":"1995","language":[{"iso":"eng"}],"date_created":"2022-07-28T11:28:13Z","publication_identifier":{"issn":["0272-5428"],"isbn":["0-8186-7183-1"]},"day":"01","publication_status":"published","author":[{"orcid":"0000-0002-5008-6530","last_name":"Henzinger","full_name":"Henzinger, Monika H","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"last_name":"King","full_name":"King, V.","first_name":"V."}],"conference":{"start_date":"1995-10-23","name":"Foundations of Computer Science","location":"Milwaukee, WI, United States","end_date":"1995-10-25"},"page":"664-672","month":"11","quality_controlled":"1","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","abstract":[{"lang":"eng","text":"This paper presents an algorithm for the fully dynamic biconnectivity problem whose running time is exponentially faster than all previously known solutions. It is the first dynamic algorithm that answers biconnectivity queries in time O(log/sup 2/n) in a n-node graph and can be updated after an edge insertion or deletion in polylogarithmic time. Our algorithm is a Las-Vegas style randomized algorithm with the update time amortized update time O(log/sup 4/n). Only recently the best deterministic result for this problem was improved to O(/spl radic/nlog/sup 2/n). We also give the first fully dynamic and a novel deletions-only transitive closure (i.e. directed connectivity) algorithms. These are randomized Monte Carlo algorithms. Let n be the number of nodes in the graph and let m/spl circ/ be the average number of edges in the graph during the whole update sequence: The fully dynamic algorithms achieve (1) query time O(n/logn) and update time O(m/spl circ//spl radic/nlog/sup 2/n+n); or (2) query time O(n/logn) and update time O(nm/spl circ//sup /spl mu/-1/)log/sup 2/n=O(nm/spl circ//sup 0.58/log/sup 2/n), where /spl mu/ is the exponent for boolean matrix multiplication (currently /spl mu/=2.38). The deletions-only algorithm answers queries in time O(n/logn). Its amortized update time is O(nlog/sup 2/n)."}],"title":"Fully dynamic biconnectivity and transitive closure","publisher":"Institute of Electrical and Electronics Engineers","date_updated":"2023-02-09T11:35:17Z","doi":"10.1109/SFCS.1995.492668","_id":"11684","publication":"Proceedings of IEEE 36th Annual Foundations of Computer Science","oa_version":"None","citation":{"apa":"Henzinger, M. H., &#38; King, V. (1995). Fully dynamic biconnectivity and transitive closure. In <i>Proceedings of IEEE 36th Annual Foundations of Computer Science</i> (pp. 664–672). Milwaukee, WI, United States: Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/SFCS.1995.492668\">https://doi.org/10.1109/SFCS.1995.492668</a>","ista":"Henzinger MH, King V. 1995. Fully dynamic biconnectivity and transitive closure. Proceedings of IEEE 36th Annual Foundations of Computer Science. Foundations of Computer Science, 664–672.","ieee":"M. H. Henzinger and V. King, “Fully dynamic biconnectivity and transitive closure,” in <i>Proceedings of IEEE 36th Annual Foundations of Computer Science</i>, Milwaukee, WI, United States, 1995, pp. 664–672.","short":"M.H. Henzinger, V. King, in:, Proceedings of IEEE 36th Annual Foundations of Computer Science, Institute of Electrical and Electronics Engineers, 1995, pp. 664–672.","mla":"Henzinger, Monika H., and V. King. “Fully Dynamic Biconnectivity and Transitive Closure.” <i>Proceedings of IEEE 36th Annual Foundations of Computer Science</i>, Institute of Electrical and Electronics Engineers, 1995, pp. 664–72, doi:<a href=\"https://doi.org/10.1109/SFCS.1995.492668\">10.1109/SFCS.1995.492668</a>.","ama":"Henzinger MH, King V. Fully dynamic biconnectivity and transitive closure. In: <i>Proceedings of IEEE 36th Annual Foundations of Computer Science</i>. Institute of Electrical and Electronics Engineers; 1995:664-672. doi:<a href=\"https://doi.org/10.1109/SFCS.1995.492668\">10.1109/SFCS.1995.492668</a>","chicago":"Henzinger, Monika H, and V. King. “Fully Dynamic Biconnectivity and Transitive Closure.” In <i>Proceedings of IEEE 36th Annual Foundations of Computer Science</i>, 664–72. Institute of Electrical and Electronics Engineers, 1995. <a href=\"https://doi.org/10.1109/SFCS.1995.492668\">https://doi.org/10.1109/SFCS.1995.492668</a>."},"type":"conference","date_published":"1995-11-01T00:00:00Z","status":"public"},{"publisher":"Springer Nature","doi":"10.1007/3-540-60313-1_142","title":"Certificates and fast algorithms for biconnectivity in fully-dynamic graphs","date_updated":"2023-02-14T08:02:03Z","_id":"11805","publication":"3rd Annual European Symposium on Algorithms","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"In this paper, we present sparse certificates for biconnectivity together with algorithms for updating these certificates. We thus obtain fully-dynamic algorithms for biconnectivity in graphs that run in O(√n log n log⌈m/n⌉) amortized time per operation, where m is the number of edges and n is the number of nodes in the graph. This improves upon the results in [11], in which algorithms were presented running in O(√m) amortized time, and solves the open problem to find certificates to speed up biconnectivity, as stated in [2].","lang":"eng"}],"quality_controlled":"1","extern":"1","month":"09","status":"public","type":"conference","date_published":"1995-09-01T00:00:00Z","volume":979,"citation":{"short":"M.H. Henzinger, H. Poutré, in:, 3rd Annual European Symposium on Algorithms, Springer Nature, 1995, pp. 171–184.","ieee":"M. H. Henzinger and H. Poutré, “Certificates and fast algorithms for biconnectivity in fully-dynamic graphs,” in <i>3rd Annual European Symposium on Algorithms</i>, Corfu, Greece, 1995, vol. 979, pp. 171–184.","ista":"Henzinger MH, Poutré H. 1995. Certificates and fast algorithms for biconnectivity in fully-dynamic graphs. 3rd Annual European Symposium on Algorithms. ESA: European Symposium on Algorithms, LNCS, vol. 979, 171–184.","apa":"Henzinger, M. H., &#38; Poutré, H. (1995). Certificates and fast algorithms for biconnectivity in fully-dynamic graphs. In <i>3rd Annual European Symposium on Algorithms</i> (Vol. 979, pp. 171–184). Corfu, Greece: Springer Nature. <a href=\"https://doi.org/10.1007/3-540-60313-1_142\">https://doi.org/10.1007/3-540-60313-1_142</a>","chicago":"Henzinger, Monika H, and Han Poutré. “Certificates and Fast Algorithms for Biconnectivity in Fully-Dynamic Graphs.” In <i>3rd Annual European Symposium on Algorithms</i>, 979:171–184. Springer Nature, 1995. <a href=\"https://doi.org/10.1007/3-540-60313-1_142\">https://doi.org/10.1007/3-540-60313-1_142</a>.","ama":"Henzinger MH, Poutré H. Certificates and fast algorithms for biconnectivity in fully-dynamic graphs. In: <i>3rd Annual European Symposium on Algorithms</i>. Vol 979. Springer Nature; 1995:171–184. doi:<a href=\"https://doi.org/10.1007/3-540-60313-1_142\">10.1007/3-540-60313-1_142</a>","mla":"Henzinger, Monika H., and Han Poutré. “Certificates and Fast Algorithms for Biconnectivity in Fully-Dynamic Graphs.” <i>3rd Annual European Symposium on Algorithms</i>, vol. 979, Springer Nature, 1995, pp. 171–184, doi:<a href=\"https://doi.org/10.1007/3-540-60313-1_142\">10.1007/3-540-60313-1_142</a>."},"intvolume":"       979","oa_version":"None","year":"1995","language":[{"iso":"eng"}],"scopus_import":"1","conference":{"start_date":"1995-09-25","name":"ESA: European Symposium on Algorithms","location":"Corfu, Greece","end_date":"1995-09-27"},"page":"171–184","alternative_title":["LNCS"],"author":[{"full_name":"Henzinger, Monika H","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","orcid":"0000-0002-5008-6530"},{"full_name":"Poutré, Han","first_name":"Han","last_name":"Poutré"}],"day":"01","publication_status":"published","date_created":"2022-08-11T14:09:52Z","publication_identifier":{"isbn":["9783540603139"],"eisbn":["9783540449133"],"issn":["0302-9743"],"eissn":["1611-3349"]}},{"publication":"22nd International Colloquium on Automata, Languages and Programming","_id":"11806","date_updated":"2023-02-14T08:09:08Z","title":"Approximating minimum cuts under insertions","doi":"10.1007/3-540-60084-1_81","publisher":"Springer Nature","abstract":[{"lang":"eng","text":"This paper presents insertions-only algorithms for maintaining the exact and approximate size of the minimum edge cut and the minimum vertex cut of a graph. The algorithms output the approximate or exact size k in time O(1) or O(log n) and a cut of size k in time linear in its size. The amortized time per insertion is O(1/ε 2) for a (2+ε)-approximation, O((log λ)((log n)/ε)2) for a (1+ε)-approximation, and O(λ log n) for the exact size of the minimum edge cut, where n is the number of nodes in the graph, λ is the size of the minimum cut and ε>0. The (2+ε)-approximation algorithm and the exact algorithm are deterministic, the (1+ε)-approximation algorithm is randomized. The algorithms are optimal in the sense that the time needed for m insertions matches the time needed by the best static algorithm on a m-edge graph. We also present a static 2-approximation algorithm for the size κ of the minimum vertex cut in a graph, which takes time O(n 2 min(√n,κ)). This is a factor of κ faster than the best algorithm for computing the exact size, which takes time O(κ 2 n 2 +κ 3 n 1.5). We give an insertionsonly algorithm for maintaining a (2+ε)-approximation of the minimum vertex cut with amortized insertion time O(n(logκk)/ε)."}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","quality_controlled":"1","month":"07","status":"public","volume":944,"date_published":"1995-07-01T00:00:00Z","type":"conference","intvolume":"       944","citation":{"ama":"Henzinger MH. Approximating minimum cuts under insertions. In: <i>22nd International Colloquium on Automata, Languages and Programming</i>. Vol 944. Springer Nature; 1995:280–291. doi:<a href=\"https://doi.org/10.1007/3-540-60084-1_81\">10.1007/3-540-60084-1_81</a>","mla":"Henzinger, Monika H. “Approximating Minimum Cuts under Insertions.” <i>22nd International Colloquium on Automata, Languages and Programming</i>, vol. 944, Springer Nature, 1995, pp. 280–291, doi:<a href=\"https://doi.org/10.1007/3-540-60084-1_81\">10.1007/3-540-60084-1_81</a>.","chicago":"Henzinger, Monika H. “Approximating Minimum Cuts under Insertions.” In <i>22nd International Colloquium on Automata, Languages and Programming</i>, 944:280–291. Springer Nature, 1995. <a href=\"https://doi.org/10.1007/3-540-60084-1_81\">https://doi.org/10.1007/3-540-60084-1_81</a>.","ista":"Henzinger MH. 1995. Approximating minimum cuts under insertions. 22nd International Colloquium on Automata, Languages and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LNCS, vol. 944, 280–291.","apa":"Henzinger, M. H. (1995). Approximating minimum cuts under insertions. In <i>22nd International Colloquium on Automata, Languages and Programming</i> (Vol. 944, pp. 280–291). Szeged, Hungary: Springer Nature. <a href=\"https://doi.org/10.1007/3-540-60084-1_81\">https://doi.org/10.1007/3-540-60084-1_81</a>","ieee":"M. H. Henzinger, “Approximating minimum cuts under insertions,” in <i>22nd International Colloquium on Automata, Languages and Programming</i>, Szeged, Hungary, 1995, vol. 944, pp. 280–291.","short":"M.H. Henzinger, in:, 22nd International Colloquium on Automata, Languages and Programming, Springer Nature, 1995, pp. 280–291."},"oa_version":"None","year":"1995","language":[{"iso":"eng"}],"scopus_import":"1","alternative_title":["LNCS"],"page":"280–291","conference":{"name":"ICALP: International Colloquium on Automata, Languages, and Programming","start_date":"1995-07-10","end_date":"1995-07-14","location":"Szeged, Hungary"},"author":[{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","full_name":"Henzinger, Monika H","last_name":"Henzinger","orcid":"0000-0002-5008-6530"}],"publication_status":"published","day":"01","publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"isbn":["9783540494256"],"eisbn":["9783540600848"]},"date_created":"2022-08-11T14:17:33Z"},{"scopus_import":"1","related_material":{"record":[{"relation":"later_version","status":"public","id":"11680"}]},"year":"1995","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["0898713498"]},"date_created":"2022-08-19T07:10:23Z","day":"01","publication_status":"published","author":[{"first_name":"David","full_name":"Alberts, David","last_name":"Alberts"},{"orcid":"0000-0002-5008-6530","last_name":"Henzinger","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H"}],"conference":{"name":"SODA: Symposium on Discrete Algorithms","start_date":"1995-01-22","end_date":"1995-01-24","location":"San Francisco, CA, United States"},"page":"312-321","month":"01","quality_controlled":"1","oa":1,"extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","abstract":[{"text":"We present a model with restricted randomness for edge updates in dynamic graph algorithms and a general technique\r\nfor analyzing the expected running time of an update operation. This model is able to capture the average case in many applications, since (1) it allows restrictions on the set of edges which can be used for insertions and (2) the type (insertion or deletion) of each update operation is arbitrary, i.e., not random. We use our technique to analyze existing and new dynamic algorithms for maximum cardinality matching, minimum spanning forest, connectivity, 2-edge connectivity,\r\nk-edge connectivity, k-vertex connectivity, and bipartiteness. Given a random graph G with mo edges and n vertices and\r\na sequence of 1 update operations such that the graph contains rni edges after operation i, the expected time for performing the updates for any 1 is O(1 logn + n xi=, l/fii) in the case of minimum spanning forests, connectivity, 2-\r\nedge connectivity, and bipartiteness. The expected time per update operation is O(n) in the case of maximum matching. For k-edge and k-vertex connectivity we also give improved bounds. Additionally we give an insertions-only algorithm for maximum cardinality matching with worst-case O(n) amortized time per insertion. ","lang":"eng"}],"publisher":"Society for Industrial and Applied Mathematics","date_updated":"2023-02-21T16:24:58Z","title":"Average case analysis of dynamic graph algorithms","publication":"6th Annual ACM-SIAM Symposium on Discrete Algorithms","_id":"11928","oa_version":"Published Version","citation":{"short":"D. Alberts, M.H. Henzinger, in:, 6th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 1995, pp. 312–321.","ieee":"D. Alberts and M. H. Henzinger, “Average case analysis of dynamic graph algorithms,” in <i>6th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, San Francisco, CA, United States, 1995, pp. 312–321.","ista":"Alberts D, Henzinger MH. 1995. Average case analysis of dynamic graph algorithms. 6th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 312–321.","apa":"Alberts, D., &#38; Henzinger, M. H. (1995). Average case analysis of dynamic graph algorithms. In <i>6th Annual ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 312–321). San Francisco, CA, United States: Society for Industrial and Applied Mathematics.","chicago":"Alberts, David, and Monika H Henzinger. “Average Case Analysis of Dynamic Graph Algorithms.” In <i>6th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 312–21. Society for Industrial and Applied Mathematics, 1995.","ama":"Alberts D, Henzinger MH. Average case analysis of dynamic graph algorithms. In: <i>6th Annual ACM-SIAM Symposium on Discrete Algorithms</i>. Society for Industrial and Applied Mathematics; 1995:312-321.","mla":"Alberts, David, and Monika H. Henzinger. “Average Case Analysis of Dynamic Graph Algorithms.” <i>6th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Society for Industrial and Applied Mathematics, 1995, pp. 312–21."},"main_file_link":[{"url":"https://dl.acm.org/doi/10.5555/313651.313712","open_access":"1"}],"type":"conference","date_published":"1995-01-01T00:00:00Z","status":"public"},{"author":[{"last_name":"Morris","full_name":"Morris, David","first_name":"David"},{"last_name":"Friml","orcid":"0000-0002-8302-7596","first_name":"Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jirí"},{"first_name":"Eva","full_name":"Zažímalová, Eva","last_name":"Zažímalová"}],"page":"451 - 484","date_created":"2018-12-11T11:57:49Z","publication_identifier":{"isbn":["978-1-4020-2684-3"]},"day":"01","publication_status":"published","publist_id":"4438","scopus_import":"1","language":[{"iso":"eng"}],"year":"1995","type":"book_chapter","date_published":"1995-01-01T00:00:00Z","status":"public","oa_version":"None","citation":{"mla":"Morris, David, et al. “Auxin Transport.” <i>Plant Hormones: Biosynthesis, Signal Transduction, Action!</i>, edited by Peter Davies, Kluwer, 1995, pp. 451–84, doi:<a href=\"https://doi.org/10.1007/978-1-4020-2686-7_21\">10.1007/978-1-4020-2686-7_21</a>.","ama":"Morris D, Friml J, Zažímalová E. Auxin transport. In: Davies P, ed. <i>Plant Hormones: Biosynthesis, Signal Transduction, Action!</i>. Kluwer; 1995:451-484. doi:<a href=\"https://doi.org/10.1007/978-1-4020-2686-7_21\">10.1007/978-1-4020-2686-7_21</a>","chicago":"Morris, David, Jiří Friml, and Eva Zažímalová. “Auxin Transport.” In <i>Plant Hormones: Biosynthesis, Signal Transduction, Action!</i>, edited by Peter Davies, 451–84. Kluwer, 1995. <a href=\"https://doi.org/10.1007/978-1-4020-2686-7_21\">https://doi.org/10.1007/978-1-4020-2686-7_21</a>.","apa":"Morris, D., Friml, J., &#38; Zažímalová, E. (1995). Auxin transport. In P. Davies (Ed.), <i>Plant Hormones: Biosynthesis, Signal Transduction, Action!</i> (pp. 451–484). Kluwer. <a href=\"https://doi.org/10.1007/978-1-4020-2686-7_21\">https://doi.org/10.1007/978-1-4020-2686-7_21</a>","ista":"Morris D, Friml J, Zažímalová E. 1995.Auxin transport. In: Plant Hormones: Biosynthesis, Signal Transduction, Action! , 451–484.","short":"D. Morris, J. Friml, E. Zažímalová, in:, P. Davies (Ed.), Plant Hormones: Biosynthesis, Signal Transduction, Action!, Kluwer, 1995, pp. 451–484.","ieee":"D. Morris, J. Friml, and E. Zažímalová, “Auxin transport,” in <i>Plant Hormones: Biosynthesis, Signal Transduction, Action!</i>, P. Davies, Ed. Kluwer, 1995, pp. 451–484."},"editor":[{"last_name":"Davies","full_name":"Davies, Peter","first_name":"Peter"}],"main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/978-1-4020-2686-7_21"}],"article_processing_charge":"No","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"lang":"eng","text":"Auxins play a crucial role in the regulation of spatial and temporal aspects of plant growth and development1. As well as being required for the division, enlargement and differentiation of individual plant cells, auxins also function as signals between cells, tissues and organs. In this way they contribute to the coordination and integration of growth and development in the whole plant and to physiological responses of plants to environmental cues (63). At the individual cell level, fast changes or pulses in hormone concentration may function to initiate or to terminate a developmental process. In contrast, the maintenance of a stable concentration of the hormone (homeostasis) may be necessary to maintain the progress of a developmental event that has already been initiated."}],"title":"Auxin transport","publisher":"Kluwer","date_updated":"2022-06-29T14:45:32Z","doi":"10.1007/978-1-4020-2686-7_21","_id":"2465","publication":"Plant Hormones: Biosynthesis, Signal Transduction, Action!","month":"01","quality_controlled":"1","extern":"1"},{"intvolume":"       360","citation":{"ista":"Ohishi H, Akazawa C, Shigemoto R, Nakanishi S, Mizuno N. 1995. Distributions of the mRNAs for L-2-amino-4-phosphonobutyrate-sensitive metabotropic glutamate receptors, mGluR4 and mGluR7, in the rat brain. Journal of Comparative Neurology. 360(4), 555–570.","apa":"Ohishi, H., Akazawa, C., Shigemoto, R., Nakanishi, S., &#38; Mizuno, N. (1995). Distributions of the mRNAs for L-2-amino-4-phosphonobutyrate-sensitive metabotropic glutamate receptors, mGluR4 and mGluR7, in the rat brain. <i>Journal of Comparative Neurology</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1002/cne.903600402\">https://doi.org/10.1002/cne.903600402</a>","short":"H. Ohishi, C. Akazawa, R. Shigemoto, S. Nakanishi, N. Mizuno, Journal of Comparative Neurology 360 (1995) 555–570.","ieee":"H. Ohishi, C. Akazawa, R. Shigemoto, S. Nakanishi, and N. Mizuno, “Distributions of the mRNAs for L-2-amino-4-phosphonobutyrate-sensitive metabotropic glutamate receptors, mGluR4 and mGluR7, in the rat brain,” <i>Journal of Comparative Neurology</i>, vol. 360, no. 4. Wiley-Blackwell, pp. 555–570, 1995.","ama":"Ohishi H, Akazawa C, Shigemoto R, Nakanishi S, Mizuno N. Distributions of the mRNAs for L-2-amino-4-phosphonobutyrate-sensitive metabotropic glutamate receptors, mGluR4 and mGluR7, in the rat brain. <i>Journal of Comparative Neurology</i>. 1995;360(4):555-570. doi:<a href=\"https://doi.org/10.1002/cne.903600402\">10.1002/cne.903600402</a>","mla":"Ohishi, Hitoshi, et al. “Distributions of the MRNAs for L-2-Amino-4-Phosphonobutyrate-Sensitive Metabotropic Glutamate Receptors, MGluR4 and MGluR7, in the Rat Brain.” <i>Journal of Comparative Neurology</i>, vol. 360, no. 4, Wiley-Blackwell, 1995, pp. 555–70, doi:<a href=\"https://doi.org/10.1002/cne.903600402\">10.1002/cne.903600402</a>.","chicago":"Ohishi, Hitoshi, Chihiro Akazawa, Ryuichi Shigemoto, Shigetada Nakanishi, and Noboru Mizuno. “Distributions of the MRNAs for L-2-Amino-4-Phosphonobutyrate-Sensitive Metabotropic Glutamate Receptors, MGluR4 and MGluR7, in the Rat Brain.” <i>Journal of Comparative Neurology</i>. Wiley-Blackwell, 1995. <a href=\"https://doi.org/10.1002/cne.903600402\">https://doi.org/10.1002/cne.903600402</a>."},"main_file_link":[{"url":"https://onlinelibrary.wiley.com/doi/abs/10.1002/cne.903600402"}],"status":"public","acknowledgement":"We are grateful  to Akira Uesugi for photographic help. This work has been supported in part by research grants from the Ministry of Education, Science and  Culture of Japan.","pmid":1,"title":"Distributions of the mRNAs for L-2-amino-4-phosphonobutyrate-sensitive metabotropic glutamate receptors, mGluR4 and mGluR7, in the rat brain","_id":"2491","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"text":"The distribution of mRNAs for metabotropic glutamate receptors, mGluR4 and mGluR7, which are highly sensitive for L-2-amino-4-phosphonobutyrate (L- AP4), was examined in the central nervous system of the rat by in situ hybridization. In general, the hybridization signals of mGluR7 mRNA were more widely distributed than those of mGluR4 mRNA, and differential expression of mGluR4 mRNA and mGluR7 mRNA was clearly indicated in some brain regions. Intense or moderate expression of mGluR4 mRNA was detected in the granule cells of the olfactory bulb and cerebellum, whereas no significant expression of mGluR7 mRNA was found in these cells. In other neurons or regions where mGluR7 mRNA was intensely or moderately expressed, no significant expression of mGluR4 mRNA was observed. Such were the mitral and tufted cells of the olfactory bulb; anterior olfactory nucleus; neocortical regions; cingulate cortex; retrosplenial cortex; piriform cortex; perirhinal cortex; CA1; CA3; granule cells of the dentate gyrus; superficial layers of the subicular cortex; deep layers of the entorhinal, parasubicular, and presubicular cortices; ventral part of the lateral septal nucleus; septohippocampal nucleus; triangular septal nucleus; nuclei of the diagonal band; bed nucleus of the stria terminalis; ventral pallidum; claustrum; amygdaloid nuclei other than the intercalated nuclei; preoptic region; hypothalamic nuclei other than the medial mammillary nucleus; ventral lateral geniculate nucleus; locus coeruleus; Purkinje cells; many nuclei of the lower brainstem other than the superior colliculus, periaqueductal gray, interpeduncular nucleus, pontine nuclei, and dorsal cochlear nucleus; and dorsal horn of the spinal cord. Both mGluR4 mRNA and mGluR7 mRNA were moderately or intensely expressed in the olfactory tubercle, superficial layers of the entorhinal cortex, CA4, septofimbrial nucleus, intercalated nuclei of the amygdala, medial mammillary nucleus, many thalamic nuclei, and pontine nuclei. Intense expression of both mGluR4 mRNA and mGluR7 mRNA was further detected in the trigeminal ganglion and dorsal root ganglia, whereas no significant expression of them was found in the pterygopalatine ganglion and superior cervical ganglion. The results indicate differential roles of the L-AP4-sensitive metabotropic glutamate receptors in the glutamatergic nervous system.","lang":"eng"}],"publication_identifier":{"issn":["0021-9967"]},"issue":"4","scopus_import":"1","external_id":{"pmid":["8801249"]},"article_type":"original","oa_version":"None","type":"journal_article","date_published":"1995-10-02T00:00:00Z","volume":360,"quality_controlled":"1","extern":"1","month":"10","publisher":"Wiley-Blackwell","doi":"10.1002/cne.903600402","date_updated":"2022-06-29T13:08:19Z","publication":"Journal of Comparative Neurology","article_processing_charge":"No","day":"02","publist_id":"4410","publication_status":"published","date_created":"2018-12-11T11:57:59Z","page":"555 - 570","author":[{"last_name":"Ohishi","full_name":"Ohishi, Hitoshi","first_name":"Hitoshi"},{"full_name":"Akazawa, Chihiro","first_name":"Chihiro","last_name":"Akazawa"},{"full_name":"Shigemoto, Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi","orcid":"0000-0001-8761-9444","last_name":"Shigemoto"},{"first_name":"Shigetada","full_name":"Nakanishi, Shigetada","last_name":"Nakanishi"},{"last_name":"Mizuno","full_name":"Mizuno, Noboru","first_name":"Noboru"}],"language":[{"iso":"eng"}],"year":"1995"},{"date_created":"2018-12-11T11:58:22Z","day":"20","publist_id":"4341","publication_status":"published","author":[{"last_name":"Ding","first_name":"Yu","full_name":"Ding, Yu"},{"last_name":"Takada","full_name":"Takada, Masahiko","first_name":"Masahiko"},{"id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi","full_name":"Shigemoto, Ryuichi","orcid":"0000-0001-8761-9444","last_name":"Shigemoto"},{"last_name":"Mizuno","full_name":"Mizuno, Noboru","first_name":"Noboru"}],"page":"336 - 340","year":"1995","language":[{"iso":"eng"}],"external_id":{"pmid":["7796113"]},"article_type":"original","oa_version":"None","type":"journal_article","date_published":"1995-03-20T00:00:00Z","volume":674,"month":"03","quality_controlled":"1","extern":"1","article_processing_charge":"No","doi":"10.1016/0006-8993(95)00022-I","date_updated":"2022-06-29T08:32:01Z","publisher":"Elsevier","publication":"Brain Research","publication_identifier":{"issn":["0006-8993"]},"issue":"2","scopus_import":"1","intvolume":"       674","citation":{"ieee":"Y. Ding, M. Takada, R. Shigemoto, and N. Mizuno, “Spinoparabrachial tract neurons showing substance P receptor-like immunoreactivity in the lumbar spinal cord of the rat,” <i>Brain Research</i>, vol. 674, no. 2. Elsevier, pp. 336–340, 1995.","short":"Y. Ding, M. Takada, R. Shigemoto, N. Mizuno, Brain Research 674 (1995) 336–340.","ista":"Ding Y, Takada M, Shigemoto R, Mizuno N. 1995. Spinoparabrachial tract neurons showing substance P receptor-like immunoreactivity in the lumbar spinal cord of the rat. Brain Research. 674(2), 336–340.","apa":"Ding, Y., Takada, M., Shigemoto, R., &#38; Mizuno, N. (1995). Spinoparabrachial tract neurons showing substance P receptor-like immunoreactivity in the lumbar spinal cord of the rat. <i>Brain Research</i>. Elsevier. <a href=\"https://doi.org/10.1016/0006-8993(95)00022-I\">https://doi.org/10.1016/0006-8993(95)00022-I</a>","chicago":"Ding, Yu, Masahiko Takada, Ryuichi Shigemoto, and Noboru Mizuno. “Spinoparabrachial Tract Neurons Showing Substance P Receptor-like Immunoreactivity in the Lumbar Spinal Cord of the Rat.” <i>Brain Research</i>. Elsevier, 1995. <a href=\"https://doi.org/10.1016/0006-8993(95)00022-I\">https://doi.org/10.1016/0006-8993(95)00022-I</a>.","ama":"Ding Y, Takada M, Shigemoto R, Mizuno N. Spinoparabrachial tract neurons showing substance P receptor-like immunoreactivity in the lumbar spinal cord of the rat. <i>Brain Research</i>. 1995;674(2):336-340. doi:<a href=\"https://doi.org/10.1016/0006-8993(95)00022-I\">10.1016/0006-8993(95)00022-I</a>","mla":"Ding, Yu, et al. “Spinoparabrachial Tract Neurons Showing Substance P Receptor-like Immunoreactivity in the Lumbar Spinal Cord of the Rat.” <i>Brain Research</i>, vol. 674, no. 2, Elsevier, 1995, pp. 336–40, doi:<a href=\"https://doi.org/10.1016/0006-8993(95)00022-I\">10.1016/0006-8993(95)00022-I</a>."},"main_file_link":[{"url":"sciencedirect.com/science/article/pii/000689939500022I?via%3Dihub"}],"status":"public","pmid":1,"acknowledgement":"The authors are grateful for photographic help of Mr. Akira Uesugi. This work was supported in part by Grants-in-Aid for Special Research on Priority Areas 05267104, Scientific Research (B) 05454658, and Scientific Research (C) 06680735 from the Ministry of Education, Science and Culture of Japan.","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"text":"By using substance P receptor (SPR) immunofluorescence histochemistry combined with fluorescent retrograde labeling, SPR-like immunoreactive (SPR-LI) neurons sending their axons to the lateral parabrachial region were observed in the lumbar spinal cord of the rat. After injection of Fluoro-Gold into the lateral parabrachial region, retrogradely labeled neurons with SPR-LI were seen frequently in lamina I and the lateral spinal nucleus, and occasionally in laminae IV and V, with a predominantly contralateral distribution. Some of these neurons, especially those in lamina I, may convey nociceptive information to the lateral parabrachial region.","lang":"eng"}],"title":"Spinoparabrachial tract neurons showing substance P receptor-like immunoreactivity in the lumbar spinal cord of the rat","_id":"2556"},{"scopus_import":"1","issue":"2","publication_identifier":{"issn":["0764-4469"]},"abstract":[{"lang":"eng","text":"Brain areas involved in the genesis and control of daily rhythms receive a prominent neural input that contains the neurotransmitter substance P (SP), a peptide putatively involved in the synchronization of circadian rhythms by environmental light. We investigated the localization of receptors to SP in the suprachiasmatic nucleus of the hypothalamus (SCN) and in the intergeniculate leaflet of the thalamus (IGL) of the rat and hamster using in situ hybridization histochemistry and immunohistochemistry. Consistently with that previously described in the rat, a neuronal population distributed along the lateral margin and at the dorso-latero-caudal aspect of the hamster SCN expresses moderately the mRNA encoding the SP receptor. In both rat and hamster, immunohistochemical data confirm the previous finding and reveal an almost complete absence of SP receptors in the ventral part of the SCN, which receives a direct projection from the retina. In the IGL of both species, numerous neurons prominently express the mRNA encoding the SP receptor. The immunostaining shows a high density of SP receptors on perikarya and dendrites throughout the nucleus. A dense staining is also observed on individual cells and processes bordering the lumen of blood vessels in the SCN and IGL."}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"2558","title":"Localization of substance P receptors in central neural structures controlling daily rhythms in nocturnal rodents","pmid":1,"status":"public","main_file_link":[{"url":"https://pubmed.ncbi.nlm.nih.gov/7757814/"}],"intvolume":"       318","citation":{"ista":"Mick G, Shigemoto R, Kitahama K. 1995. Localization of substance P receptors in central neural structures controlling daily rhythms in nocturnal rodents. Comptes Rendus de l’Academie des Sciences - Series III. 318(2), 209–217.","apa":"Mick, G., Shigemoto, R., &#38; Kitahama, K. (1995). Localization of substance P receptors in central neural structures controlling daily rhythms in nocturnal rodents. <i>Comptes Rendus de l’Academie Des Sciences - Series III</i>. Gauthier Villars Editeur.","ieee":"G. Mick, R. Shigemoto, and K. Kitahama, “Localization of substance P receptors in central neural structures controlling daily rhythms in nocturnal rodents,” <i>Comptes Rendus de l’Academie des Sciences - Series III</i>, vol. 318, no. 2. Gauthier Villars Editeur, pp. 209–217, 1995.","short":"G. Mick, R. Shigemoto, K. Kitahama, Comptes Rendus de l’Academie Des Sciences - Series III 318 (1995) 209–217.","ama":"Mick G, Shigemoto R, Kitahama K. Localization of substance P receptors in central neural structures controlling daily rhythms in nocturnal rodents. <i>Comptes Rendus de l’Academie des Sciences - Series III</i>. 1995;318(2):209-217.","mla":"Mick, Gérard, et al. “Localization of Substance P Receptors in Central Neural Structures Controlling Daily Rhythms in Nocturnal Rodents.” <i>Comptes Rendus de l’Academie Des Sciences - Series III</i>, vol. 318, no. 2, Gauthier Villars Editeur, 1995, pp. 209–17.","chicago":"Mick, Gérard, Ryuichi Shigemoto, and Kunio Kitahama. “Localization of Substance P Receptors in Central Neural Structures Controlling Daily Rhythms in Nocturnal Rodents.” <i>Comptes Rendus de l’Academie Des Sciences - Series III</i>. Gauthier Villars Editeur, 1995."},"year":"1995","language":[{"iso":"eng"}],"author":[{"first_name":"Gérard","full_name":"Mick, Gérard","last_name":"Mick"},{"last_name":"Shigemoto","orcid":"0000-0001-8761-9444","full_name":"Shigemoto, Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi"},{"last_name":"Kitahama","full_name":"Kitahama, Kunio","first_name":"Kunio"}],"page":"209 - 217","date_created":"2018-12-11T11:58:23Z","publist_id":"4340","publication_status":"published","day":"01","article_processing_charge":"No","publication":"Comptes Rendus de l'Academie des Sciences - Series III","publisher":"Gauthier Villars Editeur","date_updated":"2022-06-29T08:18:48Z","month":"02","extern":"1","quality_controlled":"1","volume":318,"type":"journal_article","date_published":"1995-02-01T00:00:00Z","oa_version":"None","article_type":"original","external_id":{"pmid":["7757814 "]}},{"month":"02","extern":"1","quality_controlled":"1","oa":1,"article_processing_charge":"No","publication":"Cell","publisher":"Cell Press","date_updated":"2022-06-28T13:27:50Z","doi":"10.1016/0092-8674(95)90354-2","article_type":"original","external_id":{"pmid":["7889569"]},"oa_version":"Published Version","volume":80,"date_published":"1995-02-10T00:00:00Z","type":"journal_article","year":"1995","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:58:23Z","publist_id":"4339","publication_status":"published","day":"10","author":[{"full_name":"Masu, Masayuki","first_name":"Masayuki","last_name":"Masu"},{"last_name":"Iwakabe","full_name":"Iwakabe, Hideki","first_name":"Hideki"},{"last_name":"Tagawa","first_name":"Yoshiaki","full_name":"Tagawa, Yoshiaki"},{"full_name":"Miyoshi, Tomomitsu","first_name":"Tomomitsu","last_name":"Miyoshi"},{"first_name":"Masayuki","full_name":"Yamashita, Masayuki","last_name":"Yamashita"},{"last_name":"Fukuda","first_name":"Yutaka","full_name":"Fukuda, Yutaka"},{"full_name":"Sasaki, Hitoshi","first_name":"Hitoshi","last_name":"Sasaki"},{"full_name":"Hiroi, Kano","first_name":"Kano","last_name":"Hiroi"},{"full_name":"Nakamura, Yasuhisa","first_name":"Yasuhisa","last_name":"Nakamura"},{"orcid":"0000-0001-8761-9444","last_name":"Shigemoto","full_name":"Shigemoto, Ryuichi","first_name":"Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Masahiko","full_name":"Takada, Masahiko","last_name":"Takada"},{"last_name":"Nakamura","full_name":"Nakamura, Kenji","first_name":"Kenji"},{"last_name":"Nakao","full_name":"Nakao, Kazuki","first_name":"Kazuki"},{"first_name":"Motoya","full_name":"Katsuki, Motoya","last_name":"Katsuki"},{"full_name":"Nakanishi, Shigetada","first_name":"Shigetada","last_name":"Nakanishi"}],"page":"757 - 765","pmid":1,"acknowledgement":"We thank Drs. N. Mizuno, M. Iso, M. Tachibana, A. Kaneko, M. Tessier-Lavigne, and T. Hensch for useful advice and A. Uesugi for photographic assistance. This work is supported by grants in aid for specially promoted research, for scientific research on priority areas, and for scientific research (A) from the Ministry of Education, Science, and Culture in Japan and by grants from the Ministry of Health and Welfare of Japan, the Sankyo Foundation, and the Senri Life Science Foundation.","abstract":[{"text":"Taking advantage of the restricted expression of metabotropic glutamate receptor subtype 6 (mGIuR6) in retinal ON bipolar cells, we generated knockout mice lacking mGIuR6 expression. The homozygous mutant mice showed a loss of ON responses but unchanged OFF responses to light. The mutant mice displayed no obvious changes in retinal cell organization nor in the projection of optic fibers to the brain. Furthermore, the mGIuR6-deficient mice showed visual behavioral responses to light stimulation as examined by shuttle box avoidance behavior experiments using light exposure as a conditioned stimulus. The results demonstrate that mGIuR6 is essential in synaptic transmission to the ON bipolar cell and that the OFF response provides an important means for transmitting visual information.","lang":"eng"}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"2559","title":"Specific deficit of the ON response in visual transmission by targeted disruption of the mGIuR6 gene","main_file_link":[{"open_access":"1","url":"https://www.sciencedirect.com/science/article/pii/0092867495903542"}],"citation":{"chicago":"Masu, Masayuki, Hideki Iwakabe, Yoshiaki Tagawa, Tomomitsu Miyoshi, Masayuki Yamashita, Yutaka Fukuda, Hitoshi Sasaki, et al. “Specific Deficit of the ON Response in Visual Transmission by Targeted Disruption of the MGIuR6 Gene.” <i>Cell</i>. Cell Press, 1995. <a href=\"https://doi.org/10.1016/0092-8674(95)90354-2\">https://doi.org/10.1016/0092-8674(95)90354-2</a>.","mla":"Masu, Masayuki, et al. “Specific Deficit of the ON Response in Visual Transmission by Targeted Disruption of the MGIuR6 Gene.” <i>Cell</i>, vol. 80, no. 5, Cell Press, 1995, pp. 757–65, doi:<a href=\"https://doi.org/10.1016/0092-8674(95)90354-2\">10.1016/0092-8674(95)90354-2</a>.","ama":"Masu M, Iwakabe H, Tagawa Y, et al. Specific deficit of the ON response in visual transmission by targeted disruption of the mGIuR6 gene. <i>Cell</i>. 1995;80(5):757-765. doi:<a href=\"https://doi.org/10.1016/0092-8674(95)90354-2\">10.1016/0092-8674(95)90354-2</a>","ieee":"M. Masu <i>et al.</i>, “Specific deficit of the ON response in visual transmission by targeted disruption of the mGIuR6 gene,” <i>Cell</i>, vol. 80, no. 5. Cell Press, pp. 757–765, 1995.","short":"M. Masu, H. Iwakabe, Y. Tagawa, T. Miyoshi, M. Yamashita, Y. Fukuda, H. Sasaki, K. Hiroi, Y. Nakamura, R. Shigemoto, M. Takada, K. Nakamura, K. Nakao, M. Katsuki, S. Nakanishi, Cell 80 (1995) 757–765.","apa":"Masu, M., Iwakabe, H., Tagawa, Y., Miyoshi, T., Yamashita, M., Fukuda, Y., … Nakanishi, S. (1995). Specific deficit of the ON response in visual transmission by targeted disruption of the mGIuR6 gene. <i>Cell</i>. Cell Press. <a href=\"https://doi.org/10.1016/0092-8674(95)90354-2\">https://doi.org/10.1016/0092-8674(95)90354-2</a>","ista":"Masu M, Iwakabe H, Tagawa Y, Miyoshi T, Yamashita M, Fukuda Y, Sasaki H, Hiroi K, Nakamura Y, Shigemoto R, Takada M, Nakamura K, Nakao K, Katsuki M, Nakanishi S. 1995. Specific deficit of the ON response in visual transmission by targeted disruption of the mGIuR6 gene. Cell. 80(5), 757–765."},"intvolume":"        80","status":"public","publication_identifier":{"issn":["0092-8674"]},"issue":"5"},{"publication_identifier":{"issn":["0304-3940"]},"issue":"2","intvolume":"       198","citation":{"ama":"Lü Y, Jin S, Xu T, et al. Expression of c-fos protein in substance P receptor-like immunoreactive neurons in response to noxious stimuli on the urinary bladder: an observation in the lumbosacral cord segments of the rat. <i>Neuroscience Letters</i>. 1995;198(2):139-142. doi:<a href=\"https://doi.org/10.1016/0304-3940(95)11991-5\">10.1016/0304-3940(95)11991-5</a>","mla":"Lü, Yan, et al. “Expression of C-Fos Protein in Substance P Receptor-like Immunoreactive Neurons in Response to Noxious Stimuli on the Urinary Bladder: An Observation in the Lumbosacral Cord Segments of the Rat.” <i>Neuroscience Letters</i>, vol. 198, no. 2, Elsevier, 1995, pp. 139–42, doi:<a href=\"https://doi.org/10.1016/0304-3940(95)11991-5\">10.1016/0304-3940(95)11991-5</a>.","chicago":"Lü, Yan, Shan Jin, Tian Xu, Bing Qin, Ji Li, Yu Ding, Ryuichi Shigemoto, and Noboru Mizuno. “Expression of C-Fos Protein in Substance P Receptor-like Immunoreactive Neurons in Response to Noxious Stimuli on the Urinary Bladder: An Observation in the Lumbosacral Cord Segments of the Rat.” <i>Neuroscience Letters</i>. Elsevier, 1995. <a href=\"https://doi.org/10.1016/0304-3940(95)11991-5\">https://doi.org/10.1016/0304-3940(95)11991-5</a>.","ista":"Lü Y, Jin S, Xu T, Qin B, Li J, Ding Y, Shigemoto R, Mizuno N. 1995. Expression of c-fos protein in substance P receptor-like immunoreactive neurons in response to noxious stimuli on the urinary bladder: an observation in the lumbosacral cord segments of the rat. Neuroscience Letters. 198(2), 139–142.","apa":"Lü, Y., Jin, S., Xu, T., Qin, B., Li, J., Ding, Y., … Mizuno, N. (1995). Expression of c-fos protein in substance P receptor-like immunoreactive neurons in response to noxious stimuli on the urinary bladder: an observation in the lumbosacral cord segments of the rat. <i>Neuroscience Letters</i>. Elsevier. <a href=\"https://doi.org/10.1016/0304-3940(95)11991-5\">https://doi.org/10.1016/0304-3940(95)11991-5</a>","short":"Y. Lü, S. Jin, T. Xu, B. Qin, J. Li, Y. Ding, R. Shigemoto, N. Mizuno, Neuroscience Letters 198 (1995) 139–142.","ieee":"Y. Lü <i>et al.</i>, “Expression of c-fos protein in substance P receptor-like immunoreactive neurons in response to noxious stimuli on the urinary bladder: an observation in the lumbosacral cord segments of the rat,” <i>Neuroscience Letters</i>, vol. 198, no. 2. Elsevier, pp. 139–142, 1995."},"main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/0304394095119915?via%3Dihub"}],"status":"public","pmid":1,"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"lang":"eng","text":"Chemical irritation of the urinary bladder with formalin in the rat induced c-fos protein-like immunoreactivity in more than 80% of substance P receptor-like immunoreactive (SPR-LI) neurons of the dorsal commissural nucleus, sacral parasympathetic nucleus and lamina I in the 6th lumbar and 1st sacral cord segments. These neurons with SPR-LI may receive noxious information from the urinary bladder through the primary afferent fibers with substance P."}],"title":"Expression of c-fos protein in substance P receptor-like immunoreactive neurons in response to noxious stimuli on the urinary bladder: an observation in the lumbosacral cord segments of the rat","_id":"2560","date_created":"2018-12-11T11:58:23Z","day":"29","publist_id":"4338","publication_status":"published","author":[{"last_name":"Lü","full_name":"Lü, Yan","first_name":"Yan"},{"full_name":"Jin, Shan","first_name":"Shan","last_name":"Jin"},{"last_name":"Xu","full_name":"Xu, Tian","first_name":"Tian"},{"last_name":"Qin","first_name":"Bing","full_name":"Qin, Bing"},{"first_name":"Ji","full_name":"Li, Ji","last_name":"Li"},{"last_name":"Ding","full_name":"Ding, Yu","first_name":"Yu"},{"last_name":"Shigemoto","orcid":"0000-0001-8761-9444","first_name":"Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","full_name":"Shigemoto, Ryuichi"},{"full_name":"Mizuno, Noboru","first_name":"Noboru","last_name":"Mizuno"}],"page":"139 - 142","year":"1995","language":[{"iso":"eng"}],"article_type":"original","oa_version":"None","external_id":{"pmid":["8592640"]},"date_published":"1995-09-29T00:00:00Z","type":"journal_article","volume":198,"month":"09","quality_controlled":"1","extern":"1","article_processing_charge":"No","date_updated":"2022-06-28T12:54:14Z","doi":"10.1016/0304-3940(95)11991-5","publisher":"Elsevier","publication":"Neuroscience Letters"},{"issue":"1-2","publication_identifier":{"issn":["0304-3940"]},"status":"public","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/0304394095122079?via%3Dihub"}],"intvolume":"       202","citation":{"chicago":"Ohishi, Hitoshi, Sakashi Nomura, Yu Ding, Ryuichi Shigemoto, Eiki Wada, Ayae Kinoshita, Jin Li, Akio Neki, Shigetada Nakanishi, and Noboru Mizuno. “Presynaptic Localization of a Metabotropic Glutamate Receptor, MGluR7, in the Primary Afferent Neurons: An Immunohistochemical Study in the Rat.” <i>Neuroscience Letters</i>. Elsevier, 1995. <a href=\"https://doi.org/10.1016/0304-3940(95)12207-9\">https://doi.org/10.1016/0304-3940(95)12207-9</a>.","mla":"Ohishi, Hitoshi, et al. “Presynaptic Localization of a Metabotropic Glutamate Receptor, MGluR7, in the Primary Afferent Neurons: An Immunohistochemical Study in the Rat.” <i>Neuroscience Letters</i>, vol. 202, no. 1–2, Elsevier, 1995, pp. 85–88, doi:<a href=\"https://doi.org/10.1016/0304-3940(95)12207-9\">10.1016/0304-3940(95)12207-9</a>.","ama":"Ohishi H, Nomura S, Ding Y, et al. Presynaptic localization of a metabotropic glutamate receptor, mGluR7, in the primary afferent neurons: An immunohistochemical study in the rat. <i>Neuroscience Letters</i>. 1995;202(1-2):85-88. doi:<a href=\"https://doi.org/10.1016/0304-3940(95)12207-9\">10.1016/0304-3940(95)12207-9</a>","ieee":"H. Ohishi <i>et al.</i>, “Presynaptic localization of a metabotropic glutamate receptor, mGluR7, in the primary afferent neurons: An immunohistochemical study in the rat,” <i>Neuroscience Letters</i>, vol. 202, no. 1–2. Elsevier, pp. 85–88, 1995.","short":"H. Ohishi, S. Nomura, Y. Ding, R. Shigemoto, E. Wada, A. Kinoshita, J. Li, A. Neki, S. Nakanishi, N. Mizuno, Neuroscience Letters 202 (1995) 85–88.","apa":"Ohishi, H., Nomura, S., Ding, Y., Shigemoto, R., Wada, E., Kinoshita, A., … Mizuno, N. (1995). Presynaptic localization of a metabotropic glutamate receptor, mGluR7, in the primary afferent neurons: An immunohistochemical study in the rat. <i>Neuroscience Letters</i>. Elsevier. <a href=\"https://doi.org/10.1016/0304-3940(95)12207-9\">https://doi.org/10.1016/0304-3940(95)12207-9</a>","ista":"Ohishi H, Nomura S, Ding Y, Shigemoto R, Wada E, Kinoshita A, Li J, Neki A, Nakanishi S, Mizuno N. 1995. Presynaptic localization of a metabotropic glutamate receptor, mGluR7, in the primary afferent neurons: An immunohistochemical study in the rat. Neuroscience Letters. 202(1–2), 85–88."},"abstract":[{"text":"An antibody which recognizes specifically a metabotropic glutamate receptor, mGluR7, was produced by using a trpE fusion protein containing a C-terminal sequence of rat mGluR7. Neuropil in laminae I and II of the dorsal horn of the rat, as well as many neuronal cell bodies in the dorsal root ganglion, showed mGluR7-like immunoreactivity; the immunoreactivity in neuropil was seen in axon terminals, which were filled with round synaptic vesicles and constituted axodendritic and axosomatic asymmetric synapses. The mGluR7-like immunoreactivity in laminae I and II in the dorsal horn was reduced after dorsal rhizotomy. The results indicate that some axon terminals of the primary afferent fibers to laminae I and II of the dorsal horn are provided with mGluR7.","lang":"eng"}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"2561","title":"Presynaptic localization of a metabotropic glutamate receptor, mGluR7, in the primary afferent neurons: An immunohistochemical study in the rat","pmid":1,"acknowledgement":"We are grateful to Mr. Akira Uesugi for photographic help.","author":[{"first_name":"Hitoshi","full_name":"Ohishi, Hitoshi","last_name":"Ohishi"},{"full_name":"Nomura, Sakashi","first_name":"Sakashi","last_name":"Nomura"},{"last_name":"Ding","full_name":"Ding, Yu","first_name":"Yu"},{"id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi","full_name":"Shigemoto, Ryuichi","orcid":"0000-0001-8761-9444","last_name":"Shigemoto"},{"last_name":"Wada","first_name":"Eiki","full_name":"Wada, Eiki"},{"first_name":"Ayae","full_name":"Kinoshita, Ayae","last_name":"Kinoshita"},{"first_name":"Jin","full_name":"Li, Jin","last_name":"Li"},{"first_name":"Akio","full_name":"Neki, Akio","last_name":"Neki"},{"full_name":"Nakanishi, Shigetada","first_name":"Shigetada","last_name":"Nakanishi"},{"last_name":"Mizuno","full_name":"Mizuno, Noboru","first_name":"Noboru"}],"page":"85 - 88","date_created":"2018-12-11T11:58:24Z","publist_id":"4337","publication_status":"published","day":"01","year":"1995","language":[{"iso":"eng"}],"volume":202,"date_published":"1995-12-01T00:00:00Z","type":"journal_article","article_type":"original","oa_version":"None","external_id":{"pmid":["8787837"]},"article_processing_charge":"No","publication":"Neuroscience Letters","publisher":"Elsevier","date_updated":"2022-06-28T12:44:57Z","doi":"10.1016/0304-3940(95)12207-9","month":"12","extern":"1","quality_controlled":"1"}]