[{"publication":"Cerebral Cortex","citation":{"short":"G. López Bendito, R. Luján, R. Shigemoto, P. Ganter, O. Paulsen, Z. Molnár, Cerebral Cortex 13 (2003) 932–942.","mla":"López Bendito, Guillermina, et al. “Blockade of GABAB Receptors Alters the Tangential Migration of Cortical Neurons.” Cerebral Cortex, vol. 13, no. 9, Oxford University Press, 2003, pp. 932–42, doi:10.1093/cercor/13.9.932.","chicago":"López Bendito, Guillermina, Rafael Luján, Ryuichi Shigemoto, Paul Ganter, Ole Paulsen, and Zoltán Molnár. “Blockade of GABAB Receptors Alters the Tangential Migration of Cortical Neurons.” Cerebral Cortex. Oxford University Press, 2003. https://doi.org/10.1093/cercor/13.9.932.","ama":"López Bendito G, Luján R, Shigemoto R, Ganter P, Paulsen O, Molnár Z. Blockade of GABAB receptors alters the tangential migration of cortical neurons. Cerebral Cortex. 2003;13(9):932-942. doi:10.1093/cercor/13.9.932","apa":"López Bendito, G., Luján, R., Shigemoto, R., Ganter, P., Paulsen, O., & Molnár, Z. (2003). Blockade of GABAB receptors alters the tangential migration of cortical neurons. Cerebral Cortex. Oxford University Press. https://doi.org/10.1093/cercor/13.9.932","ieee":"G. López Bendito, R. Luján, R. Shigemoto, P. Ganter, O. Paulsen, and Z. Molnár, “Blockade of GABAB receptors alters the tangential migration of cortical neurons,” Cerebral Cortex, vol. 13, no. 9. Oxford University Press, pp. 932–942, 2003.","ista":"López Bendito G, Luján R, Shigemoto R, Ganter P, Paulsen O, Molnár Z. 2003. Blockade of GABAB receptors alters the tangential migration of cortical neurons. Cerebral Cortex. 13(9), 932–942."},"quality_controlled":0,"page":"932 - 942","doi":"10.1093/cercor/13.9.932","date_published":"2003-09-01T00:00:00Z","day":"01","month":"09","_id":"2634","year":"2003","title":"Blockade of GABAB receptors alters the tangential migration of cortical neurons","status":"public","publication_status":"published","publisher":"Oxford University Press","intvolume":" 13","author":[{"first_name":"Guillermina","last_name":"López Bendito","full_name":"López-Bendito, Guillermina"},{"last_name":"Luján","first_name":"Rafael","full_name":"Luján, Rafael"},{"id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8761-9444","first_name":"Ryuichi","last_name":"Shigemoto","full_name":"Ryuichi Shigemoto"},{"full_name":"Ganter, Paul","last_name":"Ganter","first_name":"Paul"},{"first_name":"Ole","last_name":"Paulsen","full_name":"Paulsen, Ole"},{"last_name":"Molnár","first_name":"Zoltán","full_name":"Molnár, Zoltán"}],"date_created":"2018-12-11T11:58:47Z","date_updated":"2021-01-12T06:58:43Z","volume":13,"type":"journal_article","abstract":[{"lang":"eng","text":"To better understand the role of neurotransmitter receptors in neuronal differentiation and maturation a detailed knowledge of their identity, location and function in the plasma membrane of specific neuronal populations during development is required. Combining pre-embedding immunocytochemistry with cell tracking in embryonic brain slice cultures we show that virtually all neurons (∼98%) migrating through the lower intermediate zone (LIZ) on their way from the medial ganglionic eminence to the cerebral cortex, express GABA BR1. Blockade of GABABRs with a specific antagonist, CGP52432, resulted in a concentration-dependent accumulation of these tangentially migrating neurons in the ventricular/subventricular zones (VZ/SVZ) of the cortex and fewer cells were observed in the cortical plate/marginal zone (CP/MZ) and LIZ. Moreover, they had significantly shorter leading processes compared with similar migrating cells in control slices. Electrophysiological recording in LIZ and CP cells revealed no direct effect of either CGP52432 or the GABABR agonist, baclofen, on resting membrane properties suggesting that the effect of CGP52432 on migration might be mediated through a metabotropic action or the regulation of release of factors controlling migration. These results suggest that GABABRs have an important modulatory role in the migration of cortical interneurons."}],"issue":"9","publist_id":"4264","extern":1},{"type":"journal_article","extern":1,"abstract":[{"lang":"eng","text":"Taste-metabotropic glutamate receptor 4 (taste-mGluR4) and the heteromers of T1R1 and T1R3 are candidate receptors involved in the sense of umami (monosodium glutamate) taste. Although the expression of group III mGluRs (taste-mGluR4) has been demonstrated in taste tissues, no mention has been made of the expression of group I mGluRs (mGluR1 and mGluR5) in taste tissues. We examined the expression of mGluR1 and mGluR5 in rat gustatory tissues by using reverse transcription-polymerase chain reaction (RT-PCR), in situ hybridization, immunohistochemistry and immunoelectron microscopy. RT-PCR assay showed that mGluR1α and mGluR1β mRNAs were expressed in circumvallate papillae, but mGluR5 mRNA was not expressed. The positive signals of mGluR1 mRNA were detected only in circumvallate taste buds by in situ hybridization analysis. In cryosections of fungiform, foliate and circumvallate papillae, the antibody against mGluRla gave intense labeling on the taste hairs in all taste pores examined. In the developing taste buds, the positive signals of mGluR1α in taste hairs gradually increased with the increase in number of taste bud cells. These results show that, in addition to taste-mGluR4 and the heteromer of T1R1 and T1R3, mGluR1α may function as a receptor for glutamate (umami) taste sensation."}],"publist_id":"4267","issue":"1","title":"Expression of metabotropic glutamate receptor group I in rat gustatory papillae","status":"public","publication_status":"published","publisher":"Springer","intvolume":" 313","year":"2003","_id":"2630","date_updated":"2021-01-12T06:58:41Z","date_created":"2018-12-11T11:58:46Z","volume":313,"author":[{"full_name":"Toyono, Takashi","first_name":"Takashi","last_name":"Toyono"},{"first_name":"Yuji","last_name":"Seta","full_name":"Seta, Yuji"},{"last_name":"Kataoka","first_name":"Shinji","full_name":"Kataoka, Shinji"},{"first_name":"Shintaro","last_name":"Kawano","full_name":"Kawano, Shintaro"},{"full_name":"Ryuichi Shigemoto","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8761-9444","first_name":"Ryuichi","last_name":"Shigemoto"},{"full_name":"Toyoshima, Kuniaki","last_name":"Toyoshima","first_name":"Kuniaki"}],"day":"01","month":"07","quality_controlled":0,"page":"29 - 35","publication":"Cell and Tissue Research","citation":{"mla":"Toyono, Takashi, et al. “Expression of Metabotropic Glutamate Receptor Group I in Rat Gustatory Papillae.” Cell and Tissue Research, vol. 313, no. 1, Springer, 2003, pp. 29–35, doi:10.1007/s00441-003-0740-2.","short":"T. Toyono, Y. Seta, S. Kataoka, S. Kawano, R. Shigemoto, K. Toyoshima, Cell and Tissue Research 313 (2003) 29–35.","chicago":"Toyono, Takashi, Yuji Seta, Shinji Kataoka, Shintaro Kawano, Ryuichi Shigemoto, and Kuniaki Toyoshima. “Expression of Metabotropic Glutamate Receptor Group I in Rat Gustatory Papillae.” Cell and Tissue Research. Springer, 2003. https://doi.org/10.1007/s00441-003-0740-2.","ama":"Toyono T, Seta Y, Kataoka S, Kawano S, Shigemoto R, Toyoshima K. Expression of metabotropic glutamate receptor group I in rat gustatory papillae. Cell and Tissue Research. 2003;313(1):29-35. doi:10.1007/s00441-003-0740-2","ista":"Toyono T, Seta Y, Kataoka S, Kawano S, Shigemoto R, Toyoshima K. 2003. Expression of metabotropic glutamate receptor group I in rat gustatory papillae. Cell and Tissue Research. 313(1), 29–35.","apa":"Toyono, T., Seta, Y., Kataoka, S., Kawano, S., Shigemoto, R., & Toyoshima, K. (2003). Expression of metabotropic glutamate receptor group I in rat gustatory papillae. Cell and Tissue Research. Springer. https://doi.org/10.1007/s00441-003-0740-2","ieee":"T. Toyono, Y. Seta, S. Kataoka, S. Kawano, R. Shigemoto, and K. Toyoshima, “Expression of metabotropic glutamate receptor group I in rat gustatory papillae,” Cell and Tissue Research, vol. 313, no. 1. Springer, pp. 29–35, 2003."},"date_published":"2003-07-01T00:00:00Z","doi":"10.1007/s00441-003-0740-2"},{"day":"19","month":"12","doi":"10.1016/j.neulet.2003.09.027","date_published":"2003-12-19T00:00:00Z","publication":"Neuroscience Letters","citation":{"ama":"Bell K, De Kort GJ, Steggerda S, Shigemoto R, Ribeiro Da Silva A, Cuello A. Structural involvement of the glutamatergic presynaptic boutons in a transgenic mouse model expressing early onset amyloid pathology. Neuroscience Letters. 2003;353(2):143-147. doi:10.1016/j.neulet.2003.09.027","ista":"Bell K, De Kort GJ, Steggerda S, Shigemoto R, Ribeiro Da Silva A, Cuello A. 2003. Structural involvement of the glutamatergic presynaptic boutons in a transgenic mouse model expressing early onset amyloid pathology. Neuroscience Letters. 353(2), 143–147.","apa":"Bell, K., De Kort, G. J., Steggerda, S., Shigemoto, R., Ribeiro Da Silva, A., & Cuello, A. (2003). Structural involvement of the glutamatergic presynaptic boutons in a transgenic mouse model expressing early onset amyloid pathology. Neuroscience Letters. Elsevier. https://doi.org/10.1016/j.neulet.2003.09.027","ieee":"K. Bell, G. J. De Kort, S. Steggerda, R. Shigemoto, A. Ribeiro Da Silva, and A. Cuello, “Structural involvement of the glutamatergic presynaptic boutons in a transgenic mouse model expressing early onset amyloid pathology,” Neuroscience Letters, vol. 353, no. 2. Elsevier, pp. 143–147, 2003.","mla":"Bell, Karen, et al. “Structural Involvement of the Glutamatergic Presynaptic Boutons in a Transgenic Mouse Model Expressing Early Onset Amyloid Pathology.” Neuroscience Letters, vol. 353, no. 2, Elsevier, 2003, pp. 143–47, doi:10.1016/j.neulet.2003.09.027.","short":"K. Bell, G.J. De Kort, S. Steggerda, R. Shigemoto, A. Ribeiro Da Silva, A. Cuello, Neuroscience Letters 353 (2003) 143–147.","chicago":"Bell, Karen, G J De Kort, S Steggerda, Ryuichi Shigemoto, Alfredo Ribeiro Da Silva, and Augusto Cuello. “Structural Involvement of the Glutamatergic Presynaptic Boutons in a Transgenic Mouse Model Expressing Early Onset Amyloid Pathology.” Neuroscience Letters. Elsevier, 2003. https://doi.org/10.1016/j.neulet.2003.09.027."},"quality_controlled":0,"page":"143 - 147","abstract":[{"lang":"eng","text":"While the cholinergic depletion in Alzheimer's disease (AD) has been known for some time, a definitive involvement of other neurotransmitter systems has been somewhat more elusive. Our study demonstrates a clear involvement of both glutamatergic and, to a lesser extent, GABAergic neurons in an early onset transgenic mouse model of AD-like amyloid pathology. Immunohistochemical staining and subsequent quantification has revealed a statistically significant increased density of glutamatergic and GABAergic presynaptic boutons in both the plaque free and plaque adjacent cortical neuropile areas of transgenic mice as compared to non-transgenic controls. Furthermore, amyloid plaque size was shown to have a statistically significant effect on the relative area occupied by dystrophic glutamatergic neurites in the peri-plaque neuropile. These findings support our hypothesis that the amyloid pathology progresses in a time and neurotransmitter specific manner, first in the cholinergic system which appears to be most vulnerable, followed by the glutamatergic presynaptic boutons and finally the somewhat more resilient GABAergic terminals."}],"issue":"2","publist_id":"4262","extern":1,"type":"journal_article","author":[{"full_name":"Bell, Karen F","last_name":"Bell","first_name":"Karen"},{"last_name":"De Kort","first_name":"G J","full_name":"De Kort, G J"},{"full_name":"Steggerda, S","first_name":"S","last_name":"Steggerda"},{"full_name":"Ryuichi Shigemoto","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8761-9444","first_name":"Ryuichi","last_name":"Shigemoto"},{"first_name":"Alfredo","last_name":"Ribeiro Da Silva","full_name":"Ribeiro-da-Silva, Alfredo"},{"full_name":"Cuello, Augusto C","last_name":"Cuello","first_name":"Augusto"}],"date_updated":"2021-01-12T06:58:44Z","date_created":"2018-12-11T11:58:48Z","volume":353,"_id":"2637","year":"2003","publication_status":"published","title":"Structural involvement of the glutamatergic presynaptic boutons in a transgenic mouse model expressing early onset amyloid pathology","status":"public","intvolume":" 353","publisher":"Elsevier"},{"abstract":[{"text":"We report the results of an experimental study of magnetohydrodynamic damping of sidewall convection in a rectangular enclosure filled with gallium. In particular we investigate the suppression of convection when a steady magnetic field is applied separately in each of the three principal directions of the flow. The strongest damping of the steady flow is found for a vertical magnetic field, which is in agreement with theory. However, we observe that the application of a field transverse to the flow provides greater damping than a longitudinal one, which seems to contradict available theory. We provide a possible resolution of this apparent dichotomy in terms of the length scale of the experiment.","lang":"eng"}],"publist_id":"4105","extern":1,"type":"journal_article","author":[{"last_name":"Hof","first_name":"Björn","orcid":"0000-0003-2057-2754","id":"3A374330-F248-11E8-B48F-1D18A9856A87","full_name":"Björn Hof"},{"first_name":"Anne","last_name":"Juel","full_name":"Juel, Anne"},{"first_name":"Tom","last_name":"Mullin","full_name":"Mullin, Tom P"}],"date_created":"2018-12-11T11:59:35Z","date_updated":"2021-01-12T06:59:42Z","volume":482,"_id":"2784","year":"2003","status":"public","publication_status":"published","title":"Magnetohydrodynamic damping of convective flows in molten gallium","publisher":"Cambridge University Press","intvolume":" 482","day":"13","month":"05","date_published":"2003-05-13T00:00:00Z","doi":"10.1017/S0022112003004014","publication":"Journal of Fluid Mechanics","citation":{"mla":"Hof, Björn, et al. “Magnetohydrodynamic Damping of Convective Flows in Molten Gallium.” Journal of Fluid Mechanics, vol. 482, Cambridge University Press, 2003, pp. 163–79, doi:10.1017/S0022112003004014.","short":"B. Hof, A. Juel, T. Mullin, Journal of Fluid Mechanics 482 (2003) 163–179.","chicago":"Hof, Björn, Anne Juel, and Tom Mullin. “Magnetohydrodynamic Damping of Convective Flows in Molten Gallium.” Journal of Fluid Mechanics. Cambridge University Press, 2003. https://doi.org/10.1017/S0022112003004014.","ama":"Hof B, Juel A, Mullin T. Magnetohydrodynamic damping of convective flows in molten gallium. Journal of Fluid Mechanics. 2003;482:163-179. doi:10.1017/S0022112003004014","ista":"Hof B, Juel A, Mullin T. 2003. Magnetohydrodynamic damping of convective flows in molten gallium. Journal of Fluid Mechanics. 482, 163–179.","ieee":"B. Hof, A. Juel, and T. Mullin, “Magnetohydrodynamic damping of convective flows in molten gallium,” Journal of Fluid Mechanics, vol. 482. Cambridge University Press, pp. 163–179, 2003.","apa":"Hof, B., Juel, A., & Mullin, T. (2003). Magnetohydrodynamic damping of convective flows in molten gallium. Journal of Fluid Mechanics. Cambridge University Press. https://doi.org/10.1017/S0022112003004014"},"quality_controlled":0,"page":"163 - 179"},{"type":"journal_article","publist_id":"4104","issue":"24","abstract":[{"text":"Experimental evidence for the scaling of the finite amplitude of perturbation theory required to promote transition in Poiseuille flow was found. The exponent is -1 and was uncovered using considerable care in the design and execution of the experiment. Interestingly, this exponent was also found in experiments on transition in boundary layers.","lang":"eng"}],"extern":1,"year":"2003","_id":"2785","intvolume":" 91","publisher":"American Physical Society","publication_status":"published","title":"Scaling of the turbulence transition threshold in a pipe","status":"public","author":[{"last_name":"Hof","first_name":"Björn","orcid":"0000-0003-2057-2754","id":"3A374330-F248-11E8-B48F-1D18A9856A87","full_name":"Björn Hof"},{"full_name":"Juel, Anne","first_name":"Anne","last_name":"Juel"},{"last_name":"Mullin","first_name":"Tom","full_name":"Mullin, Tom P"}],"volume":91,"date_created":"2018-12-11T11:59:35Z","date_updated":"2021-01-12T06:59:42Z","day":"12","month":"12","citation":{"chicago":"Hof, Björn, Anne Juel, and Tom Mullin. “Scaling of the Turbulence Transition Threshold in a Pipe.” Physical Review Letters. American Physical Society, 2003. https://doi.org/10.1103/PhysRevLett.91.244502.","short":"B. Hof, A. Juel, T. Mullin, Physical Review Letters 91 (2003) 244502/1-244502/4.","mla":"Hof, Björn, et al. “Scaling of the Turbulence Transition Threshold in a Pipe.” Physical Review Letters, vol. 91, no. 24, American Physical Society, 2003, p. 244502/1-244502/4, doi:10.1103/PhysRevLett.91.244502.","apa":"Hof, B., Juel, A., & Mullin, T. (2003). Scaling of the turbulence transition threshold in a pipe. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.91.244502","ieee":"B. Hof, A. Juel, and T. Mullin, “Scaling of the turbulence transition threshold in a pipe,” Physical Review Letters, vol. 91, no. 24. American Physical Society, p. 244502/1-244502/4, 2003.","ista":"Hof B, Juel A, Mullin T. 2003. Scaling of the turbulence transition threshold in a pipe. Physical Review Letters. 91(24), 244502/1-244502/4.","ama":"Hof B, Juel A, Mullin T. Scaling of the turbulence transition threshold in a pipe. Physical Review Letters. 2003;91(24):244502/1-244502/4. doi:10.1103/PhysRevLett.91.244502"},"publication":"Physical Review Letters","page":"244502/1 - 244502/4","quality_controlled":0,"doi":"10.1103/PhysRevLett.91.244502","date_published":"2003-12-12T00:00:00Z"},{"quality_controlled":"1","page":"7 - 12","publication":"Current Opinion in Plant Biology","citation":{"ama":"Friml J. Auxin transport - Shaping the plant. Current Opinion in Plant Biology. 2003;6(1):7-12. doi:10.1016/S1369526602000031","apa":"Friml, J. (2003). Auxin transport - Shaping the plant. Current Opinion in Plant Biology. Elsevier. https://doi.org/10.1016/S1369526602000031","ieee":"J. Friml, “Auxin transport - Shaping the plant,” Current Opinion in Plant Biology, vol. 6, no. 1. Elsevier, pp. 7–12, 2003.","ista":"Friml J. 2003. Auxin transport - Shaping the plant. Current Opinion in Plant Biology. 6(1), 7–12.","short":"J. Friml, Current Opinion in Plant Biology 6 (2003) 7–12.","mla":"Friml, Jiří. “Auxin Transport - Shaping the Plant.” Current Opinion in Plant Biology, vol. 6, no. 1, Elsevier, 2003, pp. 7–12, doi:10.1016/S1369526602000031.","chicago":"Friml, Jiří. “Auxin Transport - Shaping the Plant.” Current Opinion in Plant Biology. Elsevier, 2003. https://doi.org/10.1016/S1369526602000031."},"language":[{"iso":"eng"}],"date_published":"2003-02-01T00:00:00Z","doi":"10.1016/S1369526602000031","month":"02","day":"01","publication_status":"published","title":"Auxin transport - Shaping the plant","status":"public","publisher":"Elsevier","intvolume":" 6","_id":"2990","year":"2003","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T12:00:43Z","date_updated":"2021-01-12T07:40:17Z","volume":6,"oa_version":"None","author":[{"full_name":"Friml, Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596","first_name":"Jirí","last_name":"Friml"}],"type":"journal_article","extern":"1","abstract":[{"text":"Plant growth is marked by its adaptability to continuous changes in environment. A regulated, differential distribution of auxin underlies many adaptation processes including organogenesis, meristem patterning and tropisms. In executing its multiple roles, auxin displays some characteristics of both a hormone and a morphogen. Studies on auxin transport, as well as tracing the intracellular movement of its molecular components, have suggested a possible scenario to explain how growth plasticity is conferred at the cellular and molecular level. The plant perceives stimuli and changes the subcellular position of auxin-transport components accordingly. These changes modulate auxin fluxes, and the newly established auxin distribution triggers the corresponding developmental response.","lang":"eng"}],"issue":"1","publist_id":"3711"},{"day":"01","month":"03","quality_controlled":0,"page":"612 - 625","publication":"Plant Cell","citation":{"short":"V. Willemsen, J. Friml, M. Grebe, A. Van Den Toorn, K. Palme, B. Scheres, Plant Cell 15 (2003) 612–625.","mla":"Willemsen, Viola, et al. “Cell Polarity and PIN Protein Positioning in Arabidopsis Require STEROL METHYLTRANSFERASE1 Function.” Plant Cell, vol. 15, no. 3, American Society of Plant Biologists, 2003, pp. 612–25, doi:10.1105/tpc.008433.","chicago":"Willemsen, Viola, Jiří Friml, Markus Grebe, Albert Van Den Toorn, Klaus Palme, and Ben Scheres. “Cell Polarity and PIN Protein Positioning in Arabidopsis Require STEROL METHYLTRANSFERASE1 Function.” Plant Cell. American Society of Plant Biologists, 2003. https://doi.org/10.1105/tpc.008433.","ama":"Willemsen V, Friml J, Grebe M, Van Den Toorn A, Palme K, Scheres B. Cell polarity and PIN protein positioning in Arabidopsis require STEROL METHYLTRANSFERASE1 function. Plant Cell. 2003;15(3):612-625. doi:10.1105/tpc.008433","apa":"Willemsen, V., Friml, J., Grebe, M., Van Den Toorn, A., Palme, K., & Scheres, B. (2003). Cell polarity and PIN protein positioning in Arabidopsis require STEROL METHYLTRANSFERASE1 function. Plant Cell. American Society of Plant Biologists. https://doi.org/10.1105/tpc.008433","ieee":"V. Willemsen, J. Friml, M. Grebe, A. Van Den Toorn, K. Palme, and B. Scheres, “Cell polarity and PIN protein positioning in Arabidopsis require STEROL METHYLTRANSFERASE1 function,” Plant Cell, vol. 15, no. 3. American Society of Plant Biologists, pp. 612–625, 2003.","ista":"Willemsen V, Friml J, Grebe M, Van Den Toorn A, Palme K, Scheres B. 2003. Cell polarity and PIN protein positioning in Arabidopsis require STEROL METHYLTRANSFERASE1 function. Plant Cell. 15(3), 612–625."},"date_published":"2003-03-01T00:00:00Z","doi":"10.1105/tpc.008433","type":"journal_article","extern":1,"abstract":[{"lang":"eng","text":"Plants have many polarized cell types, but relatively little is known about the mechanisms that establish polarity. The orc mutant was identified originally by defects in root patterning, and positional cloning revealed that the affected gene encodes STEROL METHYLTRANSFERASE1, which is required for the appropriate synthesis and composition of major membrane sterols. smt1orc mutants displayed several conspicuous cell polarity defects. Columella root cap cells revealed perturbed polar positioning of different organelles, and in the smt1orc root epidermis, polar initiation of root hairs was more randomized. Polar auxin transport and expression of the auxin reporter DR5-β-glucuronidase were aberrant in smt1orc. Patterning defects in smt1orc resembled those observed in mutants of the PIN gene family of putative auxin efflux transporters. Consistently, the membrane localization of the PIN1 and PIN3 proteins was disturbed in smt1orc, whereas polar positioning of the influx carrier AUX1 appeared normal. Our results suggest that balanced sterol composition is a major requirement for cell polarity and auxin efflux in Arabidopsis."}],"issue":"3","publist_id":"3710","publication_status":"published","title":"Cell polarity and PIN protein positioning in Arabidopsis require STEROL METHYLTRANSFERASE1 function","status":"public","intvolume":" 15","publisher":"American Society of Plant Biologists","year":"2003","_id":"2992","date_updated":"2021-01-12T07:40:18Z","date_created":"2018-12-11T12:00:44Z","volume":15,"author":[{"first_name":"Viola","last_name":"Willemsen","full_name":"Willemsen, Viola"},{"first_name":"Jirí","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596","full_name":"Jirí Friml"},{"first_name":"Markus","last_name":"Grebe","full_name":"Grebe, Markus"},{"first_name":"Albert","last_name":"Van Den Toorn","full_name":"Van Den Toorn, Albert"},{"full_name":"Palme, Klaus","last_name":"Palme","first_name":"Klaus"},{"full_name":"Scheres, Ben","last_name":"Scheres","first_name":"Ben"}]},{"date_created":"2018-12-11T12:00:46Z","date_updated":"2021-01-12T07:40:19Z","volume":115,"author":[{"full_name":"Eva Benková","first_name":"Eva","last_name":"Benková","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8510-9739"},{"full_name":"Michniewicz, Marta","first_name":"Marta","last_name":"Michniewicz"},{"last_name":"Sauer","first_name":"Michael","full_name":"Sauer, Michael"},{"full_name":"Teichmann, Thomas","first_name":"Thomas","last_name":"Teichmann"},{"full_name":"Seifertová, Daniela","last_name":"Seifertová","first_name":"Daniela"},{"full_name":"Jürgens, Gerd","last_name":"Jürgens","first_name":"Gerd"},{"full_name":"Jirí Friml","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","first_name":"Jirí"}],"title":"Local, efflux-dependent auxin gradients as a common module for plant organ formation","status":"public","publication_status":"published","intvolume":" 115","publisher":"Cell Press","_id":"2996","year":"2003","extern":1,"abstract":[{"lang":"eng","text":"Plants, compared to animals, exhibit an amazing adaptability and plasticity in their development. This is largely dependent on the ability of plants to form new organs, such as lateral roots, leaves, and flowers during postembryonic development. Organ primordia develop from founder cell populations into organs by coordinated cell division and differentiation. Here, we show that organ formation in Arabidopsis involves dynamic gradients of the signaling molecule auxin with maxima at the primordia tips. These gradients are mediated by cellular efflux requiring asymmetrically localized PIN proteins, which represent a functionally redundant network for auxin distribution in both aerial and underground organs. PIN1 polar localization undergoes a dynamic rearrangement, which correlates with establishment of auxin gradients and primordium development. Our results suggest that PIN-dependent, local auxin gradients represent a common module for formation of all plant organs, regardless of their mature morphology or developmental origin.\n"}],"issue":"5","publist_id":"3706","type":"journal_article","date_published":"2003-11-26T00:00:00Z","doi":"10.1016/S0092-8674(03)00924-3","quality_controlled":0,"page":"591 - 602","publication":"Cell","citation":{"chicago":"Benková, Eva, Marta Michniewicz, Michael Sauer, Thomas Teichmann, Daniela Seifertová, Gerd Jürgens, and Jiří Friml. “Local, Efflux-Dependent Auxin Gradients as a Common Module for Plant Organ Formation.” Cell. Cell Press, 2003. https://doi.org/10.1016/S0092-8674(03)00924-3.","mla":"Benková, Eva, et al. “Local, Efflux-Dependent Auxin Gradients as a Common Module for Plant Organ Formation.” Cell, vol. 115, no. 5, Cell Press, 2003, pp. 591–602, doi:10.1016/S0092-8674(03)00924-3.","short":"E. Benková, M. Michniewicz, M. Sauer, T. Teichmann, D. Seifertová, G. Jürgens, J. Friml, Cell 115 (2003) 591–602.","ista":"Benková E, Michniewicz M, Sauer M, Teichmann T, Seifertová D, Jürgens G, Friml J. 2003. Local, efflux-dependent auxin gradients as a common module for plant organ formation. Cell. 115(5), 591–602.","ieee":"E. Benková et al., “Local, efflux-dependent auxin gradients as a common module for plant organ formation,” Cell, vol. 115, no. 5. Cell Press, pp. 591–602, 2003.","apa":"Benková, E., Michniewicz, M., Sauer, M., Teichmann, T., Seifertová, D., Jürgens, G., & Friml, J. (2003). Local, efflux-dependent auxin gradients as a common module for plant organ formation. Cell. Cell Press. https://doi.org/10.1016/S0092-8674(03)00924-3","ama":"Benková E, Michniewicz M, Sauer M, et al. Local, efflux-dependent auxin gradients as a common module for plant organ formation. Cell. 2003;115(5):591-602. doi:10.1016/S0092-8674(03)00924-3"},"month":"11","day":"26"},{"month":"11","day":"13","date_published":"2003-11-13T00:00:00Z","doi":"10.1038/nature02085","page":"147 - 153","quality_controlled":0,"citation":{"chicago":"Friml, Jiří, Anne Vieten, Michael Sauer, Dolf Weijers, Heinz Schwarz, Thorsten Hamann, Remko Offringa, and Gerd Jürgens. “Efflux Dependent Auxin Gradients Establish the Apical Basal Axis of Arabidopsis.” Nature. Nature Publishing Group, 2003. https://doi.org/10.1038/nature02085.","short":"J. Friml, A. Vieten, M. Sauer, D. Weijers, H. Schwarz, T. Hamann, R. Offringa, G. Jürgens, Nature 426 (2003) 147–153.","mla":"Friml, Jiří, et al. “Efflux Dependent Auxin Gradients Establish the Apical Basal Axis of Arabidopsis.” Nature, vol. 426, no. 6963, Nature Publishing Group, 2003, pp. 147–53, doi:10.1038/nature02085.","ieee":"J. Friml et al., “Efflux dependent auxin gradients establish the apical basal axis of Arabidopsis,” Nature, vol. 426, no. 6963. Nature Publishing Group, pp. 147–153, 2003.","apa":"Friml, J., Vieten, A., Sauer, M., Weijers, D., Schwarz, H., Hamann, T., … Jürgens, G. (2003). Efflux dependent auxin gradients establish the apical basal axis of Arabidopsis. Nature. Nature Publishing Group. https://doi.org/10.1038/nature02085","ista":"Friml J, Vieten A, Sauer M, Weijers D, Schwarz H, Hamann T, Offringa R, Jürgens G. 2003. Efflux dependent auxin gradients establish the apical basal axis of Arabidopsis. Nature. 426(6963), 147–153.","ama":"Friml J, Vieten A, Sauer M, et al. Efflux dependent auxin gradients establish the apical basal axis of Arabidopsis. Nature. 2003;426(6963):147-153. doi:10.1038/nature02085"},"publication":"Nature","extern":1,"issue":"6963","publist_id":"3708","abstract":[{"lang":"eng","text":"Axis formation occurs in plants, as in animals, during early embryogenesis. However, the underlying mechanism is not known. Here we show that the first manifestation of the apical-basal axis in plants, the asymmetric division of the zygote, produces a basal cell that transports and an apical cell that responds to the signalling molecule auxin. This apical-basal auxin activity gradient triggers the specification of apical embryo structures and is actively maintained by a novel component of auxin efflux, PIN7, which is located apically in the basal cell. Later, the developmentally regulated reversal of PIN7 and onset of PIN1 polar localization reorganize the auxin gradient for specification of the basal root pole. An analysis of pin quadruple mutants identifies PIN-dependent transport as an essential part of the mechanism for embryo axis formation. Our results indicate how the establishment of cell polarity, polar auxin efflux and local auxin response result in apical-basal axis formation of the embryo, and thus determine the axiality of the adult plant.\n"}],"type":"journal_article","volume":426,"date_created":"2018-12-11T12:00:45Z","date_updated":"2021-01-12T07:40:19Z","author":[{"full_name":"Jirí Friml","first_name":"Jirí","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596"},{"first_name":"Anne","last_name":"Vieten","full_name":"Vieten, Anne"},{"full_name":"Sauer, Michael","last_name":"Sauer","first_name":"Michael"},{"full_name":"Weijers, Dolf","first_name":"Dolf","last_name":"Weijers"},{"first_name":"Heinz","last_name":"Schwarz","full_name":"Schwarz, Heinz"},{"full_name":"Hamann, Thorsten","last_name":"Hamann","first_name":"Thorsten"},{"full_name":"Offringa, Remko","first_name":"Remko","last_name":"Offringa"},{"full_name":"Jürgens, Gerd","first_name":"Gerd","last_name":"Jürgens"}],"publisher":"Nature Publishing Group","intvolume":" 426","title":"Efflux dependent auxin gradients establish the apical basal axis of Arabidopsis","status":"public","publication_status":"published","_id":"2995","year":"2003"},{"abstract":[{"lang":"eng","text":"The regular arrangement of leaves around a plant's stem, called phyllotaxis, has for centuries attracted the attention of philosophers, mathematicians and natural scientists; however, to date, studies of phyllotaxis have been largely theoretical. Leaves and flowers are formed from the shoot apical meristem, triggered by the plant hormone auxin. Auxin is transported through plant tissues by specific cellular influx and efflux carrier proteins. Here we show that proteins involved in auxin transport regulate phyllotaxis. Our data indicate that auxin is transported upwards into the meristem through the epidermis and the outermost meristem cell layer. Existing leaf primordia act as sinks, redistributing auxin and creating its heterogeneous distribution in the meristem. Auxin accumulation occurs only at certain minimal distances from existing primordia, defining the position of future primordia. This model for phyllotaxis accounts for its reiterative nature, as well as its regularity and stability."}],"publist_id":"3707","issue":"6964","extern":1,"type":"journal_article","author":[{"first_name":"Didier","last_name":"Reinhardt","full_name":"Reinhardt, Didier"},{"first_name":"Eva","last_name":"Pesce","full_name":"Pesce, Eva-Rachele"},{"last_name":"Stieger","first_name":"Pia","full_name":"Stieger, Pia"},{"full_name":"Mandel, Therese","last_name":"Mandel","first_name":"Therese"},{"first_name":"Kurt","last_name":"Baltensperger","full_name":"Baltensperger, Kurt"},{"full_name":"Bennett, Malcolm","first_name":"Malcolm","last_name":"Bennett"},{"full_name":"Traas, Jan","first_name":"Jan","last_name":"Traas"},{"full_name":"Jirí Friml","first_name":"Jirí","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596"},{"last_name":"Kuhlemeier","first_name":"Cris","full_name":"Kuhlemeier, Cris"}],"date_updated":"2021-01-12T07:40:18Z","date_created":"2018-12-11T12:00:45Z","volume":426,"_id":"2994","year":"2003","title":"Regulation of phyllotaxis by polar auxin transport","status":"public","publication_status":"published","publisher":"Nature Publishing Group","intvolume":" 426","month":"11","day":"20","doi":"10.1038/nature02081","date_published":"2003-11-20T00:00:00Z","publication":"Nature","citation":{"chicago":"Reinhardt, Didier, Eva Pesce, Pia Stieger, Therese Mandel, Kurt Baltensperger, Malcolm Bennett, Jan Traas, Jiří Friml, and Cris Kuhlemeier. “Regulation of Phyllotaxis by Polar Auxin Transport.” Nature. Nature Publishing Group, 2003. https://doi.org/10.1038/nature02081.","short":"D. Reinhardt, E. Pesce, P. Stieger, T. Mandel, K. Baltensperger, M. Bennett, J. Traas, J. Friml, C. Kuhlemeier, Nature 426 (2003) 255–260.","mla":"Reinhardt, Didier, et al. “Regulation of Phyllotaxis by Polar Auxin Transport.” Nature, vol. 426, no. 6964, Nature Publishing Group, 2003, pp. 255–60, doi:10.1038/nature02081.","apa":"Reinhardt, D., Pesce, E., Stieger, P., Mandel, T., Baltensperger, K., Bennett, M., … Kuhlemeier, C. (2003). Regulation of phyllotaxis by polar auxin transport. Nature. Nature Publishing Group. https://doi.org/10.1038/nature02081","ieee":"D. Reinhardt et al., “Regulation of phyllotaxis by polar auxin transport,” Nature, vol. 426, no. 6964. Nature Publishing Group, pp. 255–260, 2003.","ista":"Reinhardt D, Pesce E, Stieger P, Mandel T, Baltensperger K, Bennett M, Traas J, Friml J, Kuhlemeier C. 2003. Regulation of phyllotaxis by polar auxin transport. Nature. 426(6964), 255–260.","ama":"Reinhardt D, Pesce E, Stieger P, et al. Regulation of phyllotaxis by polar auxin transport. Nature. 2003;426(6964):255-260. doi:10.1038/nature02081"},"quality_controlled":0,"page":"255 - 260"},{"doi":"10.1046/j.1365-313X.2003.01705.x","date_published":"2003-04-01T00:00:00Z","page":"115 - 124","quality_controlled":0,"citation":{"chicago":"Friml, Jiří, Eva Benková, Ulrike Mayer, Klaus Palme, and Gerhard Muster. “Automated Whole Mount Localisation Techniques for Plant Seedlings.” Plant Journal. Wiley-Blackwell, 2003. https://doi.org/10.1046/j.1365-313X.2003.01705.x.","short":"J. Friml, E. Benková, U. Mayer, K. Palme, G. Muster, Plant Journal 34 (2003) 115–124.","mla":"Friml, Jiří, et al. “Automated Whole Mount Localisation Techniques for Plant Seedlings.” Plant Journal, vol. 34, no. 1, Wiley-Blackwell, 2003, pp. 115–24, doi:10.1046/j.1365-313X.2003.01705.x.","apa":"Friml, J., Benková, E., Mayer, U., Palme, K., & Muster, G. (2003). Automated whole mount localisation techniques for plant seedlings. Plant Journal. Wiley-Blackwell. https://doi.org/10.1046/j.1365-313X.2003.01705.x","ieee":"J. Friml, E. Benková, U. Mayer, K. Palme, and G. Muster, “Automated whole mount localisation techniques for plant seedlings,” Plant Journal, vol. 34, no. 1. Wiley-Blackwell, pp. 115–124, 2003.","ista":"Friml J, Benková E, Mayer U, Palme K, Muster G. 2003. Automated whole mount localisation techniques for plant seedlings. Plant Journal. 34(1), 115–124.","ama":"Friml J, Benková E, Mayer U, Palme K, Muster G. Automated whole mount localisation techniques for plant seedlings. Plant Journal. 2003;34(1):115-124. doi:10.1046/j.1365-313X.2003.01705.x"},"publication":"Plant Journal","month":"04","day":"01","volume":34,"date_updated":"2021-01-12T07:40:18Z","date_created":"2018-12-11T12:00:44Z","author":[{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596","first_name":"Jirí","last_name":"Friml","full_name":"Jirí Friml"},{"first_name":"Eva","last_name":"Benková","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8510-9739","full_name":"Eva Benková"},{"first_name":"Ulrike","last_name":"Mayer","full_name":"Mayer, Ulrike"},{"full_name":"Palme, Klaus","first_name":"Klaus","last_name":"Palme"},{"full_name":"Muster, Gerhard","last_name":"Muster","first_name":"Gerhard"}],"publisher":"Wiley-Blackwell","intvolume":" 34","status":"public","title":"Automated whole mount localisation techniques for plant seedlings","publication_status":"published","_id":"2993","year":"2003","extern":1,"issue":"1","publist_id":"3709","abstract":[{"lang":"eng","text":"Plant biology is currently experiencing a growing demand for easy and reliable mRNA and protein localisation techniques. Here, we present novel whole mount in situ hybridisation and immunolocalisation protocols, suitable to localise mRNAs and proteins in Arabidopsis seedlings. We demonstrate that these methods can be used in different organs of Arabidopsis seedlings as well as in other plant species. In order to achieve better reproducibility and higher throughput, we modified these protocols for automation to be performed by a liquid handling robot. In addition, we show that other procedures such as reporter enzyme assays and tissue clearing can be similarly automated. We present examples of application of our protocols including mRNA localisation and proteins and epitope tag (co)localisations which demonstrate that these methods provide reliable and versatile tools for expression, localisation and anatomical studies in plants."}],"type":"journal_article"},{"type":"journal_article","extern":1,"abstract":[{"lang":"eng","text":"Biosynthesis of most peptide hormones and neuropeptides requires proteolytic excision of the active peptide from inactive proprotein precursors, an activity carried out by subtilisin-like proprotein convertases (SPCs) in constitutive or regulated secretory pathways. The Drosophila amontillado (amon) gene encodes a homolog of the mammalian PC2 protein, an SPC that functions in the regulated secretory pathway in neuroendocrine tissues. We have identified amon mutants by isolating ethylmethanesulfonate (EMS)-induced lethal and visible mutations that define two complementation groups in the amon interval at 97D1 of the third chromosome. DNA sequencing identified the amon complementation group and the DNA sequence change for each of the nine amon alleles isolated. amon mutants display partial embryonic lethality, are defective in larval growth, and arrest during the first to second instar larval molt. Mutant larvae can be rescued by heat-shock-induced expression of the amon protein. Rescued larvae arrest at the subsequent larval molt, suggesting that amon is also required for the second to third instar larval molt. Our data indicate that the amon proprotein convertase is required during embryogenesis and larval development in Drosophila and support the hypothesis that AMON acts to proteolytically process peptide hormones that regulate hatching, larval growth, and larval ecdysis."}],"issue":"1","publist_id":"3545","status":"public","title":"Amontillado, the Drosophila homolog of the prohormone processing protease PC2, is required during embryogenesis and early larval development","publication_status":"published","publisher":"Genetics Society of America","intvolume":" 163","year":"2003","_id":"3151","date_created":"2018-12-11T12:01:41Z","date_updated":"2021-01-12T07:41:25Z","volume":163,"author":[{"last_name":"Rayburn","first_name":"Lowell","full_name":"Rayburn, Lowell Y"},{"full_name":"Gooding, Holly C","first_name":"Holly","last_name":"Gooding"},{"first_name":"Semil","last_name":"Choksi","full_name":"Choksi, Semil P"},{"full_name":"Maloney, Dhea","last_name":"Maloney","first_name":"Dhea"},{"last_name":"Kidd","first_name":"Ambrose","full_name":"Kidd, Ambrose R"},{"full_name":"Daria Siekhaus","last_name":"Siekhaus","first_name":"Daria E","orcid":"0000-0001-8323-8353","id":"3D224B9E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Bender, Michael","first_name":"Michael","last_name":"Bender"}],"day":"01","month":"01","quality_controlled":0,"page":"227 - 237","publication":"Genetics","citation":{"ama":"Rayburn L, Gooding H, Choksi S, et al. Amontillado, the Drosophila homolog of the prohormone processing protease PC2, is required during embryogenesis and early larval development. Genetics. 2003;163(1):227-237.","ieee":"L. Rayburn et al., “Amontillado, the Drosophila homolog of the prohormone processing protease PC2, is required during embryogenesis and early larval development,” Genetics, vol. 163, no. 1. Genetics Society of America, pp. 227–237, 2003.","apa":"Rayburn, L., Gooding, H., Choksi, S., Maloney, D., Kidd, A., Siekhaus, D. E., & Bender, M. (2003). Amontillado, the Drosophila homolog of the prohormone processing protease PC2, is required during embryogenesis and early larval development. Genetics. Genetics Society of America.","ista":"Rayburn L, Gooding H, Choksi S, Maloney D, Kidd A, Siekhaus DE, Bender M. 2003. Amontillado, the Drosophila homolog of the prohormone processing protease PC2, is required during embryogenesis and early larval development. Genetics. 163(1), 227–237.","short":"L. Rayburn, H. Gooding, S. Choksi, D. Maloney, A. Kidd, D.E. Siekhaus, M. Bender, Genetics 163 (2003) 227–237.","mla":"Rayburn, Lowell, et al. “Amontillado, the Drosophila Homolog of the Prohormone Processing Protease PC2, Is Required during Embryogenesis and Early Larval Development.” Genetics, vol. 163, no. 1, Genetics Society of America, 2003, pp. 227–37.","chicago":"Rayburn, Lowell, Holly Gooding, Semil Choksi, Dhea Maloney, Ambrose Kidd, Daria E Siekhaus, and Michael Bender. “Amontillado, the Drosophila Homolog of the Prohormone Processing Protease PC2, Is Required during Embryogenesis and Early Larval Development.” Genetics. Genetics Society of America, 2003."},"date_published":"2003-01-01T00:00:00Z"},{"type":"journal_article","abstract":[{"text":"Tripartite G-protein-coupled receptors (GPCRs) represent one of the largest groups of signal transducers, transmitting signals from hormones, neuropeptides, odorants, food and light. Ligand-bound receptors catalyse GDP/GTP exchange on the G-protein α-subunit (Gα), leading to α-GTP separation from the βγ subunits and pathway activation. Activating mutations in the receptors or G proteins underlie many human diseases, including some cancers, dwarfism and premature puberty. Regulators of G-protein signalling (RGS proteins) are known to modulate the level and duration of ligand-induced signalling by accelerating the intrinsic GTPase activity of the Gα subunit, and thus reformation of the inactive GDP-bound Gα. Here we find that even in the absence of receptor, mutation of the RGS family member Sst2 (refs 6-9) permits spontaneous activation of the G-protein-coupled mating pathway in Saccharomyces cerevisiae at levels normally seen only in the presence of ligand. Our work demonstrates the occurence of spontaneous tripartite G-protein signalling in vivo and identifies a requirement for RGS proteins in preventing such receptor-independent activation.","lang":"eng"}],"publist_id":"3544","issue":"3","extern":1,"year":"2003","_id":"3150","title":"Spontaneous receptor-independent heterotrimeric G-protein signalling in an RGS mutant","status":"public","publication_status":"published","publisher":"Nature Publishing Group","intvolume":" 5","author":[{"full_name":"Daria Siekhaus","last_name":"Siekhaus","first_name":"Daria E","orcid":"0000-0001-8323-8353","id":"3D224B9E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Drubin","first_name":"David","full_name":"Drubin, David G"}],"date_created":"2018-12-11T12:01:41Z","date_updated":"2021-01-12T07:41:24Z","volume":5,"day":"01","month":"03","publication":"Nature Cell Biology","citation":{"ama":"Siekhaus DE, Drubin D. Spontaneous receptor-independent heterotrimeric G-protein signalling in an RGS mutant. Nature Cell Biology. 2003;5(3):231-235. doi:10.1038/ncb941","apa":"Siekhaus, D. E., & Drubin, D. (2003). Spontaneous receptor-independent heterotrimeric G-protein signalling in an RGS mutant. Nature Cell Biology. Nature Publishing Group. https://doi.org/10.1038/ncb941","ieee":"D. E. Siekhaus and D. Drubin, “Spontaneous receptor-independent heterotrimeric G-protein signalling in an RGS mutant,” Nature Cell Biology, vol. 5, no. 3. Nature Publishing Group, pp. 231–235, 2003.","ista":"Siekhaus DE, Drubin D. 2003. Spontaneous receptor-independent heterotrimeric G-protein signalling in an RGS mutant. Nature Cell Biology. 5(3), 231–235.","short":"D.E. Siekhaus, D. Drubin, Nature Cell Biology 5 (2003) 231–235.","mla":"Siekhaus, Daria E., and David Drubin. “Spontaneous Receptor-Independent Heterotrimeric G-Protein Signalling in an RGS Mutant.” Nature Cell Biology, vol. 5, no. 3, Nature Publishing Group, 2003, pp. 231–35, doi:10.1038/ncb941.","chicago":"Siekhaus, Daria E, and David Drubin. “Spontaneous Receptor-Independent Heterotrimeric G-Protein Signalling in an RGS Mutant.” Nature Cell Biology. Nature Publishing Group, 2003. https://doi.org/10.1038/ncb941."},"quality_controlled":0,"page":"231 - 235","doi":"10.1038/ncb941","date_published":"2003-03-01T00:00:00Z"},{"day":"01","month":"12","date_published":"2003-12-01T00:00:00Z","doi":"10.1016/S0022-0000(03)00078-3","citation":{"chicago":"Pietrzak, Krzysztof Z. “On the Parameterized Complexity of the Fixed Alphabet Shortest Common Supersequence and Longest Common Subsequence Problems.” Journal of Computer and System Sciences. Elsevier, 2003. https://doi.org/10.1016/S0022-0000(03)00078-3.","short":"K.Z. Pietrzak, Journal of Computer and System Sciences 67 (2003) 757–771.","mla":"Pietrzak, Krzysztof Z. “On the Parameterized Complexity of the Fixed Alphabet Shortest Common Supersequence and Longest Common Subsequence Problems.” Journal of Computer and System Sciences, vol. 67, no. 4, Elsevier, 2003, pp. 757–71, doi:10.1016/S0022-0000(03)00078-3.","apa":"Pietrzak, K. Z. (2003). On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems. Journal of Computer and System Sciences. Elsevier. https://doi.org/10.1016/S0022-0000(03)00078-3","ieee":"K. Z. Pietrzak, “On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems,” Journal of Computer and System Sciences, vol. 67, no. 4. Elsevier, pp. 757–771, 2003.","ista":"Pietrzak KZ. 2003. On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems. Journal of Computer and System Sciences. 67(4), 757–771.","ama":"Pietrzak KZ. On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems. Journal of Computer and System Sciences. 2003;67(4):757-771. doi:10.1016/S0022-0000(03)00078-3"},"publication":"Journal of Computer and System Sciences","page":"757 - 771","quality_controlled":0,"publist_id":"3472","issue":"4","abstract":[{"lang":"eng","text":"We show that the fixed alphabet shortest common supersequence (SCS) and the fixed alphabet longest common subsequence (LCS) problems parameterized in the number of strings are W[1]-hard. Unless W[1]=FPT, this rules out the existence of algorithms with time complexity of O(f(k)nα) for those problems. Here n is the size of the problem instance, α is constant, k is the number of strings and f is any function of k. The fixed alphabet version of the LCS problem is of particular interest considering the importance of sequence comparison (e.g. multiple sequence alignment) in the fixed length alphabet world of DNA and protein sequences."}],"extern":1,"type":"journal_article","author":[{"orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","first_name":"Krzysztof Z","full_name":"Krzysztof Pietrzak"}],"volume":67,"date_updated":"2021-01-12T07:41:49Z","date_created":"2018-12-11T12:02:01Z","year":"2003","_id":"3209","intvolume":" 67","publisher":"Elsevier","title":"On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems","publication_status":"published","status":"public"},{"date_updated":"2021-01-12T07:41:49Z","date_created":"2018-12-11T12:02:02Z","volume":2656,"author":[{"full_name":"Maurer, Ueli M","last_name":"Maurer","first_name":"Ueli"},{"full_name":"Krzysztof Pietrzak","last_name":"Pietrzak","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"}],"status":"public","publication_status":"published","title":"The security of many round Luby Rackoff pseudo random permutations","publisher":"Springer","intvolume":" 2656","year":"2003","_id":"3210","extern":1,"abstract":[{"lang":"eng","text":"Luby and Rackoff showed how to construct a (super-)pseudo-random permutation {0,1}2n→ {0,1}2n from some number r of pseudo-random functions {0,1}n → {0,1}n. Their construction, motivated by DES, consists of a cascade of r Feistel permutations. A Feistel permutation 1for a pseudo-random function f is defined as (L, R) → (R,L ⊕ f (R)), where L and R are the left and right part of the input and ⊕ denotes bitwise XOR or, in this paper, any other group operation on {0,1}n. The only non-trivial step of the security proof consists of proving that the cascade of r Feistel permutations with independent uniform random functions {0,1}n → {0,1}n, denoted Ψ2nr is indistinguishable from a uniform random permutation {0,1}2n → {0,1}2n by any computationally unbounded adaptive distinguisher making at most O(2cn) combined chosen plaintext/ciphertext queries for any c < α, where a is a security parameter. Luby and Rackoff proved α = 1/2 for r = 4. A natural problem, proposed by Pieprzyk is to improve on α for larger r. The best known result, α = 3/4 for r = 6, is due to Patarin. In this paper we prove a = 1 -O(1/r), i.e., the trivial upper bound α = 1 can be approached. The proof uses some new techniques that can be of independent interest. "}],"publist_id":"3473","alternative_title":["LNCS"],"type":"conference","conference":{"name":"EUROCRYPT: Theory and Applications of Cryptographic Techniques"},"date_published":"2003-06-04T00:00:00Z","doi":"10.1007/3-540-39200-9_34","quality_controlled":0,"page":"544 - 561","citation":{"chicago":"Maurer, Ueli, and Krzysztof Z Pietrzak. “The Security of Many Round Luby Rackoff Pseudo Random Permutations,” 2656:544–61. Springer, 2003. https://doi.org/10.1007/3-540-39200-9_34.","mla":"Maurer, Ueli, and Krzysztof Z. Pietrzak. The Security of Many Round Luby Rackoff Pseudo Random Permutations. Vol. 2656, Springer, 2003, pp. 544–61, doi:10.1007/3-540-39200-9_34.","short":"U. Maurer, K.Z. Pietrzak, in:, Springer, 2003, pp. 544–561.","ista":"Maurer U, Pietrzak KZ. 2003. The security of many round Luby Rackoff pseudo random permutations. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 2656, 544–561.","apa":"Maurer, U., & Pietrzak, K. Z. (2003). The security of many round Luby Rackoff pseudo random permutations (Vol. 2656, pp. 544–561). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Springer. https://doi.org/10.1007/3-540-39200-9_34","ieee":"U. Maurer and K. Z. Pietrzak, “The security of many round Luby Rackoff pseudo random permutations,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, 2003, vol. 2656, pp. 544–561.","ama":"Maurer U, Pietrzak KZ. The security of many round Luby Rackoff pseudo random permutations. In: Vol 2656. Springer; 2003:544-561. doi:10.1007/3-540-39200-9_34"},"day":"04","month":"06"},{"author":[{"first_name":"Mark Tobias","last_name":"Bollenbach","id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4398-476X","full_name":"Bollenbach, Mark Tobias"},{"full_name":"Strother, T.","first_name":"T.","last_name":"Strother"},{"first_name":"Wolfgang","last_name":"Bauer","full_name":"Bauer, Wolfgang"}],"date_updated":"2021-01-12T07:43:23Z","date_created":"2018-12-11T12:03:16Z","oa_version":"None","volume":166,"_id":"3425","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2003","publication_status":"published","title":"3D supernova collapse calculations","status":"public","publisher":"Springer","intvolume":" 166","publist_id":"2976","extern":"1","type":"conference","alternative_title":["Nato Science Series II"],"conference":{"name":"NATO ASI on Structure and Dynamics of Elementary Matter"},"doi":"10.1007/978-1-4020-2705-5_21","date_published":"2003-01-01T00:00:00Z","language":[{"iso":"eng"}],"citation":{"chicago":"Bollenbach, Mark Tobias, T. Strother, and Wolfgang Bauer. “3D Supernova Collapse Calculations,” 166:277–88. Springer, 2003. https://doi.org/10.1007/978-1-4020-2705-5_21.","mla":"Bollenbach, Mark Tobias, et al. 3D Supernova Collapse Calculations. Vol. 166, Springer, 2003, pp. 277–88, doi:10.1007/978-1-4020-2705-5_21.","short":"M.T. Bollenbach, T. Strother, W. Bauer, in:, Springer, 2003, pp. 277–288.","ista":"Bollenbach MT, Strother T, Bauer W. 2003. 3D supernova collapse calculations. NATO ASI on Structure and Dynamics of Elementary Matter, Nato Science Series II, vol. 166, 277–288.","apa":"Bollenbach, M. T., Strother, T., & Bauer, W. (2003). 3D supernova collapse calculations (Vol. 166, pp. 277–288). Presented at the NATO ASI on Structure and Dynamics of Elementary Matter, Springer. https://doi.org/10.1007/978-1-4020-2705-5_21","ieee":"M. T. Bollenbach, T. Strother, and W. Bauer, “3D supernova collapse calculations,” presented at the NATO ASI on Structure and Dynamics of Elementary Matter, 2003, vol. 166, pp. 277–288.","ama":"Bollenbach MT, Strother T, Bauer W. 3D supernova collapse calculations. In: Vol 166. Springer; 2003:277-288. doi:10.1007/978-1-4020-2705-5_21"},"page":"277 - 288","day":"01","month":"01","article_processing_charge":"No"},{"date_published":"2003-01-01T00:00:00Z","publication":"Lehrbuch Vorklinik","citation":{"ama":"Jonas PM, Unsicker K. Molekulare und zelluläre Grundlagen des Nervensystems. In: Schmidt R, ed. Lehrbuch Vorklinik. Vol B. Deutscher Ärzte Verlag; 2003:3-26.","ieee":"P. M. Jonas and K. Unsicker, “Molekulare und zelluläre Grundlagen des Nervensystems.,” in Lehrbuch Vorklinik, vol. B, R. Schmidt, Ed. Deutscher Ärzte Verlag, 2003, pp. 3–26.","apa":"Jonas, P. M., & Unsicker, K. (2003). Molekulare und zelluläre Grundlagen des Nervensystems. In R. Schmidt (Ed.), Lehrbuch Vorklinik (Vol. B, pp. 3–26). Deutscher Ärzte Verlag.","ista":"Jonas PM, Unsicker K. 2003.Molekulare und zelluläre Grundlagen des Nervensystems. In: Lehrbuch Vorklinik. vol. B, 3–26.","short":"P.M. Jonas, K. Unsicker, in:, R. Schmidt (Ed.), Lehrbuch Vorklinik, Deutscher Ärzte Verlag, 2003, pp. 3–26.","mla":"Jonas, Peter M., and Klaus Unsicker. “Molekulare Und Zelluläre Grundlagen Des Nervensystems.” Lehrbuch Vorklinik, edited by R. Schmidt, vol. B, Deutscher Ärzte Verlag, 2003, pp. 3–26.","chicago":"Jonas, Peter M, and Klaus Unsicker. “Molekulare Und Zelluläre Grundlagen Des Nervensystems.” In Lehrbuch Vorklinik, edited by R. Schmidt, B:3–26. Deutscher Ärzte Verlag, 2003."},"quality_controlled":0,"page":"3 - 26","month":"01","day":"01","author":[{"full_name":"Peter Jonas","first_name":"Peter M","last_name":"Jonas","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5001-4804"},{"full_name":"Unsicker, Klaus","first_name":"Klaus","last_name":"Unsicker"}],"date_updated":"2021-01-12T07:43:35Z","date_created":"2018-12-11T12:03:26Z","volume":"B","year":"2003","_id":"3458","status":"public","publication_status":"published","title":"Molekulare und zelluläre Grundlagen des Nervensystems.","editor":[{"last_name":"Schmidt","first_name":"R.","full_name":"Schmidt, R. F."}],"publisher":"Deutscher Ärzte Verlag","publist_id":"2929","extern":1,"type":"book_chapter"},{"doi":"10.1016/S0306-4522(02)00669-3","date_published":"2003-01-15T00:00:00Z","page":"201 - 211","quality_controlled":0,"citation":{"mla":"Buzsáki, György, et al. “Hippocampal Network Patterns of Activity in the Mouse.” Neuroscience, vol. 116, no. 1, Elsevier, 2003, pp. 201–11, doi:10.1016/S0306-4522(02)00669-3.","short":"G. Buzsáki, D. Buhl, K. Harris, J.L. Csicsvari, B. Czéh, A. Morozov, Neuroscience 116 (2003) 201–211.","chicago":"Buzsáki, György, Derek Buhl, Kenneth Harris, Jozsef L Csicsvari, Boldizsár Czéh, and Alexei Morozov. “Hippocampal Network Patterns of Activity in the Mouse.” Neuroscience. Elsevier, 2003. https://doi.org/10.1016/S0306-4522(02)00669-3.","ama":"Buzsáki G, Buhl D, Harris K, Csicsvari JL, Czéh B, Morozov A. Hippocampal network patterns of activity in the mouse. Neuroscience. 2003;116(1):201-211. doi:10.1016/S0306-4522(02)00669-3","ista":"Buzsáki G, Buhl D, Harris K, Csicsvari JL, Czéh B, Morozov A. 2003. Hippocampal network patterns of activity in the mouse. Neuroscience. 116(1), 201–211.","ieee":"G. Buzsáki, D. Buhl, K. Harris, J. L. Csicsvari, B. Czéh, and A. Morozov, “Hippocampal network patterns of activity in the mouse,” Neuroscience, vol. 116, no. 1. Elsevier, pp. 201–211, 2003.","apa":"Buzsáki, G., Buhl, D., Harris, K., Csicsvari, J. L., Czéh, B., & Morozov, A. (2003). Hippocampal network patterns of activity in the mouse. Neuroscience. Elsevier. https://doi.org/10.1016/S0306-4522(02)00669-3"},"publication":"Neuroscience","day":"15","month":"01","volume":116,"date_updated":"2021-01-12T07:44:09Z","date_created":"2018-12-11T12:03:50Z","author":[{"full_name":"Buzsáki, György","last_name":"Buzsáki","first_name":"György"},{"first_name":"Derek","last_name":"Buhl","full_name":"Buhl, Derek L"},{"full_name":"Harris, Kenneth D","first_name":"Kenneth","last_name":"Harris"},{"full_name":"Jozsef Csicsvari","first_name":"Jozsef L","last_name":"Csicsvari","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5193-4036"},{"first_name":"Boldizsár","last_name":"Czéh","full_name":"Czéh, Boldizsár"},{"last_name":"Morozov","first_name":"Alexei","full_name":"Morozov, Alexei"}],"publisher":"Elsevier","intvolume":" 116","publication_status":"published","title":"Hippocampal network patterns of activity in the mouse","status":"public","_id":"3536","year":"2003","extern":1,"issue":"1","publist_id":"2849","abstract":[{"text":"Genetic engineering of the mouse brain allows investigators to address novel hypotheses in vivo. Because of the paucity of information on the network patterns of the mouse hippocampus, we investigated the electrical patterns in the behaving animal using multisite silicon probes and wire tetrodes. Theta (6-9 Hz) and gamma (40-100 Hz) oscillations were present during exploration and rapid eye movement sleep. Gamma power and theta power were comodulated and gamma power varied as a function of the theta cycle. Pyramidal cells and putative interneurons were phase-locked to theta oscillations. During immobility, consummatory behaviors and slow-wave sleep, sharp waves were present in cornu ammonis region CA1 of the hippocampus stratum radiatum associated with 140-200-Hz “ripples” in the pyramidal cell layer and population burst of CA1 neurons. In the hilus, large-amplitude “dentate spikes” occurred in association with increased discharge of hilar neurons. The amplitude of field patterns was larger in the mouse than in the rat, likely reflecting the higher neuron density in a smaller brain. We suggest that the main hippocampal network patterns are mediated by similar pathways and mechanisms in mouse and rat. ","lang":"eng"}],"type":"journal_article"},{"month":"06","day":"01","citation":{"chicago":"Edelsbrunner, Herbert, John Harer, Vijay Natarajan, and Valerio Pascucci. “Morse-Smale Complexes for Piecewise Linear 3-Manifolds,” 361–70. ACM, 2003. https://doi.org/10.1145/777792.777846.","short":"H. Edelsbrunner, J. Harer, V. Natarajan, V. Pascucci, in:, ACM, 2003, pp. 361–370.","mla":"Edelsbrunner, Herbert, et al. Morse-Smale Complexes for Piecewise Linear 3-Manifolds. ACM, 2003, pp. 361–70, doi:10.1145/777792.777846.","apa":"Edelsbrunner, H., Harer, J., Natarajan, V., & Pascucci, V. (2003). Morse-Smale complexes for piecewise linear 3-manifolds (pp. 361–370). Presented at the SCG: Symposium on Computational Geometry, ACM. https://doi.org/10.1145/777792.777846","ieee":"H. Edelsbrunner, J. Harer, V. Natarajan, and V. Pascucci, “Morse-Smale complexes for piecewise linear 3-manifolds,” presented at the SCG: Symposium on Computational Geometry, 2003, pp. 361–370.","ista":"Edelsbrunner H, Harer J, Natarajan V, Pascucci V. 2003. Morse-Smale complexes for piecewise linear 3-manifolds. SCG: Symposium on Computational Geometry, 361–370.","ama":"Edelsbrunner H, Harer J, Natarajan V, Pascucci V. Morse-Smale complexes for piecewise linear 3-manifolds. In: ACM; 2003:361-370. doi:10.1145/777792.777846"},"main_file_link":[{"url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.9592","open_access":"0"}],"quality_controlled":0,"page":"361 - 370","conference":{"name":"SCG: Symposium on Computational Geometry"},"date_published":"2003-06-01T00:00:00Z","doi":"10.1145/777792.777846","type":"conference","abstract":[{"text":"We define the Morse-Smale complex of a Morse function over a 3-manifold as the overlay of the descending and as- cending manifolds of all critical points. In the generic case, its 3-dimensional cells are shaped like crystals and are sepa- rated by quadrangular faces. In this paper, we give a combi- natorial algorithm for constructing such complexes for piece- wise linear data.","lang":"eng"}],"publist_id":"2829","extern":1,"year":"2003","_id":"3556","publication_status":"published","status":"public","title":"Morse-Smale complexes for piecewise linear 3-manifolds","publisher":"ACM","author":[{"full_name":"Herbert Edelsbrunner","first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833"},{"last_name":"Harer","first_name":"John","full_name":"Harer, John"},{"full_name":"Natarajan, Vijay","last_name":"Natarajan","first_name":"Vijay"},{"first_name":"Valerio","last_name":"Pascucci","full_name":"Pascucci, Valerio"}],"date_created":"2018-12-11T12:03:57Z","date_updated":"2021-01-12T07:44:17Z"},{"publisher":"Springer","publication_status":"published","status":"public","title":"Surface reconstruction by wrapping finite sets in space","_id":"3573","year":"2003","date_updated":"2021-01-12T07:44:24Z","date_created":"2018-12-11T12:04:02Z","author":[{"first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","full_name":"Herbert Edelsbrunner"}],"type":"book_chapter","extern":1,"publist_id":"2812","abstract":[{"text":"Given a finite point set in R, the surface reconstruction problem asks for a surface that passes through many but not necessarily all points. We describe an unambigu- ous definition of such a surface in geometric and topological terms, and sketch a fast algorithm for constructing it. Our solution overcomes past limitations to special point distributions and heuristic design decisions.","lang":"eng"}],"page":"379 - 404","quality_controlled":0,"main_file_link":[{"open_access":"0","url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.129.3633"}],"citation":{"mla":"Edelsbrunner, Herbert. “Surface Reconstruction by Wrapping Finite Sets in Space.” Discrete & Computational Geometry, Springer, 2003, pp. 379–404, doi:10.1007/978-3-642-55566-4_17.","short":"H. Edelsbrunner, in:, Discrete & Computational Geometry, Springer, 2003, pp. 379–404.","chicago":"Edelsbrunner, Herbert. “Surface Reconstruction by Wrapping Finite Sets in Space.” In Discrete & Computational Geometry, 379–404. Springer, 2003. https://doi.org/10.1007/978-3-642-55566-4_17.","ama":"Edelsbrunner H. Surface reconstruction by wrapping finite sets in space. In: Discrete & Computational Geometry. Springer; 2003:379-404. doi:10.1007/978-3-642-55566-4_17","ista":"Edelsbrunner H. 2003.Surface reconstruction by wrapping finite sets in space. In: Discrete & Computational Geometry. , 379–404.","apa":"Edelsbrunner, H. (2003). Surface reconstruction by wrapping finite sets in space. In Discrete & Computational Geometry (pp. 379–404). Springer. https://doi.org/10.1007/978-3-642-55566-4_17","ieee":"H. Edelsbrunner, “Surface reconstruction by wrapping finite sets in space,” in Discrete & Computational Geometry, Springer, 2003, pp. 379–404."},"publication":"Discrete & Computational Geometry","date_published":"2003-06-23T00:00:00Z","doi":"10.1007/978-3-642-55566-4_17","month":"06","day":"23"},{"page":"19 - 37","quality_controlled":"1","citation":{"chicago":"Edelsbrunner, Herbert, and Afra Zomorodian. “Computing Linking Numbers of a Filtration.” Homology, Homotopy and Applications. International Press, 2003.","mla":"Edelsbrunner, Herbert, and Afra Zomorodian. “Computing Linking Numbers of a Filtration.” Homology, Homotopy and Applications, vol. 5, no. 2, International Press, 2003, pp. 19–37.","short":"H. Edelsbrunner, A. Zomorodian, Homology, Homotopy and Applications 5 (2003) 19–37.","ista":"Edelsbrunner H, Zomorodian A. 2003. Computing linking numbers of a filtration. Homology, Homotopy and Applications. 5(2), 19–37.","apa":"Edelsbrunner, H., & Zomorodian, A. (2003). Computing linking numbers of a filtration. Homology, Homotopy and Applications. International Press.","ieee":"H. Edelsbrunner and A. Zomorodian, “Computing linking numbers of a filtration,” Homology, Homotopy and Applications, vol. 5, no. 2. International Press, pp. 19–37, 2003.","ama":"Edelsbrunner H, Zomorodian A. Computing linking numbers of a filtration. Homology, Homotopy and Applications. 2003;5(2):19-37."},"main_file_link":[{"url":"http://projecteuclid.org/euclid.hha/1088453320"}],"publication":"Homology, Homotopy and Applications","language":[{"iso":"eng"}],"date_published":"2003-04-22T00:00:00Z","day":"22","month":"04","intvolume":" 5","publisher":"International Press","title":"Computing linking numbers of a filtration","publication_status":"published","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"3584","year":"2003","oa_version":"None","volume":5,"date_created":"2018-12-11T12:04:05Z","date_updated":"2021-01-12T07:44:28Z","author":[{"first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert"},{"full_name":"Zomorodian, Afra","last_name":"Zomorodian","first_name":"Afra"}],"type":"journal_article","extern":"1","publist_id":"2801","issue":"2","abstract":[{"text":"We develop fast algorithms for computing the linking number of a simplicial complex within a filtration.We give experimental results in applying our work toward the detection of non-trivial tangling in biomolecules, modeled as alpha complexes.","lang":"eng"}]},{"day":"01","month":"08","publication":"Heredity","citation":{"chicago":"Nürnberger, Beate, Sebastian Hofman, Bqruni Förg Brey, Gabriele Praetzel, Alan Maclean, Jacek Szymura, Catherine Abbott, and Nicholas H Barton. “A Linkage Map for the Hybridising Toads Bombina Bombina and B. Variegata (Anura: Discoglossidae).” Heredity. Nature Publishing Group, 2003. https://doi.org/10.1038/sj.hdy.6800291.","short":"B. Nürnberger, S. Hofman, B. Förg Brey, G. Praetzel, A. Maclean, J. Szymura, C. Abbott, N.H. Barton, Heredity 91 (2003) 136–142.","mla":"Nürnberger, Beate, et al. “A Linkage Map for the Hybridising Toads Bombina Bombina and B. Variegata (Anura: Discoglossidae).” Heredity, vol. 91, no. 2, Nature Publishing Group, 2003, pp. 136–42, doi:10.1038/sj.hdy.6800291.","ieee":"B. Nürnberger et al., “A linkage map for the hybridising toads Bombina bombina and B. variegata (Anura: Discoglossidae),” Heredity, vol. 91, no. 2. Nature Publishing Group, pp. 136–142, 2003.","apa":"Nürnberger, B., Hofman, S., Förg Brey, B., Praetzel, G., Maclean, A., Szymura, J., … Barton, N. H. (2003). A linkage map for the hybridising toads Bombina bombina and B. variegata (Anura: Discoglossidae). Heredity. Nature Publishing Group. https://doi.org/10.1038/sj.hdy.6800291","ista":"Nürnberger B, Hofman S, Förg Brey B, Praetzel G, Maclean A, Szymura J, Abbott C, Barton NH. 2003. A linkage map for the hybridising toads Bombina bombina and B. variegata (Anura: Discoglossidae). Heredity. 91(2), 136–142.","ama":"Nürnberger B, Hofman S, Förg Brey B, et al. A linkage map for the hybridising toads Bombina bombina and B. variegata (Anura: Discoglossidae). Heredity. 2003;91(2):136-142. doi:10.1038/sj.hdy.6800291"},"quality_controlled":0,"page":"136 - 142","date_published":"2003-08-01T00:00:00Z","doi":"10.1038/sj.hdy.6800291","type":"journal_article","abstract":[{"text":"Stable hybrid zones in which ecologically divergent taxa give rise to a range of recombinants are natural laboratories in which the genetic basis of adaptation and reproductive isolation can be unraveled. One such hybrid zone is formed by the fire-bellied toads Bombina bombina and B. variegata (Anura: Discoglossidae). Adaptations to permanent and ephemeral breeding habitats, respectively, have shaped numerous phenotypic differences between the taxa. All of these are, in principle, candidates for a genetic dissection via QTL mapping. We present here a linkage map of 28 codominant and 10 dominant markers in the Bombina genome. In an F2 cross, markers that were mainly microsatellites, SSCPs or allozymes were mapped to 20 linkage groups. Among the 40 isolated CA microsatellites, we noted a preponderance of compound and frequently interleaved CA-TA repeats as well as a striking polarity at the 5′ end of the repeats.","lang":"eng"}],"publist_id":"2763","issue":"2","extern":1,"year":"2003","_id":"3620","title":"A linkage map for the hybridising toads Bombina bombina and B. variegata (Anura: Discoglossidae)","status":"public","publication_status":"published","intvolume":" 91","publisher":"Nature Publishing Group","author":[{"full_name":"Nürnberger, Beate","first_name":"Beate","last_name":"Nürnberger"},{"full_name":"Hofman, Sebastian","last_name":"Hofman","first_name":"Sebastian"},{"full_name":"Förg-Brey, Bqruni","first_name":"Bqruni","last_name":"Förg Brey"},{"last_name":"Praetzel","first_name":"Gabriele","full_name":"Praetzel, Gabriele"},{"last_name":"Maclean","first_name":"Alan","full_name":"Maclean, Alan W"},{"full_name":"Szymura, Jacek M","first_name":"Jacek","last_name":"Szymura"},{"first_name":"Catherine","last_name":"Abbott","full_name":"Abbott, Catherine M"},{"full_name":"Nicholas Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","first_name":"Nicholas H","last_name":"Barton"}],"date_created":"2018-12-11T12:04:17Z","date_updated":"2021-01-12T07:44:43Z","volume":91},{"type":"journal_article","extern":1,"issue":"4","publist_id":"2764","abstract":[{"lang":"eng","text":"What is the chance that some part of a stretch of genome will survive? In a population of constant size, and with no selection, the probability of survival of some part of a stretch of map length y<1 approaches View the MathML source for View the MathML source. Thus, the whole genome is certain to be lost, but the rate of loss is extremely slow. This solution extends to give the whole distribution of surviving block sizes as a function of time. We show that the expected number of blocks at time t is 1+yt and give expressions for the moments of the number of blocks and the total amount of genome that survives for a given time. The solution is based on a branching process and assumes complete interference between crossovers, so that each descendant carries only a single block of ancestral material. We consider cases where most individuals carry multiple blocks, either because there are multiple crossovers in a long genetic map, or because enough time has passed that most individuals in the population are related to each other. For species such as ours, which have a long genetic map, the genome of any individual which leaves descendants (∼80% of the population for a Poisson offspring number with mean two) is likely to persist for an extremely long time, in the form of a few short blocks of genome."}],"publisher":"Academic Press","intvolume":" 64","status":"public","publication_status":"published","title":"The distribution of surviving blocks of an ancestral genome","year":"2003","_id":"3619","volume":64,"date_updated":"2021-01-12T07:44:42Z","date_created":"2018-12-11T12:04:17Z","author":[{"first_name":"Stuart","last_name":"Baird","full_name":"Baird, Stuart J"},{"first_name":"Nicholas H","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","full_name":"Nicholas Barton"},{"last_name":"Etheridge","first_name":"Alison","full_name":"Etheridge, Alison M"}],"day":"01","month":"12","page":"451 - 471","quality_controlled":0,"citation":{"chicago":"Baird, Stuart, Nicholas H Barton, and Alison Etheridge. “The Distribution of Surviving Blocks of an Ancestral Genome.” Theoretical Population Biology. Academic Press, 2003. https://doi.org/10.1016/S0040-5809(03)00098-4.","mla":"Baird, Stuart, et al. “The Distribution of Surviving Blocks of an Ancestral Genome.” Theoretical Population Biology, vol. 64, no. 4, Academic Press, 2003, pp. 451–71, doi:10.1016/S0040-5809(03)00098-4.","short":"S. Baird, N.H. Barton, A. Etheridge, Theoretical Population Biology 64 (2003) 451–471.","ista":"Baird S, Barton NH, Etheridge A. 2003. The distribution of surviving blocks of an ancestral genome. Theoretical Population Biology. 64(4), 451–471.","ieee":"S. Baird, N. H. Barton, and A. Etheridge, “The distribution of surviving blocks of an ancestral genome,” Theoretical Population Biology, vol. 64, no. 4. Academic Press, pp. 451–471, 2003.","apa":"Baird, S., Barton, N. H., & Etheridge, A. (2003). The distribution of surviving blocks of an ancestral genome. Theoretical Population Biology. Academic Press. https://doi.org/10.1016/S0040-5809(03)00098-4","ama":"Baird S, Barton NH, Etheridge A. The distribution of surviving blocks of an ancestral genome. Theoretical Population Biology. 2003;64(4):451-471. doi:10.1016/S0040-5809(03)00098-4"},"publication":"Theoretical Population Biology","doi":"10.1016/S0040-5809(03)00098-4","date_published":"2003-12-01T00:00:00Z"},{"author":[{"first_name":"Timothy","last_name":"Vines","full_name":"Vines, Timothy H"},{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","first_name":"Nicholas H","last_name":"Barton","full_name":"Nicholas Barton"}],"volume":12,"date_updated":"2021-01-12T07:44:42Z","date_created":"2018-12-11T12:04:16Z","year":"2003","_id":"3618","intvolume":" 12","publisher":"Wiley-Blackwell","publication_status":"published","title":"A new approach to detecting mixed families","status":"public","issue":"7","publist_id":"2765","abstract":[{"text":"There are several analyses in evolutionary ecology which assume that a family of offspring has come from only two parents. Here, we present a simple test for detecting when a batch involves two or more subfamilies. It is based on the fact that the mixing of families generates associations amongst unlinked marker loci. We also present simulations illustrating the power of our method for varying numbers of loci, alleles per locus and genotyped individuals.","lang":"eng"}],"extern":1,"type":"journal_article","date_published":"2003-07-01T00:00:00Z","doi":"10.1046/j.1365-294X.2003.01867.x","citation":{"ista":"Vines T, Barton NH. 2003. A new approach to detecting mixed families. Molecular Ecology. 12(7), 1999–2002.","apa":"Vines, T., & Barton, N. H. (2003). A new approach to detecting mixed families. Molecular Ecology. Wiley-Blackwell. https://doi.org/10.1046/j.1365-294X.2003.01867.x","ieee":"T. Vines and N. H. Barton, “A new approach to detecting mixed families,” Molecular Ecology, vol. 12, no. 7. Wiley-Blackwell, pp. 1999–2002, 2003.","ama":"Vines T, Barton NH. A new approach to detecting mixed families. Molecular Ecology. 2003;12(7):1999-2002. doi:10.1046/j.1365-294X.2003.01867.x","chicago":"Vines, Timothy, and Nicholas H Barton. “A New Approach to Detecting Mixed Families.” Molecular Ecology. Wiley-Blackwell, 2003. https://doi.org/10.1046/j.1365-294X.2003.01867.x.","mla":"Vines, Timothy, and Nicholas H. Barton. “A New Approach to Detecting Mixed Families.” Molecular Ecology, vol. 12, no. 7, Wiley-Blackwell, 2003, pp. 1999–2002, doi:10.1046/j.1365-294X.2003.01867.x.","short":"T. Vines, N.H. Barton, Molecular Ecology 12 (2003) 1999–2002."},"publication":"Molecular Ecology","page":"1999 - 2002","quality_controlled":0,"month":"07","day":"01"},{"publisher":"Rockefeller University Press","intvolume":" 161","title":"Modeling network dynamics: the lac operon, a case study","publication_status":"published","status":"public","_id":"3752","year":"2003","volume":161,"date_updated":"2021-01-12T07:51:57Z","date_created":"2018-12-11T12:04:58Z","author":[{"full_name":"Vilar,Jose M","last_name":"Vilar","first_name":"Jose"},{"first_name":"Calin C","last_name":"Guet","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6220-2052","full_name":"Calin Guet"},{"first_name":"Stanislas","last_name":"Leibler","full_name":"Leibler, Stanislas"}],"type":"journal_article","extern":1,"publist_id":"2475","issue":"3","abstract":[{"text":"We use the lac operon in Escherichia coli as a prototype system to illustrate the current state, applicability, and limitations of modeling the dynamics of cellular networks. We integrate three different levels of description (molecular, cellular, and that of cell population) into a single model, which seems to capture many experimental aspects of the system.","lang":"eng"}],"page":"471 - 476","quality_controlled":0,"citation":{"apa":"Vilar, J., Guet, C. C., & Leibler, S. (2003). Modeling network dynamics: the lac operon, a case study. Journal of Cell Biology. Rockefeller University Press. https://doi.org/10.1083/jcb.200301125","ieee":"J. Vilar, C. C. Guet, and S. Leibler, “Modeling network dynamics: the lac operon, a case study,” Journal of Cell Biology, vol. 161, no. 3. Rockefeller University Press, pp. 471–476, 2003.","ista":"Vilar J, Guet CC, Leibler S. 2003. Modeling network dynamics: the lac operon, a case study. Journal of Cell Biology. 161(3), 471–476.","ama":"Vilar J, Guet CC, Leibler S. Modeling network dynamics: the lac operon, a case study. Journal of Cell Biology. 2003;161(3):471-476. doi:10.1083/jcb.200301125","chicago":"Vilar, Jose, Calin C Guet, and Stanislas Leibler. “Modeling Network Dynamics: The Lac Operon, a Case Study.” Journal of Cell Biology. Rockefeller University Press, 2003. https://doi.org/10.1083/jcb.200301125.","short":"J. Vilar, C.C. Guet, S. Leibler, Journal of Cell Biology 161 (2003) 471–476.","mla":"Vilar, Jose, et al. “Modeling Network Dynamics: The Lac Operon, a Case Study.” Journal of Cell Biology, vol. 161, no. 3, Rockefeller University Press, 2003, pp. 471–76, doi:10.1083/jcb.200301125."},"main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2172934/?tool=pubmed"}],"oa":1,"publication":"Journal of Cell Biology","doi":"10.1083/jcb.200301125","date_published":"2003-01-12T00:00:00Z","month":"01","day":"12"},{"citation":{"ieee":"W. Bauer, M. Kleine Berkenbusch, and M. T. Bollenbach, “Breaking atomic nuclei into little pieces: evidence for a phase transition,” Revista Mexicana De Fisica, vol. 49, no. 4. Sociedad Mexicana de Física, pp. 1–6, 2003.","apa":"Bauer, W., Kleine Berkenbusch, M., & Bollenbach, M. T. (2003). Breaking atomic nuclei into little pieces: evidence for a phase transition. Revista Mexicana De Fisica. Sociedad Mexicana de Física.","ista":"Bauer W, Kleine Berkenbusch M, Bollenbach MT. 2003. Breaking atomic nuclei into little pieces: evidence for a phase transition. Revista Mexicana De Fisica. 49(4), 1–6.","ama":"Bauer W, Kleine Berkenbusch M, Bollenbach MT. Breaking atomic nuclei into little pieces: evidence for a phase transition. Revista Mexicana De Fisica. 2003;49(4):1-6.","chicago":"Bauer, Wolfgang, Marco Kleine Berkenbusch, and Mark Tobias Bollenbach. “Breaking Atomic Nuclei into Little Pieces: Evidence for a Phase Transition.” Revista Mexicana De Fisica. Sociedad Mexicana de Física, 2003.","short":"W. Bauer, M. Kleine Berkenbusch, M.T. Bollenbach, Revista Mexicana De Fisica 49 (2003) 1–6.","mla":"Bauer, Wolfgang, et al. “Breaking Atomic Nuclei into Little Pieces: Evidence for a Phase Transition.” Revista Mexicana De Fisica, vol. 49, no. 4, Sociedad Mexicana de Física, 2003, pp. 1–6."},"publication":"Revista Mexicana De Fisica","page":"1 - 6","date_published":"2003-01-01T00:00:00Z","language":[{"iso":"eng"}],"article_processing_charge":"No","day":"01","month":"01","year":"2003","_id":"3797","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Sociedad Mexicana de Física","intvolume":" 49","status":"public","publication_status":"published","title":"Breaking atomic nuclei into little pieces: evidence for a phase transition","author":[{"full_name":"Bauer, Wolfgang","first_name":"Wolfgang","last_name":"Bauer"},{"first_name":"Marco","last_name":"Kleine Berkenbusch","full_name":"Kleine Berkenbusch, Marco"},{"last_name":"Bollenbach","first_name":"Mark Tobias","orcid":"0000-0003-4398-476X","id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","full_name":"Bollenbach, Mark Tobias"}],"oa_version":"None","volume":49,"date_updated":"2021-01-12T07:52:16Z","date_created":"2018-12-11T12:05:13Z","type":"journal_article","issue":"4","publist_id":"2413","extern":"1"},{"month":"08","day":"18","conference":{"name":"CSL: Computer Science Logic"},"date_published":"2003-08-18T00:00:00Z","doi":"10.1007/978-3-540-45220-1_11","quality_controlled":0,"page":"100 - 113","citation":{"ieee":"K. Chatterjee, M. Jurdziński, and T. A. Henzinger, “Simple stochastic parity games,” presented at the CSL: Computer Science Logic, 2003, vol. 2803, pp. 100–113.","apa":"Chatterjee, K., Jurdziński, M., & Henzinger, T. A. (2003). Simple stochastic parity games (Vol. 2803, pp. 100–113). Presented at the CSL: Computer Science Logic, Springer. https://doi.org/10.1007/978-3-540-45220-1_11","ista":"Chatterjee K, Jurdziński M, Henzinger TA. 2003. Simple stochastic parity games. CSL: Computer Science Logic, LNCS, vol. 2803, 100–113.","ama":"Chatterjee K, Jurdziński M, Henzinger TA. Simple stochastic parity games. In: Vol 2803. Springer; 2003:100-113. doi:10.1007/978-3-540-45220-1_11","chicago":"Chatterjee, Krishnendu, Marcin Jurdziński, and Thomas A Henzinger. “Simple Stochastic Parity Games,” 2803:100–113. Springer, 2003. https://doi.org/10.1007/978-3-540-45220-1_11.","short":"K. Chatterjee, M. Jurdziński, T.A. Henzinger, in:, Springer, 2003, pp. 100–113.","mla":"Chatterjee, Krishnendu, et al. Simple Stochastic Parity Games. Vol. 2803, Springer, 2003, pp. 100–13, doi:10.1007/978-3-540-45220-1_11."},"extern":1,"abstract":[{"lang":"eng","text":"Many verification, planning, and control problems can be modeled as games played on state-transition graphs by one or two players whose conflicting goals are to form a path in the graph. The focus here is on simple stochastic parity games, that is, two-player games with turn-based probabilistic transitions and omega-regular objectives formalized as parity (Rabin chain) winning conditions. An efficient translation from simple stochastic parity games to nonstochastic parity games is given. As many algorithms are known for solving the latter, the translation yields efficient algorithms for computing the states of a simple stochastic parity game from which a player can win with probability 1. An important special case of simple stochastic parity games are the Markov decision processes with Buchi objectives. For this special case a first provably subquadratic algorithm is given for computing the states from which the single player has a strategy to achieve a Buchi objective with probability 1. For game graphs with m edges the algorithm works in time O(mrootm). Interestingly, a similar technique sheds light on the question of the computational complexity of solving simple Buchi games and yields the first provably subquadratic algorithm, with a running time of O(n(2)/log n) for game graphs with n vertices and O(n) edges."}],"publist_id":"2259","alternative_title":["LNCS"],"type":"conference","date_created":"2018-12-11T12:05:46Z","date_updated":"2021-01-12T07:53:02Z","volume":2803,"author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Krishnendu Chatterjee"},{"first_name":"Marcin","last_name":"Jurdziński","full_name":"Jurdziński, Marcin"},{"full_name":"Thomas Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"}],"publication_status":"published","title":"Simple stochastic parity games","status":"public","intvolume":" 2803","publisher":"Springer","acknowledgement":"This research was supported in part by the DARPA grant F33615-C-98-3614, the ONR grant N00014-02-1-0671, the NSF grants CCR-9988172 and CCR-0225610, and the Polish KBN grant 7-T11C-027-20.","_id":"3897","year":"2003"},{"page":"109 - 126","quality_controlled":0,"citation":{"mla":"Chatterjee, Krishnendu, et al. Stack Size Analysis for Interrupt-Driven Programs. Vol. 2694, Springer, 2003, pp. 109–26, doi:10.1007/3-540-44898-5_7.","short":"K. Chatterjee, D. Ma, R. Majumdar, T. Zhao, T.A. Henzinger, J. Palsberg, in:, Springer, 2003, pp. 109–126.","chicago":"Chatterjee, Krishnendu, Di Ma, Ritankar Majumdar, Tian Zhao, Thomas A Henzinger, and Jens Palsberg. “Stack Size Analysis for Interrupt-Driven Programs,” 2694:109–26. Springer, 2003. https://doi.org/10.1007/3-540-44898-5_7.","ama":"Chatterjee K, Ma D, Majumdar R, Zhao T, Henzinger TA, Palsberg J. Stack size analysis for interrupt-driven programs. In: Vol 2694. Springer; 2003:109-126. doi:10.1007/3-540-44898-5_7","ista":"Chatterjee K, Ma D, Majumdar R, Zhao T, Henzinger TA, Palsberg J. 2003. Stack size analysis for interrupt-driven programs. SAS: Static Analysis Symposium, LNCS, vol. 2694, 109–126.","ieee":"K. Chatterjee, D. Ma, R. Majumdar, T. Zhao, T. A. Henzinger, and J. Palsberg, “Stack size analysis for interrupt-driven programs,” presented at the SAS: Static Analysis Symposium, 2003, vol. 2694, pp. 109–126.","apa":"Chatterjee, K., Ma, D., Majumdar, R., Zhao, T., Henzinger, T. A., & Palsberg, J. (2003). Stack size analysis for interrupt-driven programs (Vol. 2694, pp. 109–126). Presented at the SAS: Static Analysis Symposium, Springer. https://doi.org/10.1007/3-540-44898-5_7"},"doi":"10.1007/3-540-44898-5_7","date_published":"2003-05-28T00:00:00Z","conference":{"name":"SAS: Static Analysis Symposium"},"day":"28","month":"05","publisher":"Springer","intvolume":" 2694","status":"public","publication_status":"published","title":"Stack size analysis for interrupt-driven programs","_id":"3898","acknowledgement":"Jens Palsberg, Di Ma, and Tian Zhao were supported by the NSF ITR award 0112628. Thomas A. Henzinger, Krishnendu Chatterjee, and Rupak Majumdar were supported by the AFOSR grant F49620-00-1-0327, the DARPA grants F33615-C-98-3614 and F33615-00-C-1693, the MARCO grant 98-DT-660, and the NSF grants CCR-0208875 and CCR-0085949.","year":"2003","volume":2694,"date_updated":"2021-01-12T07:53:02Z","date_created":"2018-12-11T12:05:46Z","author":[{"full_name":"Krishnendu Chatterjee","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"full_name":"Ma, Di","last_name":"Ma","first_name":"Di"},{"full_name":"Majumdar, Ritankar S","last_name":"Majumdar","first_name":"Ritankar"},{"full_name":"Zhao, Tian","first_name":"Tian","last_name":"Zhao"},{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Thomas Henzinger"},{"full_name":"Palsberg, Jens","last_name":"Palsberg","first_name":"Jens"}],"alternative_title":["LNCS"],"type":"conference","extern":1,"publist_id":"2260","abstract":[{"text":"We study the problem of determining stack boundedness and the exact maximum stack size for three classes of interrupt-driven programs. Interrupt-driven programs axe used in many real-time applications that require responsive interrupt handling. In order to ensure responsiveness, programmers often enable interrupt processing in the body of lower-priority interrupt handlers. In such programs a programming error can allow interrupt handlers to be interrupted in cyclic fashion to lead to an unbounded stack, causing the system to crash. For a restricted class of interrupt-driven programs, we show that there is a polynomial-time procedure to check stack boundedness, while determining the exact maximum stack size is PSPACE-complete. For a larger class of programs, the two problems are both PSPACE-complete, and for the largest class of programs we consider, the two problems are PSPACE-hard and can be solved in exponential time.","lang":"eng"}]},{"type":"journal_article","extern":1,"abstract":[{"text":"We present algorithms for constructing a hierarchy of increasingly coarse Morse-Smale complexes that decompose a piecewise linear 2-manifold. While these complexes are defined only in the smooth category, we extend the construction to the piecewise linearcategory by ensuring structural integrity and simulating differentiability. We then simplify Morse-Smale complexes by canceling pairs of critical points in order of increasing persistence.","lang":"eng"}],"publist_id":"2134","issue":"1","publication_status":"published","title":"Hierarchical Morse-Smale complexes for piecewise linear 2-manifolds","status":"public","publisher":"Springer","intvolume":" 30","acknowledgement":"Partially supported by ARO under Grant DAAG55-98-1-0177, NSF under Grants CCR-97-12088, EIA-9972879 and CCR-00-86013.","_id":"3993","year":"2003","date_created":"2018-12-11T12:06:19Z","date_updated":"2021-01-12T07:53:43Z","volume":30,"author":[{"full_name":"Herbert Edelsbrunner","first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833"},{"first_name":"John","last_name":"Harer","full_name":"Harer, John"},{"full_name":"Zomorodian, Afra","first_name":"Afra","last_name":"Zomorodian"}],"day":"01","month":"07","quality_controlled":0,"page":"87 - 107","publication":"Discrete & Computational Geometry","citation":{"chicago":"Edelsbrunner, Herbert, John Harer, and Afra Zomorodian. “Hierarchical Morse-Smale Complexes for Piecewise Linear 2-Manifolds.” Discrete & Computational Geometry. Springer, 2003. https://doi.org/10.1007/s00454-003-2926-5.","mla":"Edelsbrunner, Herbert, et al. “Hierarchical Morse-Smale Complexes for Piecewise Linear 2-Manifolds.” Discrete & Computational Geometry, vol. 30, no. 1, Springer, 2003, pp. 87–107, doi:10.1007/s00454-003-2926-5.","short":"H. Edelsbrunner, J. Harer, A. Zomorodian, Discrete & Computational Geometry 30 (2003) 87–107.","ista":"Edelsbrunner H, Harer J, Zomorodian A. 2003. Hierarchical Morse-Smale complexes for piecewise linear 2-manifolds. Discrete & Computational Geometry. 30(1), 87–107.","ieee":"H. Edelsbrunner, J. Harer, and A. Zomorodian, “Hierarchical Morse-Smale complexes for piecewise linear 2-manifolds,” Discrete & Computational Geometry, vol. 30, no. 1. Springer, pp. 87–107, 2003.","apa":"Edelsbrunner, H., Harer, J., & Zomorodian, A. (2003). Hierarchical Morse-Smale complexes for piecewise linear 2-manifolds. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-003-2926-5","ama":"Edelsbrunner H, Harer J, Zomorodian A. Hierarchical Morse-Smale complexes for piecewise linear 2-manifolds. Discrete & Computational Geometry. 2003;30(1):87-107. doi:10.1007/s00454-003-2926-5"},"date_published":"2003-07-01T00:00:00Z","doi":"10.1007/s00454-003-2926-5"},{"day":"01","month":"10","page":"173 - 192","quality_controlled":0,"citation":{"ama":"Cheng H, Edelsbrunner H. Area, perimeter and derivatives of a skin curve. Computational Geometry: Theory and Applications. 2003;26(2):173-192. doi:10.1016/S0925-7721(02)00124-4","apa":"Cheng, H., & Edelsbrunner, H. (2003). Area, perimeter and derivatives of a skin curve. Computational Geometry: Theory and Applications. Elsevier. https://doi.org/10.1016/S0925-7721(02)00124-4","ieee":"H. Cheng and H. Edelsbrunner, “Area, perimeter and derivatives of a skin curve,” Computational Geometry: Theory and Applications, vol. 26, no. 2. Elsevier, pp. 173–192, 2003.","ista":"Cheng H, Edelsbrunner H. 2003. Area, perimeter and derivatives of a skin curve. Computational Geometry: Theory and Applications. 26(2), 173–192.","short":"H. Cheng, H. Edelsbrunner, Computational Geometry: Theory and Applications 26 (2003) 173–192.","mla":"Cheng, Ho, and Herbert Edelsbrunner. “Area, Perimeter and Derivatives of a Skin Curve.” Computational Geometry: Theory and Applications, vol. 26, no. 2, Elsevier, 2003, pp. 173–92, doi:10.1016/S0925-7721(02)00124-4.","chicago":"Cheng, Ho, and Herbert Edelsbrunner. “Area, Perimeter and Derivatives of a Skin Curve.” Computational Geometry: Theory and Applications. Elsevier, 2003. https://doi.org/10.1016/S0925-7721(02)00124-4."},"publication":"Computational Geometry: Theory and Applications","doi":"10.1016/S0925-7721(02)00124-4","date_published":"2003-10-01T00:00:00Z","type":"journal_article","extern":1,"issue":"2","publist_id":"2135","abstract":[{"lang":"eng","text":"The body defined by a finite collection of disks is a subset of the plane bounded by a tangent continuous curve, which we call the skin. We give analytic formulas for the area, the perimeter, the area derivative, and the perimeter derivative of the body. Given the filtrations of the Delaunay triangulation and the Voronoi diagram of the disks, all formulas can be evaluated in time proportional to the number of disks."}],"publisher":"Elsevier","intvolume":" 26","status":"public","title":"Area, perimeter and derivatives of a skin curve","publication_status":"published","acknowledgement":"NSF under grant DMS-98-73945, ARO under grant DAAG55-98-1-0177 and by NSF under grants CCR- 97-12088, EIA-9972879, and CCR-00-86013.","_id":"3994","year":"2003","volume":26,"date_created":"2018-12-11T12:06:20Z","date_updated":"2021-01-12T07:53:43Z","author":[{"first_name":"Ho","last_name":"Cheng","full_name":"Cheng, Ho-Lun"},{"full_name":"Herbert Edelsbrunner","last_name":"Edelsbrunner","first_name":"Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"}]},{"extern":1,"abstract":[{"lang":"eng","text":"Significant advances have been made during the past few years in our understanding of how the spinal monosynaptic reflex develops. Transcription factors in the Neurogenin, Runt, ETS, and LIM families control sequential steps of the specification of various subtypes of dorsal root ganglia sensory neurons. The initiation of muscle spindle differentiation requires neuregulin 1, derived from Ia afferent sensory neurons, and signaling through ErbB receptors in intrafusal muscle fibers. Several retrograde signals from the periphery are important for the establishment of late connectivity in the reflex circuit. Finally, neurotrophin 3 released from muscle spindles regulates the strength of sensory-motor connections within the spinal cord postnatally."}],"issue":"1","publist_id":"3557","type":"review","date_updated":"2019-04-26T07:22:24Z","date_created":"2018-12-11T12:01:37Z","volume":13,"author":[{"last_name":"Chen","first_name":"Hsiao","full_name":"Chen, Hsiao Huei"},{"full_name":"Simon Hippenmeyer","first_name":"Simon","last_name":"Hippenmeyer","id":"37B36620-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2279-1061"},{"first_name":"Silvia","last_name":"Arber","full_name":"Arber, Silvia"},{"first_name":"Eric","last_name":"Frank","full_name":"Frank, Eric"}],"title":"Development of the monosynaptic stretch reflex circuit","status":"public","publication_status":"published","intvolume":" 13","publisher":"Elsevier","year":"2003","_id":"3139","month":"02","day":"01","doi":"10.1016/S0959-4388(03)00006-0","date_published":"2003-02-01T00:00:00Z","quality_controlled":0,"page":"96 - 102","publication":"Current Opinion in Neurobiology","citation":{"chicago":"Chen, Hsiao, Simon Hippenmeyer, Silvia Arber, and Eric Frank. “Development of the Monosynaptic Stretch Reflex Circuit.” Current Opinion in Neurobiology. Elsevier, 2003. https://doi.org/10.1016/S0959-4388(03)00006-0.","short":"H. Chen, S. Hippenmeyer, S. Arber, E. Frank, Current Opinion in Neurobiology 13 (2003) 96–102.","mla":"Chen, Hsiao, et al. “Development of the Monosynaptic Stretch Reflex Circuit.” Current Opinion in Neurobiology, vol. 13, no. 1, Elsevier, 2003, pp. 96–102, doi:10.1016/S0959-4388(03)00006-0.","apa":"Chen, H., Hippenmeyer, S., Arber, S., & Frank, E. (2003). Development of the monosynaptic stretch reflex circuit. Current Opinion in Neurobiology. Elsevier. https://doi.org/10.1016/S0959-4388(03)00006-0","ieee":"H. Chen, S. Hippenmeyer, S. Arber, and E. Frank, “Development of the monosynaptic stretch reflex circuit,” Current Opinion in Neurobiology, vol. 13, no. 1. Elsevier, pp. 96–102, 2003.","ista":"Chen H, Hippenmeyer S, Arber S, Frank E. 2003. Development of the monosynaptic stretch reflex circuit. Current Opinion in Neurobiology. 13(1), 96–102.","ama":"Chen H, Hippenmeyer S, Arber S, Frank E. Development of the monosynaptic stretch reflex circuit. Current Opinion in Neurobiology. 2003;13(1):96-102. doi:10.1016/S0959-4388(03)00006-0"}},{"day":"26","month":"06","quality_controlled":0,"page":"501 - 516","citation":{"short":"V. Kolmogorov, R. Zabih, S. Gortler, in:, Springer, 2003, pp. 501–516.","mla":"Kolmogorov, Vladimir, et al. Generalized Multi Camera Scene Reconstruction Using Graph Cuts. Vol. 2683, Springer, 2003, pp. 501–16, doi:10.1007/978-3-540-45063-4_32.","chicago":"Kolmogorov, Vladimir, Ramin Zabih, and Steven Gortler. “Generalized Multi Camera Scene Reconstruction Using Graph Cuts,” 2683:501–16. Springer, 2003. https://doi.org/10.1007/978-3-540-45063-4_32.","ama":"Kolmogorov V, Zabih R, Gortler S. Generalized multi camera scene reconstruction using graph cuts. In: Vol 2683. Springer; 2003:501-516. doi:10.1007/978-3-540-45063-4_32","ieee":"V. Kolmogorov, R. Zabih, and S. Gortler, “Generalized multi camera scene reconstruction using graph cuts,” presented at the EMMCVPR: Energy Minimization Methods in Computer Vision and Pattern Recognition, 2003, vol. 2683, pp. 501–516.","apa":"Kolmogorov, V., Zabih, R., & Gortler, S. (2003). Generalized multi camera scene reconstruction using graph cuts (Vol. 2683, pp. 501–516). Presented at the EMMCVPR: Energy Minimization Methods in Computer Vision and Pattern Recognition, Springer. https://doi.org/10.1007/978-3-540-45063-4_32","ista":"Kolmogorov V, Zabih R, Gortler S. 2003. Generalized multi camera scene reconstruction using graph cuts. EMMCVPR: Energy Minimization Methods in Computer Vision and Pattern Recognition, LNCS, vol. 2683, 501–516."},"conference":{"name":"EMMCVPR: Energy Minimization Methods in Computer Vision and Pattern Recognition"},"date_published":"2003-06-26T00:00:00Z","doi":"10.1007/978-3-540-45063-4_32","alternative_title":["LNCS"],"type":"conference","extern":1,"abstract":[{"text":"Reconstructing a 3-D scene from more than one camera is a classical problem in computer vision. One of the major sources of difficulty is the fact that not all scene elements are visible from all cameras. In the last few years, two promising approaches have been developed 11,12 that formulate the scene reconstruction problem in terms of energy minimization, and minimize the energy using graph cuts. These energy minimization approaches treat the input images symmetrically, handle visibility constraints correctly, and allow spatial smoothness to be enforced. However, these algorithm propose different problem formulations, and handle a limited class of smoothness terms. One algorithm 11 uses a problem formulation that is restricted to two-camera stereo, and imposes smoothness between a pair of cameras. The other algorithm 12 can handle an arbitrary number of cameras, but imposes smoothness only with respect to a single camera. In this paper we give a more general energy minimization formulation for the problem, which allows a larger class of spatial smoothness constraints. We show that our formulation includes both of the previous approaches as special cases, as well as permitting new energy functions. Experimental results on real data with ground truth are also included. ","lang":"eng"}],"publist_id":"3512","title":"Generalized multi camera scene reconstruction using graph cuts","status":"public","publication_status":"published","publisher":"Springer","intvolume":" 2683","_id":"3171","year":"2003","date_updated":"2021-01-12T07:41:34Z","date_created":"2018-12-11T12:01:48Z","volume":2683,"author":[{"full_name":"Vladimir Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","last_name":"Kolmogorov"},{"first_name":"Ramin","last_name":"Zabih","full_name":"Zabih, Ramin"},{"full_name":"Gortler, Steven","last_name":"Gortler","first_name":"Steven"}]},{"date_updated":"2021-01-12T07:41:35Z","date_created":"2018-12-11T12:01:49Z","volume":2,"author":[{"full_name":"Kim, Junhwan","first_name":"Junhwan","last_name":"Kim"},{"full_name":"Vladimir Kolmogorov","first_name":"Vladimir","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Zabih","first_name":"Ramin","full_name":"Zabih, Ramin"}],"status":"public","title":"Visual correspondence using energy minimization and mutual information","publication_status":"published","publisher":"IEEE","intvolume":" 2","year":"2003","_id":"3174","extern":1,"abstract":[{"text":"We address visual correspondence problems without assuming that scene points have similar intensities in different views. This situation is common, usually due to non-lambertian scenes or to differences between cameras. We use maximization of mutual information, a powerful technique for registering images that requires no a priori model of the relationship between scene intensities in different views. However, it has proven difficult to use mutual information to compute dense visual correspondence. Comparing fixed-size windows via mutual information suffers from the well-known problems of fixed windows, namely poor performance at discontinuities and in low-texture regions. In this paper, we show how to compute visual correspondence using mutual information without suffering from these problems. Using 'a simple approximation, mutual information can be incorporated into the standard energy minimization framework used in early vision. The energy can then be efficiently minimized using graph cuts, which preserve discontinuities and handle low-texture regions. The resulting algorithm combines the accurate disparity maps that come from graph cuts with the tolerance for intensity changes that comes from mutual information.","lang":"eng"}],"publist_id":"3510","type":"conference","conference":{"name":"ICCV: International Conference on Computer Vision"},"doi":"10.1109/ICCV.2003.1238463","date_published":"2003-09-30T00:00:00Z","quality_controlled":0,"page":"1033 - 1040","citation":{"ama":"Kim J, Kolmogorov V, Zabih R. Visual correspondence using energy minimization and mutual information. In: Vol 2. IEEE; 2003:1033-1040. doi:10.1109/ICCV.2003.1238463","ista":"Kim J, Kolmogorov V, Zabih R. 2003. Visual correspondence using energy minimization and mutual information. ICCV: International Conference on Computer Vision vol. 2, 1033–1040.","apa":"Kim, J., Kolmogorov, V., & Zabih, R. (2003). Visual correspondence using energy minimization and mutual information (Vol. 2, pp. 1033–1040). Presented at the ICCV: International Conference on Computer Vision, IEEE. https://doi.org/10.1109/ICCV.2003.1238463","ieee":"J. Kim, V. Kolmogorov, and R. Zabih, “Visual correspondence using energy minimization and mutual information,” presented at the ICCV: International Conference on Computer Vision, 2003, vol. 2, pp. 1033–1040.","mla":"Kim, Junhwan, et al. Visual Correspondence Using Energy Minimization and Mutual Information. Vol. 2, IEEE, 2003, pp. 1033–40, doi:10.1109/ICCV.2003.1238463.","short":"J. Kim, V. Kolmogorov, R. Zabih, in:, IEEE, 2003, pp. 1033–1040.","chicago":"Kim, Junhwan, Vladimir Kolmogorov, and Ramin Zabih. “Visual Correspondence Using Energy Minimization and Mutual Information,” 2:1033–40. IEEE, 2003. https://doi.org/10.1109/ICCV.2003.1238463."},"month":"09","day":"30"},{"month":"09","day":"30","quality_controlled":0,"page":"26 - 33","citation":{"chicago":"Boykov, Yuri, and Vladimir Kolmogorov. “Computing Geodesics and Minimal Surfaces via Graph Cuts,” 1:26–33. IEEE, 2003. https://doi.org/10.1109/ICCV.2003.1238310.","mla":"Boykov, Yuri, and Vladimir Kolmogorov. Computing Geodesics and Minimal Surfaces via Graph Cuts. Vol. 1, IEEE, 2003, pp. 26–33, doi:10.1109/ICCV.2003.1238310.","short":"Y. Boykov, V. Kolmogorov, in:, IEEE, 2003, pp. 26–33.","ista":"Boykov Y, Kolmogorov V. 2003. Computing geodesics and minimal surfaces via graph cuts. ICCV: International Conference on Computer Vision vol. 1, 26–33.","apa":"Boykov, Y., & Kolmogorov, V. (2003). Computing geodesics and minimal surfaces via graph cuts (Vol. 1, pp. 26–33). Presented at the ICCV: International Conference on Computer Vision, IEEE. https://doi.org/10.1109/ICCV.2003.1238310","ieee":"Y. Boykov and V. Kolmogorov, “Computing geodesics and minimal surfaces via graph cuts,” presented at the ICCV: International Conference on Computer Vision, 2003, vol. 1, pp. 26–33.","ama":"Boykov Y, Kolmogorov V. Computing geodesics and minimal surfaces via graph cuts. In: Vol 1. IEEE; 2003:26-33. doi:10.1109/ICCV.2003.1238310"},"conference":{"name":"ICCV: International Conference on Computer Vision"},"doi":"10.1109/ICCV.2003.1238310","date_published":"2003-09-30T00:00:00Z","type":"conference","extern":1,"abstract":[{"text":"Geodesic active contours and graph cuts are two standard image segmentation techniques. We introduce a new segmentation method combining some of their benefits. Our main intuition is that any cut on a graph embedded in some continuous space can be interpreted as a contour (in 2D) or a surface (in 3D). We show how to build a grid graph and set its edge weights so that the cost of cuts is arbitrarily close to the length (area) of the corresponding contours (surfaces) for any anisotropic Riemannian metric. There are two interesting consequences of this technical result. First, graph cut algorithms can be used to find globally minimum geodesic contours (minimal surfaces in 3D) under arbitrary Riemannian metric for a given set of boundary conditions. Second, we show how to minimize metrication artifacts in existing graph-cut based methods in vision. Theoretically speaking, our work provides an interesting link between several branches of mathematics -differential geometry, integral geometry, and combinatorial optimization. The main technical problem is solved using Cauchy-Crofton formula from integral geometry.","lang":"eng"}],"publist_id":"3511","publication_status":"published","title":"Computing geodesics and minimal surfaces via graph cuts","status":"public","intvolume":" 1","publisher":"IEEE","year":"2003","_id":"3170","date_created":"2018-12-11T12:01:48Z","date_updated":"2021-01-12T07:41:33Z","volume":1,"author":[{"first_name":"Yuri","last_name":"Boykov","full_name":"Boykov, Yuri"},{"full_name":"Vladimir Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","last_name":"Kolmogorov"}]},{"quality_controlled":0,"page":"552 - 556","publication":"Nature","citation":{"ista":"Harris K, Csicsvari JL, Hirase H, Dragoi G, Buzsáki G. 2003. Organization of cell assemblies in the hippocampus. Nature. 424(6948), 552–556.","apa":"Harris, K., Csicsvari, J. L., Hirase, H., Dragoi, G., & Buzsáki, G. (2003). Organization of cell assemblies in the hippocampus. Nature. Nature Publishing Group. https://doi.org/0.1038/nature01834","ieee":"K. Harris, J. L. Csicsvari, H. Hirase, G. Dragoi, and G. Buzsáki, “Organization of cell assemblies in the hippocampus,” Nature, vol. 424, no. 6948. Nature Publishing Group, pp. 552–556, 2003.","ama":"Harris K, Csicsvari JL, Hirase H, Dragoi G, Buzsáki G. Organization of cell assemblies in the hippocampus. Nature. 2003;424(6948):552-556. doi:0.1038/nature01834","chicago":"Harris, Kenneth, Jozsef L Csicsvari, Hajima Hirase, George Dragoi, and György Buzsáki. “Organization of Cell Assemblies in the Hippocampus.” Nature. Nature Publishing Group, 2003. https://doi.org/0.1038/nature01834.","mla":"Harris, Kenneth, et al. “Organization of Cell Assemblies in the Hippocampus.” Nature, vol. 424, no. 6948, Nature Publishing Group, 2003, pp. 552–56, doi:0.1038/nature01834.","short":"K. Harris, J.L. Csicsvari, H. Hirase, G. Dragoi, G. Buzsáki, Nature 424 (2003) 552–556."},"doi":"0.1038/nature01834","date_published":"2003-07-31T00:00:00Z","day":"31","month":"07","title":"Organization of cell assemblies in the hippocampus","publication_status":"published","status":"public","intvolume":" 424","publisher":"Nature Publishing Group","year":"2003","_id":"3526","date_updated":"2021-01-12T07:44:04Z","date_created":"2018-12-11T12:03:47Z","volume":424,"author":[{"first_name":"Kenneth","last_name":"Harris","full_name":"Harris, Kenneth D"},{"full_name":"Jozsef Csicsvari","first_name":"Jozsef L","last_name":"Csicsvari","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5193-4036"},{"first_name":"Hajima","last_name":"Hirase","full_name":"Hirase, Hajima"},{"full_name":"Dragoi, George","first_name":"George","last_name":"Dragoi"},{"full_name":"Buzsáki, György","last_name":"Buzsáki","first_name":"György"}],"type":"journal_article","extern":1,"abstract":[{"text":"Neurons can produce action potentials with high temporal precision(1). A fundamental issue is whether, and how, this capability is used in information processing. According to the `cell assembly' hypothesis, transient synchrony of anatomically distributed groups of neurons underlies processing of both external sensory input and internal cognitive mechanisms(2-4). Accordingly, neuron populations should be arranged into groups whose synchrony exceeds that predicted by common modulation by sensory input. Here we find that the spike times of hippocampal pyramidal cells can be predicted more accurately by using the spike times of simultaneously recorded neurons in addition to the animals location in space. This improvement remained when the spatial prediction was refined with a spatially dependent theta phase modulation(5-8). The time window in which spike times are best predicted from simultaneous peer activity is 10-30 ms, suggesting that cell assemblies are synchronized at this timescale. Because this temporal window matches the membrane time constant of pyramidal neurons(9), the period of the hippocampal gamma oscillation(10) and the time window for synaptic plasticity(11), we propose that cooperative activity at this timescale is optimal for information transmission and storage in cortical circuits.","lang":"eng"}],"publist_id":"2859","issue":"6948"},{"year":"2003","_id":"3529","publisher":"American Physiological Society","intvolume":" 90","title":"Massively parallel recording of unit and local field potentials with silicon-based electrodes","status":"public","publication_status":"published","author":[{"full_name":"Jozsef Csicsvari","last_name":"Csicsvari","first_name":"Jozsef L","orcid":"0000-0002-5193-4036","id":"3FA14672-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Henze, Darrell A","first_name":"Darrell","last_name":"Henze"},{"full_name":"Jamieson, Brian G","last_name":"Jamieson","first_name":"Brian"},{"full_name":"Harris, Kenneth D","first_name":"Kenneth","last_name":"Harris"},{"full_name":"Sirota, Anton M","last_name":"Sirota","first_name":"Anton"},{"full_name":"Bartho, Peter","last_name":"Bartho","first_name":"Peter"},{"last_name":"Wise","first_name":"Kensall","full_name":"Wise, Kensall D"},{"first_name":"György","last_name":"Buzsáki","full_name":"Buzsáki, György"}],"volume":90,"date_updated":"2021-01-12T07:44:05Z","date_created":"2018-12-11T12:03:48Z","type":"journal_article","issue":"2","publist_id":"2856","abstract":[{"text":"Parallel recording of neuronal activity in the behaving animal is a prerequisite for our understanding of neuronal representation and storage of information. Here we describe the development of micro-machined silicon microelectrode arrays for unit and local field recordings. The two-dimensional probes with 96 or 64 recording sites provided high-density recording of unit and field activity with minimal tissue displacement or damage. The on-chip active circuit eliminated movement and other artifacts and greatly reduced the weight of the headgear. The precise geometry of the recording tips allowed for the estimation of the spatial location of the recorded neurons and for high-resolution estimation of extracellular current source density. Action potentials could be simultaneously recorded from the soma and dendrites of the same neurons. Silicon technology is a promising approach for high-density, high-resolution sampling of neuronal activity in both basic research and prosthetic devices.","lang":"eng"}],"extern":1,"citation":{"chicago":"Csicsvari, Jozsef L, Darrell Henze, Brian Jamieson, Kenneth Harris, Anton Sirota, Peter Bartho, Kensall Wise, and György Buzsáki. “Massively Parallel Recording of Unit and Local Field Potentials with Silicon-Based Electrodes.” Journal of Neurophysiology. American Physiological Society, 2003. https://doi.org/10.1152/jn.00116.2003.","short":"J.L. Csicsvari, D. Henze, B. Jamieson, K. Harris, A. Sirota, P. Bartho, K. Wise, G. Buzsáki, Journal of Neurophysiology 90 (2003) 1314–1323.","mla":"Csicsvari, Jozsef L., et al. “Massively Parallel Recording of Unit and Local Field Potentials with Silicon-Based Electrodes.” Journal of Neurophysiology, vol. 90, no. 2, American Physiological Society, 2003, pp. 1314–23, doi:10.1152/jn.00116.2003.","apa":"Csicsvari, J. L., Henze, D., Jamieson, B., Harris, K., Sirota, A., Bartho, P., … Buzsáki, G. (2003). Massively parallel recording of unit and local field potentials with silicon-based electrodes. Journal of Neurophysiology. American Physiological Society. https://doi.org/10.1152/jn.00116.2003","ieee":"J. L. Csicsvari et al., “Massively parallel recording of unit and local field potentials with silicon-based electrodes,” Journal of Neurophysiology, vol. 90, no. 2. American Physiological Society, pp. 1314–1323, 2003.","ista":"Csicsvari JL, Henze D, Jamieson B, Harris K, Sirota A, Bartho P, Wise K, Buzsáki G. 2003. Massively parallel recording of unit and local field potentials with silicon-based electrodes. Journal of Neurophysiology. 90(2), 1314–1323.","ama":"Csicsvari JL, Henze D, Jamieson B, et al. Massively parallel recording of unit and local field potentials with silicon-based electrodes. Journal of Neurophysiology. 2003;90(2):1314-1323. doi:10.1152/jn.00116.2003"},"publication":"Journal of Neurophysiology","page":"1314 - 1323","quality_controlled":0,"date_published":"2003-08-01T00:00:00Z","doi":"10.1152/jn.00116.2003","day":"01","month":"08"},{"year":"2003","_id":"3528","intvolume":" 37","publisher":"Elsevier","title":"Mechanisms of gamma oscillations in the hippocampus of the behaving rat","publication_status":"published","status":"public","author":[{"full_name":"Jozsef Csicsvari","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5193-4036","first_name":"Jozsef L","last_name":"Csicsvari"},{"first_name":"Brian","last_name":"Jamieson","full_name":"Jamieson, Brian G"},{"first_name":"Kensall","last_name":"Wise","full_name":"Wise, Kensall D"},{"last_name":"Buzsáki","first_name":"György","full_name":"Buzsáki, György"}],"volume":37,"date_created":"2018-12-11T12:03:48Z","date_updated":"2021-01-12T07:44:05Z","type":"journal_article","publist_id":"2857","issue":"2","abstract":[{"text":"Gamma frequency oscillations (30-100 Hz) have been suggested to underlie various cognitive and motor functions. Here, we examine the generation of gamma oscillation currents in the hippocampus, using two-dimensional, 96-site silicon probes. Two gamma generators were identified, one in the dentate gyrus and another in the CA3-CA1 regions. The coupling strength between the two oscillators varied during both theta and nontheta states. Both pyramidal cells and interneurons were phase-locked to gamma waves. Anatomical connectivity, rather than physical distance, determined the coupling strength of the oscillating neurons. CA3 pyramidal neurons discharged CA3 and CA1 interneurons at latencies indicative of monosynaptic connections. Intrahippocampal gamma oscillation emerges in the CA3 recurrent system, which entrains the CA1 region via its interneurons.","lang":"eng"}],"extern":1,"citation":{"chicago":"Csicsvari, Jozsef L, Brian Jamieson, Kensall Wise, and György Buzsáki. “Mechanisms of Gamma Oscillations in the Hippocampus of the Behaving Rat.” Neuron. Elsevier, 2003. https://doi.org/10.1016/S0896-6273(02)01169-8.","mla":"Csicsvari, Jozsef L., et al. “Mechanisms of Gamma Oscillations in the Hippocampus of the Behaving Rat.” Neuron, vol. 37, no. 2, Elsevier, 2003, pp. 311–22, doi:10.1016/S0896-6273(02)01169-8.","short":"J.L. Csicsvari, B. Jamieson, K. Wise, G. Buzsáki, Neuron 37 (2003) 311–322.","ista":"Csicsvari JL, Jamieson B, Wise K, Buzsáki G. 2003. Mechanisms of gamma oscillations in the hippocampus of the behaving rat. Neuron. 37(2), 311–322.","apa":"Csicsvari, J. L., Jamieson, B., Wise, K., & Buzsáki, G. (2003). Mechanisms of gamma oscillations in the hippocampus of the behaving rat. Neuron. Elsevier. https://doi.org/10.1016/S0896-6273(02)01169-8","ieee":"J. L. Csicsvari, B. Jamieson, K. Wise, and G. Buzsáki, “Mechanisms of gamma oscillations in the hippocampus of the behaving rat,” Neuron, vol. 37, no. 2. Elsevier, pp. 311–322, 2003.","ama":"Csicsvari JL, Jamieson B, Wise K, Buzsáki G. Mechanisms of gamma oscillations in the hippocampus of the behaving rat. Neuron. 2003;37(2):311-322. doi:10.1016/S0896-6273(02)01169-8"},"publication":"Neuron","page":"311 - 322","quality_controlled":0,"date_published":"2003-01-01T00:00:00Z","doi":"10.1016/S0896-6273(02)01169-8","month":"01","day":"01"},{"month":"02","day":"18","publication":"PNAS","citation":{"apa":"Sirota, A., Csicsvari, J. L., Buhl, D., & Buzsáki, G. (2003). Communication between neocortex and hippocampus during sleep in rodents. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.0437938100","ieee":"A. Sirota, J. L. Csicsvari, D. Buhl, and G. Buzsáki, “Communication between neocortex and hippocampus during sleep in rodents,” PNAS, vol. 100, no. 4. National Academy of Sciences, pp. 2065–2069, 2003.","ista":"Sirota A, Csicsvari JL, Buhl D, Buzsáki G. 2003. Communication between neocortex and hippocampus during sleep in rodents. PNAS. 100(4), 2065–2069.","ama":"Sirota A, Csicsvari JL, Buhl D, Buzsáki G. Communication between neocortex and hippocampus during sleep in rodents. PNAS. 2003;100(4):2065-2069. doi:10.1073/pnas.0437938100","chicago":"Sirota, Anton, Jozsef L Csicsvari, Derek Buhl, and György Buzsáki. “Communication between Neocortex and Hippocampus during Sleep in Rodents.” PNAS. National Academy of Sciences, 2003. https://doi.org/10.1073/pnas.0437938100.","short":"A. Sirota, J.L. Csicsvari, D. Buhl, G. Buzsáki, PNAS 100 (2003) 2065–2069.","mla":"Sirota, Anton, et al. “Communication between Neocortex and Hippocampus during Sleep in Rodents.” PNAS, vol. 100, no. 4, National Academy of Sciences, 2003, pp. 2065–69, doi:10.1073/pnas.0437938100."},"quality_controlled":0,"page":"2065 - 2069","doi":"10.1073/pnas.0437938100","date_published":"2003-02-18T00:00:00Z","type":"journal_article","abstract":[{"text":"Both neocortical and hippocampal networks organize the firing patterns of their neurons by prominent oscillations during sleep, but the functional role of these rhythms is not well understood. Here, we show a robust correlation of neuronal discharges between the somatosensory cortex and hippocampus on both slow and fine time scales in the mouse and rat. Neuronal bursts in deep cortical layers, associated with sleep spindles and delta waves/slow rhythm, effectively triggered hippocampal discharges related to fast (ripple) oscillations. We hypothesize that oscillation-mediated temporal links coordinate specific information transfer between neocortical and hippocampal cell assemblies. Such a neocortical-hippocampal interplay may be important for memory consolidation.","lang":"eng"}],"publist_id":"2841","issue":"4","extern":1,"year":"2003","_id":"3543","status":"public","title":"Communication between neocortex and hippocampus during sleep in rodents","publication_status":"published","intvolume":" 100","publisher":"National Academy of Sciences","author":[{"full_name":"Sirota, Anton M","last_name":"Sirota","first_name":"Anton"},{"full_name":"Jozsef Csicsvari","first_name":"Jozsef L","last_name":"Csicsvari","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5193-4036"},{"full_name":"Buhl, Derek L","last_name":"Buhl","first_name":"Derek"},{"full_name":"Buzsáki, György","last_name":"Buzsáki","first_name":"György"}],"date_created":"2018-12-11T12:03:53Z","date_updated":"2021-01-12T07:44:12Z","volume":100},{"date_published":"2003-02-01T00:00:00Z","doi":"10.1023/A:1023217515688","citation":{"ama":"Chatterjee K, Dasgupta P, Chakrabarti P. A branching time temporal framework for quantitative reasoning. Journal of Automated Reasoning. 2003;30(2):205-232. doi:10.1023/A:1023217515688","ista":"Chatterjee K, Dasgupta P, Chakrabarti P. 2003. A branching time temporal framework for quantitative reasoning. Journal of Automated Reasoning. 30(2), 205–232.","apa":"Chatterjee, K., Dasgupta, P., & Chakrabarti, P. (2003). A branching time temporal framework for quantitative reasoning. Journal of Automated Reasoning. Springer. https://doi.org/10.1023/A:1023217515688","ieee":"K. Chatterjee, P. Dasgupta, and P. Chakrabarti, “A branching time temporal framework for quantitative reasoning,” Journal of Automated Reasoning, vol. 30, no. 2. Springer, pp. 205–232, 2003.","mla":"Chatterjee, Krishnendu, et al. “A Branching Time Temporal Framework for Quantitative Reasoning.” Journal of Automated Reasoning, vol. 30, no. 2, Springer, 2003, pp. 205–32, doi:10.1023/A:1023217515688.","short":"K. Chatterjee, P. Dasgupta, P. Chakrabarti, Journal of Automated Reasoning 30 (2003) 205–232.","chicago":"Chatterjee, Krishnendu, Pallab Dasgupta, and Partha Chakrabarti. “A Branching Time Temporal Framework for Quantitative Reasoning.” Journal of Automated Reasoning. Springer, 2003. https://doi.org/10.1023/A:1023217515688."},"publication":"Journal of Automated Reasoning","page":"205 - 232","quality_controlled":0,"month":"02","day":"01","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Krishnendu Chatterjee"},{"first_name":"Pallab","last_name":"Dasgupta","full_name":"Dasgupta, Pallab"},{"full_name":"Chakrabarti, Partha P","first_name":"Partha","last_name":"Chakrabarti"}],"volume":30,"date_updated":"2021-01-12T07:44:31Z","date_created":"2018-12-11T12:04:08Z","year":"2003","_id":"3593","publisher":"Springer","intvolume":" 30","status":"public","publication_status":"published","title":"A branching time temporal framework for quantitative reasoning","issue":"2","publist_id":"2790","abstract":[{"text":"Temporal logics such as Computation Tree Logic (CTL) and Linear Temporal Logic (LTL) have become popular for specifying temporal properties over a wide variety of planning and verification problems. In this paper we work towards building a generalized framework for automated reasoning based on temporal logics. We present a powerful extension of CTL with first-order quantification over the set of reachable states for reasoning about extremal properties of weighted labeled transition systems in general. The proposed logic, which we call Weighted Quantified Computation Tree Logic (WQCTL), captures the essential elements common to the domain of planning and verification problems and can thereby be used as an effective specification language in both domains. We show that in spite of the rich, expressive power of the logic, we are able to evaluate WQCTL formulas in time polynomial in the size of the state space times the length of the formula. Wepresent experimental results on the WQCTL verifier.","lang":"eng"}],"extern":1,"type":"journal_article"},{"publist_id":"2704","extern":1,"type":"dissertation","author":[{"full_name":"Christoph Lampert","first_name":"Christoph","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887"}],"date_created":"2018-12-11T12:04:34Z","date_updated":"2021-01-12T07:45:05Z","volume":356,"year":"2003","_id":"3678","status":"public","publication_status":"published","title":"The Neumann operator in strictly pseudoconvex domains with weighted Bergman metric ","publisher":"Universität Bonn, Fachbibliothek Mathematik","intvolume":" 356","day":"31","month":"03","date_published":"2003-03-31T00:00:00Z","publication":"Bonner Mathematische Schriften","citation":{"chicago":"Lampert, Christoph. “The Neumann Operator in Strictly Pseudoconvex Domains with Weighted Bergman Metric .” Bonner Mathematische Schriften. Universität Bonn, Fachbibliothek Mathematik, 2003.","short":"C. Lampert, The Neumann Operator in Strictly Pseudoconvex Domains with Weighted Bergman Metric , Universität Bonn, Fachbibliothek Mathematik, 2003.","mla":"Lampert, Christoph. “The Neumann Operator in Strictly Pseudoconvex Domains with Weighted Bergman Metric .” Bonner Mathematische Schriften, vol. 356, Universität Bonn, Fachbibliothek Mathematik, 2003, pp. 1–165.","apa":"Lampert, C. (2003). The Neumann operator in strictly pseudoconvex domains with weighted Bergman metric . Bonner Mathematische Schriften. Universität Bonn, Fachbibliothek Mathematik.","ieee":"C. Lampert, “The Neumann operator in strictly pseudoconvex domains with weighted Bergman metric ,” Universität Bonn, Fachbibliothek Mathematik, 2003.","ista":"Lampert C. 2003. The Neumann operator in strictly pseudoconvex domains with weighted Bergman metric . Universität Bonn, Fachbibliothek Mathematik.","ama":"Lampert C. The Neumann operator in strictly pseudoconvex domains with weighted Bergman metric . Bonner Mathematische Schriften. 2003;356:1-165."},"main_file_link":[{"url":"http://pub.ist.ac.at/~chl/papers/lampert-phd2003.pdf","open_access":"0"}],"quality_controlled":0,"page":"1 - 165"},{"type":"journal_article","extern":1,"abstract":[{"lang":"eng","text":"The combination of high-resolution atomic force microscopy (AFM) imaging and single-molecule force-spectroscopy was employed to unfold single bacteriorhodopsins (BR) from native purple membrane patches at various physiologically relevant temperatures. The unfolding spectra reveal detailed insight into the stability of individual structural elements of BR against mechanical unfolding. Intermittent states in the unfolding process are associated with the stepwise unfolding of alpha-helices, whereas other states are associated with the unfolding of polypeptide loops connecting the alpha-helices. It was found that the unfolding forces of the secondary structures considerably decreased upon increasing the temperature from 8 to 52°C. Associated with this effect, the probability of individual unfolding pathways of BR was significantly influenced by the temperature. At lower temperatures, transmembrane alpha-helices and extracellular polypeptide loops exhibited sufficient stability to individually establish potential barriers against unfolding, whereas they predominantly unfolded collectively at elevated temperatures. This suggests that increasing the temperature decreases the mechanical stability of secondary structural elements and changes molecular interactions between secondary structures, thereby forcing them to act as grouped structures."}],"publist_id":"2506","issue":"19","title":"Unfolding pathways of native bacteriorhodopsin depend on temperature","status":"public","publication_status":"published","publisher":"Wiley-Blackwell","intvolume":" 22","year":"2003","_id":"3725","date_created":"2018-12-11T12:04:50Z","date_updated":"2021-01-12T07:51:45Z","volume":22,"author":[{"orcid":"0000-0002-8023-9315","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","last_name":"Janovjak","first_name":"Harald L","full_name":"Harald Janovjak"},{"last_name":"Kessler","first_name":"Max","full_name":"Kessler, Max"},{"full_name":"Oesterhelt, Dieter","first_name":"Dieter","last_name":"Oesterhelt"},{"first_name":"Hermann","last_name":"Gaub","full_name":"Gaub, Hermann"},{"last_name":"Mueller","first_name":"Daniel","full_name":"Mueller, Daniel J"}],"day":"01","month":"01","quality_controlled":0,"page":"5220 - 5229","publication":"EMBO Journal","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC204492/","open_access":"1"}],"citation":{"apa":"Janovjak, H. L., Kessler, M., Oesterhelt, D., Gaub, H., & Mueller, D. (2003). Unfolding pathways of native bacteriorhodopsin depend on temperature. EMBO Journal. Wiley-Blackwell. https://doi.org/10.1093/emboj/cdg509","ieee":"H. L. Janovjak, M. Kessler, D. Oesterhelt, H. Gaub, and D. Mueller, “Unfolding pathways of native bacteriorhodopsin depend on temperature,” EMBO Journal, vol. 22, no. 19. Wiley-Blackwell, pp. 5220–5229, 2003.","ista":"Janovjak HL, Kessler M, Oesterhelt D, Gaub H, Mueller D. 2003. Unfolding pathways of native bacteriorhodopsin depend on temperature. EMBO Journal. 22(19), 5220–5229.","ama":"Janovjak HL, Kessler M, Oesterhelt D, Gaub H, Mueller D. Unfolding pathways of native bacteriorhodopsin depend on temperature. EMBO Journal. 2003;22(19):5220-5229. doi:10.1093/emboj/cdg509","chicago":"Janovjak, Harald L, Max Kessler, Dieter Oesterhelt, Hermann Gaub, and Daniel Mueller. “Unfolding Pathways of Native Bacteriorhodopsin Depend on Temperature.” EMBO Journal. Wiley-Blackwell, 2003. https://doi.org/10.1093/emboj/cdg509.","short":"H.L. Janovjak, M. Kessler, D. Oesterhelt, H. Gaub, D. Mueller, EMBO Journal 22 (2003) 5220–5229.","mla":"Janovjak, Harald L., et al. “Unfolding Pathways of Native Bacteriorhodopsin Depend on Temperature.” EMBO Journal, vol. 22, no. 19, Wiley-Blackwell, 2003, pp. 5220–29, doi:10.1093/emboj/cdg509."},"oa":1,"date_published":"2003-01-01T00:00:00Z","doi":"10.1093/emboj/cdg509"},{"date_published":"2003-01-01T00:00:00Z","citation":{"chicago":"Lien, Cheng, and Peter M Jonas. “Kv3 Potassium Conductance Is Necessary and Kinetically Optimized for High-Frequency Action Potential Generation in Hippocampal Interneurons.” Journal of Neuroscience. Society for Neuroscience, 2003.","short":"C. Lien, P.M. Jonas, Journal of Neuroscience 23 (2003) 2058–68.","mla":"Lien, Cheng, and Peter M. Jonas. “Kv3 Potassium Conductance Is Necessary and Kinetically Optimized for High-Frequency Action Potential Generation in Hippocampal Interneurons.” Journal of Neuroscience, vol. 23, no. 6, Society for Neuroscience, 2003, pp. 2058–68.","apa":"Lien, C., & Jonas, P. M. (2003). Kv3 potassium conductance is necessary and kinetically optimized for high-frequency action potential generation in hippocampal interneurons. Journal of Neuroscience. Society for Neuroscience.","ieee":"C. Lien and P. M. Jonas, “Kv3 potassium conductance is necessary and kinetically optimized for high-frequency action potential generation in hippocampal interneurons,” Journal of Neuroscience, vol. 23, no. 6. Society for Neuroscience, pp. 2058–68, 2003.","ista":"Lien C, Jonas PM. 2003. Kv3 potassium conductance is necessary and kinetically optimized for high-frequency action potential generation in hippocampal interneurons. Journal of Neuroscience. 23(6), 2058–68.","ama":"Lien C, Jonas PM. Kv3 potassium conductance is necessary and kinetically optimized for high-frequency action potential generation in hippocampal interneurons. Journal of Neuroscience. 2003;23(6):2058-2068."},"publication":"Journal of Neuroscience","page":"2058 - 68","quality_controlled":0,"day":"01","month":"01","author":[{"first_name":"Cheng","last_name":"Lien","full_name":"Lien, Cheng-Chang"},{"orcid":"0000-0001-5001-4804","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","last_name":"Jonas","first_name":"Peter M","full_name":"Peter Jonas"}],"volume":23,"date_updated":"2021-01-12T07:52:19Z","date_created":"2018-12-11T12:05:16Z","year":"2003","_id":"3804","intvolume":" 23","publisher":"Society for Neuroscience","publication_status":"published","title":"Kv3 potassium conductance is necessary and kinetically optimized for high-frequency action potential generation in hippocampal interneurons","status":"public","publist_id":"2406","issue":"6","abstract":[{"lang":"eng","text":"Kv3 channels are thought to be essential for the fast-spiking (FS) phenotype in GABAergic interneurons, but how these channels confer the ability to generate action potentials (APs) at high frequency is unknown. To address this question, we developed a fast dynamic-clamp system (approximately 50 kHz) that allowed us to add a Kv3 model conductance to CA1 oriens alveus (OA) interneurons in hippocampal slices. Selective pharmacological block of Kv3 channels by 0.3 mm 4-aminopyridine or 1 mm tetraethylammonium ions led to a marked broadening of APs during trains of short stimuli and a reduction in AP frequency during 1 sec stimuli. The addition of artificial Kv3 conductance restored the original AP pattern. Subtraction of Kv3 conductance by dynamic clamp mimicked the effects of the blockers. Application of artificial Kv3 conductance also led to FS in OA interneurons after complete K+ channel block and even induced FS in hippocampal pyramidal neurons in the absence of blockers. Adding artificial Kv3 conductance with altered deactivation kinetics revealed a nonmonotonic relationship between mean AP frequency and deactivation rate, with a maximum slightly above the original value. Insertion of artificial Kv3 conductance with either lowered activation threshold or inactivation also led to a reduction in the mean AP frequency. However, the mechanisms were distinct. Shifting the activation threshold induced adaptation, whereas adding inactivation caused frequency-dependent AP broadening. In conclusion, Kv3 channels are necessary for the FS phenotype of OA interneurons, and several of their gating properties appear to be optimized for high-frequency repetitive activity."}],"extern":1,"type":"journal_article"},{"date_published":"2003-01-01T00:00:00Z","doi":"10.1073/pnas.1432836100","quality_controlled":0,"page":"8975 - 80","publication":"PNAS","citation":{"mla":"Hallermann, Stefan, et al. “A Large Pool of Releasable Vesicles in a Cortical Glutamatergic Synapse.” PNAS, vol. 100, no. 15, National Academy of Sciences, 2003, pp. 8975–80, doi:10.1073/pnas.1432836100.","short":"S. Hallermann, C. Pawlu, P.M. Jonas, M. Heckmann, PNAS 100 (2003) 8975–80.","chicago":"Hallermann, Stefan, Christian Pawlu, Peter M Jonas, and Manfred Heckmann. “A Large Pool of Releasable Vesicles in a Cortical Glutamatergic Synapse.” PNAS. National Academy of Sciences, 2003. https://doi.org/10.1073/pnas.1432836100.","ama":"Hallermann S, Pawlu C, Jonas PM, Heckmann M. A large pool of releasable vesicles in a cortical glutamatergic synapse. PNAS. 2003;100(15):8975-8980. doi:10.1073/pnas.1432836100","ista":"Hallermann S, Pawlu C, Jonas PM, Heckmann M. 2003. A large pool of releasable vesicles in a cortical glutamatergic synapse. PNAS. 100(15), 8975–80.","apa":"Hallermann, S., Pawlu, C., Jonas, P. M., & Heckmann, M. (2003). A large pool of releasable vesicles in a cortical glutamatergic synapse. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1432836100","ieee":"S. Hallermann, C. Pawlu, P. M. Jonas, and M. Heckmann, “A large pool of releasable vesicles in a cortical glutamatergic synapse,” PNAS, vol. 100, no. 15. National Academy of Sciences, pp. 8975–80, 2003."},"day":"01","month":"01","date_updated":"2021-01-12T07:52:20Z","date_created":"2018-12-11T12:05:16Z","volume":100,"author":[{"full_name":"Hallermann, Stefan","last_name":"Hallermann","first_name":"Stefan"},{"full_name":"Pawlu, Christian","last_name":"Pawlu","first_name":"Christian"},{"id":"353C1B58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5001-4804","first_name":"Peter M","last_name":"Jonas","full_name":"Peter Jonas"},{"full_name":"Heckmann, Manfred","first_name":"Manfred","last_name":"Heckmann"}],"publication_status":"published","status":"public","title":"A large pool of releasable vesicles in a cortical glutamatergic synapse","intvolume":" 100","publisher":"National Academy of Sciences","_id":"3806","year":"2003","extern":1,"abstract":[{"text":"To probe exocytosis at a cortical glutamatergic synapse, we made capacitance measurements in whole-cell recorded hippocampal mossy fiber terminals. Evaluation of different methods by using a morphology-based equivalent electrical model revealed that quantitative capacitance measurements are possible in this presynaptic structure. Voltage pulses leading to presynaptic Ca2+ inflow evoked large capacitance signals that showed saturation with increasing pulse duration. The mean peak capacitance increase was 100 fF, corresponding to a pool of approximately 1,400 releasable vesicles. Thus hippocampal mossy fiber synapses have a vesicular "maxipool." Large pool size and rapid vesicle recycling may underlie the uniquely large extent of activity-dependent plasticity in this synapse.","lang":"eng"}],"issue":"15","publist_id":"2405","type":"journal_article"},{"month":"01","day":"01","page":"54 - 62","citation":{"ama":"Anderson C, Cremer S, Heinze J. Live and let die: Why fighter males of the ant Cardiocondyla kill each other but tolerate their winged rivals. Behavioral Ecology. 2003;14(1):54-62. doi:10.1093/beheco/14.1.54","ista":"Anderson C, Cremer S, Heinze J. 2003. Live and let die: Why fighter males of the ant Cardiocondyla kill each other but tolerate their winged rivals. Behavioral Ecology. 14(1), 54–62.","apa":"Anderson, C., Cremer, S., & Heinze, J. (2003). Live and let die: Why fighter males of the ant Cardiocondyla kill each other but tolerate their winged rivals. Behavioral Ecology. Oxford University Press. https://doi.org/10.1093/beheco/14.1.54","ieee":"C. Anderson, S. Cremer, and J. Heinze, “Live and let die: Why fighter males of the ant Cardiocondyla kill each other but tolerate their winged rivals,” Behavioral Ecology, vol. 14, no. 1. Oxford University Press, pp. 54–62, 2003.","mla":"Anderson, Carl, et al. “Live and Let Die: Why Fighter Males of the Ant Cardiocondyla Kill Each Other but Tolerate Their Winged Rivals.” Behavioral Ecology, vol. 14, no. 1, Oxford University Press, 2003, pp. 54–62, doi:10.1093/beheco/14.1.54.","short":"C. Anderson, S. Cremer, J. Heinze, Behavioral Ecology 14 (2003) 54–62.","chicago":"Anderson, Carl, Sylvia Cremer, and Jürgen Heinze. “Live and Let Die: Why Fighter Males of the Ant Cardiocondyla Kill Each Other but Tolerate Their Winged Rivals.” Behavioral Ecology. Oxford University Press, 2003. https://doi.org/10.1093/beheco/14.1.54."},"publication":"Behavioral Ecology","language":[{"iso":"eng"}],"doi":"10.1093/beheco/14.1.54","date_published":"2003-01-01T00:00:00Z","type":"journal_article","extern":"1","publist_id":"2233","issue":"1","abstract":[{"text":"Unlike most social insects, many Cardiocondyla ant species have two male morphs: wingless (ergatoid) males, who remain in the natal nest, and winged males who disperse but, strangely, before leaving may also mate within the nest. Whereas ergatoid males are highly intolerant of each other and fight among themselves, they tend to tolerate their winged counterparts. This is despite the fact that these winged males, like ergatoid males, represent mating competition. Why should ergatoid males tolerate their winged rivals? We developed a mathematical model to address this question. Our model focuses on a number of factors likely toinfluence whether ergatoid males are tolerant of winged males: ergatoid male–winged male relatedness, number of virgin queens, number of winged males, and the number of ejaculates a winged male has (winged males are sperm limited, whereas ergatoid males have lifelong spermatogenesis). Surprisingly, we found that increasing the number of virgin queens favors a kill strategy, whereas an increase in the other factors favors a let-live strategy; these predictions appear true for C. obscurior and for a number of other Cardiocondyla species. Two further aspects, unequal insemination success and multiple mating in queens, were also incorporated into the model and predictions made about their effects on toleration of winged males. The model is applicable more generally in species that have dimorphic males, such as some other ants, bees, and fig wasps.","lang":"eng"}],"intvolume":" 14","publisher":"Oxford University Press","title":"Live and let die: Why fighter males of the ant Cardiocondyla kill each other but tolerate their winged rivals","publication_status":"published","status":"public","_id":"3921","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2003","oa_version":"None","volume":14,"date_updated":"2021-01-12T07:53:13Z","date_created":"2018-12-11T12:05:54Z","author":[{"full_name":"Anderson, Carl","last_name":"Anderson","first_name":"Carl"},{"full_name":"Cremer, Sylvia","first_name":"Sylvia","last_name":"Cremer","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2193-3868"},{"full_name":"Heinze, Jürgen","first_name":"Jürgen","last_name":"Heinze"}]},{"status":"public","publication_status":"published","title":"Stress grows wings: Environmental induction of winged dispersal males in Cardiocondyla ants","intvolume":" 13","publisher":"Cell Press","_id":"3922","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2003","date_updated":"2021-01-12T07:53:13Z","date_created":"2018-12-11T12:05:54Z","volume":13,"oa_version":"None","author":[{"full_name":"Cremer, Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2193-3868","first_name":"Sylvia","last_name":"Cremer"},{"full_name":"Heinze, Jürgen","last_name":"Heinze","first_name":"Jürgen"}],"type":"journal_article","extern":"1","abstract":[{"text":"Dispersal is advantageous, but, at the same time, it implies high costs and risks. Due to these counteracting selection pressures, many species evolved dispersal polymorphisms, which, in ants, are typically restricted to the female sex (queens). Male polymorphism is presently only known from a few genera, such as Cardiocondyla, in which winged dispersing males coexist with wingless fighter males that mate exclusively inside their maternal nests. We studied the developmental mechanisms underlying these alternative male morphs and found that, first, male dimorphism is not genetically determined, but is induced by environmental conditions (decreasing temperature and density). Second, male morph is not yet fixed at the egg stage, but it differentiates during larval development. This flexible developmental pattern of male morphs allows Cardiocondyla ant colonies to react quickly to changes in their environment. Under good conditions, they invest exclusively in philopatric wingless males. But, when environmental conditions turn bad, colonies start to produce winged dispersal males, even though these males require a many times higher investment by the colony than their much smaller wingless counterparts. Cardiocondyla ants share this potential of optimal resource allocation with other colonial animals and some seed dimorphic plants.","lang":"eng"}],"publist_id":"2234","issue":"3","page":"219 - 223","publication":"Current Biology","citation":{"ama":"Cremer S, Heinze J. Stress grows wings: Environmental induction of winged dispersal males in Cardiocondyla ants. Current Biology. 2003;13(3):219-223. doi:10.1016/S0960-9822(03)00012-5","ista":"Cremer S, Heinze J. 2003. Stress grows wings: Environmental induction of winged dispersal males in Cardiocondyla ants. Current Biology. 13(3), 219–223.","apa":"Cremer, S., & Heinze, J. (2003). Stress grows wings: Environmental induction of winged dispersal males in Cardiocondyla ants. Current Biology. Cell Press. https://doi.org/10.1016/S0960-9822(03)00012-5","ieee":"S. Cremer and J. Heinze, “Stress grows wings: Environmental induction of winged dispersal males in Cardiocondyla ants,” Current Biology, vol. 13, no. 3. Cell Press, pp. 219–223, 2003.","mla":"Cremer, Sylvia, and Jürgen Heinze. “Stress Grows Wings: Environmental Induction of Winged Dispersal Males in Cardiocondyla Ants.” Current Biology, vol. 13, no. 3, Cell Press, 2003, pp. 219–23, doi:10.1016/S0960-9822(03)00012-5.","short":"S. Cremer, J. Heinze, Current Biology 13 (2003) 219–223.","chicago":"Cremer, Sylvia, and Jürgen Heinze. “Stress Grows Wings: Environmental Induction of Winged Dispersal Males in Cardiocondyla Ants.” Current Biology. Cell Press, 2003. https://doi.org/10.1016/S0960-9822(03)00012-5."},"language":[{"iso":"eng"}],"doi":"10.1016/S0960-9822(03)00012-5","date_published":"2003-02-04T00:00:00Z","day":"04","month":"02"},{"month":"01","day":"01","publication":"Blick in die Wissenschaft","citation":{"mla":"Cremer, Sylvia, and Jürgen Heinze. “Zwischen Hochzeitsflug Und Brudermord: Reproduktive Taktiken Bei Ameisenmännchen.” Blick in Die Wissenschaft, vol. 12, no. 15, Schnell und Steiner, 2003, pp. 32–36.","short":"S. Cremer, J. Heinze, Blick in Die Wissenschaft 12 (2003) 32–36.","chicago":"Cremer, Sylvia, and Jürgen Heinze. “Zwischen Hochzeitsflug Und Brudermord: Reproduktive Taktiken Bei Ameisenmännchen.” Blick in Die Wissenschaft. Schnell und Steiner, 2003.","ama":"Cremer S, Heinze J. Zwischen Hochzeitsflug und Brudermord: reproduktive Taktiken bei Ameisenmännchen. Blick in die Wissenschaft. 2003;12(15):32-36.","ista":"Cremer S, Heinze J. 2003. Zwischen Hochzeitsflug und Brudermord: reproduktive Taktiken bei Ameisenmännchen. Blick in die Wissenschaft. 12(15), 32–36.","ieee":"S. Cremer and J. Heinze, “Zwischen Hochzeitsflug und Brudermord: reproduktive Taktiken bei Ameisenmännchen,” Blick in die Wissenschaft, vol. 12, no. 15. Schnell und Steiner, pp. 32–36, 2003.","apa":"Cremer, S., & Heinze, J. (2003). Zwischen Hochzeitsflug und Brudermord: reproduktive Taktiken bei Ameisenmännchen. Blick in Die Wissenschaft. Schnell und Steiner."},"page":"32 - 36","date_published":"2003-01-01T00:00:00Z","language":[{"iso":"eng"}],"type":"journal_article","abstract":[{"lang":"eng","text":"Male dimorphism is not genetically determined, but is induced by environmental conditions particularly decreasing temperature and density."}],"publist_id":"2235","issue":"15","extern":"1","year":"2003","_id":"3917","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Zwischen Hochzeitsflug und Brudermord: reproduktive Taktiken bei Ameisenmännchen","status":"public","publication_status":"published","intvolume":" 12","publisher":"Schnell und Steiner","author":[{"full_name":"Cremer, Sylvia","first_name":"Sylvia","last_name":"Cremer","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2193-3868"},{"first_name":"Jürgen","last_name":"Heinze","full_name":"Heinze, Jürgen"}],"date_updated":"2021-01-12T07:53:11Z","date_created":"2018-12-11T12:05:53Z","volume":12,"oa_version":"None"},{"supervisor":[{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","first_name":"Thomas A","last_name":"Henzinger"}],"language":[{"iso":"eng"}],"date_published":"2003-12-01T00:00:00Z","page":"1 - 201","citation":{"chicago":"Majumdar, Ritankar. “Symbolic Algorithms for Verification and Control.” University of California, Berkeley, 2003.","mla":"Majumdar, Ritankar. Symbolic Algorithms for Verification and Control. University of California, Berkeley, 2003, pp. 1–201.","short":"R. Majumdar, Symbolic Algorithms for Verification and Control, University of California, Berkeley, 2003.","ista":"Majumdar R. 2003. Symbolic algorithms for verification and control. University of California, Berkeley.","apa":"Majumdar, R. (2003). Symbolic algorithms for verification and control. University of California, Berkeley.","ieee":"R. Majumdar, “Symbolic algorithms for verification and control,” University of California, Berkeley, 2003.","ama":"Majumdar R. Symbolic algorithms for verification and control. 2003:1-201."},"month":"12","day":"01","article_processing_charge":"No","date_created":"2018-12-11T12:08:44Z","date_updated":"2021-01-12T07:56:49Z","oa_version":"None","author":[{"full_name":"Majumdar, Ritankar","first_name":"Ritankar","last_name":"Majumdar"}],"status":"public","publication_status":"published","title":"Symbolic algorithms for verification and control","publisher":"University of California, Berkeley","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"4416","year":"2003","extern":"1","abstract":[{"lang":"eng","text":"Methods for the formal specification and verification of systems are indispensible for the development of complex yet correct systems. In formal verification, the designer describes the system in a modeling language with a well-defined semantics, and this system description is analyzed against a set of correctness requirements. Model checking is an algorithmic technique to check that a system description indeed satisfies correctness requirements given as logical specifications. While successful in hardware verification, the potential for model checking for software and embedded systems has not yet been realized. This is because traditional model checking focuses on systems modeled as finite state-transition graphs. While a natural model for hardware (especially synchronous hardware), state-transition graphs often do not capture software and embedded systems at an appropriate level of granularity. This dissertation considers two orthogonal extensions to finite state-transition graphs making model checking techniques applicable to both a wider class of systems and a wider class of properties.\r\n\r\nThe first direction is an extension to infinite-state structures finitely represented using constraints and operations on constraints. Infinite state arises when we wish to model variables with unbounded range (e.g., integers), or data structures, or real time. We provide a uniform framework of symbolic region algebras to study model checking of infinite-state systems. We also provide sufficient language-independent termination conditions for symbolic model checking algorithms on infinite state systems.\r\n\r\nThe second direction supplements verification with game theoretic reasoning. Games are natural models for interactions between components. We study game theoretic behavior with winning conditions given by temporal logic objectives both in the deterministic and in the probabilistic context. For deterministic games, we provide an extremal model characterization of fixpoint algorithms that link solutions of verification problems to solutions for games. For probabilistic games we study fixpoint characterization of winning probabilities for games with omega-regular winning objectives, and construct (epsilon-)optimal winning strategies."}],"publist_id":"313","type":"dissertation"},{"year":"2003","_id":"4425","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"University of California, Berkeley","status":"public","publication_status":"published","title":"Giotto: A time-triggered language for embedded programming","author":[{"full_name":"Horowitz, Benjamin","first_name":"Benjamin","last_name":"Horowitz"}],"oa_version":"None","date_updated":"2021-01-12T07:56:53Z","date_created":"2018-12-11T12:08:47Z","type":"dissertation","publist_id":"305","abstract":[{"text":"Giotto provides a time-triggered programmer’s model for the implementation of embedded control systems with hard real-time constraints. Giotto’s precise semantics and predictabil- ity make it suitable for safety-critical applications.\r\nGiotto is based around the idea that time-triggered task invocation together with time-triggered mode switching can form a useful programming model for real-time systems. To substantiate this claim, we describe the use of Giotto to refactor the software of a small, autonomous helicopter. The ease with which Giotto expresses the existing software provides evidence that Giotto is an appropriate programming language for control systems.\r\nSince Giotto is a real-time programming language, ensuring that Giotto programs meet their deadlines is crucial. To study precedence-constrained Giotto scheduling, we first examine single-mode, single-processor scheduling. We extend to an infinite, periodic setting the classical problem of meeting deadlines for a set of tasks with release times, deadlines, precedence constraints, and preemption. We then develop an algorithm for scheduling Giotto programs on a single processor by representing Giotto programs as instances of the extended scheduling problem.\r\nNext, we study multi-mode, single-processor Giotto scheduling. This problem is different from classical scheduling problems, since in our precedence-constrained approach, the deadlines of tasks may vary depending on the mode switching behavior of the program. We present conditional scheduling models which capture this varying-deadline behavior. We develop polynomial-time algorithms for some conditional scheduling models, and prove oth- ers to be computationally hard. We show how to represent multi-mode Giotto programs as instances of the model, resulting in an algorithm for scheduling multi-mode Giotto programs on a single processor.\r\nFinally, we show that the problem of scheduling Giotto programs for multiple net- worked processors is strongly NP-hard.","lang":"eng"}],"extern":"1","citation":{"chicago":"Horowitz, Benjamin. “Giotto: A Time-Triggered Language for Embedded Programming.” University of California, Berkeley, 2003.","short":"B. Horowitz, Giotto: A Time-Triggered Language for Embedded Programming, University of California, Berkeley, 2003.","mla":"Horowitz, Benjamin. Giotto: A Time-Triggered Language for Embedded Programming. University of California, Berkeley, 2003, pp. 1–237.","ieee":"B. Horowitz, “Giotto: A time-triggered language for embedded programming,” University of California, Berkeley, 2003.","apa":"Horowitz, B. (2003). Giotto: A time-triggered language for embedded programming. University of California, Berkeley.","ista":"Horowitz B. 2003. Giotto: A time-triggered language for embedded programming. University of California, Berkeley.","ama":"Horowitz B. Giotto: A time-triggered language for embedded programming. 2003:1-237."},"page":"1 - 237","date_published":"2003-10-01T00:00:00Z","language":[{"iso":"eng"}],"supervisor":[{"orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A"}],"article_processing_charge":"No","month":"10","day":"01"},{"doi":"10.1088/0953-4075/36/12/306","date_published":"2003-06-28T00:00:00Z","publication":"Journal of Physics B: Atomic, Molecular and Optical Physics","citation":{"chicago":"Hosten, Onur, Patrizia Vignolo, Anna Minguzzi, Bilal Tanatar, and Mario Tosi. “Free Expansion of Two-Dimensional Condensates with a Vortex.” Journal of Physics B: Atomic, Molecular and Optical Physics. IOP Publishing Ltd., 2003. https://doi.org/10.1088/0953-4075/36/12/306.","short":"O. Hosten, P. Vignolo, A. Minguzzi, B. Tanatar, M. Tosi, Journal of Physics B: Atomic, Molecular and Optical Physics 36 (2003) 2455–2463.","mla":"Hosten, Onur, et al. “Free Expansion of Two-Dimensional Condensates with a Vortex.” Journal of Physics B: Atomic, Molecular and Optical Physics, vol. 36, no. 12, IOP Publishing Ltd., 2003, pp. 2455–63, doi:10.1088/0953-4075/36/12/306.","apa":"Hosten, O., Vignolo, P., Minguzzi, A., Tanatar, B., & Tosi, M. (2003). Free expansion of two-dimensional condensates with a vortex. Journal of Physics B: Atomic, Molecular and Optical Physics. IOP Publishing Ltd. https://doi.org/10.1088/0953-4075/36/12/306","ieee":"O. Hosten, P. Vignolo, A. Minguzzi, B. Tanatar, and M. Tosi, “Free expansion of two-dimensional condensates with a vortex,” Journal of Physics B: Atomic, Molecular and Optical Physics, vol. 36, no. 12. IOP Publishing Ltd., pp. 2455–2463, 2003.","ista":"Hosten O, Vignolo P, Minguzzi A, Tanatar B, Tosi M. 2003. Free expansion of two-dimensional condensates with a vortex. Journal of Physics B: Atomic, Molecular and Optical Physics. 36(12), 2455–2463.","ama":"Hosten O, Vignolo P, Minguzzi A, Tanatar B, Tosi M. Free expansion of two-dimensional condensates with a vortex. Journal of Physics B: Atomic, Molecular and Optical Physics. 2003;36(12):2455-2463. doi:10.1088/0953-4075/36/12/306"},"quality_controlled":0,"page":"2455 - 2463","day":"28","month":"06","author":[{"last_name":"Hosten","first_name":"Onur","orcid":"0000-0002-2031-204X","id":"4C02D85E-F248-11E8-B48F-1D18A9856A87","full_name":"Onur Hosten"},{"last_name":"Vignolo","first_name":"Patrizia","full_name":"Vignolo, Patrizia"},{"full_name":"Minguzzi, Anna","last_name":"Minguzzi","first_name":"Anna"},{"full_name":"Tanatar, Bilal","first_name":"Bilal","last_name":"Tanatar"},{"full_name":"Tosi, Mario P","first_name":"Mario","last_name":"Tosi"}],"date_updated":"2021-01-12T08:03:20Z","date_created":"2018-12-11T11:47:16Z","volume":36,"year":"2003","_id":"576","title":"Free expansion of two-dimensional condensates with a vortex","status":"public","publication_status":"published","publisher":"IOP Publishing Ltd.","intvolume":" 36","abstract":[{"text":"We study the free expansion of a pancake-shaped Bose-condensed gas, which is initially trapped under harmonic confinement and containing a vortex at its centre. In the case of a radial expansion holding the axial confinement fixed we consider various models for the interactions, depending on the thickness of the condensate relative to the value of the scattering length. We are thus able to evaluate different scattering regimes ranging from quasi-three-dimensional (Q3D) to strictly two-dimensional (2D). We find that as the system goes from Q3D to 2D the expansion rate of the condensate increases whereas that of the vortex core decreases. In the Q3D scattering regime we also examine a fully free expansion in 3D and find oscillatory behaviour for the vortex core radius: an initial fast expansion of the vortex core is followed by a slowing down. Such a nonuniform expansion rate of the vortex core implies that the timing of its observation should be chosen appropriately.","lang":"eng"}],"issue":"12","publist_id":"7239","extern":1,"type":"journal_article"},{"page":"1178-1185","quality_controlled":"1","external_id":{"pmid":["14555955"]},"citation":{"chicago":"Rogers, Candida, Vincenzina Reale, Kyuhyung Kim, Heather Chatwin, Chris Li, Peter Evans, and Mario de Bono. “Inhibition of Caenorhabditis Elegans Social Feeding by FMRFamide-Related Peptide Activation of NPR-1.” Nature Neuroscience. Springer Nature, 2003. https://doi.org/10.1038/nn1140.","mla":"Rogers, Candida, et al. “Inhibition of Caenorhabditis Elegans Social Feeding by FMRFamide-Related Peptide Activation of NPR-1.” Nature Neuroscience, vol. 6, no. 11, Springer Nature, 2003, pp. 1178–85, doi:10.1038/nn1140.","short":"C. Rogers, V. Reale, K. Kim, H. Chatwin, C. Li, P. Evans, M. de Bono, Nature Neuroscience 6 (2003) 1178–1185.","ista":"Rogers C, Reale V, Kim K, Chatwin H, Li C, Evans P, de Bono M. 2003. Inhibition of Caenorhabditis elegans social feeding by FMRFamide-related peptide activation of NPR-1. Nature Neuroscience. 6(11), 1178–1185.","apa":"Rogers, C., Reale, V., Kim, K., Chatwin, H., Li, C., Evans, P., & de Bono, M. (2003). Inhibition of Caenorhabditis elegans social feeding by FMRFamide-related peptide activation of NPR-1. Nature Neuroscience. Springer Nature. https://doi.org/10.1038/nn1140","ieee":"C. Rogers et al., “Inhibition of Caenorhabditis elegans social feeding by FMRFamide-related peptide activation of NPR-1,” Nature Neuroscience, vol. 6, no. 11. Springer Nature, pp. 1178–1185, 2003.","ama":"Rogers C, Reale V, Kim K, et al. Inhibition of Caenorhabditis elegans social feeding by FMRFamide-related peptide activation of NPR-1. Nature Neuroscience. 2003;6(11):1178-1185. doi:10.1038/nn1140"},"publication":"Nature Neuroscience","language":[{"iso":"eng"}],"date_published":"2003-10-12T00:00:00Z","doi":"10.1038/nn1140","publication_identifier":{"issn":["1097-6256","1546-1726"]},"day":"12","month":"10","publisher":"Springer Nature","intvolume":" 6","publication_status":"published","status":"public","title":"Inhibition of Caenorhabditis elegans social feeding by FMRFamide-related peptide activation of NPR-1","pmid":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"6156","year":"2003","oa_version":"None","volume":6,"date_updated":"2021-01-12T08:06:25Z","date_created":"2019-03-21T09:47:53Z","author":[{"full_name":"Rogers, Candida","first_name":"Candida","last_name":"Rogers"},{"full_name":"Reale, Vincenzina","last_name":"Reale","first_name":"Vincenzina"},{"last_name":"Kim","first_name":"Kyuhyung","full_name":"Kim, Kyuhyung"},{"full_name":"Chatwin, Heather","last_name":"Chatwin","first_name":"Heather"},{"last_name":"Li","first_name":"Chris","full_name":"Li, Chris"},{"full_name":"Evans, Peter","last_name":"Evans","first_name":"Peter"},{"first_name":"Mario","last_name":"de Bono","id":"4E3FF80E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8347-0443","full_name":"de Bono, Mario"}],"type":"journal_article","extern":"1","issue":"11","abstract":[{"lang":"eng","text":"Social and solitary feeding in natural Caenorhabditis elegans isolates are associated with two alleles of the orphan G-protein-coupled receptor (GPCR) NPR-1: social feeders contain NPR-1 215F, whereas solitary feeders contain NPR-1 215V. Here we identify FMRFamide-related neuropeptides (FaRPs) encoded by the flp-18 and flp-21 genes as NPR-1 ligands and show that these peptides can differentially activate the NPR-1 215F and NPR-1 215V receptors. Multicopy overexpression of flp-21 transformed wild social animals into solitary feeders. Conversely, a flp-21 deletion partially phenocopied the npr-1(null) phenotype, which is consistent with NPR-1 activation by FLP-21 in vivo but also implicates other ligands for NPR-1. Phylogenetic studies indicate that the dominant npr-1 215V allele likely arose from an ancestral npr-1 215F gene in C. elegans. Our data suggest a model in which solitary feeding evolved in an ancestral social strain of C. elegans by a gain-of-function mutation that modified the response of NPR-1 to FLP-18 and FLP-21 ligands."}]}]