[{"year":"2019","_id":"6828","oa_version":"Preprint","title":"Arakawa-Suzuki functors for Whittaker modules","article_processing_charge":"No","month":"11","abstract":[{"text":"In this paper we construct a family of exact functors from the category of Whittaker modules of the simple complex Lie algebra of type  to the category of finite-dimensional modules of the graded affine Hecke algebra of type . Using results of Backelin [2] and of Arakawa-Suzuki [1], we prove that these functors map standard modules to standard modules (or zero) and simple modules to simple modules (or zero). Moreover, we show that each simple module of the graded affine Hecke algebra appears as the image of a simple Whittaker module. Since the Whittaker category contains the BGG category  as a full subcategory, our results generalize results of Arakawa-Suzuki [1], which in turn generalize Schur-Weyl duality between finite-dimensional representations of  and representations of the symmetric group .","lang":"eng"}],"date_published":"2019-11-15T00:00:00Z","status":"public","arxiv":1,"publication_status":"published","article_type":"original","author":[{"last_name":"Brown","full_name":"Brown, Adam","id":"70B7FDF6-608D-11E9-9333-8535E6697425","first_name":"Adam"}],"isi":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa":1,"citation":{"chicago":"Brown, Adam. “Arakawa-Suzuki Functors for Whittaker Modules.” <i>Journal of Algebra</i>. Elsevier, 2019. <a href=\"https://doi.org/10.1016/j.jalgebra.2019.07.027\">https://doi.org/10.1016/j.jalgebra.2019.07.027</a>.","ama":"Brown A. Arakawa-Suzuki functors for Whittaker modules. <i>Journal of Algebra</i>. 2019;538:261-289. doi:<a href=\"https://doi.org/10.1016/j.jalgebra.2019.07.027\">10.1016/j.jalgebra.2019.07.027</a>","ieee":"A. Brown, “Arakawa-Suzuki functors for Whittaker modules,” <i>Journal of Algebra</i>, vol. 538. Elsevier, pp. 261–289, 2019.","mla":"Brown, Adam. “Arakawa-Suzuki Functors for Whittaker Modules.” <i>Journal of Algebra</i>, vol. 538, Elsevier, 2019, pp. 261–89, doi:<a href=\"https://doi.org/10.1016/j.jalgebra.2019.07.027\">10.1016/j.jalgebra.2019.07.027</a>.","ista":"Brown A. 2019. Arakawa-Suzuki functors for Whittaker modules. Journal of Algebra. 538, 261–289.","apa":"Brown, A. (2019). Arakawa-Suzuki functors for Whittaker modules. <i>Journal of Algebra</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jalgebra.2019.07.027\">https://doi.org/10.1016/j.jalgebra.2019.07.027</a>","short":"A. Brown, Journal of Algebra 538 (2019) 261–289."},"volume":538,"page":"261-289","day":"15","publisher":"Elsevier","doi":"10.1016/j.jalgebra.2019.07.027","type":"journal_article","publication":"Journal of Algebra","main_file_link":[{"url":"https://arxiv.org/abs/1805.04676","open_access":"1"}],"intvolume":"       538","quality_controlled":"1","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0021-8693"]},"date_updated":"2023-08-29T07:11:47Z","external_id":{"arxiv":["1805.04676"],"isi":["000487176300011"]},"date_created":"2019-08-22T07:54:13Z","department":[{"_id":"HeEd"}]},{"external_id":{"isi":["000481688700050"],"pmid":["31416964"]},"date_updated":"2023-08-29T07:16:40Z","intvolume":"       365","language":[{"iso":"eng"}],"quality_controlled":"1","department":[{"_id":"EdHa"}],"date_created":"2019-08-25T22:00:51Z","type":"journal_article","page":"705-710","publisher":"American Association for the Advancement of Science","day":"16","doi":"10.1126/science.aau3429","volume":365,"citation":{"ama":"Krndija D, Marjou FE, Guirao B, et al. Active cell migration is critical for steady-state epithelial turnover in the gut. <i>Science</i>. 2019;365(6454):705-710. doi:<a href=\"https://doi.org/10.1126/science.aau3429\">10.1126/science.aau3429</a>","chicago":"Krndija, Denis, Fatima El Marjou, Boris Guirao, Sophie Richon, Olivier Leroy, Yohanns Bellaiche, Edouard B Hannezo, and Danijela Matic Vignjevic. “Active Cell Migration Is Critical for Steady-State Epithelial Turnover in the Gut.” <i>Science</i>. American Association for the Advancement of Science, 2019. <a href=\"https://doi.org/10.1126/science.aau3429\">https://doi.org/10.1126/science.aau3429</a>.","short":"D. Krndija, F.E. Marjou, B. Guirao, S. Richon, O. Leroy, Y. Bellaiche, E.B. Hannezo, D.M. Vignjevic, Science 365 (2019) 705–710.","apa":"Krndija, D., Marjou, F. E., Guirao, B., Richon, S., Leroy, O., Bellaiche, Y., … Vignjevic, D. M. (2019). Active cell migration is critical for steady-state epithelial turnover in the gut. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.aau3429\">https://doi.org/10.1126/science.aau3429</a>","mla":"Krndija, Denis, et al. “Active Cell Migration Is Critical for Steady-State Epithelial Turnover in the Gut.” <i>Science</i>, vol. 365, no. 6454, American Association for the Advancement of Science, 2019, pp. 705–10, doi:<a href=\"https://doi.org/10.1126/science.aau3429\">10.1126/science.aau3429</a>.","ista":"Krndija D, Marjou FE, Guirao B, Richon S, Leroy O, Bellaiche Y, Hannezo EB, Vignjevic DM. 2019. Active cell migration is critical for steady-state epithelial turnover in the gut. Science. 365(6454), 705–710.","ieee":"D. Krndija <i>et al.</i>, “Active cell migration is critical for steady-state epithelial turnover in the gut,” <i>Science</i>, vol. 365, no. 6454. American Association for the Advancement of Science, pp. 705–710, 2019."},"publication":"Science","status":"public","scopus_import":"1","abstract":[{"lang":"eng","text":"Steady-state turnover is a hallmark of epithelial tissues throughout adult life. Intestinal epithelial turnover is marked by continuous cell migration, which is assumed to be driven by mitotic pressure from the crypts. However, the balance of forces in renewal remains ill-defined. Combining biophysical modeling and quantitative three-dimensional tissue imaging with genetic and physical manipulations, we revealed the existence of an actin-related protein 2/3 complex–dependent active migratory force, which explains quantitatively the profiles of cell speed, density, and tissue tension along the villi. Cells migrate collectively with minimal rearrangements while displaying dual—apicobasal and front-back—polarity characterized by actin-rich basal protrusions oriented in the direction of migration. We propose that active migration is a critical component of gut epithelial turnover."}],"date_published":"2019-08-16T00:00:00Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","isi":1,"author":[{"last_name":"Krndija","full_name":"Krndija, Denis","first_name":"Denis"},{"full_name":"Marjou, Fatima El","first_name":"Fatima El","last_name":"Marjou"},{"last_name":"Guirao","full_name":"Guirao, Boris","first_name":"Boris"},{"first_name":"Sophie","full_name":"Richon, Sophie","last_name":"Richon"},{"last_name":"Leroy","first_name":"Olivier","full_name":"Leroy, Olivier"},{"first_name":"Yohanns","full_name":"Bellaiche, Yohanns","last_name":"Bellaiche"},{"last_name":"Hannezo","orcid":"0000-0001-6005-1561","first_name":"Edouard B","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87","full_name":"Hannezo, Edouard B"},{"last_name":"Vignjevic","first_name":"Danijela Matic","full_name":"Vignjevic, Danijela Matic"}],"publication_status":"published","title":"Active cell migration is critical for steady-state epithelial turnover in the gut","oa_version":"None","year":"2019","_id":"6832","issue":"6454","month":"08","pmid":1,"article_processing_charge":"No"},{"author":[{"last_name":"Destagnol","full_name":"Destagnol, Kevin N","id":"44DDECBC-F248-11E8-B48F-1D18A9856A87","first_name":"Kevin N"},{"first_name":"Efthymios","full_name":"Sofos, Efthymios","last_name":"Sofos"}],"publication_status":"published","article_type":"original","oa":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","isi":1,"status":"public","date_published":"2019-11-01T00:00:00Z","abstract":[{"text":"We derive the Hasse principle and weak approximation for fibrations of certain varieties in the spirit of work by Colliot-Thélène–Sansuc and Harpaz–Skorobogatov–Wittenberg. Our varieties are defined through polynomials in many variables and part of our work is devoted to establishing Schinzel's hypothesis for polynomials of this kind. This last part is achieved by using arguments behind Birch's well-known result regarding the Hasse principle for complete intersections with the notable difference that we prove our result in 50% fewer variables than in the classical Birch setting. We also study the problem of square-free values of an integer polynomial with 66.6% fewer variables than in the Birch setting.","lang":"eng"}],"scopus_import":"1","arxiv":1,"article_processing_charge":"No","month":"11","oa_version":"Preprint","year":"2019","_id":"6835","issue":"11","title":"Rational points and prime values of polynomials in moderately many variables","article_number":"102794","department":[{"_id":"TiBr"}],"date_created":"2019-09-01T22:00:55Z","publication_identifier":{"issn":["0007-4497"]},"intvolume":"       156","language":[{"iso":"eng"}],"quality_controlled":"1","external_id":{"isi":["000496342100002"],"arxiv":["1801.03082"]},"date_updated":"2023-08-29T07:18:02Z","publication":"Bulletin des Sciences Mathematiques","main_file_link":[{"url":"https://arxiv.org/abs/1801.03082","open_access":"1"}],"volume":156,"citation":{"ieee":"K. N. Destagnol and E. Sofos, “Rational points and prime values of polynomials in moderately many variables,” <i>Bulletin des Sciences Mathematiques</i>, vol. 156, no. 11. Elsevier, 2019.","apa":"Destagnol, K. N., &#38; Sofos, E. (2019). Rational points and prime values of polynomials in moderately many variables. <i>Bulletin Des Sciences Mathematiques</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.bulsci.2019.102794\">https://doi.org/10.1016/j.bulsci.2019.102794</a>","mla":"Destagnol, Kevin N., and Efthymios Sofos. “Rational Points and Prime Values of Polynomials in Moderately Many Variables.” <i>Bulletin Des Sciences Mathematiques</i>, vol. 156, no. 11, 102794, Elsevier, 2019, doi:<a href=\"https://doi.org/10.1016/j.bulsci.2019.102794\">10.1016/j.bulsci.2019.102794</a>.","ista":"Destagnol KN, Sofos E. 2019. Rational points and prime values of polynomials in moderately many variables. Bulletin des Sciences Mathematiques. 156(11), 102794.","short":"K.N. Destagnol, E. Sofos, Bulletin Des Sciences Mathematiques 156 (2019).","chicago":"Destagnol, Kevin N, and Efthymios Sofos. “Rational Points and Prime Values of Polynomials in Moderately Many Variables.” <i>Bulletin Des Sciences Mathematiques</i>. Elsevier, 2019. <a href=\"https://doi.org/10.1016/j.bulsci.2019.102794\">https://doi.org/10.1016/j.bulsci.2019.102794</a>.","ama":"Destagnol KN, Sofos E. Rational points and prime values of polynomials in moderately many variables. <i>Bulletin des Sciences Mathematiques</i>. 2019;156(11). doi:<a href=\"https://doi.org/10.1016/j.bulsci.2019.102794\">10.1016/j.bulsci.2019.102794</a>"},"type":"journal_article","doi":"10.1016/j.bulsci.2019.102794","day":"01","publisher":"Elsevier"},{"has_accepted_license":"1","date_updated":"2025-07-10T11:53:55Z","external_id":{"isi":["000482219600045"]},"quality_controlled":"1","language":[{"iso":"eng"}],"intvolume":"       572","publication_identifier":{"eissn":["1476-4687"],"issn":["0028-0836"]},"file_date_updated":"2020-07-14T12:47:42Z","date_created":"2019-09-01T22:00:56Z","department":[{"_id":"KrCh"}],"day":"22","doi":"10.1038/s41586-019-1488-5","publisher":"Springer Nature","page":"524-527","type":"journal_article","ec_funded":1,"related_material":{"link":[{"description":"News on IST Homepage","relation":"press_release","url":"https://ist.ac.at/en/news/too-much-inequality-impedes-support-for-public-goods-according-to-research-published-in-nature/"}]},"citation":{"short":"O.P. Hauser, C. Hilbe, K. Chatterjee, M.A. Nowak, Nature 572 (2019) 524–527.","ieee":"O. P. Hauser, C. Hilbe, K. Chatterjee, and M. A. Nowak, “Social dilemmas among unequals,” <i>Nature</i>, vol. 572, no. 7770. Springer Nature, pp. 524–527, 2019.","ista":"Hauser OP, Hilbe C, Chatterjee K, Nowak MA. 2019. Social dilemmas among unequals. Nature. 572(7770), 524–527.","apa":"Hauser, O. P., Hilbe, C., Chatterjee, K., &#38; Nowak, M. A. (2019). Social dilemmas among unequals. <i>Nature</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41586-019-1488-5\">https://doi.org/10.1038/s41586-019-1488-5</a>","mla":"Hauser, Oliver P., et al. “Social Dilemmas among Unequals.” <i>Nature</i>, vol. 572, no. 7770, Springer Nature, 2019, pp. 524–27, doi:<a href=\"https://doi.org/10.1038/s41586-019-1488-5\">10.1038/s41586-019-1488-5</a>.","ama":"Hauser OP, Hilbe C, Chatterjee K, Nowak MA. Social dilemmas among unequals. <i>Nature</i>. 2019;572(7770):524-527. doi:<a href=\"https://doi.org/10.1038/s41586-019-1488-5\">10.1038/s41586-019-1488-5</a>","chicago":"Hauser, Oliver P., Christian Hilbe, Krishnendu Chatterjee, and Martin A. Nowak. “Social Dilemmas among Unequals.” <i>Nature</i>. Springer Nature, 2019. <a href=\"https://doi.org/10.1038/s41586-019-1488-5\">https://doi.org/10.1038/s41586-019-1488-5</a>."},"volume":572,"publication":"Nature","ddc":["000"],"scopus_import":"1","date_published":"2019-08-22T00:00:00Z","abstract":[{"lang":"eng","text":"Direct reciprocity is a powerful mechanism for the evolution of cooperation on the basis of repeated interactions1,2,3,4. It requires that interacting individuals are sufficiently equal, such that everyone faces similar consequences when they cooperate or defect. Yet inequality is ubiquitous among humans5,6 and is generally considered to undermine cooperation and welfare7,8,9,10. Most previous models of reciprocity do not include inequality11,12,13,14,15. These models assume that individuals are the same in all relevant aspects. Here we introduce a general framework to study direct reciprocity among unequal individuals. Our model allows for multiple sources of inequality. Subjects can differ in their endowments, their productivities and in how much they benefit from public goods. We find that extreme inequality prevents cooperation. But if subjects differ in productivity, some endowment inequality can be necessary for cooperation to prevail. Our mathematical predictions are supported by a behavioural experiment in which we vary the endowments and productivities of the subjects. We observe that overall welfare is maximized when the two sources of heterogeneity are aligned, such that more productive individuals receive higher endowments. By contrast, when endowments and productivities are misaligned, cooperation quickly breaks down. Our findings have implications for policy-makers concerned with equity, efficiency and the provisioning of public goods."}],"status":"public","isi":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"file_id":"7828","relation":"main_file","file_size":18577756,"content_type":"application/pdf","access_level":"open_access","creator":"dernst","date_created":"2020-05-14T10:00:32Z","date_updated":"2020-07-14T12:47:42Z","file_name":"2019_Nature_Hauser.pdf","checksum":"a6e0e3168bf62de624e7772cdfaeb26f"}],"oa":1,"article_type":"letter_note","publication_status":"published","project":[{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"}],"author":[{"last_name":"Hauser","first_name":"Oliver P.","full_name":"Hauser, Oliver P."},{"id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","full_name":"Hilbe, Christian","first_name":"Christian","last_name":"Hilbe","orcid":"0000-0001-5116-955X"},{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Martin A.","full_name":"Nowak, Martin A.","last_name":"Nowak"}],"title":"Social dilemmas among unequals","issue":"7770","_id":"6836","year":"2019","oa_version":"Submitted Version","month":"08","article_processing_charge":"No"},{"_id":"6837","issue":"8","year":"2019","oa_version":"None","title":"Migrasomes take center stage","article_processing_charge":"No","pmid":1,"month":"08","scopus_import":"1","abstract":[{"text":"Migrasomes are a recently discovered type of extracellular vesicles that are characteristically generated along retraction fibers in migrating cells. Two studies now show how migrasomes are formed and how they function in the physiologically relevant context of the developing zebrafish embryo.","lang":"eng"}],"date_published":"2019-08-01T00:00:00Z","status":"public","publication_status":"published","author":[{"full_name":"Tavano, Ste","id":"2F162F0C-F248-11E8-B48F-1D18A9856A87","first_name":"Ste","orcid":"0000-0001-9970-7804","last_name":"Tavano"},{"first_name":"Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87","full_name":"Heisenberg, Carl-Philipp J","last_name":"Heisenberg","orcid":"0000-0002-0912-4566"}],"isi":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"ama":"Tavano S, Heisenberg C-PJ. Migrasomes take center stage. <i>Nature Cell Biology</i>. 2019;21(8):918-920. doi:<a href=\"https://doi.org/10.1038/s41556-019-0369-3\">10.1038/s41556-019-0369-3</a>","chicago":"Tavano, Ste, and Carl-Philipp J Heisenberg. “Migrasomes Take Center Stage.” <i>Nature Cell Biology</i>. Springer Nature, 2019. <a href=\"https://doi.org/10.1038/s41556-019-0369-3\">https://doi.org/10.1038/s41556-019-0369-3</a>.","short":"S. Tavano, C.-P.J. Heisenberg, Nature Cell Biology 21 (2019) 918–920.","apa":"Tavano, S., &#38; Heisenberg, C.-P. J. (2019). Migrasomes take center stage. <i>Nature Cell Biology</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41556-019-0369-3\">https://doi.org/10.1038/s41556-019-0369-3</a>","ista":"Tavano S, Heisenberg C-PJ. 2019. Migrasomes take center stage. Nature Cell Biology. 21(8), 918–920.","mla":"Tavano, Ste, and Carl-Philipp J. Heisenberg. “Migrasomes Take Center Stage.” <i>Nature Cell Biology</i>, vol. 21, no. 8, Springer Nature, 2019, pp. 918–20, doi:<a href=\"https://doi.org/10.1038/s41556-019-0369-3\">10.1038/s41556-019-0369-3</a>.","ieee":"S. Tavano and C.-P. J. Heisenberg, “Migrasomes take center stage,” <i>Nature Cell Biology</i>, vol. 21, no. 8. Springer Nature, pp. 918–920, 2019."},"volume":21,"day":"01","publisher":"Springer Nature","doi":"10.1038/s41556-019-0369-3","page":"918-920","type":"journal_article","publication":"Nature Cell Biology","quality_controlled":"1","language":[{"iso":"eng"}],"intvolume":"        21","publication_identifier":{"eissn":["1476-4679"]},"date_updated":"2023-08-29T07:42:20Z","external_id":{"pmid":["31371826"],"isi":["000478029000003"]},"date_created":"2019-09-01T22:00:57Z","department":[{"_id":"CaHe"}]},{"status":"public","scopus_import":"1","abstract":[{"lang":"eng","text":"We discuss thermodynamic properties of harmonically trapped\r\nimperfect quantum gases. The spatial inhomogeneity of these systems imposes\r\na redefinition of the mean-field interparticle potential energy as compared\r\nto the homogeneous case. In our approach, it takes the form a\r\n2N2 ωd, where\r\nN is the number of particles, ω—the harmonic trap frequency, d—system’s\r\ndimensionality, and a is a parameter characterizing the interparticle interaction.\r\nWe provide arguments that this model corresponds to the limiting case of\r\na long-ranged interparticle potential of vanishingly small amplitude. This\r\nconclusion is drawn from a computation similar to the well-known Kac scaling\r\nprocedure, which is presented here in a form adapted to the case of an isotropic\r\nharmonic trap. We show that within the model, the imperfect gas of trapped\r\nrepulsive bosons undergoes the Bose–Einstein condensation provided d > 1.\r\nThe main result of our analysis is that in d = 1 the gas of attractive imperfect\r\nfermions with a = −aF < 0 is thermodynamically equivalent to the gas of\r\nrepulsive bosons with a = aB > 0 provided the parameters aF and aB fulfill\r\nthe relation aB + aF = \u001f. This result supplements similar recent conclusion\r\nabout thermodynamic equivalence of two-dimensional (2D) uniform imperfect\r\nrepulsive Bose and attractive Fermi gases."}],"date_published":"2019-06-13T00:00:00Z","arxiv":1,"author":[{"last_name":"Mysliwy","id":"316457FC-F248-11E8-B48F-1D18A9856A87","full_name":"Mysliwy, Krzysztof","first_name":"Krzysztof"},{"last_name":"Napiórkowski","full_name":"Napiórkowski, Marek","first_name":"Marek"}],"project":[{"call_identifier":"H2020","name":"International IST Doctoral Program","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","oa":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","isi":1,"oa_version":"Preprint","year":"2019","issue":"6","_id":"6840","title":"Thermodynamics of inhomogeneous imperfect quantum gases in harmonic traps","article_processing_charge":"No","month":"06","publication_identifier":{"eissn":["1742-5468"]},"intvolume":"      2019","language":[{"iso":"eng"}],"quality_controlled":"1","external_id":{"isi":["000471650100001"],"arxiv":["1810.02209"]},"date_updated":"2025-03-31T16:01:18Z","article_number":"063101","department":[{"_id":"RoSe"}],"date_created":"2019-09-01T22:00:59Z","volume":2019,"citation":{"ama":"Mysliwy K, Napiórkowski M. Thermodynamics of inhomogeneous imperfect quantum gases in harmonic traps. <i>Journal of Statistical Mechanics: Theory and Experiment</i>. 2019;2019(6). doi:<a href=\"https://doi.org/10.1088/1742-5468/ab190d\">10.1088/1742-5468/ab190d</a>","chicago":"Mysliwy, Krzysztof, and Marek Napiórkowski. “Thermodynamics of Inhomogeneous Imperfect Quantum Gases in Harmonic Traps.” <i>Journal of Statistical Mechanics: Theory and Experiment</i>. IOP Publishing, 2019. <a href=\"https://doi.org/10.1088/1742-5468/ab190d\">https://doi.org/10.1088/1742-5468/ab190d</a>.","short":"K. Mysliwy, M. Napiórkowski, Journal of Statistical Mechanics: Theory and Experiment 2019 (2019).","ieee":"K. Mysliwy and M. Napiórkowski, “Thermodynamics of inhomogeneous imperfect quantum gases in harmonic traps,” <i>Journal of Statistical Mechanics: Theory and Experiment</i>, vol. 2019, no. 6. IOP Publishing, 2019.","apa":"Mysliwy, K., &#38; Napiórkowski, M. (2019). Thermodynamics of inhomogeneous imperfect quantum gases in harmonic traps. <i>Journal of Statistical Mechanics: Theory and Experiment</i>. IOP Publishing. <a href=\"https://doi.org/10.1088/1742-5468/ab190d\">https://doi.org/10.1088/1742-5468/ab190d</a>","ista":"Mysliwy K, Napiórkowski M. 2019. Thermodynamics of inhomogeneous imperfect quantum gases in harmonic traps. Journal of Statistical Mechanics: Theory and Experiment. 2019(6), 063101.","mla":"Mysliwy, Krzysztof, and Marek Napiórkowski. “Thermodynamics of Inhomogeneous Imperfect Quantum Gases in Harmonic Traps.” <i>Journal of Statistical Mechanics: Theory and Experiment</i>, vol. 2019, no. 6, 063101, IOP Publishing, 2019, doi:<a href=\"https://doi.org/10.1088/1742-5468/ab190d\">10.1088/1742-5468/ab190d</a>."},"ec_funded":1,"type":"journal_article","publisher":"IOP Publishing","day":"13","doi":"10.1088/1742-5468/ab190d","publication":"Journal of Statistical Mechanics: Theory and Experiment","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1810.02209"}]},{"citation":{"ama":"Gehér GP, Titkos T, Virosztek D. On isometric embeddings of Wasserstein spaces – the discrete case. <i>Journal of Mathematical Analysis and Applications</i>. 2019;480(2). doi:<a href=\"https://doi.org/10.1016/j.jmaa.2019.123435\">10.1016/j.jmaa.2019.123435</a>","chicago":"Gehér, György Pál, Tamás Titkos, and Daniel Virosztek. “On Isometric Embeddings of Wasserstein Spaces – the Discrete Case.” <i>Journal of Mathematical Analysis and Applications</i>. Elsevier, 2019. <a href=\"https://doi.org/10.1016/j.jmaa.2019.123435\">https://doi.org/10.1016/j.jmaa.2019.123435</a>.","short":"G.P. Gehér, T. Titkos, D. Virosztek, Journal of Mathematical Analysis and Applications 480 (2019).","ieee":"G. P. Gehér, T. Titkos, and D. Virosztek, “On isometric embeddings of Wasserstein spaces – the discrete case,” <i>Journal of Mathematical Analysis and Applications</i>, vol. 480, no. 2. Elsevier, 2019.","ista":"Gehér GP, Titkos T, Virosztek D. 2019. On isometric embeddings of Wasserstein spaces – the discrete case. Journal of Mathematical Analysis and Applications. 480(2), 123435.","mla":"Gehér, György Pál, et al. “On Isometric Embeddings of Wasserstein Spaces – the Discrete Case.” <i>Journal of Mathematical Analysis and Applications</i>, vol. 480, no. 2, 123435, Elsevier, 2019, doi:<a href=\"https://doi.org/10.1016/j.jmaa.2019.123435\">10.1016/j.jmaa.2019.123435</a>.","apa":"Gehér, G. P., Titkos, T., &#38; Virosztek, D. (2019). On isometric embeddings of Wasserstein spaces – the discrete case. <i>Journal of Mathematical Analysis and Applications</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jmaa.2019.123435\">https://doi.org/10.1016/j.jmaa.2019.123435</a>"},"volume":480,"day":"15","doi":"10.1016/j.jmaa.2019.123435","publisher":"Elsevier","ec_funded":1,"type":"journal_article","publication":"Journal of Mathematical Analysis and Applications","main_file_link":[{"url":"https://arxiv.org/abs/1809.01101","open_access":"1"}],"quality_controlled":"1","language":[{"iso":"eng"}],"intvolume":"       480","publication_identifier":{"issn":["0022-247X"],"eissn":["1096-0813"]},"date_updated":"2025-07-10T11:53:55Z","external_id":{"arxiv":["1809.01101"],"isi":["000486563900031"]},"date_created":"2019-09-01T22:01:01Z","department":[{"_id":"LaEr"}],"article_number":"123435","issue":"2","_id":"6843","year":"2019","oa_version":"Preprint","title":"On isometric embeddings of Wasserstein spaces – the discrete case","article_processing_charge":"No","month":"12","abstract":[{"text":"The aim of this short paper is to offer a complete characterization of all (not necessarily surjective) isometric embeddings of the Wasserstein space Wp(X), where S is a countable discrete metric space and 0<p<∞ is any parameter value. Roughly speaking, we will prove that any isometric embedding can be described by a special kind of X×(0,1]-indexed family of nonnegative finite measures. Our result implies that a typical non-surjective isometric embedding of Wp(X) splits mass and does not preserve the shape of measures. In order to stress that the lack of surjectivity is what makes things challenging, we will prove alternatively that Wp(X) is isometrically rigid for all 0<p<∞.","lang":"eng"}],"scopus_import":"1","date_published":"2019-12-15T00:00:00Z","status":"public","arxiv":1,"article_type":"original","publication_status":"published","project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"author":[{"full_name":"Gehér, György Pál","first_name":"György Pál","last_name":"Gehér"},{"last_name":"Titkos","first_name":"Tamás","full_name":"Titkos, Tamás"},{"first_name":"Daniel","id":"48DB45DA-F248-11E8-B48F-1D18A9856A87","full_name":"Virosztek, Daniel","orcid":"0000-0003-1109-5511","last_name":"Virosztek"}],"isi":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1},{"article_processing_charge":"No","month":"09","_id":"6844","issue":"3","year":"2019","oa_version":"Published Version","title":"A mathematical insight into cell labelling experiments for clonal analysis","article_type":"original","publication_status":"published","project":[{"grant_number":"725780","_id":"260018B0-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development"}],"license":"https://creativecommons.org/licenses/by-nc/4.0/","author":[{"last_name":"Picco","first_name":"Noemi","full_name":"Picco, Noemi"},{"first_name":"Simon","full_name":"Hippenmeyer, Simon","id":"37B36620-F248-11E8-B48F-1D18A9856A87","last_name":"Hippenmeyer","orcid":"0000-0003-2279-1061"},{"last_name":"Rodarte","first_name":"Julio","full_name":"Rodarte, Julio","id":"3C70A038-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Streicher","full_name":"Streicher, Carmen","id":"36BCB99C-F248-11E8-B48F-1D18A9856A87","first_name":"Carmen"},{"full_name":"Molnár, Zoltán","first_name":"Zoltán","last_name":"Molnár"},{"last_name":"Maini","first_name":"Philip K.","full_name":"Maini, Philip K."},{"last_name":"Woolley","first_name":"Thomas E.","full_name":"Woolley, Thomas E."}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","isi":1,"file":[{"file_id":"6845","file_size":1192994,"relation":"main_file","content_type":"application/pdf","creator":"dernst","date_created":"2019-09-02T12:05:18Z","access_level":"open_access","file_name":"2019_JournalAnatomy_Picco.pdf","date_updated":"2020-07-14T12:47:42Z","checksum":"160f960844b204057f20896e0e1f8ee7"}],"oa":1,"date_published":"2019-09-01T00:00:00Z","abstract":[{"lang":"eng","text":"Studying the progression of the proliferative and differentiative patterns of neural stem cells at the individual cell level is crucial to the understanding of cortex development and how the disruption of such patterns can lead to malformations and neurodevelopmental diseases. However, our understanding of the precise lineage progression programme at single-cell resolution is still incomplete due to the technical variations in lineage- tracing approaches. One of the key challenges involves developing a robust theoretical framework in which we can integrate experimental observations and introduce correction factors to obtain a reliable and representative description of the temporal modulation of proliferation and differentiation. In order to obtain more conclusive insights, we carry out virtual clonal analysis using mathematical modelling and compare our results against experimental data. Using a dataset obtained with Mosaic Analysis with Double Markers, we illustrate how the theoretical description can be exploited to interpret and reconcile the disparity between virtual and experimental results."}],"scopus_import":"1","status":"public","ddc":["570"],"publication":"Journal of Anatomy","citation":{"short":"N. Picco, S. Hippenmeyer, J. Rodarte, C. Streicher, Z. Molnár, P.K. Maini, T.E. Woolley, Journal of Anatomy 235 (2019) 686–696.","ieee":"N. Picco <i>et al.</i>, “A mathematical insight into cell labelling experiments for clonal analysis,” <i>Journal of Anatomy</i>, vol. 235, no. 3. Wiley, pp. 686–696, 2019.","ista":"Picco N, Hippenmeyer S, Rodarte J, Streicher C, Molnár Z, Maini PK, Woolley TE. 2019. A mathematical insight into cell labelling experiments for clonal analysis. Journal of Anatomy. 235(3), 686–696.","mla":"Picco, Noemi, et al. “A Mathematical Insight into Cell Labelling Experiments for Clonal Analysis.” <i>Journal of Anatomy</i>, vol. 235, no. 3, Wiley, 2019, pp. 686–96, doi:<a href=\"https://doi.org/10.1111/joa.13001\">10.1111/joa.13001</a>.","apa":"Picco, N., Hippenmeyer, S., Rodarte, J., Streicher, C., Molnár, Z., Maini, P. K., &#38; Woolley, T. E. (2019). A mathematical insight into cell labelling experiments for clonal analysis. <i>Journal of Anatomy</i>. Wiley. <a href=\"https://doi.org/10.1111/joa.13001\">https://doi.org/10.1111/joa.13001</a>","ama":"Picco N, Hippenmeyer S, Rodarte J, et al. A mathematical insight into cell labelling experiments for clonal analysis. <i>Journal of Anatomy</i>. 2019;235(3):686-696. doi:<a href=\"https://doi.org/10.1111/joa.13001\">10.1111/joa.13001</a>","chicago":"Picco, Noemi, Simon Hippenmeyer, Julio Rodarte, Carmen Streicher, Zoltán Molnár, Philip K. Maini, and Thomas E. Woolley. “A Mathematical Insight into Cell Labelling Experiments for Clonal Analysis.” <i>Journal of Anatomy</i>. Wiley, 2019. <a href=\"https://doi.org/10.1111/joa.13001\">https://doi.org/10.1111/joa.13001</a>."},"volume":235,"doi":"10.1111/joa.13001","publisher":"Wiley","day":"01","page":"686-696","ec_funded":1,"type":"journal_article","file_date_updated":"2020-07-14T12:47:42Z","date_created":"2019-09-02T11:57:28Z","department":[{"_id":"SiHi"}],"tmp":{"short":"CC BY-NC (4.0)","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","image":"/images/cc_by_nc.png","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode"},"language":[{"iso":"eng"}],"quality_controlled":"1","intvolume":"       235","publication_identifier":{"eissn":["1469-7580"],"issn":["0021-8782"]},"has_accepted_license":"1","date_updated":"2025-04-14T07:43:05Z","external_id":{"isi":["000482426800017"]}},{"month":"07","pmid":1,"article_processing_charge":"No","title":"Thinking about the evolution of complex traits in the era of genome-wide association studies","oa_version":"Published Version","_id":"6855","year":"2019","oa":1,"isi":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","file":[{"date_updated":"2020-07-14T12:47:42Z","file_name":"2019_AnnualReview_Sella.pdf","checksum":"23d3978cf4739a89ce2c3e779f9305ca","relation":"main_file","file_size":411491,"file_id":"6862","access_level":"open_access","date_created":"2019-09-09T07:22:12Z","creator":"dernst","content_type":"application/pdf"}],"license":"https://creativecommons.org/licenses/by/4.0/","author":[{"full_name":"Sella, Guy","first_name":"Guy","last_name":"Sella"},{"last_name":"Barton","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H"}],"publication_status":"published","ddc":["576"],"status":"public","date_published":"2019-07-05T00:00:00Z","scopus_import":"1","abstract":[{"text":"Many traits of interest are highly heritable and genetically complex, meaning that much of the variation they exhibit arises from differences at numerous loci in the genome. Complex traits and their evolution have been studied for more than a century, but only in the last decade have genome-wide association studies (GWASs) in humans begun to reveal their genetic basis. Here, we bring these threads of research together to ask how findings from GWASs can further our understanding of the processes that give rise to heritable variation in complex traits and of the genetic basis of complex trait evolution in response to changing selection pressures (i.e., of polygenic adaptation). Conversely, we ask how evolutionary thinking helps us to interpret findings from GWASs and informs related efforts of practical importance.","lang":"eng"}],"publication":"Annual Review of Genomics and Human Genetics","type":"journal_article","publisher":"Annual Reviews","doi":"10.1146/annurev-genom-083115-022316","day":"05","page":"461-493","volume":20,"citation":{"short":"G. Sella, N.H. Barton, Annual Review of Genomics and Human Genetics 20 (2019) 461–493.","ieee":"G. Sella and N. H. Barton, “Thinking about the evolution of complex traits in the era of genome-wide association studies,” <i>Annual Review of Genomics and Human Genetics</i>, vol. 20. Annual Reviews, pp. 461–493, 2019.","mla":"Sella, Guy, and Nicholas H. Barton. “Thinking about the Evolution of Complex Traits in the Era of Genome-Wide Association Studies.” <i>Annual Review of Genomics and Human Genetics</i>, vol. 20, Annual Reviews, 2019, pp. 461–93, doi:<a href=\"https://doi.org/10.1146/annurev-genom-083115-022316\">10.1146/annurev-genom-083115-022316</a>.","apa":"Sella, G., &#38; Barton, N. H. (2019). Thinking about the evolution of complex traits in the era of genome-wide association studies. <i>Annual Review of Genomics and Human Genetics</i>. Annual Reviews. <a href=\"https://doi.org/10.1146/annurev-genom-083115-022316\">https://doi.org/10.1146/annurev-genom-083115-022316</a>","ista":"Sella G, Barton NH. 2019. Thinking about the evolution of complex traits in the era of genome-wide association studies. Annual Review of Genomics and Human Genetics. 20, 461–493.","ama":"Sella G, Barton NH. Thinking about the evolution of complex traits in the era of genome-wide association studies. <i>Annual Review of Genomics and Human Genetics</i>. 2019;20:461-493. doi:<a href=\"https://doi.org/10.1146/annurev-genom-083115-022316\">10.1146/annurev-genom-083115-022316</a>","chicago":"Sella, Guy, and Nicholas H Barton. “Thinking about the Evolution of Complex Traits in the Era of Genome-Wide Association Studies.” <i>Annual Review of Genomics and Human Genetics</i>. Annual Reviews, 2019. <a href=\"https://doi.org/10.1146/annurev-genom-083115-022316\">https://doi.org/10.1146/annurev-genom-083115-022316</a>."},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"department":[{"_id":"NiBa"}],"file_date_updated":"2020-07-14T12:47:42Z","date_created":"2019-09-07T14:28:29Z","corr_author":"1","external_id":{"pmid":["31283361"],"isi":["000485148400020"]},"has_accepted_license":"1","date_updated":"2024-10-09T20:58:59Z","publication_identifier":{"eissn":["1545-293X"],"issn":["1527-8204"]},"language":[{"iso":"eng"}],"quality_controlled":"1","intvolume":"        20"},{"publication":"New Phytologist","ec_funded":1,"type":"journal_article","page":"1035-1047","doi":"10.1111/nph.16180","publisher":"Wiley","day":"01","volume":224,"citation":{"mla":"Pickup, Melinda, et al. “Mating System Variation in Hybrid Zones: Facilitation, Barriers and Asymmetries to Gene Flow.” <i>New Phytologist</i>, vol. 224, no. 3, Wiley, 2019, pp. 1035–47, doi:<a href=\"https://doi.org/10.1111/nph.16180\">10.1111/nph.16180</a>.","apa":"Pickup, M., Barton, N. H., Brandvain, Y., Fraisse, C., Yakimowski, S., Dixit, T., … Field, D. (2019). Mating system variation in hybrid zones: Facilitation, barriers and asymmetries to gene flow. <i>New Phytologist</i>. Wiley. <a href=\"https://doi.org/10.1111/nph.16180\">https://doi.org/10.1111/nph.16180</a>","ista":"Pickup M, Barton NH, Brandvain Y, Fraisse C, Yakimowski S, Dixit T, Lexer C, Cereghetti E, Field D. 2019. Mating system variation in hybrid zones: Facilitation, barriers and asymmetries to gene flow. New Phytologist. 224(3), 1035–1047.","ieee":"M. Pickup <i>et al.</i>, “Mating system variation in hybrid zones: Facilitation, barriers and asymmetries to gene flow,” <i>New Phytologist</i>, vol. 224, no. 3. Wiley, pp. 1035–1047, 2019.","short":"M. Pickup, N.H. Barton, Y. Brandvain, C. Fraisse, S. Yakimowski, T. Dixit, C. Lexer, E. Cereghetti, D. Field, New Phytologist 224 (2019) 1035–1047.","chicago":"Pickup, Melinda, Nicholas H Barton, Yaniv Brandvain, Christelle Fraisse, Sarah Yakimowski, Tanmay Dixit, Christian Lexer, Eva Cereghetti, and David Field. “Mating System Variation in Hybrid Zones: Facilitation, Barriers and Asymmetries to Gene Flow.” <i>New Phytologist</i>. Wiley, 2019. <a href=\"https://doi.org/10.1111/nph.16180\">https://doi.org/10.1111/nph.16180</a>.","ama":"Pickup M, Barton NH, Brandvain Y, et al. Mating system variation in hybrid zones: Facilitation, barriers and asymmetries to gene flow. <i>New Phytologist</i>. 2019;224(3):1035-1047. doi:<a href=\"https://doi.org/10.1111/nph.16180\">10.1111/nph.16180</a>"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"department":[{"_id":"NiBa"}],"file_date_updated":"2020-07-14T12:47:42Z","date_created":"2019-09-07T14:35:40Z","external_id":{"pmid":["31505037"]},"date_updated":"2025-04-15T07:17:08Z","has_accepted_license":"1","publication_identifier":{"eissn":["1469-8137"],"issn":["0028-646X"]},"intvolume":"       224","quality_controlled":"1","language":[{"iso":"eng"}],"month":"11","pmid":1,"article_processing_charge":"No","title":"Mating system variation in hybrid zones: Facilitation, barriers and asymmetries to gene flow","oa_version":"Published Version","year":"2019","_id":"6856","issue":"3","oa":1,"file":[{"file_size":1511958,"relation":"main_file","file_id":"7011","access_level":"open_access","date_created":"2019-11-13T08:15:05Z","creator":"dernst","content_type":"application/pdf","date_updated":"2020-07-14T12:47:42Z","file_name":"2019_NewPhytologist_Pickup.pdf","checksum":"21e4c95599bbcaf7c483b89954658672"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000-0001-6118-0541","last_name":"Pickup","first_name":"Melinda","id":"2C78037E-F248-11E8-B48F-1D18A9856A87","full_name":"Pickup, Melinda"},{"first_name":"Nicholas H","full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton","orcid":"0000-0002-8548-5240"},{"full_name":"Brandvain, Yaniv","first_name":"Yaniv","last_name":"Brandvain"},{"orcid":"0000-0001-8441-5075","last_name":"Fraisse","first_name":"Christelle","id":"32DF5794-F248-11E8-B48F-1D18A9856A87","full_name":"Fraisse, Christelle"},{"last_name":"Yakimowski","first_name":"Sarah","full_name":"Yakimowski, Sarah"},{"last_name":"Dixit","first_name":"Tanmay","full_name":"Dixit, Tanmay"},{"first_name":"Christian","full_name":"Lexer, Christian","last_name":"Lexer"},{"last_name":"Cereghetti","full_name":"Cereghetti, Eva","id":"71AA91B4-05ED-11EA-8BEB-F5833E63BD63","first_name":"Eva"},{"id":"419049E2-F248-11E8-B48F-1D18A9856A87","full_name":"Field, David","first_name":"David","last_name":"Field","orcid":"0000-0002-4014-8478"}],"project":[{"name":"Mating system and the evolutionary dynamics of hybrid zones","call_identifier":"FP7","grant_number":"329960","_id":"25B36484-B435-11E9-9278-68D0E5697425"},{"name":"Sex chromosomes and species barriers","call_identifier":"FWF","grant_number":"M02463","_id":"2662AADE-B435-11E9-9278-68D0E5697425"}],"article_type":"original","publication_status":"published","ddc":["570"],"status":"public","abstract":[{"text":"Plant mating systems play a key role in structuring genetic variation both within and between species. In hybrid zones, the outcomes and dynamics of hybridization are usually interpreted as the balance between gene flow and selection against hybrids. Yet, mating systems can introduce selective forces that alter these expectations; with diverse outcomes for the level and direction of gene flow depending on variation in outcrossing and whether the mating systems of the species pair are the same or divergent. We present a survey of hybridization in 133 species pairs from 41 plant families and examine how patterns of hybridization vary with mating system. We examine if hybrid zone mode, level of gene flow, asymmetries in gene flow and the frequency of reproductive isolating barriers vary in relation to mating system/s of the species pair. We combine these results with a simulation model and examples from the literature to address two general themes: (i) the two‐way interaction between introgression and the evolution of reproductive systems, and (ii) how mating system can facilitate or restrict interspecific gene flow. We conclude that examining mating system with hybridization provides unique opportunities to understand divergence and the processes underlying reproductive isolation.","lang":"eng"}],"scopus_import":"1","date_published":"2019-11-01T00:00:00Z"},{"oa":1,"isi":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","file":[{"file_name":"2019_BioEssays_Giese.pdf","date_updated":"2020-07-14T12:47:42Z","checksum":"8cc7551bff70b2658f8d5630f228ee12","relation":"main_file","file_size":193248,"file_id":"6939","creator":"dernst","date_created":"2019-10-11T06:59:26Z","access_level":"open_access","content_type":"application/pdf"}],"author":[{"full_name":"Giese, B","first_name":"B","last_name":"Giese"},{"last_name":"Friess","first_name":"J L","full_name":"Friess, J L"},{"last_name":"Schetelig","full_name":"Schetelig, M F ","first_name":"M F "},{"full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","orcid":"0000-0002-8548-5240","last_name":"Barton"},{"full_name":"Messer, Philip","first_name":"Philip","last_name":"Messer"},{"last_name":"Debarre","full_name":"Debarre, Florence","first_name":"Florence"},{"last_name":"Meimberg","full_name":"Meimberg, H","first_name":"H"},{"first_name":"N","full_name":"Windbichler, N","last_name":"Windbichler"},{"full_name":"Boete, C","first_name":"C","last_name":"Boete"}],"publication_status":"published","article_type":"original","ddc":["570"],"status":"public","abstract":[{"lang":"eng","text":"Gene Drives are regarded as future tools with a high potential for population control. Due to their inherent ability to overcome the rules of Mendelian inheritance, gene drives (GD) may spread genes rapidly through populations of sexually reproducing organisms. A release of organisms carrying a GD would constitute a paradigm shift in the handling of genetically modified organisms because gene drive organisms (GDO) are designed to drive their transgenes into wild populations and thereby increase the number of GDOs. The rapid development in this field and its focus on wild populations demand a prospective risk assessment with a focus on exposure related aspects. Presently, it is unclear how adequate risk management could be guaranteed to limit the spread of GDs in time and space, in order to avoid potential adverse effects in socio‐ecological systems.\r\n\r\nThe recent workshop on the “Evaluation of Spatial and Temporal Control of Gene Drives” hosted by the Institute of Safety/Security and Risk Sciences (ISR) in Vienna aimed at gaining some insight into the potential population dynamic behavior of GDs and appropriate measures of control. Scientists from France, Germany, England, and the USA discussed both topics in this meeting on April 4–5, 2019. This article summarizes results of the workshop."}],"scopus_import":"1","date_published":"2019-11-01T00:00:00Z","month":"11","article_processing_charge":"No","title":"Gene Drives: Dynamics and regulatory matters – A report from the workshop “Evaluation of spatial and temporal control of Gene Drives”, 4 – 5 April 2019, Vienna","oa_version":"Published Version","issue":"11","_id":"6857","year":"2019","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"department":[{"_id":"NiBa"}],"article_number":"1900151","date_created":"2019-09-07T14:40:03Z","file_date_updated":"2020-07-14T12:47:42Z","external_id":{"isi":["000489502000001"]},"has_accepted_license":"1","date_updated":"2023-08-30T06:56:26Z","publication_identifier":{"eissn":["1521-1878"]},"language":[{"iso":"eng"}],"quality_controlled":"1","intvolume":"        41","publication":"BioEssays","type":"journal_article","publisher":"Wiley","doi":"10.1002/bies.201900151","day":"01","volume":41,"citation":{"short":"B. Giese, J.L. Friess, M.F. Schetelig, N.H. Barton, P. Messer, F. Debarre, H. Meimberg, N. Windbichler, C. Boete, BioEssays 41 (2019).","ista":"Giese B, Friess JL, Schetelig MF, Barton NH, Messer P, Debarre F, Meimberg H, Windbichler N, Boete C. 2019. Gene Drives: Dynamics and regulatory matters – A report from the workshop “Evaluation of spatial and temporal control of Gene Drives”, 4 – 5 April 2019, Vienna. BioEssays. 41(11), 1900151.","mla":"Giese, B., et al. “Gene Drives: Dynamics and Regulatory Matters – A Report from the Workshop ‘Evaluation of Spatial and Temporal Control of Gene Drives’, 4 – 5 April 2019, Vienna.” <i>BioEssays</i>, vol. 41, no. 11, 1900151, Wiley, 2019, doi:<a href=\"https://doi.org/10.1002/bies.201900151\">10.1002/bies.201900151</a>.","apa":"Giese, B., Friess, J. L., Schetelig, M. F., Barton, N. H., Messer, P., Debarre, F., … Boete, C. (2019). Gene Drives: Dynamics and regulatory matters – A report from the workshop “Evaluation of spatial and temporal control of Gene Drives”, 4 – 5 April 2019, Vienna. <i>BioEssays</i>. Wiley. <a href=\"https://doi.org/10.1002/bies.201900151\">https://doi.org/10.1002/bies.201900151</a>","ieee":"B. Giese <i>et al.</i>, “Gene Drives: Dynamics and regulatory matters – A report from the workshop ‘Evaluation of spatial and temporal control of Gene Drives’, 4 – 5 April 2019, Vienna,” <i>BioEssays</i>, vol. 41, no. 11. Wiley, 2019.","ama":"Giese B, Friess JL, Schetelig MF, et al. Gene Drives: Dynamics and regulatory matters – A report from the workshop “Evaluation of spatial and temporal control of Gene Drives”, 4 – 5 April 2019, Vienna. <i>BioEssays</i>. 2019;41(11). doi:<a href=\"https://doi.org/10.1002/bies.201900151\">10.1002/bies.201900151</a>","chicago":"Giese, B, J L Friess, M F  Schetelig, Nicholas H Barton, Philip Messer, Florence Debarre, H Meimberg, N Windbichler, and C Boete. “Gene Drives: Dynamics and Regulatory Matters – A Report from the Workshop ‘Evaluation of Spatial and Temporal Control of Gene Drives’, 4 – 5 April 2019, Vienna.” <i>BioEssays</i>. Wiley, 2019. <a href=\"https://doi.org/10.1002/bies.201900151\">https://doi.org/10.1002/bies.201900151</a>."}},{"title":"Is speciation driven by cycles of mixing and isolation?","year":"2019","_id":"6858","issue":"2","oa_version":"Published Version","month":"03","article_processing_charge":"No","ddc":["570"],"date_published":"2019-03-01T00:00:00Z","scopus_import":"1","status":"public","file":[{"date_updated":"2020-10-02T09:16:44Z","file_name":"2019_NSR_Barton.pdf","checksum":"571d60fa21a568607d1fd04e119da88c","success":1,"relation":"main_file","file_size":106463,"file_id":"8595","access_level":"open_access","date_created":"2020-10-02T09:16:44Z","creator":"dernst","content_type":"application/pdf"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","isi":1,"oa":1,"publication_status":"published","article_type":"review","author":[{"first_name":"Nicholas H","full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton","orcid":"0000-0002-8548-5240"}],"page":"291-292","day":"01","publisher":"Oxford University Press","doi":"10.1093/nsr/nwy113","type":"journal_article","citation":{"short":"N.H. Barton, National Science Review 6 (2019) 291–292.","ieee":"N. H. Barton, “Is speciation driven by cycles of mixing and isolation?,” <i>National Science Review</i>, vol. 6, no. 2. Oxford University Press, pp. 291–292, 2019.","mla":"Barton, Nicholas H. “Is Speciation Driven by Cycles of Mixing and Isolation?” <i>National Science Review</i>, vol. 6, no. 2, Oxford University Press, 2019, pp. 291–92, doi:<a href=\"https://doi.org/10.1093/nsr/nwy113\">10.1093/nsr/nwy113</a>.","apa":"Barton, N. H. (2019). Is speciation driven by cycles of mixing and isolation? <i>National Science Review</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/nsr/nwy113\">https://doi.org/10.1093/nsr/nwy113</a>","ista":"Barton NH. 2019. Is speciation driven by cycles of mixing and isolation? National Science Review. 6(2), 291–292.","ama":"Barton NH. Is speciation driven by cycles of mixing and isolation? <i>National Science Review</i>. 2019;6(2):291-292. doi:<a href=\"https://doi.org/10.1093/nsr/nwy113\">10.1093/nsr/nwy113</a>","chicago":"Barton, Nicholas H. “Is Speciation Driven by Cycles of Mixing and Isolation?” <i>National Science Review</i>. Oxford University Press, 2019. <a href=\"https://doi.org/10.1093/nsr/nwy113\">https://doi.org/10.1093/nsr/nwy113</a>."},"volume":6,"publication":"National Science Review","date_updated":"2023-08-29T07:51:09Z","has_accepted_license":"1","external_id":{"isi":["000467957400025"]},"intvolume":"         6","language":[{"iso":"eng"}],"quality_controlled":"1","publication_identifier":{"eissn":["2053-714X"],"issn":["2095-5138"]},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"date_created":"2019-09-07T14:43:02Z","file_date_updated":"2020-10-02T09:16:44Z","department":[{"_id":"NiBa"}]},{"author":[{"id":"3E751364-F248-11E8-B48F-1D18A9856A87","full_name":"Zhou, Long","first_name":"Long","last_name":"Zhou","orcid":"0000-0002-1864-8951"},{"first_name":"Leonid A","full_name":"Sazanov, Leonid A","id":"338D39FE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0977-7989","last_name":"Sazanov"}],"publication_status":"published","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","isi":1,"status":"public","abstract":[{"text":"V (vacuolar)/A (archaeal)-type adenosine triphosphatases (ATPases), found in archaeaand eubacteria, couple ATP hydrolysis or synthesis to proton translocation across theplasma membrane using the rotary-catalysis mechanism. They belong to the V-typeATPase family, which differs from the mitochondrial/chloroplast F-type ATP synthasesin overall architecture. We solved cryo–electron microscopy structures of the intactThermus thermophilusV/A-ATPase, reconstituted into lipid nanodiscs, in three rotationalstates and two substates. These structures indicate substantial flexibility betweenV1and Voin a working enzyme, which results from mechanical competition between centralshaft rotation and resistance from the peripheral stalks. We also describedetails of adenosine diphosphate inhibition release, V1-Votorque transmission, andproton translocation, which are relevant for the entire V-type ATPase family.","lang":"eng"}],"date_published":"2019-08-23T00:00:00Z","scopus_import":"1","article_processing_charge":"No","month":"08","pmid":1,"oa_version":"None","year":"2019","issue":"6455","_id":"6859","title":"Structure and conformational plasticity of the intact Thermus thermophilus V/A-type ATPase","article_number":"eaaw9144","department":[{"_id":"LeSa"}],"date_created":"2019-09-07T19:04:45Z","acknowledged_ssus":[{"_id":"ScienComp"}],"publication_identifier":{"eissn":["1095-9203"],"issn":["0036-8075"]},"intvolume":"       365","quality_controlled":"1","language":[{"iso":"eng"}],"external_id":{"isi":["000482464000043"],"pmid":["31439765"]},"date_updated":"2023-08-29T07:52:02Z","publication":"Science","volume":365,"citation":{"ieee":"L. Zhou and L. A. Sazanov, “Structure and conformational plasticity of the intact Thermus thermophilus V/A-type ATPase,” <i>Science</i>, vol. 365, no. 6455. AAAS, 2019.","apa":"Zhou, L., &#38; Sazanov, L. A. (2019). Structure and conformational plasticity of the intact Thermus thermophilus V/A-type ATPase. <i>Science</i>. AAAS. <a href=\"https://doi.org/10.1126/science.aaw9144\">https://doi.org/10.1126/science.aaw9144</a>","mla":"Zhou, Long, and Leonid A. Sazanov. “Structure and Conformational Plasticity of the Intact Thermus Thermophilus V/A-Type ATPase.” <i>Science</i>, vol. 365, no. 6455, eaaw9144, AAAS, 2019, doi:<a href=\"https://doi.org/10.1126/science.aaw9144\">10.1126/science.aaw9144</a>.","ista":"Zhou L, Sazanov LA. 2019. Structure and conformational plasticity of the intact Thermus thermophilus V/A-type ATPase. Science. 365(6455), eaaw9144.","short":"L. Zhou, L.A. Sazanov, Science 365 (2019).","chicago":"Zhou, Long, and Leonid A Sazanov. “Structure and Conformational Plasticity of the Intact Thermus Thermophilus V/A-Type ATPase.” <i>Science</i>. AAAS, 2019. <a href=\"https://doi.org/10.1126/science.aaw9144\">https://doi.org/10.1126/science.aaw9144</a>.","ama":"Zhou L, Sazanov LA. Structure and conformational plasticity of the intact Thermus thermophilus V/A-type ATPase. <i>Science</i>. 2019;365(6455). doi:<a href=\"https://doi.org/10.1126/science.aaw9144\">10.1126/science.aaw9144</a>"},"related_material":{"link":[{"url":"https://ist.ac.at/en/news/structure-of-protein-nano-turbine-revealed/","relation":"press_release","description":"News on IST Website"}]},"type":"journal_article","day":"23","doi":"10.1126/science.aaw9144","publisher":"AAAS"},{"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"article_number":"11","date_created":"2019-09-18T08:04:26Z","file_date_updated":"2020-07-14T12:47:42Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"language":[{"iso":"eng"}],"quality_controlled":"1","intvolume":"       138","corr_author":"1","external_id":{"arxiv":["1905.03835"]},"has_accepted_license":"1","date_updated":"2025-07-10T11:53:57Z","volume":138,"citation":{"chicago":"Avni, Guy, Thomas A Henzinger, and Dorde Zikelic. “Bidding Mechanisms in Graph Games,” Vol. 138. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. <a href=\"https://doi.org/10.4230/LIPICS.MFCS.2019.11\">https://doi.org/10.4230/LIPICS.MFCS.2019.11</a>.","ama":"Avni G, Henzinger TA, Zikelic D. Bidding mechanisms in graph games. In: Vol 138. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:<a href=\"https://doi.org/10.4230/LIPICS.MFCS.2019.11\">10.4230/LIPICS.MFCS.2019.11</a>","apa":"Avni, G., Henzinger, T. A., &#38; Zikelic, D. (2019). Bidding mechanisms in graph games (Vol. 138). Presented at the MFCS: Mathematical Foundations of Computer Science, Aachen, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPICS.MFCS.2019.11\">https://doi.org/10.4230/LIPICS.MFCS.2019.11</a>","mla":"Avni, Guy, et al. <i>Bidding Mechanisms in Graph Games</i>. Vol. 138, 11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:<a href=\"https://doi.org/10.4230/LIPICS.MFCS.2019.11\">10.4230/LIPICS.MFCS.2019.11</a>.","ista":"Avni G, Henzinger TA, Zikelic D. 2019. Bidding mechanisms in graph games. MFCS: Mathematical Foundations of Computer Science, LIPIcs, vol. 138, 11.","ieee":"G. Avni, T. A. Henzinger, and D. Zikelic, “Bidding mechanisms in graph games,” presented at the MFCS: Mathematical Foundations of Computer Science, Aachen, Germany, 2019, vol. 138.","short":"G. Avni, T.A. Henzinger, D. Zikelic, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019."},"ec_funded":1,"type":"conference","related_material":{"record":[{"relation":"later_version","id":"9239","status":"public"}]},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","day":"01","doi":"10.4230/LIPICS.MFCS.2019.11","author":[{"first_name":"Guy","full_name":"Avni, Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","last_name":"Avni","orcid":"0000-0001-5588-8287"},{"orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"first_name":"Dorde","full_name":"Zikelic, Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4681-1699","last_name":"Zikelic"}],"publication_status":"published","project":[{"grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","call_identifier":"H2020"},{"grant_number":"M02369","_id":"264B3912-B435-11E9-9278-68D0E5697425","name":"Formal Methods meets Algorithmic Game Theory","call_identifier":"FWF"},{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S11402-N23","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"date_updated":"2020-07-14T12:47:42Z","file_name":"2019_LIPIcs_Avni.pdf","checksum":"6346e116a4f4ed1414174d96d2c4fbd7","file_id":"6913","relation":"main_file","file_size":554457,"content_type":"application/pdf","access_level":"open_access","creator":"kschuh","date_created":"2019-09-27T11:45:15Z"}],"status":"public","scopus_import":"1","date_published":"2019-08-01T00:00:00Z","abstract":[{"lang":"eng","text":"In two-player games on graphs, the players move a token through a graph to produce a finite or infinite path, which determines the qualitative winner or quantitative payoff of the game. We study bidding games in which the players bid for the right to move the token. Several bidding rules were studied previously. In Richman bidding, in each round, the players simultaneously submit bids, and the higher bidder moves the token and pays the other player. Poorman bidding is similar except that the winner of the bidding pays the \"bank\" rather than the other player. Taxman bidding spans the spectrum between Richman and poorman bidding. They are parameterized by a constant tau in [0,1]: portion tau of the winning bid is paid to the other player, and portion 1-tau to the bank. While finite-duration (reachability) taxman games have been studied before, we present, for the first time, results on infinite-duration taxman games. It was previously shown that both Richman and poorman infinite-duration games with qualitative objectives reduce to reachability games, and we show a similar result here. Our most interesting results concern quantitative taxman games, namely mean-payoff games, where poorman and Richman bidding differ significantly. A central quantity in these games is the ratio between the two players' initial budgets. While in poorman mean-payoff games, the optimal payoff of a player depends on the initial ratio, in Richman bidding, the payoff depends only on the structure of the game. In both games the optimal payoffs can be found using (different) probabilistic connections with random-turn games in which in each turn, instead of bidding, a coin is tossed to determine which player moves. While the value with Richman bidding equals the value of a random-turn game with an un-biased coin, with poorman bidding, the bias in the coin is the initial ratio of the budgets. We give a complete classification of mean-payoff taxman games that is based on a probabilistic connection: the value of a taxman bidding game with parameter tau and initial ratio r, equals the value of a random-turn game that uses a coin with bias F(tau, r) = (r+tau * (1-r))/(1+tau). Thus, we show that Richman bidding is the exception; namely, for every tau <1, the value of the game depends on the initial ratio. Our proof technique simplifies and unifies the previous proof techniques for both Richman and poorman bidding. "}],"arxiv":1,"ddc":["004"],"conference":{"end_date":"2019-08-30","name":"MFCS: Mathematical Foundations of Computer Science","start_date":"2019-08-26","location":"Aachen, Germany"},"article_processing_charge":"No","alternative_title":["LIPIcs"],"month":"08","oa_version":"Published Version","_id":"6884","year":"2019","title":"Bidding mechanisms in graph games"},{"doi":"10.4230/LIPICS.CONCUR.2019.27","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","day":"01","type":"conference","citation":{"ama":"Chatterjee K, Henzinger TA, Otop J. Long-run average behavior of vector addition systems with states. In: Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:<a href=\"https://doi.org/10.4230/LIPICS.CONCUR.2019.27\">10.4230/LIPICS.CONCUR.2019.27</a>","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Long-Run Average Behavior of Vector Addition Systems with States,” Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. <a href=\"https://doi.org/10.4230/LIPICS.CONCUR.2019.27\">https://doi.org/10.4230/LIPICS.CONCUR.2019.27</a>.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Long-run average behavior of vector addition systems with states,” presented at the CONCUR: Conference on Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Otop, J. (2019). Long-run average behavior of vector addition systems with states (Vol. 140). Presented at the CONCUR: Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPICS.CONCUR.2019.27\">https://doi.org/10.4230/LIPICS.CONCUR.2019.27</a>","mla":"Chatterjee, Krishnendu, et al. <i>Long-Run Average Behavior of Vector Addition Systems with States</i>. Vol. 140, 27, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:<a href=\"https://doi.org/10.4230/LIPICS.CONCUR.2019.27\">10.4230/LIPICS.CONCUR.2019.27</a>.","ista":"Chatterjee K, Henzinger TA, Otop J. 2019. Long-run average behavior of vector addition systems with states. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 140, 27."},"volume":140,"date_updated":"2025-07-10T11:53:58Z","has_accepted_license":"1","corr_author":"1","intvolume":"       140","language":[{"iso":"eng"}],"quality_controlled":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"file_date_updated":"2020-07-14T12:47:43Z","date_created":"2019-09-18T08:06:14Z","article_number":"27","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"title":"Long-run average behavior of vector addition systems with states","year":"2019","_id":"6885","oa_version":"Published Version","month":"08","alternative_title":["LIPIcs"],"article_processing_charge":"No","conference":{"location":"Amsterdam, Netherlands","start_date":"2019-08-27","end_date":"2019-08-30","name":"CONCUR: Conference on Concurrency Theory"},"ddc":["000"],"scopus_import":"1","abstract":[{"text":"A vector addition system with states (VASS) consists of a finite set of states and counters. A configuration is a state and a value for each counter; a transition changes the state and each counter is incremented, decremented, or left unchanged. While qualitative properties such as state and configuration reachability have been studied for VASS, we consider the long-run average cost of infinite computations of VASS. The cost of a configuration is for each state, a linear combination of the counter values. In the special case of uniform cost functions, the linear combination is the same for all states. The (regular) long-run emptiness problem is, given a VASS, a cost function, and a threshold value, if there is a (lasso-shaped) computation such that the long-run average value of the cost function does not exceed the threshold. For uniform cost functions, we show that the regular long-run emptiness problem is (a) decidable in polynomial time for integer-valued VASS, and (b) decidable but nonelementarily hard for natural-valued VASS (i.e., nonnegative counters). For general cost functions, we show that the problem is (c) NP-complete for integer-valued VASS, and (d) undecidable for natural-valued VASS. Our most interesting result is for (c) integer-valued VASS with general cost functions, where we establish a connection between the regular long-run emptiness problem and quadratic Diophantine inequalities. The general (nonregular) long-run emptiness problem is equally hard as the regular problem in all cases except (c), where it remains open. ","lang":"eng"}],"date_published":"2019-08-01T00:00:00Z","status":"public","file":[{"content_type":"application/pdf","access_level":"open_access","creator":"kschuh","date_created":"2019-09-27T12:09:35Z","file_id":"6914","relation":"main_file","file_size":538120,"checksum":"4985e26e1572d1575d64d38acabd71d6","date_updated":"2020-07-14T12:47:43Z","file_name":"2019_LIPIcs_Chatterjee.pdf"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"project":[{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","call_identifier":"FWF","name":"Game Theory"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S11402-N23","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"first_name":"Jan","full_name":"Otop, Jan","last_name":"Otop"}]},{"citation":{"ieee":"M. Aghajohari, G. Avni, and T. A. Henzinger, “Determinacy in discrete-bidding infinite-duration games,” presented at the CONCUR: Conference on Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140.","apa":"Aghajohari, M., Avni, G., &#38; Henzinger, T. A. (2019). Determinacy in discrete-bidding infinite-duration games (Vol. 140). Presented at the CONCUR: Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPICS.CONCUR.2019.20\">https://doi.org/10.4230/LIPICS.CONCUR.2019.20</a>","ista":"Aghajohari M, Avni G, Henzinger TA. 2019. Determinacy in discrete-bidding infinite-duration games. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 140, 20.","mla":"Aghajohari, Milad, et al. <i>Determinacy in Discrete-Bidding Infinite-Duration Games</i>. Vol. 140, 20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:<a href=\"https://doi.org/10.4230/LIPICS.CONCUR.2019.20\">10.4230/LIPICS.CONCUR.2019.20</a>.","short":"M. Aghajohari, G. Avni, T.A. Henzinger, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","chicago":"Aghajohari, Milad, Guy Avni, and Thomas A Henzinger. “Determinacy in Discrete-Bidding Infinite-Duration Games,” Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. <a href=\"https://doi.org/10.4230/LIPICS.CONCUR.2019.20\">https://doi.org/10.4230/LIPICS.CONCUR.2019.20</a>.","ama":"Aghajohari M, Avni G, Henzinger TA. Determinacy in discrete-bidding infinite-duration games. In: Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:<a href=\"https://doi.org/10.4230/LIPICS.CONCUR.2019.20\">10.4230/LIPICS.CONCUR.2019.20</a>"},"volume":140,"doi":"10.4230/LIPICS.CONCUR.2019.20","day":"01","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","type":"conference","date_created":"2019-09-18T08:06:58Z","file_date_updated":"2020-07-14T12:47:43Z","department":[{"_id":"ToHe"}],"article_number":"20","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","short":"CC BY (3.0)","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode"},"language":[{"iso":"eng"}],"quality_controlled":"1","intvolume":"       140","has_accepted_license":"1","date_updated":"2025-07-10T11:53:58Z","corr_author":"1","external_id":{"arxiv":["1905.03588"]},"alternative_title":["LIPIcs"],"article_processing_charge":"No","month":"08","_id":"6886","year":"2019","oa_version":"Published Version","title":"Determinacy in discrete-bidding infinite-duration games","publication_status":"published","project":[{"name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S11402-N23","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Formal Methods meets Algorithmic Game Theory","_id":"264B3912-B435-11E9-9278-68D0E5697425","grant_number":"M02369"}],"license":"https://creativecommons.org/licenses/by/3.0/","author":[{"first_name":"Milad","full_name":"Aghajohari, Milad","last_name":"Aghajohari"},{"id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","full_name":"Avni, Guy","first_name":"Guy","last_name":"Avni","orcid":"0000-0001-5588-8287"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"file_id":"6915","file_size":741425,"relation":"main_file","content_type":"application/pdf","creator":"kschuh","date_created":"2019-09-27T12:21:38Z","access_level":"open_access","file_name":"2019_LIPIcs_Aghajohari.pdf","date_updated":"2020-07-14T12:47:43Z","checksum":"4df6d3575c506edb17215adada03cc8e"}],"oa":1,"scopus_import":"1","abstract":[{"lang":"eng","text":"In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the winner of the game. Such games are central in formal methods since they model the interaction between a non-terminating system and its environment. In bidding games the players bid for the right to move the token: in each round, the players simultaneously submit bids, and the higher bidder moves the token and pays the other player. Bidding games are known to have a clean and elegant mathematical structure that relies on the ability of the players to submit arbitrarily small bids. Many applications, however, require a fixed granularity for the bids, which can represent, for example, the monetary value expressed in cents. We study, for the first time, the combination of discrete-bidding and infinite-duration games. Our most important result proves that these games form a large determined subclass of concurrent games, where determinacy is the strong property that there always exists exactly one player who can guarantee winning the game. In particular, we show that, in contrast to non-discrete bidding games, the mechanism with which tied bids are resolved plays an important role in discrete-bidding games. We study several natural tie-breaking mechanisms and show that, while some do not admit determinacy, most natural mechanisms imply determinacy for every pair of initial budgets. "}],"date_published":"2019-08-01T00:00:00Z","status":"public","arxiv":1,"ddc":["000"],"conference":{"start_date":"2019-08-27","end_date":"2019-08-30","name":"CONCUR: Conference on Concurrency Theory","location":"Amsterdam, Netherlands"}},{"ddc":["000"],"conference":{"start_date":"2019-08-27","end_date":"2019-08-30","name":"CONCUR: Conference on Concurrency Theory","location":"Amsterdam, Netherlands"},"status":"public","date_published":"2019-08-01T00:00:00Z","scopus_import":"1","abstract":[{"text":"The fundamental model-checking problem, given as input a model and a specification, asks for the algorithmic verification of whether the model satisfies the specification. Two classical models for reactive systems are graphs and Markov decision processes (MDPs). A basic specification formalism in the verification of reactive systems is the strong fairness (aka Streett) objective, where given different types of requests and corresponding grants, the requirement is that for each type, if the request event happens infinitely often, then the corresponding grant event must also happen infinitely often. All omega-regular objectives can be expressed as Streett objectives and hence they are canonical in verification. Consider graphs/MDPs with n vertices, m edges, and a Streett objectives with k pairs, and let b denote the size of the description of the Streett objective for the sets of requests and grants. The current best-known algorithm for the problem requires time O(min(n^2, m sqrt{m log n}) + b log n). In this work we present randomized near-linear time algorithms, with expected running time O~(m + b), where the O~ notation hides poly-log factors. Our randomized algorithms are near-linear in the size of the input, and hence optimal up to poly-log factors. ","lang":"eng"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"file_size":730112,"relation":"main_file","file_id":"6922","access_level":"open_access","date_created":"2019-10-01T08:20:30Z","creator":"kschuh","content_type":"application/pdf","date_updated":"2020-07-14T12:47:43Z","file_name":"2019_LIPIcs_Chatterjee.pdf","checksum":"e1f0e4061212454574f34a1368d018ec"}],"author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"full_name":"Dvorák, Wolfgang","first_name":"Wolfgang","last_name":"Dvorák"},{"full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","last_name":"Henzinger","orcid":"0000-0002-5008-6530"},{"first_name":"Alexander","full_name":"Svozil, Alexander","last_name":"Svozil"}],"publication_status":"published","project":[{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","call_identifier":"FWF","name":"Game Theory"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"}],"title":"Near-linear time algorithms for Streett objectives in graphs and MDPs","oa_version":"Published Version","_id":"6887","year":"2019","month":"08","article_processing_charge":"No","alternative_title":["LIPIcs"],"corr_author":"1","has_accepted_license":"1","date_updated":"2025-07-10T11:53:59Z","quality_controlled":"1","language":[{"iso":"eng"}],"intvolume":"       140","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"department":[{"_id":"KrCh"}],"article_number":"7","file_date_updated":"2020-07-14T12:47:43Z","date_created":"2019-09-18T08:07:58Z","type":"conference","ec_funded":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","doi":"10.4230/LIPICS.CONCUR.2019.7","day":"01","volume":140,"citation":{"chicago":"Chatterjee, Krishnendu, Wolfgang Dvorák, Monika Henzinger, and Alexander Svozil. “Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs.” In <i>Leibniz International Proceedings in Informatics</i>, Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. <a href=\"https://doi.org/10.4230/LIPICS.CONCUR.2019.7\">https://doi.org/10.4230/LIPICS.CONCUR.2019.7</a>.","ama":"Chatterjee K, Dvorák W, Henzinger M, Svozil A. Near-linear time algorithms for Streett objectives in graphs and MDPs. In: <i>Leibniz International Proceedings in Informatics</i>. Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:<a href=\"https://doi.org/10.4230/LIPICS.CONCUR.2019.7\">10.4230/LIPICS.CONCUR.2019.7</a>","apa":"Chatterjee, K., Dvorák, W., Henzinger, M., &#38; Svozil, A. (2019). Near-linear time algorithms for Streett objectives in graphs and MDPs. In <i>Leibniz International Proceedings in Informatics</i> (Vol. 140). Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPICS.CONCUR.2019.7\">https://doi.org/10.4230/LIPICS.CONCUR.2019.7</a>","mla":"Chatterjee, Krishnendu, et al. “Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs.” <i>Leibniz International Proceedings in Informatics</i>, vol. 140, 7, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:<a href=\"https://doi.org/10.4230/LIPICS.CONCUR.2019.7\">10.4230/LIPICS.CONCUR.2019.7</a>.","ista":"Chatterjee K, Dvorák W, Henzinger M, Svozil A. 2019. Near-linear time algorithms for Streett objectives in graphs and MDPs. Leibniz International Proceedings in Informatics. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 140, 7.","ieee":"K. Chatterjee, W. Dvorák, M. Henzinger, and A. Svozil, “Near-linear time algorithms for Streett objectives in graphs and MDPs,” in <i>Leibniz International Proceedings in Informatics</i>, Amsterdam, Netherlands, 2019, vol. 140.","short":"K. Chatterjee, W. Dvorák, M. Henzinger, A. Svozil, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019."},"publication":"Leibniz International Proceedings in Informatics"},{"status":"public","scopus_import":"1","date_published":"2019-05-01T00:00:00Z","abstract":[{"text":"In this paper, we design novel liquid time-constant recurrent neural networks for robotic control, inspired by the brain of the nematode, C. elegans. In the worm's nervous system, neurons communicate through nonlinear time-varying synaptic links established amongst them by their particular wiring structure. This property enables neurons to express liquid time-constants dynamics and therefore allows the network to originate complex behaviors with a small number of neurons. We identify neuron-pair communication motifs as design operators and use them to configure compact neuronal network structures to govern sequential robotic tasks. The networks are systematically designed to map the environmental observations to motor actions, by their hierarchical topology from sensory neurons, through recurrently-wired interneurons, to motor neurons. The networks are then parametrized in a supervised-learning scheme by a search-based algorithm. We demonstrate that obtained networks realize interpretable dynamics. We evaluate their performance in controlling mobile and arm robots, and compare their attributes to other artificial neural network-based control agents. Finally, we experimentally show their superior resilience to environmental noise, compared to the existing machine learning-based methods.","lang":"eng"}],"ddc":["000"],"conference":{"start_date":"2019-05-20","name":"ICRA: International Conference on Robotics and Automation","end_date":"2019-05-24","location":"Montreal, QC, Canada"},"author":[{"last_name":"Lechner","first_name":"Mathias","full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Hasani","full_name":"Hasani, Ramin","first_name":"Ramin"},{"last_name":"Zimmer","first_name":"Manuel","full_name":"Zimmer, Manuel"},{"orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A"},{"full_name":"Grosu, Radu","first_name":"Radu","last_name":"Grosu"}],"publication_status":"published","project":[{"name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"}],"oa":1,"isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","file":[{"file_id":"8636","relation":"main_file","file_size":3265107,"content_type":"application/pdf","access_level":"open_access","creator":"dernst","date_created":"2020-10-08T17:30:38Z","date_updated":"2020-10-08T17:30:38Z","file_name":"2019_ICRA_Lechner.pdf","success":1,"checksum":"f5545a6b60c3ffd01feb3613f81d03b6"}],"oa_version":"Submitted Version","_id":"6888","year":"2019","title":"Designing worm-inspired neural networks for interpretable robotic control","article_processing_charge":"No","alternative_title":["ICRA"],"month":"05","publication_identifier":{"isbn":["9781538660270"]},"quality_controlled":"1","language":[{"iso":"eng"}],"external_id":{"isi":["000494942300011"]},"has_accepted_license":"1","date_updated":"2025-09-10T10:42:55Z","department":[{"_id":"ToHe"}],"article_number":"8793840","file_date_updated":"2020-10-08T17:30:38Z","date_created":"2019-09-18T08:09:51Z","volume":"2019-May","citation":{"chicago":"Lechner, Mathias, Ramin Hasani, Manuel Zimmer, Thomas A Henzinger, and Radu Grosu. “Designing Worm-Inspired Neural Networks for Interpretable Robotic Control.” In <i>Proceedings - IEEE International Conference on Robotics and Automation</i>, Vol. 2019–May. IEEE, 2019. <a href=\"https://doi.org/10.1109/icra.2019.8793840\">https://doi.org/10.1109/icra.2019.8793840</a>.","ama":"Lechner M, Hasani R, Zimmer M, Henzinger TA, Grosu R. Designing worm-inspired neural networks for interpretable robotic control. In: <i>Proceedings - IEEE International Conference on Robotics and Automation</i>. Vol 2019-May. IEEE; 2019. doi:<a href=\"https://doi.org/10.1109/icra.2019.8793840\">10.1109/icra.2019.8793840</a>","mla":"Lechner, Mathias, et al. “Designing Worm-Inspired Neural Networks for Interpretable Robotic Control.” <i>Proceedings - IEEE International Conference on Robotics and Automation</i>, vol. 2019–May, 8793840, IEEE, 2019, doi:<a href=\"https://doi.org/10.1109/icra.2019.8793840\">10.1109/icra.2019.8793840</a>.","apa":"Lechner, M., Hasani, R., Zimmer, M., Henzinger, T. A., &#38; Grosu, R. (2019). Designing worm-inspired neural networks for interpretable robotic control. In <i>Proceedings - IEEE International Conference on Robotics and Automation</i> (Vol. 2019–May). Montreal, QC, Canada: IEEE. <a href=\"https://doi.org/10.1109/icra.2019.8793840\">https://doi.org/10.1109/icra.2019.8793840</a>","ista":"Lechner M, Hasani R, Zimmer M, Henzinger TA, Grosu R. 2019. Designing worm-inspired neural networks for interpretable robotic control. Proceedings - IEEE International Conference on Robotics and Automation. ICRA: International Conference on Robotics and Automation, ICRA, vol. 2019–May, 8793840.","ieee":"M. Lechner, R. Hasani, M. Zimmer, T. A. Henzinger, and R. Grosu, “Designing worm-inspired neural networks for interpretable robotic control,” in <i>Proceedings - IEEE International Conference on Robotics and Automation</i>, Montreal, QC, Canada, 2019, vol. 2019–May.","short":"M. Lechner, R. Hasani, M. Zimmer, T.A. Henzinger, R. Grosu, in:, Proceedings - IEEE International Conference on Robotics and Automation, IEEE, 2019."},"type":"conference","day":"01","doi":"10.1109/icra.2019.8793840","publisher":"IEEE","publication":"Proceedings - IEEE International Conference on Robotics and Automation"},{"alternative_title":["LIPIcs"],"article_processing_charge":"No","month":"08","oa_version":"Published Version","_id":"6889","year":"2019","title":"Combinations of Qualitative Winning for Stochastic Parity Games","author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"last_name":"Piterman","full_name":"Piterman, Nir","first_name":"Nir"}],"publication_status":"published","project":[{"name":"Game Theory","call_identifier":"FWF","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"relation":"main_file","file_size":509163,"file_id":"6923","date_created":"2019-10-01T08:49:45Z","creator":"kschuh","access_level":"open_access","content_type":"application/pdf","file_name":"2019_LIPIcs_Chatterjee.pdf","date_updated":"2020-07-14T12:47:43Z","checksum":"7b2ecfd4d9d02360308c0ca986fc10a7"}],"status":"public","scopus_import":"1","date_published":"2019-08-01T00:00:00Z","abstract":[{"lang":"eng","text":"We study Markov decision processes and turn-based stochastic games with parity conditions. There are three qualitative winning criteria, namely, sure winning, which requires all paths to satisfy the condition, almost-sure winning, which requires the condition to be satisfied with probability 1, and limit-sure winning, which requires the condition to be satisfied with probability arbitrarily close to 1. We study the combination of two of these criteria for parity conditions, e.g., there are two parity conditions one of which must be won surely, and the other almost-surely. The problem has been studied recently by Berthon et al. for MDPs with combination of sure and almost-sure winning, under infinite-memory strategies, and the problem has been established to be in NP cap co-NP. Even in MDPs there is a difference between finite-memory and infinite-memory strategies. Our main results for combination of sure and almost-sure winning are as follows: (a) we show that for MDPs with finite-memory strategies the problem is in NP cap co-NP; (b) we show that for turn-based stochastic games the problem is co-NP-complete, both for finite-memory and infinite-memory strategies; and (c) we present algorithmic results for the finite-memory case, both for MDPs and turn-based stochastic games, by reduction to non-stochastic parity games. In addition we show that all the above complexity results also carry over to combination of sure and limit-sure winning, and results for all other combinations can be derived from existing results in the literature. Thus we present a complete picture for the study of combinations of two qualitative winning criteria for parity conditions in MDPs and turn-based stochastic games. "}],"ddc":["000"],"conference":{"location":"Amsterdam, Netherlands","end_date":"2019-08-30","name":"CONCUR: Conference on Concurrency Theory","start_date":"2019-08-27"},"volume":140,"citation":{"chicago":"Chatterjee, Krishnendu, and Nir Piterman. “Combinations of Qualitative Winning for Stochastic Parity Games,” Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. <a href=\"https://doi.org/10.4230/LIPICS.CONCUR.2019.6\">https://doi.org/10.4230/LIPICS.CONCUR.2019.6</a>.","ama":"Chatterjee K, Piterman N. Combinations of Qualitative Winning for Stochastic Parity Games. In: Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:<a href=\"https://doi.org/10.4230/LIPICS.CONCUR.2019.6\">10.4230/LIPICS.CONCUR.2019.6</a>","mla":"Chatterjee, Krishnendu, and Nir Piterman. <i>Combinations of Qualitative Winning for Stochastic Parity Games</i>. Vol. 140, 6, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:<a href=\"https://doi.org/10.4230/LIPICS.CONCUR.2019.6\">10.4230/LIPICS.CONCUR.2019.6</a>.","apa":"Chatterjee, K., &#38; Piterman, N. (2019). Combinations of Qualitative Winning for Stochastic Parity Games (Vol. 140). Presented at the CONCUR: Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPICS.CONCUR.2019.6\">https://doi.org/10.4230/LIPICS.CONCUR.2019.6</a>","ista":"Chatterjee K, Piterman N. 2019. Combinations of Qualitative Winning for Stochastic Parity Games. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 140, 6.","ieee":"K. Chatterjee and N. Piterman, “Combinations of Qualitative Winning for Stochastic Parity Games,” presented at the CONCUR: Conference on Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140.","short":"K. Chatterjee, N. Piterman, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019."},"type":"conference","day":"01","doi":"10.4230/LIPICS.CONCUR.2019.6","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"KrCh"}],"article_number":"6","date_created":"2019-09-18T08:11:43Z","file_date_updated":"2020-07-14T12:47:43Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"language":[{"iso":"eng"}],"quality_controlled":"1","intvolume":"       140","has_accepted_license":"1","date_updated":"2025-07-10T11:53:59Z"},{"citation":{"short":"M. Obr, F.K. Schur, in:, F.A. Rey (Ed.), Complementary Strategies to Study Virus Structure and Function, Elsevier, 2019, pp. 117–159.","ieee":"M. Obr and F. K. Schur, “Structural analysis of pleomorphic and asymmetric viruses using cryo-electron tomography and subtomogram averaging,” in <i>Complementary Strategies to Study Virus Structure and Function</i>, vol. 105, F. A. Rey, Ed. Elsevier, 2019, pp. 117–159.","mla":"Obr, Martin, and Florian KM Schur. “Structural Analysis of Pleomorphic and Asymmetric Viruses Using Cryo-Electron Tomography and Subtomogram Averaging.” <i>Complementary Strategies to Study Virus Structure and Function</i>, edited by Félix A. Rey, vol. 105, Elsevier, 2019, pp. 117–59, doi:<a href=\"https://doi.org/10.1016/bs.aivir.2019.07.008\">10.1016/bs.aivir.2019.07.008</a>.","apa":"Obr, M., &#38; Schur, F. K. (2019). Structural analysis of pleomorphic and asymmetric viruses using cryo-electron tomography and subtomogram averaging. In F. A. Rey (Ed.), <i>Complementary Strategies to Study Virus Structure and Function</i> (Vol. 105, pp. 117–159). Elsevier. <a href=\"https://doi.org/10.1016/bs.aivir.2019.07.008\">https://doi.org/10.1016/bs.aivir.2019.07.008</a>","ista":"Obr M, Schur FK. 2019.Structural analysis of pleomorphic and asymmetric viruses using cryo-electron tomography and subtomogram averaging. In: Complementary Strategies to Study Virus Structure and Function. vol. 105, 117–159.","ama":"Obr M, Schur FK. Structural analysis of pleomorphic and asymmetric viruses using cryo-electron tomography and subtomogram averaging. In: Rey FA, ed. <i>Complementary Strategies to Study Virus Structure and Function</i>. Vol 105. Advances in Virus Research. Elsevier; 2019:117-159. doi:<a href=\"https://doi.org/10.1016/bs.aivir.2019.07.008\">10.1016/bs.aivir.2019.07.008</a>","chicago":"Obr, Martin, and Florian KM Schur. “Structural Analysis of Pleomorphic and Asymmetric Viruses Using Cryo-Electron Tomography and Subtomogram Averaging.” In <i>Complementary Strategies to Study Virus Structure and Function</i>, edited by Félix A. Rey, 105:117–59. Advances in Virus Research. Elsevier, 2019. <a href=\"https://doi.org/10.1016/bs.aivir.2019.07.008\">https://doi.org/10.1016/bs.aivir.2019.07.008</a>."},"volume":105,"page":"117-159","publisher":"Elsevier","day":"27","doi":"10.1016/bs.aivir.2019.07.008","type":"book_chapter","publication":"Complementary Strategies to Study Virus Structure and Function","intvolume":"       105","quality_controlled":"1","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0065-3527"],"isbn":["9780128184561"]},"date_updated":"2023-08-30T06:56:00Z","editor":[{"first_name":"Félix A.","full_name":"Rey, Félix A.","last_name":"Rey"}],"external_id":{"pmid":["    31522703"],"isi":["000501594500006"]},"date_created":"2019-09-18T08:15:37Z","series_title":"Advances in Virus Research","department":[{"_id":"FlSc"}],"year":"2019","_id":"6890","oa_version":"None","title":"Structural analysis of pleomorphic and asymmetric viruses using cryo-electron tomography and subtomogram averaging","article_processing_charge":"No","pmid":1,"month":"08","scopus_import":"1","date_published":"2019-08-27T00:00:00Z","abstract":[{"lang":"eng","text":"Describing the protein interactions that form pleomorphic and asymmetric viruses represents a considerable challenge to most structural biology techniques, including X-ray crystallography and single particle cryo-electron microscopy. Obtaining a detailed understanding of these interactions is nevertheless important, considering the number of relevant human pathogens that do not follow strict icosahedral or helical symmetry. Cryo-electron tomography and subtomogram averaging methods provide structural insights into complex biological environments and are well suited to go beyond structures of perfectly symmetric viruses. This chapter discusses recent developments showing that cryo-ET and subtomogram averaging can provide high-resolution insights into hitherto unknown structural features of pleomorphic and asymmetric virus particles. It also describes how these methods have significantly added to our understanding of retrovirus capsid assemblies in immature and mature viruses. Additional examples of irregular viruses and their associated proteins, whose structures have been studied via cryo-ET and subtomogram averaging, further support the versatility of these methods."}],"status":"public","publication_status":"published","author":[{"id":"4741CA5A-F248-11E8-B48F-1D18A9856A87","full_name":"Obr, Martin","first_name":"Martin","orcid":"0000-0003-1756-6564","last_name":"Obr"},{"last_name":"Schur","orcid":"0000-0003-4790-8078","first_name":"Florian KM","id":"48AD8942-F248-11E8-B48F-1D18A9856A87","full_name":"Schur, Florian KM"}],"isi":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8"}]