[{"publisher":"Genetics Society of America","publication_status":"published","oa_version":"Submitted Version","ec_funded":1,"date_published":"2011-09-01T00:00:00Z","volume":189,"publication":"Genetics","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","intvolume":"       189","isi":1,"issue":"1","article_processing_charge":"No","date_updated":"2025-09-30T08:42:59Z","_id":"3394","external_id":{"isi":["000294721600018"]},"department":[{"_id":"NiBa"}],"citation":{"chicago":"Polechova, Jitka, and Nicholas H Barton. “Genetic Drift Widens the Expected Cline but Narrows the Expected Cline Width.” <i>Genetics</i>. Genetics Society of America, 2011. <a href=\"https://doi.org/10.1534/genetics.111.129817\">https://doi.org/10.1534/genetics.111.129817</a>.","ieee":"J. Polechova and N. H. Barton, “Genetic drift widens the expected cline but narrows the expected cline width,” <i>Genetics</i>, vol. 189, no. 1. Genetics Society of America, pp. 227–235, 2011.","apa":"Polechova, J., &#38; Barton, N. H. (2011). Genetic drift widens the expected cline but narrows the expected cline width. <i>Genetics</i>. Genetics Society of America. <a href=\"https://doi.org/10.1534/genetics.111.129817\">https://doi.org/10.1534/genetics.111.129817</a>","mla":"Polechova, Jitka, and Nicholas H. Barton. “Genetic Drift Widens the Expected Cline but Narrows the Expected Cline Width.” <i>Genetics</i>, vol. 189, no. 1, Genetics Society of America, 2011, pp. 227–35, doi:<a href=\"https://doi.org/10.1534/genetics.111.129817\">10.1534/genetics.111.129817</a>.","ama":"Polechova J, Barton NH. Genetic drift widens the expected cline but narrows the expected cline width. <i>Genetics</i>. 2011;189(1):227-235. doi:<a href=\"https://doi.org/10.1534/genetics.111.129817\">10.1534/genetics.111.129817</a>","short":"J. Polechova, N.H. Barton, Genetics 189 (2011) 227–235.","ista":"Polechova J, Barton NH. 2011. Genetic drift widens the expected cline but narrows the expected cline width. Genetics. 189(1), 227–235."},"language":[{"iso":"eng"}],"publist_id":"3213","corr_author":"1","quality_controlled":"1","status":"public","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3176109/","open_access":"1"}],"abstract":[{"text":"Random genetic drift shifts clines in space, alters their width, and distorts their shape. Such random fluctuations complicate inferences from cline width and position. Notably, the effect of genetic drift on the expected shape of the cline is opposite to the naive (but quite common) misinterpretation of classic results on the expected cline. While random drift on average broadens the overall cline in expected allele frequency, it narrows the width of any particular cline. The opposing effects arise because locally, drift drives alleles to fixation—but fluctuations in position widen the expected cline. The effect of genetic drift can be predicted from standardized variance in allele frequencies, averaged across the habitat: 〈F〉. A cline maintained by spatially varying selection (step change) is expected to be narrower by a factor of  relative to the cline in the absence of drift. The expected cline is broader by the inverse of this factor. In a tension zone maintained by underdominance, the expected cline width is narrower by about 1 – 〈F〉relative to the width in the absence of drift. Individual clines can differ substantially from the expectation, and we give quantitative predictions for the variance in cline position and width. The predictions apply to clines in almost one-dimensional circumstances such as hybrid zones in rivers, deep valleys, or along a coast line and give a guide to what patterns to expect in two dimensions.","lang":"eng"}],"date_created":"2018-12-11T12:03:05Z","oa":1,"type":"journal_article","month":"09","title":"Genetic drift widens the expected cline but narrows the expected cline width","year":"2011","doi":"10.1534/genetics.111.129817","author":[{"id":"3BBFB084-F248-11E8-B48F-1D18A9856A87","full_name":"Polechova, Jitka","last_name":"Polechova","first_name":"Jitka","orcid":"0000-0003-0951-3112"},{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","last_name":"Barton","first_name":"Nicholas H"}],"project":[{"name":"Limits to selection in biology and in evolutionary computation","_id":"25B07788-B435-11E9-9278-68D0E5697425","grant_number":"250152","call_identifier":"FP7"}],"page":"227 - 235","scopus_import":"1","day":"01"},{"citation":{"chicago":"Palero, Ferran, Pere Abello, Enrique Macpherson, Mark Beaumont, and Marta Pascual. “Effect of Oceanographic Barriers and Overfishing on the Population Genetic Structure of the European Spiny Lobster Palinurus Elephas.” <i>Biological Journal of the Linnean Society</i>. Wiley-Blackwell, 2011. <a href=\"https://doi.org/10.1111/j.1095-8312.2011.01728.x\">https://doi.org/10.1111/j.1095-8312.2011.01728.x</a>.","ieee":"F. Palero, P. Abello, E. Macpherson, M. Beaumont, and M. Pascual, “Effect of oceanographic barriers and overfishing on the population genetic structure of the European spiny lobster Palinurus elephas,” <i>Biological Journal of the Linnean Society</i>, vol. 104, no. 2. Wiley-Blackwell, pp. 407–418, 2011.","ama":"Palero F, Abello P, Macpherson E, Beaumont M, Pascual M. Effect of oceanographic barriers and overfishing on the population genetic structure of the European spiny lobster Palinurus elephas. <i>Biological Journal of the Linnean Society</i>. 2011;104(2):407-418. doi:<a href=\"https://doi.org/10.1111/j.1095-8312.2011.01728.x\">10.1111/j.1095-8312.2011.01728.x</a>","mla":"Palero, Ferran, et al. “Effect of Oceanographic Barriers and Overfishing on the Population Genetic Structure of the European Spiny Lobster Palinurus Elephas.” <i>Biological Journal of the Linnean Society</i>, vol. 104, no. 2, Wiley-Blackwell, 2011, pp. 407–18, doi:<a href=\"https://doi.org/10.1111/j.1095-8312.2011.01728.x\">10.1111/j.1095-8312.2011.01728.x</a>.","ista":"Palero F, Abello P, Macpherson E, Beaumont M, Pascual M. 2011. Effect of oceanographic barriers and overfishing on the population genetic structure of the European spiny lobster Palinurus elephas. Biological Journal of the Linnean Society. 104(2), 407–418.","short":"F. Palero, P. Abello, E. Macpherson, M. Beaumont, M. Pascual, Biological Journal of the Linnean Society 104 (2011) 407–418.","apa":"Palero, F., Abello, P., Macpherson, E., Beaumont, M., &#38; Pascual, M. (2011). Effect of oceanographic barriers and overfishing on the population genetic structure of the European spiny lobster Palinurus elephas. <i>Biological Journal of the Linnean Society</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1095-8312.2011.01728.x\">https://doi.org/10.1111/j.1095-8312.2011.01728.x</a>"},"department":[{"_id":"NiBa"}],"external_id":{"isi":["000294902700013"]},"publist_id":"3212","language":[{"iso":"eng"}],"issue":"2","_id":"3395","date_updated":"2025-09-30T08:42:31Z","article_processing_charge":"No","intvolume":"       104","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication":"Biological Journal of the Linnean Society","acknowledgement":"This work was supported by a pre-doctoral fellowship awarded by the Autonomous Government of Catalonia to F.P. (2006FIC-00082). Research was funded by projects FBBVA-BIOCON 08-187/09, CGL2006-13423, and CTM2007-66635. The authors are part of the research group 2009SGR-636, 2009SGR-655, and 2009SGR-1364 of the Generalitat de Catalunya. F.P. acknowledges EU-Synthesys grant (GB-TAF-4474).","isi":1,"publication_status":"published","publisher":"Wiley-Blackwell","date_published":"2011-09-14T00:00:00Z","volume":104,"oa_version":"None","day":"14","scopus_import":"1","page":"407 - 418","author":[{"id":"3F0E2A22-F248-11E8-B48F-1D18A9856A87","full_name":"Palero, Ferran","orcid":"0000-0002-0343-8329","last_name":"Palero","first_name":"Ferran"},{"full_name":"Abello, Pere","first_name":"Pere","last_name":"Abello"},{"full_name":"Macpherson, Enrique","last_name":"Macpherson","first_name":"Enrique"},{"full_name":"Beaumont, Mark","last_name":"Beaumont","first_name":"Mark"},{"full_name":"Pascual, Marta","last_name":"Pascual","first_name":"Marta"}],"doi":"10.1111/j.1095-8312.2011.01728.x","year":"2011","related_material":{"record":[{"status":"public","relation":"research_data","id":"9762"}]},"title":"Effect of oceanographic barriers and overfishing on the population genetic structure of the European spiny lobster Palinurus elephas","month":"09","date_created":"2018-12-11T12:03:06Z","abstract":[{"lang":"eng","text":"Defining population structure and genetic diversity levels is of the utmost importance for developing efficient conservation strategies. Overfishing has caused mean annual catches of the European spiny lobster (Palinurus elephas) to decrease alarmingly along its distribution area. In this context, there is a need for comprehensive studies aiming to evaluate the genetic health of the exploited populations. The present study is based on a set of ten nuclear markers amplified in 331 individuals from ten different localities covering most of P. elephas distribution area. Samples from Atlantic and Mediterranean basins showed small but significant differences, indicating that P. elephas populations do not behave as a single panmictic unit but form two partially-overlapping groups. Despite intense overfishing, our dataset did not recover a recent bottleneck signal, and instead showed a large and stable historical effective size. This result could be accounted for by specific life-history traits (reproduction and longevity) and the limitations of molecular markers in covering recent timescales for nontemporal samples. The findings of the present study emphasize the need to integrate information on effective population sizes and life-history parameters when evaluating population connectivity levels from genetic data."}],"type":"journal_article","corr_author":"1","status":"public","quality_controlled":"1"},{"issue":"21","date_updated":"2025-09-30T08:41:19Z","article_processing_charge":"No","_id":"3396","external_id":{"isi":["000296060100011"]},"citation":{"short":"P. Stockinger, C.-P.J. Heisenberg, J.-L. Maître, Development 138 (2011) 4673–4683.","ista":"Stockinger P, Heisenberg C-PJ, Maître J-L. 2011. Defective neuroepithelial cell cohesion affects tangential branchiomotor neuron migration in the zebrafish neural tube. Development. 138(21), 4673–4683.","ama":"Stockinger P, Heisenberg C-PJ, Maître J-L. Defective neuroepithelial cell cohesion affects tangential branchiomotor neuron migration in the zebrafish neural tube. <i>Development</i>. 2011;138(21):4673-4683. doi:<a href=\"https://doi.org/10.1242/dev.071233\">10.1242/dev.071233</a>","mla":"Stockinger, Petra, et al. “Defective Neuroepithelial Cell Cohesion Affects Tangential Branchiomotor Neuron Migration in the Zebrafish Neural Tube.” <i>Development</i>, vol. 138, no. 21, Company of Biologists, 2011, pp. 4673–83, doi:<a href=\"https://doi.org/10.1242/dev.071233\">10.1242/dev.071233</a>.","apa":"Stockinger, P., Heisenberg, C.-P. J., &#38; Maître, J.-L. (2011). Defective neuroepithelial cell cohesion affects tangential branchiomotor neuron migration in the zebrafish neural tube. <i>Development</i>. Company of Biologists. <a href=\"https://doi.org/10.1242/dev.071233\">https://doi.org/10.1242/dev.071233</a>","ieee":"P. Stockinger, C.-P. J. Heisenberg, and J.-L. Maître, “Defective neuroepithelial cell cohesion affects tangential branchiomotor neuron migration in the zebrafish neural tube,” <i>Development</i>, vol. 138, no. 21. Company of Biologists, pp. 4673–4683, 2011.","chicago":"Stockinger, Petra, Carl-Philipp J Heisenberg, and Jean-Léon Maître. “Defective Neuroepithelial Cell Cohesion Affects Tangential Branchiomotor Neuron Migration in the Zebrafish Neural Tube.” <i>Development</i>. Company of Biologists, 2011. <a href=\"https://doi.org/10.1242/dev.071233\">https://doi.org/10.1242/dev.071233</a>."},"department":[{"_id":"CaHe"}],"language":[{"iso":"eng"}],"has_accepted_license":"1","publist_id":"3210","publication_status":"published","publisher":"Company of Biologists","oa_version":"Published Version","volume":138,"date_published":"2011-09-28T00:00:00Z","publication":"Development","file_date_updated":"2020-07-14T12:46:12Z","intvolume":"       138","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","isi":1,"ddc":["570"],"month":"09","title":"Defective neuroepithelial cell cohesion affects tangential branchiomotor neuron migration in the zebrafish neural tube","author":[{"first_name":"Petra","last_name":"Stockinger","full_name":"Stockinger, Petra","id":"261CB030-E90D-11E9-B182-F697D44B663C"},{"first_name":"Carl-Philipp J","last_name":"Heisenberg","orcid":"0000-0002-0912-4566","id":"39427864-F248-11E8-B48F-1D18A9856A87","full_name":"Heisenberg, Carl-Philipp J"},{"orcid":"0000-0002-3688-1474","first_name":"Jean-Léon","last_name":"Maître","full_name":"Maître, Jean-Léon","id":"48F1E0D8-F248-11E8-B48F-1D18A9856A87"}],"year":"2011","doi":"10.1242/dev.071233","day":"28","page":"4673 - 4683","scopus_import":"1","article_type":"original","corr_author":"1","quality_controlled":"1","status":"public","abstract":[{"text":"Facial branchiomotor neurons (FBMNs) in zebrafish and mouse embryonic hindbrain undergo a characteristic tangential migration from rhombomere (r) 4, where they are born, to r6/7. Cohesion among neuroepithelial cells (NCs) has been suggested to function in FBMN migration by inhibiting FBMNs positioned in the basal neuroepithelium such that they move apically between NCs towards the midline of the neuroepithelium instead of tangentially along the basal side of the neuroepithelium towards r6/7. However, direct experimental evaluation of this hypothesis is still lacking. Here, we have used a combination of biophysical cell adhesion measurements and high-resolution time-lapse microscopy to determine the role of NC cohesion in FBMN migration. We show that reducing NC cohesion by interfering with Cadherin 2 (Cdh2) activity results in FBMNs positioned at the basal side of the neuroepithelium moving apically towards the neural tube midline instead of tangentially towards r6/7. In embryos with strongly reduced NC cohesion, ectopic apical FBMN movement frequently results in fusion of the bilateral FBMN clusters over the apical midline of the neural tube. By contrast, reducing cohesion among FBMNs by interfering with Contactin 2 (Cntn2) expression in these cells has little effect on apical FBMN movement, but reduces the fusion of the bilateral FBMN clusters in embryos with strongly diminished NC cohesion. These data provide direct experimental evidence that NC cohesion functions in tangential FBMN migration by restricting their apical movement.","lang":"eng"}],"date_created":"2018-12-11T12:03:06Z","acknowledged_ssus":[{"_id":"Bio"},{"_id":"PreCl"}],"file":[{"file_id":"6930","file_size":4672439,"checksum":"ca12b79e01ef36c1ef1aea31cf7e7139","date_updated":"2020-07-14T12:46:12Z","creator":"dernst","access_level":"open_access","relation":"main_file","date_created":"2019-10-07T14:19:42Z","content_type":"application/pdf","file_name":"2011_Development_Stockinger.pdf"}],"oa":1,"type":"journal_article"},{"status":"public","quality_controlled":"1","corr_author":"1","type":"journal_article","oa":1,"date_created":"2018-12-11T12:03:06Z","abstract":[{"text":"Recent advances in microscopy techniques and biophysical measurements have provided novel insight into the molecular, cellular and biophysical basis of cell adhesion. However, comparably little is known about a core element of cell–cell adhesion—the energy of adhesion at the cell–cell contact. In this review, we discuss approaches to understand the nature and regulation of adhesion energy, and propose strategies to determine adhesion energy between cells in vitro and in vivo.","lang":"eng"}],"main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3188705/","open_access":"1"}],"title":"The role of adhesion energy in controlling cell-cell contacts","month":"10","day":"01","page":"508 - 514","scopus_import":"1","author":[{"id":"48F1E0D8-F248-11E8-B48F-1D18A9856A87","full_name":"Maître, Jean-Léon","last_name":"Maître","first_name":"Jean-Léon","orcid":"0000-0002-3688-1474"},{"first_name":"Carl-Philipp J","last_name":"Heisenberg","orcid":"0000-0002-0912-4566","full_name":"Heisenberg, Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87"}],"year":"2011","doi":"10.1016/j.ceb.2011.07.004","date_published":"2011-10-01T00:00:00Z","volume":23,"oa_version":"Submitted Version","publication_status":"published","publisher":"Elsevier","isi":1,"intvolume":"        23","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication":"Current Opinion in Cell Biology","_id":"3397","date_updated":"2025-09-30T08:42:02Z","article_processing_charge":"No","issue":"5","publist_id":"3211","language":[{"iso":"eng"}],"citation":{"ama":"Maître J-L, Heisenberg C-PJ. The role of adhesion energy in controlling cell-cell contacts. <i>Current Opinion in Cell Biology</i>. 2011;23(5):508-514. doi:<a href=\"https://doi.org/10.1016/j.ceb.2011.07.004\">10.1016/j.ceb.2011.07.004</a>","mla":"Maître, Jean-Léon, and Carl-Philipp J. Heisenberg. “The Role of Adhesion Energy in Controlling Cell-Cell Contacts.” <i>Current Opinion in Cell Biology</i>, vol. 23, no. 5, Elsevier, 2011, pp. 508–14, doi:<a href=\"https://doi.org/10.1016/j.ceb.2011.07.004\">10.1016/j.ceb.2011.07.004</a>.","ista":"Maître J-L, Heisenberg C-PJ. 2011. The role of adhesion energy in controlling cell-cell contacts. Current Opinion in Cell Biology. 23(5), 508–514.","short":"J.-L. Maître, C.-P.J. Heisenberg, Current Opinion in Cell Biology 23 (2011) 508–514.","apa":"Maître, J.-L., &#38; Heisenberg, C.-P. J. (2011). The role of adhesion energy in controlling cell-cell contacts. <i>Current Opinion in Cell Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ceb.2011.07.004\">https://doi.org/10.1016/j.ceb.2011.07.004</a>","chicago":"Maître, Jean-Léon, and Carl-Philipp J Heisenberg. “The Role of Adhesion Energy in Controlling Cell-Cell Contacts.” <i>Current Opinion in Cell Biology</i>. Elsevier, 2011. <a href=\"https://doi.org/10.1016/j.ceb.2011.07.004\">https://doi.org/10.1016/j.ceb.2011.07.004</a>.","ieee":"J.-L. Maître and C.-P. J. Heisenberg, “The role of adhesion energy in controlling cell-cell contacts,” <i>Current Opinion in Cell Biology</i>, vol. 23, no. 5. Elsevier, pp. 508–514, 2011."},"department":[{"_id":"CaHe"}],"external_id":{"isi":["000296040800002"]}},{"scopus_import":"1","day":"29","year":"2011","doi":"10.1371/journal.pone.0017323","author":[{"last_name":"Cremer","first_name":"Sylvia","orcid":"0000-0002-2193-3868","full_name":"Cremer, Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Alexandra","last_name":"Schrempf","full_name":"Schrempf, Alexandra"},{"last_name":"Heinze","first_name":"Jürgen","full_name":"Heinze, Jürgen"}],"article_number":"e17323","pubrep_id":"377","ddc":["576"],"title":"Competition and opportunity shape the reproductive tactics of males in the ant Cardiocondyla obscurior","month":"03","date_created":"2018-12-11T12:03:07Z","abstract":[{"text":"Context-dependent adjustment of mating tactics can drastically increase the mating success of behaviourally flexible animals. We used the ant Cardiocondyla obscurior as a model system to study adaptive adjustment of male mating tactics. This species shows a male diphenism of wingless fighter males and peaceful winged males. Whereas the wingless males stay and exclusively mate in the maternal colony, the mating behaviour of winged males is plastic. They copulate with female sexuals in their natal nests early in life but later disperse in search for sexuals outside. In this study, we observed the nest-leaving behaviour of winged males under different conditions and found that they adaptively adjust the timing of their dispersal to the availability of mating partners, as well as the presence, and even the type of competitors in their natal nests. In colonies with virgin female queens winged males stayed longest when they were the only male in the nest. They left earlier when mating partners were not available or when other males were present. In the presence of wingless, locally mating fighter males, winged males dispersed earlier than in the presence of docile, winged competitors. This suggests that C. obscurior males are capable of estimating their local breeding chances and adaptively adjust their dispersal behaviour in both an opportunistic and a risk-sensitive way, thus showing hitherto unknown behavioural plasticity in social insect males.","lang":"eng"}],"type":"journal_article","file":[{"file_size":147367,"checksum":"46f8cbde61f06fcacf8fa297cacfa0e5","file_id":"5162","relation":"main_file","date_updated":"2020-07-14T12:46:12Z","access_level":"open_access","creator":"system","date_created":"2018-12-12T10:15:40Z","content_type":"application/pdf","file_name":"IST-2015-377-v1+1_journal.pone.0017323.pdf"}],"oa":1,"corr_author":"1","status":"public","quality_controlled":"1","department":[{"_id":"SyCr"}],"citation":{"ama":"Cremer S, Schrempf A, Heinze J. Competition and opportunity shape the reproductive tactics of males in the ant Cardiocondyla obscurior. <i>PLoS One</i>. 2011;6(3). doi:<a href=\"https://doi.org/10.1371/journal.pone.0017323\">10.1371/journal.pone.0017323</a>","mla":"Cremer, Sylvia, et al. “Competition and Opportunity Shape the Reproductive Tactics of Males in the Ant Cardiocondyla Obscurior.” <i>PLoS One</i>, vol. 6, no. 3, e17323, Public Library of Science, 2011, doi:<a href=\"https://doi.org/10.1371/journal.pone.0017323\">10.1371/journal.pone.0017323</a>.","short":"S. Cremer, A. Schrempf, J. Heinze, PLoS One 6 (2011).","ista":"Cremer S, Schrempf A, Heinze J. 2011. Competition and opportunity shape the reproductive tactics of males in the ant Cardiocondyla obscurior. PLoS One. 6(3), e17323.","apa":"Cremer, S., Schrempf, A., &#38; Heinze, J. (2011). Competition and opportunity shape the reproductive tactics of males in the ant Cardiocondyla obscurior. <i>PLoS One</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pone.0017323\">https://doi.org/10.1371/journal.pone.0017323</a>","chicago":"Cremer, Sylvia, Alexandra Schrempf, and Jürgen Heinze. “Competition and Opportunity Shape the Reproductive Tactics of Males in the Ant Cardiocondyla Obscurior.” <i>PLoS One</i>. Public Library of Science, 2011. <a href=\"https://doi.org/10.1371/journal.pone.0017323\">https://doi.org/10.1371/journal.pone.0017323</a>.","ieee":"S. Cremer, A. Schrempf, and J. Heinze, “Competition and opportunity shape the reproductive tactics of males in the ant Cardiocondyla obscurior,” <i>PLoS One</i>, vol. 6, no. 3. Public Library of Science, 2011."},"external_id":{"isi":["000289054600009"]},"publist_id":"3059","has_accepted_license":"1","language":[{"iso":"eng"}],"issue":"3","_id":"3399","article_processing_charge":"No","date_updated":"2025-09-30T08:40:50Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","intvolume":"         6","file_date_updated":"2020-07-14T12:46:12Z","publication":"PLoS One","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"isi":1,"acknowledgement":"This work was supported by the German Science Foundation (www.dfg.de, He 1623/23).","publisher":"Public Library of Science","publication_status":"published","date_published":"2011-03-29T00:00:00Z","volume":6,"oa_version":"Published Version"},{"abstract":[{"text":"Glutamate is the major excitatory neurotransmitter in the mammalian central nervous system and gates non-selective cation channels. The origins of glutamate receptors are not well understood as they differ structurally and functionally from simple bacterial ligand-gated ion channels. Here we report the discovery of an ionotropic glutamate receptor that combines the typical eukaryotic domain architecture with the 'TXVGYG' signature sequence of the selectivity filter found in K+ channels. This receptor exhibits functional properties intermediate between bacterial and eukaryotic glutamate-gated ion channels, suggesting a link in the evolution of ionotropic glutamate receptors.","lang":"eng"}],"date_created":"2018-12-11T12:03:09Z","oa":1,"file":[{"file_name":"IST-2017-832-v1+1_janovjak.pdf","date_created":"2018-12-12T10:11:36Z","content_type":"application/pdf","file_id":"4891","checksum":"6b68d65aadd97c18d663eb117a0a9d35","file_size":387654,"access_level":"open_access","creator":"system","date_updated":"2020-07-14T12:46:12Z","relation":"main_file"}],"type":"journal_article","corr_author":"1","quality_controlled":"1","status":"public","author":[{"orcid":"0000-0002-8023-9315","last_name":"Janovjak","first_name":"Harald L","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","full_name":"Janovjak, Harald L"},{"full_name":"Sandoz, Guillaume","first_name":"Guillaume","last_name":"Sandoz"},{"full_name":"Isacoff, Ehud","last_name":"Isacoff","first_name":"Ehud"}],"year":"2011","doi":"10.1038/ncomms1231","day":"08","page":"1 - 6","scopus_import":"1","ddc":["570","571"],"pubrep_id":"832","month":"03","title":"Modern ionotropic glutamate receptor with a K+ selectivity signature sequence","publication":"Nature Communications","file_date_updated":"2020-07-14T12:46:12Z","intvolume":"         2","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","isi":1,"publication_status":"published","publisher":"Nature Publishing Group","oa_version":"Submitted Version","date_published":"2011-03-08T00:00:00Z","volume":2,"external_id":{"isi":["000289982600022"]},"citation":{"ama":"Janovjak HL, Sandoz G, Isacoff E. Modern ionotropic glutamate receptor with a K+ selectivity signature sequence. <i>Nature Communications</i>. 2011;2(232):1-6. doi:<a href=\"https://doi.org/10.1038/ncomms1231\">10.1038/ncomms1231</a>","mla":"Janovjak, Harald L., et al. “Modern Ionotropic Glutamate Receptor with a K+ Selectivity Signature Sequence.” <i>Nature Communications</i>, vol. 2, no. 232, Nature Publishing Group, 2011, pp. 1–6, doi:<a href=\"https://doi.org/10.1038/ncomms1231\">10.1038/ncomms1231</a>.","ista":"Janovjak HL, Sandoz G, Isacoff E. 2011. Modern ionotropic glutamate receptor with a K+ selectivity signature sequence. Nature Communications. 2(232), 1–6.","short":"H.L. Janovjak, G. Sandoz, E. Isacoff, Nature Communications 2 (2011) 1–6.","apa":"Janovjak, H. L., Sandoz, G., &#38; Isacoff, E. (2011). Modern ionotropic glutamate receptor with a K+ selectivity signature sequence. <i>Nature Communications</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/ncomms1231\">https://doi.org/10.1038/ncomms1231</a>","chicago":"Janovjak, Harald L, Guillaume Sandoz, and Ehud Isacoff. “Modern Ionotropic Glutamate Receptor with a K+ Selectivity Signature Sequence.” <i>Nature Communications</i>. Nature Publishing Group, 2011. <a href=\"https://doi.org/10.1038/ncomms1231\">https://doi.org/10.1038/ncomms1231</a>.","ieee":"H. L. Janovjak, G. Sandoz, and E. Isacoff, “Modern ionotropic glutamate receptor with a K+ selectivity signature sequence,” <i>Nature Communications</i>, vol. 2, no. 232. Nature Publishing Group, pp. 1–6, 2011."},"department":[{"_id":"HaJa"}],"language":[{"iso":"eng"}],"has_accepted_license":"1","publist_id":"2997","issue":"232","date_updated":"2025-09-30T08:40:22Z","article_processing_charge":"No","_id":"3405"},{"date_updated":"2024-10-09T21:02:32Z","place":"Berlin, Heidelberg","article_processing_charge":"No","_id":"10907","publication_identifier":{"eisbn":["9783642208447"],"isbn":["9783642208430"],"issn":["0302-9743"],"eissn":["1611-3349"]},"citation":{"chicago":"Artner, Nicole M., Adrian Ion, and Walter G. Kropatsch. “Spatio-Temporal Extraction of Articulated Models in a Graph Pyramid.” In <i>Graph-Based Representations in Pattern Recognition</i>, edited by Xiaoyi Jiang, Miquel Ferrer, and Andrea Torsello, 6658:215–24. LNIP. Berlin, Heidelberg: Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-20844-7_22\">https://doi.org/10.1007/978-3-642-20844-7_22</a>.","ieee":"N. M. Artner, A. Ion, and W. G. Kropatsch, “Spatio-temporal extraction of articulated models in a graph pyramid,” in <i>Graph-Based Representations in Pattern Recognition</i>, Münster, Germany, 2011, vol. 6658, pp. 215–224.","mla":"Artner, Nicole M., et al. “Spatio-Temporal Extraction of Articulated Models in a Graph Pyramid.” <i>Graph-Based Representations in Pattern Recognition</i>, edited by Xiaoyi Jiang et al., vol. 6658, Springer, 2011, pp. 215–24, doi:<a href=\"https://doi.org/10.1007/978-3-642-20844-7_22\">10.1007/978-3-642-20844-7_22</a>.","ama":"Artner NM, Ion A, Kropatsch WG. Spatio-temporal extraction of articulated models in a graph pyramid. In: Jiang X, Ferrer M, Torsello A, eds. <i>Graph-Based Representations in Pattern Recognition</i>. Vol 6658. LNIP. Berlin, Heidelberg: Springer; 2011:215-224. doi:<a href=\"https://doi.org/10.1007/978-3-642-20844-7_22\">10.1007/978-3-642-20844-7_22</a>","ista":"Artner NM, Ion A, Kropatsch WG. 2011. Spatio-temporal extraction of articulated models in a graph pyramid. Graph-Based Representations in Pattern Recognition. GbRPR: Graph-based Representations in Pattern RecognitionLNIP, LNCS, vol. 6658, 215–224.","short":"N.M. Artner, A. Ion, W.G. Kropatsch, in:, X. Jiang, M. Ferrer, A. Torsello (Eds.), Graph-Based Representations in Pattern Recognition, Springer, Berlin, Heidelberg, 2011, pp. 215–224.","apa":"Artner, N. M., Ion, A., &#38; Kropatsch, W. G. (2011). Spatio-temporal extraction of articulated models in a graph pyramid. In X. Jiang, M. Ferrer, &#38; A. Torsello (Eds.), <i>Graph-Based Representations in Pattern Recognition</i> (Vol. 6658, pp. 215–224). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-642-20844-7_22\">https://doi.org/10.1007/978-3-642-20844-7_22</a>"},"department":[{"_id":"HeEd"}],"language":[{"iso":"eng"}],"publication_status":"published","publisher":"Springer","oa_version":"None","volume":6658,"date_published":"2011-06-01T00:00:00Z","publication":"Graph-Based Representations in Pattern Recognition","intvolume":"      6658","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","acknowledgement":"This work has been partially supported by the Austrian Science Fund under grants S9103-N13 and P18716-N13.","alternative_title":["LNCS"],"conference":{"end_date":"2011-05-20","location":"Münster, Germany","name":"GbRPR: Graph-based Representations in Pattern Recognition","start_date":"2011-05-18"},"series_title":"LNIP","month":"06","title":"Spatio-temporal extraction of articulated models in a graph pyramid","author":[{"full_name":"Artner, Nicole M.","first_name":"Nicole M.","last_name":"Artner"},{"last_name":"Ion","first_name":"Adrian","full_name":"Ion, Adrian","id":"29F89302-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kropatsch","first_name":"Walter G.","full_name":"Kropatsch, Walter G."}],"year":"2011","doi":"10.1007/978-3-642-20844-7_22","day":"01","scopus_import":"1","page":"215-224","corr_author":"1","quality_controlled":"1","status":"public","abstract":[{"text":"This paper presents a method to create a model of an articulated object using the planar motion in an initialization video. The model consists of rigid parts connected by points of articulation. The rigid parts are described by the positions of salient feature-points tracked throughout the video. Following a filtering step that identifies points that belong to different objects, rigid parts are found by a grouping process in a graph pyramid. Valid articulation points are selected by verifying multiple hypotheses for each pair of parts.","lang":"eng"}],"editor":[{"full_name":"Jiang, Xiaoyi","first_name":"Xiaoyi","last_name":"Jiang"},{"last_name":"Ferrer","first_name":"Miquel","full_name":"Ferrer, Miquel"},{"full_name":"Torsello, Andrea","first_name":"Andrea","last_name":"Torsello"}],"date_created":"2022-03-21T08:08:35Z","type":"conference"},{"volume":108,"date_published":"2011-02-01T00:00:00Z","oa_version":"Published Version","publisher":"National Academy of Sciences","publication_status":"published","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","intvolume":"       108","publication":"Proceedings of the National Academy of Sciences","_id":"9483","article_processing_charge":"No","date_updated":"2021-12-14T08:33:49Z","issue":"5","extern":"1","language":[{"iso":"eng"}],"department":[{"_id":"DaZi"}],"pmid":1,"citation":{"chicago":"Hsieh, Tzung-Fu, Juhyun Shin, Rie Uzawa, Pedro Silva, Stephanie Cohen, Matthew J. Bauer, Meryl Hashimoto, et al. “Regulation of Imprinted Gene Expression in Arabidopsis Endosperm.” <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences, 2011. <a href=\"https://doi.org/10.1073/pnas.1019273108\">https://doi.org/10.1073/pnas.1019273108</a>.","ieee":"T.-F. Hsieh <i>et al.</i>, “Regulation of imprinted gene expression in Arabidopsis endosperm,” <i>Proceedings of the National Academy of Sciences</i>, vol. 108, no. 5. National Academy of Sciences, pp. 1755–1762, 2011.","apa":"Hsieh, T.-F., Shin, J., Uzawa, R., Silva, P., Cohen, S., Bauer, M. J., … Fischer, R. L. (2011). Regulation of imprinted gene expression in Arabidopsis endosperm. <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1019273108\">https://doi.org/10.1073/pnas.1019273108</a>","ama":"Hsieh T-F, Shin J, Uzawa R, et al. Regulation of imprinted gene expression in Arabidopsis endosperm. <i>Proceedings of the National Academy of Sciences</i>. 2011;108(5):1755-1762. doi:<a href=\"https://doi.org/10.1073/pnas.1019273108\">10.1073/pnas.1019273108</a>","mla":"Hsieh, Tzung-Fu, et al. “Regulation of Imprinted Gene Expression in Arabidopsis Endosperm.” <i>Proceedings of the National Academy of Sciences</i>, vol. 108, no. 5, National Academy of Sciences, 2011, pp. 1755–62, doi:<a href=\"https://doi.org/10.1073/pnas.1019273108\">10.1073/pnas.1019273108</a>.","ista":"Hsieh T-F, Shin J, Uzawa R, Silva P, Cohen S, Bauer MJ, Hashimoto M, Kirkbride RC, Harada JJ, Zilberman D, Fischer RL. 2011. Regulation of imprinted gene expression in Arabidopsis endosperm. Proceedings of the National Academy of Sciences. 108(5), 1755–1762.","short":"T.-F. Hsieh, J. Shin, R. Uzawa, P. Silva, S. Cohen, M.J. Bauer, M. Hashimoto, R.C. Kirkbride, J.J. Harada, D. Zilberman, R.L. Fischer, Proceedings of the National Academy of Sciences 108 (2011) 1755–1762."},"publication_identifier":{"eissn":["1091-6490"],"issn":["0027-8424"]},"external_id":{"pmid":["21257907"]},"status":"public","quality_controlled":"1","type":"journal_article","oa":1,"date_created":"2021-06-07T07:40:38Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1073/pnas.1019273108"}],"abstract":[{"text":"Imprinted genes are expressed primarily or exclusively from either the maternal or paternal allele, a phenomenon that occurs in flowering plants and mammals. Flowering plant imprinted gene expression has been described primarily in endosperm, a terminal nutritive tissue consumed by the embryo during seed development or after germination. Imprinted expression in Arabidopsis thaliana endosperm is orchestrated by differences in cytosine DNA methylation between the paternal and maternal genomes as well as by Polycomb group proteins. Currently, only 11 imprinted A. thaliana genes are known. Here, we use extensive sequencing of cDNA libraries to identify 9 paternally expressed and 34 maternally expressed imprinted genes in A. thaliana endosperm that are regulated by the DNA-demethylating glycosylase DEMETER, the DNA methyltransferase MET1, and/or the core Polycomb group protein FIE. These genes encode transcription factors, proteins involved in hormone signaling, components of the ubiquitin protein degradation pathway, regulators of histone and DNA methylation, and small RNA pathway proteins. We also identify maternally expressed genes that may be regulated by unknown mechanisms or deposited from maternal tissues. We did not detect any imprinted genes in the embryo. Our results show that imprinted gene expression is an extensive mechanistically complex phenomenon that likely affects multiple aspects of seed development.","lang":"eng"}],"title":"Regulation of imprinted gene expression in Arabidopsis endosperm","month":"02","article_type":"original","page":"1755-1762","scopus_import":"1","day":"01","year":"2011","doi":"10.1073/pnas.1019273108","author":[{"full_name":"Hsieh, Tzung-Fu","first_name":"Tzung-Fu","last_name":"Hsieh"},{"full_name":"Shin, Juhyun","last_name":"Shin","first_name":"Juhyun"},{"full_name":"Uzawa, Rie","first_name":"Rie","last_name":"Uzawa"},{"first_name":"Pedro","last_name":"Silva","full_name":"Silva, Pedro"},{"full_name":"Cohen, Stephanie","last_name":"Cohen","first_name":"Stephanie"},{"full_name":"Bauer, Matthew J.","last_name":"Bauer","first_name":"Matthew J."},{"full_name":"Hashimoto, Meryl","first_name":"Meryl","last_name":"Hashimoto"},{"last_name":"Kirkbride","first_name":"Ryan C.","full_name":"Kirkbride, Ryan C."},{"full_name":"Harada, John J.","last_name":"Harada","first_name":"John J."},{"id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","full_name":"Zilberman, Daniel","last_name":"Zilberman","first_name":"Daniel","orcid":"0000-0002-0123-8649"},{"first_name":"Robert L.","last_name":"Fischer","full_name":"Fischer, Robert L."}]},{"publication":"Developmental Cell","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","intvolume":"        20","publisher":"Elsevier","publication_status":"published","oa_version":"Published Version","date_published":"2011-06-14T00:00:00Z","volume":20,"external_id":{"pmid":["21664571"]},"pmid":1,"department":[{"_id":"DaZi"}],"publication_identifier":{"issn":["1534-5807"],"eissn":["1878-1551"]},"citation":{"apa":"Zilberman, D. (2011). <i>Balancing parental contributions in plant embryonic gene activation</i>. <i>Developmental Cell</i> (Vol. 20, pp. 735–736). Elsevier. <a href=\"https://doi.org/10.1016/j.devcel.2011.05.018\">https://doi.org/10.1016/j.devcel.2011.05.018</a>","mla":"Zilberman, Daniel. “Balancing Parental Contributions in Plant Embryonic Gene Activation.” <i>Developmental Cell</i>, vol. 20, no. 6, Elsevier, 2011, pp. 735–36, doi:<a href=\"https://doi.org/10.1016/j.devcel.2011.05.018\">10.1016/j.devcel.2011.05.018</a>.","ama":"Zilberman D. <i>Balancing Parental Contributions in Plant Embryonic Gene Activation</i>. Vol 20. Elsevier; 2011:735-736. doi:<a href=\"https://doi.org/10.1016/j.devcel.2011.05.018\">10.1016/j.devcel.2011.05.018</a>","short":"D. Zilberman, Balancing Parental Contributions in Plant Embryonic Gene Activation, Elsevier, 2011.","ista":"Zilberman D. 2011. Balancing parental contributions in plant embryonic gene activation, Elsevier,p.","chicago":"Zilberman, Daniel. <i>Balancing Parental Contributions in Plant Embryonic Gene Activation</i>. <i>Developmental Cell</i>. Vol. 20. Elsevier, 2011. <a href=\"https://doi.org/10.1016/j.devcel.2011.05.018\">https://doi.org/10.1016/j.devcel.2011.05.018</a>.","ieee":"D. Zilberman, <i>Balancing parental contributions in plant embryonic gene activation</i>, vol. 20, no. 6. Elsevier, 2011, pp. 735–736."},"language":[{"iso":"eng"}],"extern":"1","issue":"6","article_processing_charge":"No","date_updated":"2021-12-14T08:34:37Z","_id":"9522","main_file_link":[{"url":"https://doi.org/10.1016/j.devcel.2011.05.018","open_access":"1"}],"abstract":[{"lang":"eng","text":"Little is known about chromatin remodeling events immediately after fertilization. A recent report by Autran et al. (2011) in Cell now shows that chromatin regulatory pathways that silence transposable elements are responsible for global delayed activation of gene expression in the early Arabidopsis embryo."}],"date_created":"2021-06-08T06:23:39Z","oa":1,"type":"other_academic_publication","quality_controlled":"1","status":"public","doi":"10.1016/j.devcel.2011.05.018","year":"2011","author":[{"first_name":"Daniel","last_name":"Zilberman","orcid":"0000-0002-0123-8649","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","full_name":"Zilberman, Daniel"}],"page":"735-736","day":"14","month":"06","title":"Balancing parental contributions in plant embryonic gene activation"},{"year":"2011","doi":"10.5061/dryad.299h8","author":[{"id":"3F0E2A22-F248-11E8-B48F-1D18A9856A87","full_name":"Palero, Ferran","orcid":"0000-0002-0343-8329","last_name":"Palero","first_name":"Ferran"},{"full_name":"Abello, Pere","first_name":"Pere","last_name":"Abello"},{"last_name":"Macpherson","first_name":"Enrique","full_name":"Macpherson, Enrique"},{"last_name":"Beaumont","first_name":"Mark","full_name":"Beaumont, Mark"},{"first_name":"Marta","last_name":"Pascual","full_name":"Pascual, Marta"}],"department":[{"_id":"NiBa"}],"citation":{"chicago":"Palero, Ferran, Pere Abello, Enrique Macpherson, Mark Beaumont, and Marta Pascual. “Data from: Effect of Oceanographic Barriers and Overfishing on the Population Genetic Structure of the European Spiny Lobster (Palinurus Elephas).” IST Austria, 2011. <a href=\"https://doi.org/10.5061/dryad.299h8\">https://doi.org/10.5061/dryad.299h8</a>.","ieee":"F. Palero, P. Abello, E. Macpherson, M. Beaumont, and M. Pascual, “Data from: Effect of oceanographic barriers and overfishing on the population genetic structure of the European spiny lobster (Palinurus elephas).” IST Austria, 2011.","mla":"Palero, Ferran, et al. <i>Data from: Effect of Oceanographic Barriers and Overfishing on the Population Genetic Structure of the European Spiny Lobster (Palinurus Elephas)</i>. IST Austria, 2011, doi:<a href=\"https://doi.org/10.5061/dryad.299h8\">10.5061/dryad.299h8</a>.","ama":"Palero F, Abello P, Macpherson E, Beaumont M, Pascual M. Data from: Effect of oceanographic barriers and overfishing on the population genetic structure of the European spiny lobster (Palinurus elephas). 2011. doi:<a href=\"https://doi.org/10.5061/dryad.299h8\">10.5061/dryad.299h8</a>","short":"F. Palero, P. Abello, E. Macpherson, M. Beaumont, M. Pascual, (2011).","ista":"Palero F, Abello P, Macpherson E, Beaumont M, Pascual M. 2011. Data from: Effect of oceanographic barriers and overfishing on the population genetic structure of the European spiny lobster (Palinurus elephas), IST Austria, <a href=\"https://doi.org/10.5061/dryad.299h8\">10.5061/dryad.299h8</a>.","apa":"Palero, F., Abello, P., Macpherson, E., Beaumont, M., &#38; Pascual, M. (2011). Data from: Effect of oceanographic barriers and overfishing on the population genetic structure of the European spiny lobster (Palinurus elephas). IST Austria. <a href=\"https://doi.org/10.5061/dryad.299h8\">https://doi.org/10.5061/dryad.299h8</a>"},"day":"12","month":"05","article_processing_charge":"No","date_updated":"2025-09-30T08:42:31Z","title":"Data from: Effect of oceanographic barriers and overfishing on the population genetic structure of the European spiny lobster (Palinurus elephas)","_id":"9762","related_material":{"record":[{"id":"3395","status":"public","relation":"used_in_publication"}]},"oa":1,"type":"research_data_reference","main_file_link":[{"open_access":"1","url":"https://doi.org/10.5061/dryad.299h8"}],"abstract":[{"lang":"eng","text":"Defining population structure and genetic diversity levels is of the utmost importance for developing efficient conservation strategies. Overfishing has caused mean annual catches of the European spiny lobster (Palinurus elephas) to decrease alarmingly along its distribution area. In this context, there is a need for comprehensive studies to evaluate the genetic health of the exploited populations. The present work is based on a set of 10 nuclear markers amplified in 331 individuals from 10 different localities covering most of P. elephas distribution area. Samples from Atlantic and Mediterranean basins showed small but significant differences, indicating that P. elephas populations do not behave as a single panmictic unit but form two partially-overlapping groups. Despite intense overfishing, our dataset did not recover a recent bottleneck signal, and showed a large and stable historical effective size instead. This result could be accounted for by specific life history traits (reproduction and longevity) and the limitations of molecular markers in covering very recent timescales for non temporal samples. Our study emphasizes the necessity of integrating information on effective population sizes and life history parameters when evaluating population connectivity levels from genetic data."}],"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","date_created":"2021-08-02T07:11:19Z","oa_version":"Published Version","status":"public","date_published":"2011-05-12T00:00:00Z","publisher":"IST Austria"},{"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","intvolume":"        31","publication":"European Journal of Neuroscience","isi":1,"publisher":"Wiley-Blackwell","publication_status":"published","date_published":"2011-03-23T00:00:00Z","volume":31,"oa_version":"Submitted Version","department":[{"_id":"PeJo"}],"citation":{"chicago":"Vyleta, Nicholas, and Stephen Smith. “Spontaneous Glutamate Release Is Independent of Calcium Influx and Tonically Activated by the Calcium-Sensing Receptor.” <i>European Journal of Neuroscience</i>. Wiley-Blackwell, 2011. <a href=\"https://doi.org/10.1523/JNEUROSCI.6398-10.2011\">https://doi.org/10.1523/JNEUROSCI.6398-10.2011</a>.","ieee":"N. Vyleta and S. Smith, “Spontaneous glutamate release is independent of calcium influx and tonically activated by the calcium-sensing receptor,” <i>European Journal of Neuroscience</i>, vol. 31, no. 12. Wiley-Blackwell, pp. 4593–4606, 2011.","apa":"Vyleta, N., &#38; Smith, S. (2011). Spontaneous glutamate release is independent of calcium influx and tonically activated by the calcium-sensing receptor. <i>European Journal of Neuroscience</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1523/JNEUROSCI.6398-10.2011\">https://doi.org/10.1523/JNEUROSCI.6398-10.2011</a>","mla":"Vyleta, Nicholas, and Stephen Smith. “Spontaneous Glutamate Release Is Independent of Calcium Influx and Tonically Activated by the Calcium-Sensing Receptor.” <i>European Journal of Neuroscience</i>, vol. 31, no. 12, Wiley-Blackwell, 2011, pp. 4593–606, doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.6398-10.2011\">10.1523/JNEUROSCI.6398-10.2011</a>.","ama":"Vyleta N, Smith S. Spontaneous glutamate release is independent of calcium influx and tonically activated by the calcium-sensing receptor. <i>European Journal of Neuroscience</i>. 2011;31(12):4593-4606. doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.6398-10.2011\">10.1523/JNEUROSCI.6398-10.2011</a>","ista":"Vyleta N, Smith S. 2011. Spontaneous glutamate release is independent of calcium influx and tonically activated by the calcium-sensing receptor. European Journal of Neuroscience. 31(12), 4593–4606.","short":"N. Vyleta, S. Smith, European Journal of Neuroscience 31 (2011) 4593–4606."},"external_id":{"isi":["000288750700025"]},"publist_id":"7353","language":[{"iso":"eng"}],"issue":"12","_id":"469","article_processing_charge":"No","date_updated":"2025-09-30T09:25:10Z","date_created":"2018-12-11T11:46:39Z","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3097128/","open_access":"1"}],"abstract":[{"text":"Spontaneous release of glutamate is important for maintaining synaptic strength and controlling spike timing in the brain. Mechanisms regulating spontaneous exocytosis remain poorly understood. Extracellular calcium concentration ([Ca2+]o) regulates Ca2+ entry through voltage-activated calcium channels (VACCs) and consequently is a pivotal determinant of action potential-evoked vesicle fusion. Extracellular Ca 2+ also enhances spontaneous release, but via unknown mechanisms. Here we report that external Ca2+ triggers spontaneous glutamate release more weakly than evoked release in mouse neocortical neurons. Blockade of VACCs has no effect on the spontaneous release rate or its dependence on [Ca2+]o. Intracellular [Ca2+] slowly increases in a minority of neurons following increases in [Ca2+]o. Furthermore, the enhancement of spontaneous release by extracellular calcium is insensitive to chelation of intracellular calcium by BAPTA. Activation of the calcium-sensing receptor (CaSR), a G-protein-coupled receptor present in nerve terminals, by several specific agonists increased spontaneous glutamate release. The frequency of spontaneous synaptic transmission was decreased in CaSR mutant neurons. The concentration-effect relationship for extracellular calcium regulation of spontaneous release was well described by a combination of CaSR-dependent and CaSR-independent mechanisms. Overall these results indicate that extracellular Ca2+ does not trigger spontaneous glutamate release by simply increasing calcium influx but stimulates CaSR and thereby promotes resting spontaneous glutamate release. ","lang":"eng"}],"type":"journal_article","oa":1,"status":"public","quality_controlled":"1","page":"4593 - 4606","scopus_import":"1","day":"23","doi":"10.1523/JNEUROSCI.6398-10.2011","year":"2011","author":[{"last_name":"Vyleta","first_name":"Nicholas","id":"36C4978E-F248-11E8-B48F-1D18A9856A87","full_name":"Vyleta, Nicholas"},{"full_name":"Smith, Stephen","first_name":"Stephen","last_name":"Smith"}],"title":"Spontaneous glutamate release is independent of calcium influx and tonically activated by the calcium-sensing receptor","month":"03"},{"abstract":[{"lang":"eng","text":"BioSig is an open source software library for biomedical signal processing. The aim of the BioSig project is to foster research in biomedical signal processing by providing free and open source software tools for many different application areas. Some of the areas where BioSig can be employed are neuroinformatics, brain-computer interfaces, neurophysiology, psychology, cardiovascular systems, and sleep research. Moreover, the analysis of biosignals such as the electroencephalogram (EEG), electrocorticogram (ECoG), electrocardiogram (ECG), electrooculogram (EOG), electromyogram (EMG), or respiration signals is a very relevant element of the BioSig project. Specifically, BioSig provides solutions for data acquisition, artifact processing, quality control, feature extraction, classification, modeling, and data visualization, to name a few. In this paper, we highlight several methods to help students and researchers to work more efficiently with biomedical signals. "}],"date_created":"2018-12-11T11:46:45Z","oa":1,"file":[{"file_id":"4642","checksum":"8263bbf255171f2054f43f3db5f53b6e","file_size":2863551,"creator":"system","access_level":"open_access","date_updated":"2020-07-14T12:46:35Z","relation":"main_file","file_name":"IST-2018-947-v1+1_2011_Schloegl_BioSig.pdf","date_created":"2018-12-12T10:07:44Z","content_type":"application/pdf"}],"type":"journal_article","corr_author":"1","quality_controlled":"1","status":"public","author":[{"id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","full_name":"Schlögl, Alois","orcid":"0000-0002-5621-8100","last_name":"Schlögl","first_name":"Alois"},{"full_name":"Vidaurre, Carmen","first_name":"Carmen","last_name":"Vidaurre"},{"full_name":"Sander, Tilmann","first_name":"Tilmann","last_name":"Sander"}],"year":"2011","doi":"10.1155/2011/935364","day":"01","scopus_import":"1","article_number":"935364","ddc":["005"],"pubrep_id":"947","month":"01","title":"BioSig: The free and open source software library for biomedical signal processing","publication":"Computational Intelligence and Neuroscience","file_date_updated":"2020-07-14T12:46:35Z","intvolume":"      2011","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","isi":1,"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"publication_status":"published","publisher":"Hindawi Publishing Corporation","oa_version":"Published Version","volume":2011,"date_published":"2011-01-01T00:00:00Z","external_id":{"isi":["000208906100033"]},"citation":{"chicago":"Schlögl, Alois, Carmen Vidaurre, and Tilmann Sander. “BioSig: The Free and Open Source Software Library for Biomedical Signal Processing.” <i>Computational Intelligence and Neuroscience</i>. Hindawi Publishing Corporation, 2011. <a href=\"https://doi.org/10.1155/2011/935364\">https://doi.org/10.1155/2011/935364</a>.","ieee":"A. Schlögl, C. Vidaurre, and T. Sander, “BioSig: The free and open source software library for biomedical signal processing,” <i>Computational Intelligence and Neuroscience</i>, vol. 2011. Hindawi Publishing Corporation, 2011.","apa":"Schlögl, A., Vidaurre, C., &#38; Sander, T. (2011). BioSig: The free and open source software library for biomedical signal processing. <i>Computational Intelligence and Neuroscience</i>. Hindawi Publishing Corporation. <a href=\"https://doi.org/10.1155/2011/935364\">https://doi.org/10.1155/2011/935364</a>","mla":"Schlögl, Alois, et al. “BioSig: The Free and Open Source Software Library for Biomedical Signal Processing.” <i>Computational Intelligence and Neuroscience</i>, vol. 2011, 935364, Hindawi Publishing Corporation, 2011, doi:<a href=\"https://doi.org/10.1155/2011/935364\">10.1155/2011/935364</a>.","ama":"Schlögl A, Vidaurre C, Sander T. BioSig: The free and open source software library for biomedical signal processing. <i>Computational Intelligence and Neuroscience</i>. 2011;2011. doi:<a href=\"https://doi.org/10.1155/2011/935364\">10.1155/2011/935364</a>","short":"A. Schlögl, C. Vidaurre, T. Sander, Computational Intelligence and Neuroscience 2011 (2011).","ista":"Schlögl A, Vidaurre C, Sander T. 2011. BioSig: The free and open source software library for biomedical signal processing. Computational Intelligence and Neuroscience. 2011, 935364."},"department":[{"_id":"ScienComp"},{"_id":"PeJo"}],"language":[{"iso":"eng"}],"has_accepted_license":"1","publist_id":"7330","date_updated":"2025-09-30T09:24:43Z","article_processing_charge":"No","_id":"490"},{"corr_author":"1","status":"public","quality_controlled":"1","date_created":"2018-12-11T11:46:46Z","abstract":[{"text":"In their search for antigens, lymphocytes continuously shuttle among blood vessels, lymph vessels, and lymphatic tissues. Chemokines mediate entry of lymphocytes into lymphatic tissues, and sphingosine 1-phosphate (S1P) promotes localization of lymphocytes to the vasculature. Both signals are sensed through G protein-coupled receptors (GPCRs). Most GPCRs undergo ligand-dependent homologous receptor desensitization, a process that decreases their signaling output after previous exposure to high ligand concentration. Such desensitization can explain why lymphocytes do not take an intermediate position between two signals but rather oscillate between them. The desensitization of S1P receptor 1 (S1PR1) is mediated by GPCR kinase 2 (GRK2). Deletion of GRK2 in lymphocytes compromises desensitization by high vascular S1P concentrations, thereby reducing responsiveness to the chemokine signal and trapping the cells in the vascular compartment. The desensitization kinetics of S1PR1 allows lymphocytes to dynamically shuttle between vasculature and lymphatic tissue, although the positional information in both compartments is static.","lang":"eng"}],"type":"journal_article","title":"Setting the clock for recirculating lymphocytes","month":"11","day":"08","scopus_import":"1","author":[{"id":"4DFA52AE-F248-11E8-B48F-1D18A9856A87","full_name":"Eichner, Alexander","last_name":"Eichner","first_name":"Alexander"},{"orcid":"0000-0002-6620-9179","last_name":"Sixt","first_name":"Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","full_name":"Sixt, Michael K"}],"year":"2011","doi":"10.1126/scisignal.2002617","article_number":"pe43","publication_status":"published","publisher":"American Association for the Advancement of Science","date_published":"2011-11-08T00:00:00Z","volume":4,"oa_version":"None","intvolume":"         4","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication":"Science Signaling","isi":1,"issue":"198","_id":"491","date_updated":"2025-09-30T09:24:17Z","article_processing_charge":"No","citation":{"mla":"Eichner, Alexander, and Michael K. Sixt. “Setting the Clock for Recirculating Lymphocytes.” <i>Science Signaling</i>, vol. 4, no. 198, pe43, American Association for the Advancement of Science, 2011, doi:<a href=\"https://doi.org/10.1126/scisignal.2002617\">10.1126/scisignal.2002617</a>.","ama":"Eichner A, Sixt MK. Setting the clock for recirculating lymphocytes. <i>Science Signaling</i>. 2011;4(198). doi:<a href=\"https://doi.org/10.1126/scisignal.2002617\">10.1126/scisignal.2002617</a>","ista":"Eichner A, Sixt MK. 2011. Setting the clock for recirculating lymphocytes. Science Signaling. 4(198), pe43.","short":"A. Eichner, M.K. Sixt, Science Signaling 4 (2011).","apa":"Eichner, A., &#38; Sixt, M. K. (2011). Setting the clock for recirculating lymphocytes. <i>Science Signaling</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/scisignal.2002617\">https://doi.org/10.1126/scisignal.2002617</a>","chicago":"Eichner, Alexander, and Michael K Sixt. “Setting the Clock for Recirculating Lymphocytes.” <i>Science Signaling</i>. American Association for the Advancement of Science, 2011. <a href=\"https://doi.org/10.1126/scisignal.2002617\">https://doi.org/10.1126/scisignal.2002617</a>.","ieee":"A. Eichner and M. K. Sixt, “Setting the clock for recirculating lymphocytes,” <i>Science Signaling</i>, vol. 4, no. 198. American Association for the Advancement of Science, 2011."},"department":[{"_id":"MiSi"}],"external_id":{"isi":["000296800500002"]},"publist_id":"7329","language":[{"iso":"eng"}]},{"quality_controlled":"1","status":"public","oa":1,"type":"journal_article","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3199389/"}],"abstract":[{"lang":"eng","text":"Cancer stem cells or cancer initiating cells are believed to contribute to cancer recurrence after therapy. MicroRNAs (miRNAs) are short RNA molecules with fundamental roles in gene regulation. The role of miRNAs in cancer stem cells is only poorly understood. Here, we report miRNA expression profiles of glioblastoma stem cell-containing CD133 + cell populations. We find that miR-9, miR-9 * (referred to as miR-9/9 *), miR-17 and miR-106b are highly abundant in CD133 + cells. Furthermore, inhibition of miR-9/9 * or miR-17 leads to reduced neurosphere formation and stimulates cell differentiation. Calmodulin-binding transcription activator 1 (CAMTA1) is a putative transcription factor, which induces the expression of the anti-proliferative cardiac hormone natriuretic peptide A (NPPA). We identify CAMTA1 as an miR-9/9 * and miR-17 target. CAMTA1 expression leads to reduced neurosphere formation and tumour growth in nude mice, suggesting that CAMTA1 can function as tumour suppressor. Consistently, CAMTA1 and NPPA expression correlate with patient survival. Our findings could provide a basis for novel strategies of glioblastoma therapy."}],"date_created":"2018-12-11T11:46:55Z","month":"10","title":"CAMTA1 is a novel tumour suppressor regulated by miR-9/9 * in glioblastoma stem cells","article_type":"original","doi":"10.1038/emboj.2011.301","year":"2011","author":[{"last_name":"Schraivogel","first_name":"Daniel","full_name":"Schraivogel, Daniel"},{"first_name":"Lasse","last_name":"Weinmann","full_name":"Weinmann, Lasse"},{"last_name":"Beier","first_name":"Dagmar","full_name":"Beier, Dagmar"},{"full_name":"Tabatabai, Ghazaleh","first_name":"Ghazaleh","last_name":"Tabatabai"},{"id":"4DFA52AE-F248-11E8-B48F-1D18A9856A87","full_name":"Eichner, Alexander","last_name":"Eichner","first_name":"Alexander"},{"full_name":"Zhu, Jia","last_name":"Zhu","first_name":"Jia"},{"last_name":"Anton","first_name":"Martina","full_name":"Anton, Martina"},{"id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","full_name":"Sixt, Michael K","last_name":"Sixt","first_name":"Michael K","orcid":"0000-0002-6620-9179"},{"last_name":"Weller","first_name":"Michael","full_name":"Weller, Michael"},{"full_name":"Beier, Christoph","last_name":"Beier","first_name":"Christoph"},{"last_name":"Meister","first_name":"Gunter","full_name":"Meister, Gunter"}],"scopus_import":"1","page":"4309 - 4322","day":"19","oa_version":"Submitted Version","volume":30,"date_published":"2011-10-19T00:00:00Z","publisher":"Wiley-Blackwell","publication_status":"published","isi":1,"publication":"EMBO Journal","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","intvolume":"        30","article_processing_charge":"No","date_updated":"2025-09-30T09:23:51Z","_id":"518","issue":"20","language":[{"iso":"eng"}],"publist_id":"7301","external_id":{"pmid":["21857646"],"isi":["000296715800018"]},"pmid":1,"department":[{"_id":"MiSi"}],"citation":{"chicago":"Schraivogel, Daniel, Lasse Weinmann, Dagmar Beier, Ghazaleh Tabatabai, Alexander Eichner, Jia Zhu, Martina Anton, et al. “CAMTA1 Is a Novel Tumour Suppressor Regulated by MiR-9/9 * in Glioblastoma Stem Cells.” <i>EMBO Journal</i>. Wiley-Blackwell, 2011. <a href=\"https://doi.org/10.1038/emboj.2011.301\">https://doi.org/10.1038/emboj.2011.301</a>.","ieee":"D. Schraivogel <i>et al.</i>, “CAMTA1 is a novel tumour suppressor regulated by miR-9/9 * in glioblastoma stem cells,” <i>EMBO Journal</i>, vol. 30, no. 20. Wiley-Blackwell, pp. 4309–4322, 2011.","mla":"Schraivogel, Daniel, et al. “CAMTA1 Is a Novel Tumour Suppressor Regulated by MiR-9/9 * in Glioblastoma Stem Cells.” <i>EMBO Journal</i>, vol. 30, no. 20, Wiley-Blackwell, 2011, pp. 4309–22, doi:<a href=\"https://doi.org/10.1038/emboj.2011.301\">10.1038/emboj.2011.301</a>.","ama":"Schraivogel D, Weinmann L, Beier D, et al. CAMTA1 is a novel tumour suppressor regulated by miR-9/9 * in glioblastoma stem cells. <i>EMBO Journal</i>. 2011;30(20):4309-4322. doi:<a href=\"https://doi.org/10.1038/emboj.2011.301\">10.1038/emboj.2011.301</a>","short":"D. Schraivogel, L. Weinmann, D. Beier, G. Tabatabai, A. Eichner, J. Zhu, M. Anton, M.K. Sixt, M. Weller, C. Beier, G. Meister, EMBO Journal 30 (2011) 4309–4322.","ista":"Schraivogel D, Weinmann L, Beier D, Tabatabai G, Eichner A, Zhu J, Anton M, Sixt MK, Weller M, Beier C, Meister G. 2011. CAMTA1 is a novel tumour suppressor regulated by miR-9/9 * in glioblastoma stem cells. EMBO Journal. 30(20), 4309–4322.","apa":"Schraivogel, D., Weinmann, L., Beier, D., Tabatabai, G., Eichner, A., Zhu, J., … Meister, G. (2011). CAMTA1 is a novel tumour suppressor regulated by miR-9/9 * in glioblastoma stem cells. <i>EMBO Journal</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1038/emboj.2011.301\">https://doi.org/10.1038/emboj.2011.301</a>"}},{"publication_status":"published","publisher":"Springer","oa_version":"Published Version","date_published":"2011-12-01T00:00:00Z","volume":39,"publication":"Formal Methods in System Design","intvolume":"        39","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","isi":1,"issue":"3","date_updated":"2025-09-30T09:23:08Z","article_processing_charge":"No","_id":"531","external_id":{"isi":["000297596900004"]},"citation":{"chicago":"Guerraoui, Rachid, Thomas A Henzinger, and Vasu Singh. “Verification of STM on Relaxed Memory Models.” <i>Formal Methods in System Design</i>. Springer, 2011. <a href=\"https://doi.org/10.1007/s10703-011-0131-3\">https://doi.org/10.1007/s10703-011-0131-3</a>.","ieee":"R. Guerraoui, T. A. Henzinger, and V. Singh, “Verification of STM on relaxed memory models,” <i>Formal Methods in System Design</i>, vol. 39, no. 3. Springer, pp. 297–331, 2011.","ama":"Guerraoui R, Henzinger TA, Singh V. Verification of STM on relaxed memory models. <i>Formal Methods in System Design</i>. 2011;39(3):297-331. doi:<a href=\"https://doi.org/10.1007/s10703-011-0131-3\">10.1007/s10703-011-0131-3</a>","mla":"Guerraoui, Rachid, et al. “Verification of STM on Relaxed Memory Models.” <i>Formal Methods in System Design</i>, vol. 39, no. 3, Springer, 2011, pp. 297–331, doi:<a href=\"https://doi.org/10.1007/s10703-011-0131-3\">10.1007/s10703-011-0131-3</a>.","ista":"Guerraoui R, Henzinger TA, Singh V. 2011. Verification of STM on relaxed memory models. Formal Methods in System Design. 39(3), 297–331.","short":"R. Guerraoui, T.A. Henzinger, V. Singh, Formal Methods in System Design 39 (2011) 297–331.","apa":"Guerraoui, R., Henzinger, T. A., &#38; Singh, V. (2011). Verification of STM on relaxed memory models. <i>Formal Methods in System Design</i>. Springer. <a href=\"https://doi.org/10.1007/s10703-011-0131-3\">https://doi.org/10.1007/s10703-011-0131-3</a>"},"department":[{"_id":"ToHe"}],"language":[{"iso":"eng"}],"publist_id":"7288","corr_author":"1","quality_controlled":"1","status":"public","abstract":[{"lang":"eng","text":"Software transactional memories (STM) are described in the literature with assumptions of sequentially consistent program execution and atomicity of high level operations like read, write, and abort. However, in a realistic setting, processors use relaxed memory models to optimize hardware performance. Moreover, the atomicity of operations depends on the underlying hardware. This paper presents the first approach to verify STMs under relaxed memory models with atomicity of 32 bit loads and stores, and read-modify-write operations. We describe RML, a simple language for expressing concurrent programs. We develop a semantics of RML parametrized by a relaxed memory model. We then present our tool, FOIL, which takes as input the RML description of an STM algorithm restricted to two threads and two variables, and the description of a memory model, and automatically determines the locations of fences, which if inserted, ensure the correctness of the restricted STM algorithm under the given memory model. We use FOIL to verify DSTM, TL2, and McRT STM under the memory models of sequential consistency, total store order, partial store order, and relaxed memory order for two threads and two variables. Finally, we extend the verification results for DSTM and TL2 to an arbitrary number of threads and variables by manually proving that the structural properties of STMs are satisfied at the hardware level of atomicity under the considered relaxed memory models."}],"main_file_link":[{"url":"https://infoscience.epfl.ch/record/178042/files/art3A10.10072Fs10703-011-0131-3.pdf","open_access":"1"}],"date_created":"2018-12-11T11:47:00Z","oa":1,"type":"journal_article","ddc":["000"],"month":"12","title":"Verification of STM on relaxed memory models","author":[{"full_name":"Guerraoui, Rachid","first_name":"Rachid","last_name":"Guerraoui"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger"},{"last_name":"Singh","first_name":"Vasu","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","full_name":"Singh, Vasu"}],"doi":"10.1007/s10703-011-0131-3","year":"2011","day":"01","scopus_import":"1","page":"297 - 331","article_type":"original"},{"_id":"5379","date_updated":"2025-07-10T11:52:28Z","article_processing_charge":"No","language":[{"iso":"eng"}],"has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"citation":{"chicago":"Chatterjee, Krishnendu, and Monika Henzinger. <i>An O(N2) Time Algorithm for Alternating Büchi Games</i>. IST Austria, 2011. <a href=\"https://doi.org/10.15479/AT:IST-2011-0009\">https://doi.org/10.15479/AT:IST-2011-0009</a>.","ieee":"K. Chatterjee and M. Henzinger, <i>An O(n2) time algorithm for alternating Büchi games</i>. IST Austria, 2011.","apa":"Chatterjee, K., &#38; Henzinger, M. (2011). <i>An O(n2) time algorithm for alternating Büchi games</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2011-0009\">https://doi.org/10.15479/AT:IST-2011-0009</a>","ama":"Chatterjee K, Henzinger M. <i>An O(N2) Time Algorithm for Alternating Büchi Games</i>. IST Austria; 2011. doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0009\">10.15479/AT:IST-2011-0009</a>","mla":"Chatterjee, Krishnendu, and Monika Henzinger. <i>An O(N2) Time Algorithm for Alternating Büchi Games</i>. IST Austria, 2011, doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0009\">10.15479/AT:IST-2011-0009</a>.","ista":"Chatterjee K, Henzinger M. 2011. An O(n2) time algorithm for alternating Büchi games, IST Austria, 20p.","short":"K. Chatterjee, M. Henzinger, An O(N2) Time Algorithm for Alternating Büchi Games, IST Austria, 2011."},"department":[{"_id":"KrCh"}],"date_published":"2011-07-11T00:00:00Z","oa_version":"Published Version","publication_status":"published","publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"file_date_updated":"2020-07-14T12:46:39Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"An O(n2) time algorithm for alternating Büchi games","month":"07","pubrep_id":"15","related_material":{"record":[{"id":"3165","relation":"later_version","status":"public"}]},"ddc":["000","004"],"day":"11","page":"20","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","first_name":"Monika H","last_name":"Henzinger"}],"doi":"10.15479/AT:IST-2011-0009","year":"2011","status":"public","type":"technical_report","oa":1,"file":[{"checksum":"0b354264229045d982332fd2cb5b9a26","file_size":388665,"file_id":"5504","relation":"main_file","access_level":"open_access","creator":"system","date_updated":"2020-07-14T12:46:39Z","file_name":"IST-2011-0009_IST-2011-0009.pdf","content_type":"application/pdf","date_created":"2018-12-12T11:53:43Z"}],"date_created":"2018-12-12T11:38:59Z","abstract":[{"lang":"eng","text":"Computing the winning set for Büchi objectives in alternating games on graphs is a central problem in computer aided verification with a large number of applications. The long standing best known upper bound for solving the problem is ̃O(n·m), where n is the number of vertices and m is the number of edges in the graph. We are the first to break the ̃O(n·m) boundary by presenting a new technique that reduces the running time to O(n2). This bound also leads to O(n2) time algorithms for computing the set of almost-sure winning vertices for Büchi objectives (1) in alternating games with probabilistic transitions (improving an earlier bound of O(n·m)), (2) in concurrent graph games with constant actions (improving an earlier bound of O(n3)), and (3) in Markov decision processes (improving for m > n4/3 an earlier bound of O(min(m1.5, m·n2/3)). We also show that the same technique can be used to compute the maximal end-component decomposition of a graph in time O(n2), which is an improvement over earlier bounds for m > n4/3. Finally, we show how to maintain the winning set for Büchi objectives in alternating games under a sequence of edge insertions or a sequence of edge deletions in O(n) amortized time per operation. This is the first dynamic algorithm for this problem."}]},{"publisher":"IST Austria","publication_status":"published","oa_version":"Published Version","status":"public","date_published":"2011-07-11T00:00:00Z","abstract":[{"lang":"eng","text":"We consider 2-player games played on a finite state space for an infinite number of rounds.  The games are concurrent: in each round, the two players (player 1 and player 2) choose their moves independently and simultaneously; the current state and the two moves determine the successor state. We study concurrent games with ω-regular winning conditions specified as parity objectives.  We consider the qualitative analysis problems: the computation of the almost-sure and limit-sure winning set of states, where player 1 can ensure to win with probability 1 and with probability arbitrarily close to 1, respectively. In general the almost-sure and limit-sure winning strategies require both infinite-memory as well as infinite-precision (to describe probabilities). We study the bounded-rationality problem for qualitative analysis of concurrent parity games, where the strategy set for player 1 is restricted to bounded-resource strategies.  In terms of precision, strategies can be deterministic, uniform, finite-precision or infinite-precision;  and in terms of memory, strategies can be memoryless, finite-memory or infinite-memory. We present a precise and complete characterization of the qualitative winning sets for all combinations of classes of strategies. In particular, we show that uniform memoryless strategies are as powerful as finite-precision infinite-memory strategies, and infinite-precision memoryless strategies are as powerful as infinite-precision finite-memory strategies.  We show that the winning sets can be computed in O(n2d+3) time, where n is the size of the game structure and 2d is the number of priorities (or colors), and our algorithms are symbolic. The membership problem of whether a state belongs to a winning set can be decided in NP ∩ coNP. While this complexity is the same as for the simpler class of turn-based parity games, where in each state only one of the two players has a choice of moves, our algorithms,that are obtained by characterization of the winning sets as μ-calculus formulas, are considerably more involved than those for turn-based games."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-12T11:39:00Z","file_date_updated":"2020-07-14T12:46:39Z","oa":1,"file":[{"file_id":"5544","checksum":"0fd38186409be819a911c4990fa79d1f","file_size":500399,"creator":"system","access_level":"open_access","date_updated":"2020-07-14T12:46:39Z","relation":"main_file","file_name":"IST-2011-0008_IST-2011-0008.pdf","date_created":"2018-12-12T11:54:22Z","content_type":"application/pdf"}],"alternative_title":["IST Austria Technical Report"],"type":"technical_report","ddc":["000"],"related_material":{"record":[{"id":"3338","status":"public","relation":"later_version"}]},"pubrep_id":"16","month":"07","date_updated":"2025-06-26T09:28:52Z","title":"Bounded rationality in concurrent parity games","_id":"5380","doi":"10.15479/AT:IST-2011-0008","year":"2011","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"}],"department":[{"_id":"KrCh"}],"page":"53","publication_identifier":{"issn":["2664-1690"]},"day":"11","citation":{"apa":"Chatterjee, K. (2011). <i>Bounded rationality in concurrent parity games</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2011-0008\">https://doi.org/10.15479/AT:IST-2011-0008</a>","short":"K. Chatterjee, Bounded Rationality in Concurrent Parity Games, IST Austria, 2011.","ista":"Chatterjee K. 2011. Bounded rationality in concurrent parity games, IST Austria, 53p.","mla":"Chatterjee, Krishnendu. <i>Bounded Rationality in Concurrent Parity Games</i>. IST Austria, 2011, doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0008\">10.15479/AT:IST-2011-0008</a>.","ama":"Chatterjee K. <i>Bounded Rationality in Concurrent Parity Games</i>. IST Austria; 2011. doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0008\">10.15479/AT:IST-2011-0008</a>","ieee":"K. Chatterjee, <i>Bounded rationality in concurrent parity games</i>. IST Austria, 2011.","chicago":"Chatterjee, Krishnendu. <i>Bounded Rationality in Concurrent Parity Games</i>. IST Austria, 2011. <a href=\"https://doi.org/10.15479/AT:IST-2011-0008\">https://doi.org/10.15479/AT:IST-2011-0008</a>."},"has_accepted_license":"1","language":[{"iso":"eng"}]},{"oa_version":"Published Version","status":"public","date_published":"2011-07-05T00:00:00Z","publisher":"IST Austria","publication_status":"published","oa":1,"file":[{"checksum":"06bf6dfc97f6006e3fd0e9a3f31bc961","file_size":574055,"file_id":"5488","relation":"main_file","access_level":"open_access","creator":"system","date_updated":"2020-07-14T12:46:39Z","file_name":"IST-2011-0007_IST-2011-0007.pdf","date_created":"2018-12-12T11:53:27Z","content_type":"application/pdf"}],"alternative_title":["IST Austria Technical Report"],"type":"technical_report","abstract":[{"lang":"eng","text":"In two-player finite-state stochastic games of partial obser- vation on graphs, in every state of the graph, the players simultaneously choose an action, and their joint actions determine a probability distri- bution over the successor states. The game is played for infinitely many rounds and thus the players construct an infinite path in the graph. We consider reachability objectives where the first player tries to ensure a target state to be visited almost-surely (i.e., with probability 1) or pos- itively (i.e., with positive probability), no matter the strategy of the second player.\r\n\r\nWe classify such games according to the information and to the power of randomization available to the players. On the basis of information, the game can be one-sided with either (a) player 1, or (b) player 2 having partial observation (and the other player has perfect observation), or two- sided with (c) both players having partial observation. On the basis of randomization, (a) the players may not be allowed to use randomization (pure strategies), or (b) they may choose a probability distribution over actions but the actual random choice is external and not visible to the player (actions invisible), or (c) they may use full randomization.\r\n\r\nOur main results for pure strategies are as follows: (1) For one-sided games with player 2 perfect observation we show that (in contrast to full randomized strategies) belief-based (subset-construction based) strate- gies are not sufficient, and present an exponential upper bound on mem- ory both for almost-sure and positive winning strategies; we show that the problem of deciding the existence of almost-sure and positive winning strategies for player 1 is EXPTIME-complete and present symbolic algo- rithms that avoid the explicit exponential construction. (2) For one-sided games with player 1 perfect observation we show that non-elementary memory is both necessary and sufficient for both almost-sure and posi- tive winning strategies. (3) We show that for the general (two-sided) case finite-memory strategies are sufficient for both positive and almost-sure winning, and at least non-elementary memory is required. We establish the equivalence of the almost-sure winning problems for pure strategies and for randomized strategies with actions invisible. Our equivalence re- sult exhibit serious flaws in previous results in the literature: we show a non-elementary memory lower bound for almost-sure winning whereas an exponential upper bound was previously claimed."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2020-07-14T12:46:39Z","date_created":"2018-12-12T11:39:00Z","month":"07","date_updated":"2025-09-30T08:08:45Z","title":"Partial-observation stochastic games: How to win when belief fails","_id":"5381","ddc":["000","005"],"related_material":{"record":[{"relation":"later_version","status":"public","id":"1903"},{"status":"public","relation":"later_version","id":"2211"},{"id":"2955","status":"public","relation":"later_version"}]},"pubrep_id":"17","has_accepted_license":"1","language":[{"iso":"eng"}],"year":"2011","doi":"10.15479/AT:IST-2011-0007","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"}],"department":[{"_id":"KrCh"}],"page":"43","publication_identifier":{"issn":["2664-1690"]},"citation":{"short":"K. Chatterjee, L. Doyen, Partial-Observation Stochastic Games: How to Win When Belief Fails, IST Austria, 2011.","ista":"Chatterjee K, Doyen L. 2011. Partial-observation stochastic games: How to win when belief fails, IST Austria, 43p.","ama":"Chatterjee K, Doyen L. <i>Partial-Observation Stochastic Games: How to Win When Belief Fails</i>. IST Austria; 2011. doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0007\">10.15479/AT:IST-2011-0007</a>","mla":"Chatterjee, Krishnendu, and Laurent Doyen. <i>Partial-Observation Stochastic Games: How to Win When Belief Fails</i>. IST Austria, 2011, doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0007\">10.15479/AT:IST-2011-0007</a>.","apa":"Chatterjee, K., &#38; Doyen, L. (2011). <i>Partial-observation stochastic games: How to win when belief fails</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2011-0007\">https://doi.org/10.15479/AT:IST-2011-0007</a>","ieee":"K. Chatterjee and L. Doyen, <i>Partial-observation stochastic games: How to win when belief fails</i>. IST Austria, 2011.","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. <i>Partial-Observation Stochastic Games: How to Win When Belief Fails</i>. IST Austria, 2011. <a href=\"https://doi.org/10.15479/AT:IST-2011-0007\">https://doi.org/10.15479/AT:IST-2011-0007</a>."},"day":"05"},{"date_published":"2011-06-27T00:00:00Z","status":"public","oa_version":"Published Version","publisher":"IST Austria","publication_status":"published","type":"technical_report","oa":1,"file":[{"date_created":"2018-12-12T11:54:24Z","content_type":"application/pdf","file_name":"IST-2011-0006_IST-2011-0006.pdf","relation":"main_file","date_updated":"2020-07-14T12:46:40Z","access_level":"open_access","creator":"system","file_size":335997,"checksum":"1322b652d6ab07eb5248298a3f91c1cf","file_id":"5546"}],"alternative_title":["IST Austria Technical Report"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2020-07-14T12:46:40Z","date_created":"2018-12-12T11:39:00Z","abstract":[{"lang":"eng","text":"We consider two-player stochastic games played on a finite state space for an infinite num- ber of rounds. The games are concurrent: in each round, the two players (player 1 and player 2) choose their moves independently and simultaneously; the current state and the two moves determine a probability distribution over the successor states. We also consider the important special case of turn-based stochastic games where players make moves in turns, rather than concurrently. We study concurrent games with ω-regular winning conditions specified as parity objectives. The value for player 1 for a parity objective is the maximal probability with which the player can guarantee the satisfaction of the objective against all strategies of the opponent. We study the problem of continuity and robustness of the value function in concurrent and turn-based stochastic parity games with respect to imprecision in the transition probabilities. We present quantitative bounds on the difference of the value function (in terms of the imprecision of the transition probabilities) and show the value continuity for structurally equivalent concurrent games (two games are structurally equivalent if the support of the transition func- tion is same and the probabilities differ). We also show robustness of optimal strategies for structurally equivalent turn-based stochastic parity games. Finally we show that the value continuity property breaks without the structurally equivalent assumption (even for Markov chains) and show that our quantitative bound is asymptotically optimal. Hence our results are tight (the assumption is both necessary and sufficient) and optimal (our quantitative bound is asymptotically optimal)."}],"title":"Robustness of structurally equivalent concurrent parity games","_id":"5382","month":"06","date_updated":"2025-04-15T08:12:24Z","pubrep_id":"18","related_material":{"record":[{"id":"3341","relation":"later_version","status":"public"}]},"ddc":["000","005"],"has_accepted_license":"1","language":[{"iso":"eng"}],"department":[{"_id":"KrCh"}],"page":"18","citation":{"ieee":"K. Chatterjee, <i>Robustness of structurally equivalent concurrent parity games</i>. IST Austria, 2011.","chicago":"Chatterjee, Krishnendu. <i>Robustness of Structurally Equivalent Concurrent Parity Games</i>. IST Austria, 2011. <a href=\"https://doi.org/10.15479/AT:IST-2011-0006\">https://doi.org/10.15479/AT:IST-2011-0006</a>.","apa":"Chatterjee, K. (2011). <i>Robustness of structurally equivalent concurrent parity games</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2011-0006\">https://doi.org/10.15479/AT:IST-2011-0006</a>","ista":"Chatterjee K. 2011. Robustness of structurally equivalent concurrent parity games, IST Austria, 18p.","short":"K. Chatterjee, Robustness of Structurally Equivalent Concurrent Parity Games, IST Austria, 2011.","ama":"Chatterjee K. <i>Robustness of Structurally Equivalent Concurrent Parity Games</i>. IST Austria; 2011. doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0006\">10.15479/AT:IST-2011-0006</a>","mla":"Chatterjee, Krishnendu. <i>Robustness of Structurally Equivalent Concurrent Parity Games</i>. IST Austria, 2011, doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0006\">10.15479/AT:IST-2011-0006</a>."},"day":"27","publication_identifier":{"issn":["2664-1690"]},"year":"2011","doi":"10.15479/AT:IST-2011-0006","author":[{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"}]},{"month":"04","date_updated":"2024-10-09T20:54:31Z","title":"On an efficient decision procedure for imperative tree data structures","_id":"5383","ddc":["000","006"],"pubrep_id":"19","related_material":{"record":[{"relation":"later_version","status":"public","id":"3323"}]},"has_accepted_license":"1","language":[{"iso":"eng"}],"year":"2011","doi":"10.15479/AT:IST-2011-0005","author":[{"id":"447BFB88-F248-11E8-B48F-1D18A9856A87","full_name":"Wies, Thomas","first_name":"Thomas","last_name":"Wies"},{"first_name":"Marco","last_name":"Muñiz","full_name":"Muñiz, Marco"},{"full_name":"Kuncak, Viktor","first_name":"Viktor","last_name":"Kuncak"}],"department":[{"_id":"ToHe"}],"page":"25","publication_identifier":{"issn":["2664-1690"]},"day":"26","citation":{"apa":"Wies, T., Muñiz, M., &#38; Kuncak, V. (2011). <i>On an efficient decision procedure for imperative tree data structures</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2011-0005\">https://doi.org/10.15479/AT:IST-2011-0005</a>","short":"T. Wies, M. Muñiz, V. Kuncak, On an Efficient Decision Procedure for Imperative Tree Data Structures, IST Austria, 2011.","ista":"Wies T, Muñiz M, Kuncak V. 2011. On an efficient decision procedure for imperative tree data structures, IST Austria, 25p.","ama":"Wies T, Muñiz M, Kuncak V. <i>On an Efficient Decision Procedure for Imperative Tree Data Structures</i>. IST Austria; 2011. doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0005\">10.15479/AT:IST-2011-0005</a>","mla":"Wies, Thomas, et al. <i>On an Efficient Decision Procedure for Imperative Tree Data Structures</i>. IST Austria, 2011, doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0005\">10.15479/AT:IST-2011-0005</a>.","ieee":"T. Wies, M. Muñiz, and V. Kuncak, <i>On an efficient decision procedure for imperative tree data structures</i>. IST Austria, 2011.","chicago":"Wies, Thomas, Marco Muñiz, and Viktor Kuncak. <i>On an Efficient Decision Procedure for Imperative Tree Data Structures</i>. IST Austria, 2011. <a href=\"https://doi.org/10.15479/AT:IST-2011-0005\">https://doi.org/10.15479/AT:IST-2011-0005</a>."},"oa_version":"Published Version","status":"public","date_published":"2011-04-26T00:00:00Z","publisher":"IST Austria","publication_status":"published","oa":1,"file":[{"relation":"main_file","date_updated":"2020-07-14T12:46:40Z","access_level":"open_access","creator":"system","file_size":619053,"checksum":"b20029184c4a819c5f4466a4a3d238b5","file_id":"5462","date_created":"2018-12-12T11:53:01Z","content_type":"application/pdf","file_name":"IST-2011-0005_IST-2011-0005.pdf"}],"alternative_title":["IST Austria Technical Report"],"type":"technical_report","abstract":[{"lang":"eng","text":"We present a new decidable logic called TREX for expressing constraints about imperative tree data structures. In particular, TREX supports a transitive closure operator that can express reachability constraints, which often appear in data structure invariants. We show that our logic is closed under weakest precondition computation, which enables its use for automated software verification. We further show that satisfiability of formulas in TREX is decidable in NP. The low complexity makes it an attractive alternative to more expensive logics such as monadic second-order logic (MSOL) over trees, which have been traditionally used for reasoning about tree data structures."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2020-07-14T12:46:40Z","date_created":"2018-12-12T11:39:01Z"}]