[{"year":"2018","date_published":"2018-01-01T00:00:00Z","_id":"310","status":"public","oa_version":"Preprint","ec_funded":1,"date_updated":"2025-06-02T08:53:40Z","day":"01","oa":1,"type":"conference","language":[{"iso":"eng"}],"quality_controlled":"1","arxiv":1,"title":"Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety, and diameter","isi":1,"doi":"10.1137/1.9781611975031.151","publisher":"ACM","article_processing_charge":"No","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"}],"department":[{"_id":"KrCh"}],"citation":{"ieee":"K. Chatterjee, W. Dvorák, M. H. Henzinger, and V. Loitzenbauer, “Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety, and diameter,” presented at the SODA: Symposium on Discrete Algorithms, New Orleans, Louisiana, United States, 2018, pp. 2341–2356.","apa":"Chatterjee, K., Dvorák, W., Henzinger, M. H., &#38; Loitzenbauer, V. (2018). Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety, and diameter (pp. 2341–2356). Presented at the SODA: Symposium on Discrete Algorithms, New Orleans, Louisiana, United States: ACM. <a href=\"https://doi.org/10.1137/1.9781611975031.151\">https://doi.org/10.1137/1.9781611975031.151</a>","chicago":"Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Veronika Loitzenbauer. “Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter,” 2341–56. ACM, 2018. <a href=\"https://doi.org/10.1137/1.9781611975031.151\">https://doi.org/10.1137/1.9781611975031.151</a>.","short":"K. Chatterjee, W. Dvorák, M.H. Henzinger, V. Loitzenbauer, in:, ACM, 2018, pp. 2341–2356.","ama":"Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety, and diameter. In: ACM; 2018:2341-2356. doi:<a href=\"https://doi.org/10.1137/1.9781611975031.151\">10.1137/1.9781611975031.151</a>","ista":"Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. 2018. Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety, and diameter. SODA: Symposium on Discrete Algorithms, 2341–2356.","mla":"Chatterjee, Krishnendu, et al. <i>Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter</i>. ACM, 2018, pp. 2341–56, doi:<a href=\"https://doi.org/10.1137/1.9781611975031.151\">10.1137/1.9781611975031.151</a>."},"month":"01","publist_id":"7555","main_file_link":[{"url":"https://arxiv.org/abs/1711.09148","open_access":"1"}],"abstract":[{"text":"A model of computation that is widely used in the formal analysis of reactive systems is symbolic algorithms. In this model the access to the input graph is restricted to consist of symbolic operations, which are expensive in comparison to the standard RAM operations. We give lower bounds on the number of symbolic operations for basic graph problems such as the computation of the strongly connected components and of the approximate diameter as well as for fundamental problems in model checking such as safety, liveness, and coliveness. Our lower bounds are linear in the number of vertices of the graph, even for constant-diameter graphs. For none of these problems lower bounds on the number of symbolic operations were known before. The lower bounds show an interesting separation of these problems from the reachability problem, which can be solved with O(D) symbolic operations, where D is the diameter of the graph. Additionally we present an approximation algorithm for the graph diameter which requires Õ(n/D) symbolic steps to achieve a (1 +ϵ)-approximation for any constant &gt; 0. This compares to O(n/D) symbolic steps for the (naive) exact algorithm and O(D) symbolic steps for a 2-approximation. Finally we also give a refined analysis of the strongly connected components algorithms of [15], showing that it uses an optimal number of symbolic steps that is proportional to the sum of the diameters of the strongly connected components.","lang":"eng"}],"scopus_import":"1","page":"2341 - 2356","external_id":{"isi":["000483921200152"],"arxiv":["1711.09148"]},"conference":{"start_date":"2018-01-07","location":"New Orleans, Louisiana, United States","name":"SODA: Symposium on Discrete Algorithms","end_date":"2018-01-10"},"date_created":"2018-12-11T11:45:45Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publication_status":"published","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Dvorák","full_name":"Dvorák, Wolfgang","first_name":"Wolfgang"},{"orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","last_name":"Henzinger","first_name":"Monika H"},{"first_name":"Veronika","last_name":"Loitzenbauer","full_name":"Loitzenbauer, Veronika"}]},{"date_created":"2018-12-11T11:45:45Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","license":"https://creativecommons.org/licenses/by/4.0/","conference":{"location":"Thessaloniki, Greece","start_date":"2018-04-16","end_date":"2018-04-19","name":"ESOP: European Symposium on Programming"},"page":"739 - 767","author":[{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0003-1702-6584","id":"391365CE-F248-11E8-B48F-1D18A9856A87","full_name":"Goharshady, Amir","last_name":"Goharshady","first_name":"Amir"},{"first_name":"Yaron","last_name":"Velner","full_name":"Velner, Yaron"}],"publication_status":"published","department":[{"_id":"KrCh"}],"month":"04","citation":{"ieee":"K. Chatterjee, A. K. Goharshady, and Y. Velner, “Quantitative analysis of smart contracts,” presented at the ESOP: European Symposium on Programming, Thessaloniki, Greece, 2018, vol. 10801, pp. 739–767.","apa":"Chatterjee, K., Goharshady, A. K., &#38; Velner, Y. (2018). Quantitative analysis of smart contracts (Vol. 10801, pp. 739–767). Presented at the ESOP: European Symposium on Programming, Thessaloniki, Greece: Springer. <a href=\"https://doi.org/10.1007/978-3-319-89884-1_26\">https://doi.org/10.1007/978-3-319-89884-1_26</a>","chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Yaron Velner. “Quantitative Analysis of Smart Contracts,” 10801:739–67. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-89884-1_26\">https://doi.org/10.1007/978-3-319-89884-1_26</a>.","ista":"Chatterjee K, Goharshady AK, Velner Y. 2018. Quantitative analysis of smart contracts. ESOP: European Symposium on Programming, LNCS, vol. 10801, 739–767.","ama":"Chatterjee K, Goharshady AK, Velner Y. Quantitative analysis of smart contracts. In: Vol 10801. Springer; 2018:739-767. doi:<a href=\"https://doi.org/10.1007/978-3-319-89884-1_26\">10.1007/978-3-319-89884-1_26</a>","short":"K. Chatterjee, A.K. Goharshady, Y. Velner, in:, Springer, 2018, pp. 739–767.","mla":"Chatterjee, Krishnendu, et al. <i>Quantitative Analysis of Smart Contracts</i>. Vol. 10801, Springer, 2018, pp. 739–67, doi:<a href=\"https://doi.org/10.1007/978-3-319-89884-1_26\">10.1007/978-3-319-89884-1_26</a>."},"alternative_title":["LNCS"],"article_processing_charge":"No","project":[{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"scopus_import":"1","acknowledgement":"The research was partially supported by Vienna Science and Technology Fund (WWTF) Project ICT15-003, Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE), and ERC Starting grant (279307: Graph Games).","file":[{"file_name":"2018_ESOP_Chatterjee.pdf","file_id":"5716","relation":"main_file","date_created":"2018-12-17T15:45:49Z","checksum":"9c8a8338c571903b599b6ca93abd2cce","date_updated":"2020-07-14T12:46:00Z","file_size":1394993,"creator":"dernst","content_type":"application/pdf","access_level":"open_access"}],"has_accepted_license":"1","abstract":[{"lang":"eng","text":"Smart contracts are computer programs that are executed by a network of mutually distrusting agents, without the need of an external trusted authority. Smart contracts handle and transfer assets of considerable value (in the form of crypto-currency like Bitcoin). Hence, it is crucial that their implementation is bug-free. We identify the utility (or expected payoff) of interacting with such smart contracts as the basic and canonical quantitative property for such contracts. We present a framework for such quantitative analysis of smart contracts. Such a formal framework poses new and novel research challenges in programming languages, as it requires modeling of game-theoretic aspects to analyze incentives for deviation from honest behavior and modeling utilities which are not specified as standard temporal properties such as safety and termination. While game-theoretic incentives have been analyzed in the security community, their analysis has been restricted to the very special case of stateless games. However, to analyze smart contracts, stateful analysis is required as it must account for the different program states of the protocol. Our main contributions are as follows: we present (i)~a simplified programming language for smart contracts; (ii)~an automatic translation of the programs to state-based games; (iii)~an abstraction-refinement approach to solve such games; and (iv)~experimental results on real-world-inspired smart contracts."}],"publist_id":"7554","quality_controlled":"1","language":[{"iso":"eng"}],"day":"01","oa":1,"type":"conference","publisher":"Springer","doi":"10.1007/978-3-319-89884-1_26","title":"Quantitative analysis of smart contracts","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"ddc":["000"],"status":"public","intvolume":"     10801","_id":"311","date_published":"2018-04-01T00:00:00Z","year":"2018","file_date_updated":"2020-07-14T12:46:00Z","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"8934"}]},"date_updated":"2025-06-02T08:53:41Z","ec_funded":1,"oa_version":"Published Version","volume":10801},{"volume":32,"oa_version":"Submitted Version","date_updated":"2023-09-13T09:34:38Z","year":"2018","date_published":"2018-03-29T00:00:00Z","intvolume":"        32","_id":"312","status":"public","title":"On the optimality of the FCC lattice for soft sphere packing","publication":"SIAM J Discrete Math","publisher":"Society for Industrial and Applied Mathematics ","doi":"10.1137/16M1097201","isi":1,"oa":1,"type":"journal_article","day":"29","language":[{"iso":"eng"}],"quality_controlled":"1","publist_id":"7553","abstract":[{"text":"Motivated by biological questions, we study configurations of equal spheres that neither pack nor cover. Placing their centers on a lattice, we define the soft density of the configuration by penalizing multiple overlaps. Considering the 1-parameter family of diagonally distorted 3-dimensional integer lattices, we show that the soft density is maximized at the FCC lattice.","lang":"eng"}],"main_file_link":[{"url":"http://pdfs.semanticscholar.org/d2d5/6da00fbc674e6a8b1bb9d857167e54200dc6.pdf","open_access":"1"}],"acknowledgement":"This work was partially supported by the DFG Collaborative Research Center TRR 109, “Discretization in Geometry and Dynamics,” through grant I02979-N35 of the Austrian Science Fund (FWF).","scopus_import":"1","project":[{"_id":"2561EBF4-B435-11E9-9278-68D0E5697425","name":"Persistence and stability of geometric complexes","call_identifier":"FWF","grant_number":"I02979-N35"}],"article_processing_charge":"No","citation":{"ama":"Edelsbrunner H, Iglesias Ham M. On the optimality of the FCC lattice for soft sphere packing. <i>SIAM J Discrete Math</i>. 2018;32(1):750-782. doi:<a href=\"https://doi.org/10.1137/16M1097201\">10.1137/16M1097201</a>","mla":"Edelsbrunner, Herbert, and Mabel Iglesias Ham. “On the Optimality of the FCC Lattice for Soft Sphere Packing.” <i>SIAM J Discrete Math</i>, vol. 32, no. 1, Society for Industrial and Applied Mathematics , 2018, pp. 750–82, doi:<a href=\"https://doi.org/10.1137/16M1097201\">10.1137/16M1097201</a>.","short":"H. Edelsbrunner, M. Iglesias Ham, SIAM J Discrete Math 32 (2018) 750–782.","ista":"Edelsbrunner H, Iglesias Ham M. 2018. On the optimality of the FCC lattice for soft sphere packing. SIAM J Discrete Math. 32(1), 750–782.","chicago":"Edelsbrunner, Herbert, and Mabel Iglesias Ham. “On the Optimality of the FCC Lattice for Soft Sphere Packing.” <i>SIAM J Discrete Math</i>. Society for Industrial and Applied Mathematics , 2018. <a href=\"https://doi.org/10.1137/16M1097201\">https://doi.org/10.1137/16M1097201</a>.","apa":"Edelsbrunner, H., &#38; Iglesias Ham, M. (2018). On the optimality of the FCC lattice for soft sphere packing. <i>SIAM J Discrete Math</i>. Society for Industrial and Applied Mathematics . <a href=\"https://doi.org/10.1137/16M1097201\">https://doi.org/10.1137/16M1097201</a>","ieee":"H. Edelsbrunner and M. Iglesias Ham, “On the optimality of the FCC lattice for soft sphere packing,” <i>SIAM J Discrete Math</i>, vol. 32, no. 1. Society for Industrial and Applied Mathematics , pp. 750–782, 2018."},"month":"03","department":[{"_id":"HeEd"}],"publication_identifier":{"issn":["08954801"]},"article_type":"original","publication_status":"published","author":[{"first_name":"Herbert","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833"},{"first_name":"Mabel","last_name":"Iglesias Ham","full_name":"Iglesias Ham, Mabel","id":"41B58C0C-F248-11E8-B48F-1D18A9856A87"}],"page":"750 - 782","external_id":{"isi":["000428958900038"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","issue":"1","date_created":"2018-12-11T11:45:46Z"},{"status":"public","_id":"314","intvolume":"         6","date_published":"2018-04-25T00:00:00Z","year":"2018","date_updated":"2023-09-19T10:11:25Z","oa_version":"Published Version","volume":6,"quality_controlled":"1","language":[{"iso":"eng"}],"day":"25","oa":1,"type":"journal_article","isi":1,"publisher":"Cell Press","doi":"10.1016/j.cels.2018.04.003","publication":"Cell Systems","title":"The science of living matter for tomorrow","pmid":1,"department":[{"_id":"AnKi"}],"citation":{"chicago":"Bauer, Guntram, Nikta Fakhri, Anna Kicheva, Jané Kondev, Karsten Kruse, Hiroyuki Noji, Daniel Riveline, Timothy Saunders, Mukund Thatta, and Eric Wieschaus. “The Science of Living Matter for Tomorrow.” <i>Cell Systems</i>. Cell Press, 2018. <a href=\"https://doi.org/10.1016/j.cels.2018.04.003\">https://doi.org/10.1016/j.cels.2018.04.003</a>.","ieee":"G. Bauer <i>et al.</i>, “The science of living matter for tomorrow,” <i>Cell Systems</i>, vol. 6, no. 4. Cell Press, pp. 400–402, 2018.","apa":"Bauer, G., Fakhri, N., Kicheva, A., Kondev, J., Kruse, K., Noji, H., … Wieschaus, E. (2018). The science of living matter for tomorrow. <i>Cell Systems</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cels.2018.04.003\">https://doi.org/10.1016/j.cels.2018.04.003</a>","ama":"Bauer G, Fakhri N, Kicheva A, et al. The science of living matter for tomorrow. <i>Cell Systems</i>. 2018;6(4):400-402. doi:<a href=\"https://doi.org/10.1016/j.cels.2018.04.003\">10.1016/j.cels.2018.04.003</a>","mla":"Bauer, Guntram, et al. “The Science of Living Matter for Tomorrow.” <i>Cell Systems</i>, vol. 6, no. 4, Cell Press, 2018, pp. 400–02, doi:<a href=\"https://doi.org/10.1016/j.cels.2018.04.003\">10.1016/j.cels.2018.04.003</a>.","short":"G. Bauer, N. Fakhri, A. Kicheva, J. Kondev, K. Kruse, H. Noji, D. Riveline, T. Saunders, M. Thatta, E. Wieschaus, Cell Systems 6 (2018) 400–402.","ista":"Bauer G, Fakhri N, Kicheva A, Kondev J, Kruse K, Noji H, Riveline D, Saunders T, Thatta M, Wieschaus E. 2018. The science of living matter for tomorrow. Cell Systems. 6(4), 400–402."},"month":"04","article_processing_charge":"No","scopus_import":"1","main_file_link":[{"url":"https://doi.org/10.1016/j.cels.2018.04.003","open_access":"1"}],"abstract":[{"lang":"eng","text":"The interface of physics and biology pro-vides a fruitful environment for generatingnew concepts and exciting ways forwardto understanding living matter. Examplesof successful studies include the estab-lishment and readout of morphogen gra-dients during development, signal pro-cessing in protein and genetic networks,the role of fluctuations in determining thefates of cells and tissues, and collectiveeffects in proteins and in tissues. It is nothard to envision that significant further ad-vances will translate to societal benefitsby initiating the development of new de-vices and strategies for curing disease.However, research at the interface posesvarious challenges, in particular for youngscientists, and current institutions arerarely designed to facilitate such scientificprograms. In this Letter, we propose aninternational initiative that addressesthese challenges through the establish-ment of a worldwide network of platformsfor cross-disciplinary training and incuba-tors for starting new collaborations."}],"publist_id":"7551","date_created":"2018-12-11T11:45:46Z","issue":"4","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","external_id":{"pmid":["29698645"],"isi":["000432192100003"]},"page":"400 - 402","author":[{"last_name":"Bauer","full_name":"Bauer, Guntram","first_name":"Guntram"},{"full_name":"Fakhri, Nikta","last_name":"Fakhri","first_name":"Nikta"},{"orcid":"0000-0003-4509-4998","first_name":"Anna","id":"3959A2A0-F248-11E8-B48F-1D18A9856A87","full_name":"Kicheva, Anna","last_name":"Kicheva"},{"first_name":"Jané","last_name":"Kondev","full_name":"Kondev, Jané"},{"first_name":"Karsten","last_name":"Kruse","full_name":"Kruse, Karsten"},{"last_name":"Noji","full_name":"Noji, Hiroyuki","first_name":"Hiroyuki"},{"first_name":"Daniel","last_name":"Riveline","full_name":"Riveline, Daniel"},{"full_name":"Saunders, Timothy","last_name":"Saunders","first_name":"Timothy"},{"last_name":"Thatta","full_name":"Thatta, Mukund","first_name":"Mukund"},{"first_name":"Eric","last_name":"Wieschaus","full_name":"Wieschaus, Eric"}],"publication_status":"published","article_type":"letter_note","publication_identifier":{"eissn":["2405-4712"]}},{"_id":"315","intvolume":"        16","status":"public","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"ddc":["576"],"file_date_updated":"2020-07-14T12:46:01Z","year":"2018","date_published":"2018-06-15T00:00:00Z","related_material":{"record":[{"status":"public","id":"9839","relation":"research_data"}]},"volume":16,"oa_version":"Published Version","date_updated":"2023-02-23T14:10:16Z","quality_controlled":"1","oa":1,"type":"journal_article","day":"15","language":[{"iso":"eng"}],"publication":"PLoS Biology","doi":"10.1371/journal.pbio.2005372","publisher":"Public Library of Science","title":"Is the sky the limit? On the expansion threshold of a species’ range","citation":{"short":"J. Polechova, PLoS Biology 16 (2018).","ista":"Polechova J. 2018. Is the sky the limit? On the expansion threshold of a species’ range. PLoS Biology. 16(6), e2005372.","mla":"Polechova, Jitka. “Is the Sky the Limit? On the Expansion Threshold of a Species’ Range.” <i>PLoS Biology</i>, vol. 16, no. 6, e2005372, Public Library of Science, 2018, doi:<a href=\"https://doi.org/10.1371/journal.pbio.2005372\">10.1371/journal.pbio.2005372</a>.","ama":"Polechova J. Is the sky the limit? On the expansion threshold of a species’ range. <i>PLoS Biology</i>. 2018;16(6). doi:<a href=\"https://doi.org/10.1371/journal.pbio.2005372\">10.1371/journal.pbio.2005372</a>","ieee":"J. Polechova, “Is the sky the limit? On the expansion threshold of a species’ range,” <i>PLoS Biology</i>, vol. 16, no. 6. Public Library of Science, 2018.","apa":"Polechova, J. (2018). Is the sky the limit? On the expansion threshold of a species’ range. <i>PLoS Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pbio.2005372\">https://doi.org/10.1371/journal.pbio.2005372</a>","chicago":"Polechova, Jitka. “Is the Sky the Limit? On the Expansion Threshold of a Species’ Range.” <i>PLoS Biology</i>. Public Library of Science, 2018. <a href=\"https://doi.org/10.1371/journal.pbio.2005372\">https://doi.org/10.1371/journal.pbio.2005372</a>."},"month":"06","department":[{"_id":"NiBa"}],"article_number":"e2005372","has_accepted_license":"1","file":[{"file_name":"2017_PLOS_Polechova.pdf","file_id":"5870","date_created":"2019-01-22T08:30:03Z","relation":"main_file","content_type":"application/pdf","access_level":"open_access","checksum":"908c52751bba30c55ed36789e5e4c84d","date_updated":"2020-07-14T12:46:01Z","creator":"dernst","file_size":6968201}],"scopus_import":1,"publist_id":"7550","abstract":[{"lang":"eng","text":"More than 100 years after Grigg’s influential analysis of species’ borders, the causes of limits to species’ ranges still represent a puzzle that has never been understood with clarity. The topic has become especially important recently as many scientists have become interested in the potential for species’ ranges to shift in response to climate change—and yet nearly all of those studies fail to recognise or incorporate evolutionary genetics in a way that relates to theoretical developments. I show that range margins can be understood based on just two measurable parameters: (i) the fitness cost of dispersal—a measure of environmental heterogeneity—and (ii) the strength of genetic drift, which reduces genetic diversity. Together, these two parameters define an ‘expansion threshold’: adaptation fails when genetic drift reduces genetic diversity below that required for adaptation to a heterogeneous environment. When the key parameters drop below this expansion threshold locally, a sharp range margin forms. When they drop below this threshold throughout the species’ range, adaptation collapses everywhere, resulting in either extinction or formation of a fragmented metapopulation. Because the effects of dispersal differ fundamentally with dimension, the second parameter—the strength of genetic drift—is qualitatively different compared to a linear habitat. In two-dimensional habitats, genetic drift becomes effectively independent of selection. It decreases with ‘neighbourhood size’—the number of individuals accessible by dispersal within one generation. Moreover, in contrast to earlier predictions, which neglected evolution of genetic variance and/or stochasticity in two dimensions, dispersal into small marginal populations aids adaptation. This is because the reduction of both genetic and demographic stochasticity has a stronger effect than the cost of dispersal through increased maladaptation. The expansion threshold thus provides a novel, theoretically justified, and testable prediction for formation of the range margin and collapse of the species’ range."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"6","date_created":"2018-12-11T11:45:46Z","publication_status":"published","author":[{"orcid":"0000-0003-0951-3112","last_name":"Polechova","full_name":"Polechova, Jitka","id":"3BBFB084-F248-11E8-B48F-1D18A9856A87","first_name":"Jitka"}],"publication_identifier":{"issn":["15449173"]}},{"scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://www.biorxiv.org/node/80098.abstract"}],"abstract":[{"text":"Self-incompatibility (SI) is a genetically based recognition system that functions to prevent self-fertilization and mating among related plants. An enduring puzzle in SI is how the high diversity observed in nature arises and is maintained. Based on the underlying recognition mechanism, SI can be classified into two main groups: self- and non-self recognition. Most work has focused on diversification within self-recognition systems despite expected differences between the two groups in the evolutionary pathways and outcomes of diversification. Here, we use a deterministic population genetic model and stochastic simulations to investigate how novel S-haplotypes evolve in a gametophytic non-self recognition (SRNase/S Locus F-box (SLF)) SI system. For this model the pathways for diversification involve either the maintenance or breakdown of SI and can vary in the order of mutations of the female (SRNase) and male (SLF) components. We show analytically that diversification can occur with high inbreeding depression and self-pollination, but this varies with evolutionary pathway and level of completeness (which determines the number of potential mating partners in the population), and in general is more likely for lower haplotype number. The conditions for diversification are broader in stochastic simulations of finite population size. However, the number of haplotypes observed under high inbreeding and moderate to high self-pollination is less than that commonly observed in nature. Diversification was observed through pathways that maintain SI as well as through self-compatible intermediates. Yet the lifespan of diversified haplotypes was sensitive to their level of completeness. By examining diversification in a non-self recognition SI system, this model extends our understanding of the evolution and maintenance of haplotype diversity observed in a self recognition system common in flowering plants.","lang":"eng"}],"department":[{"_id":"NiBa"},{"_id":"GaTk"}],"month":"07","citation":{"ista":"Bodova K, Priklopil T, Field D, Barton NH, Pickup M. 2018. Evolutionary pathways for the generation of new self-incompatibility haplotypes in a non-self recognition system. Genetics. 209(3), 861–883.","ama":"Bodova K, Priklopil T, Field D, Barton NH, Pickup M. Evolutionary pathways for the generation of new self-incompatibility haplotypes in a non-self recognition system. <i>Genetics</i>. 2018;209(3):861-883. doi:<a href=\"https://doi.org/10.1534/genetics.118.300748\">10.1534/genetics.118.300748</a>","short":"K. Bodova, T. Priklopil, D. Field, N.H. Barton, M. Pickup, Genetics 209 (2018) 861–883.","mla":"Bodova, Katarina, et al. “Evolutionary Pathways for the Generation of New Self-Incompatibility Haplotypes in a Non-Self Recognition System.” <i>Genetics</i>, vol. 209, no. 3, Genetics Society of America, 2018, pp. 861–83, doi:<a href=\"https://doi.org/10.1534/genetics.118.300748\">10.1534/genetics.118.300748</a>.","apa":"Bodova, K., Priklopil, T., Field, D., Barton, N. H., &#38; Pickup, M. (2018). Evolutionary pathways for the generation of new self-incompatibility haplotypes in a non-self recognition system. <i>Genetics</i>. Genetics Society of America. <a href=\"https://doi.org/10.1534/genetics.118.300748\">https://doi.org/10.1534/genetics.118.300748</a>","ieee":"K. Bodova, T. Priklopil, D. Field, N. H. Barton, and M. Pickup, “Evolutionary pathways for the generation of new self-incompatibility haplotypes in a non-self recognition system,” <i>Genetics</i>, vol. 209, no. 3. Genetics Society of America, pp. 861–883, 2018.","chicago":"Bodova, Katarina, Tadeas Priklopil, David Field, Nicholas H Barton, and Melinda Pickup. “Evolutionary Pathways for the Generation of New Self-Incompatibility Haplotypes in a Non-Self Recognition System.” <i>Genetics</i>. Genetics Society of America, 2018. <a href=\"https://doi.org/10.1534/genetics.118.300748\">https://doi.org/10.1534/genetics.118.300748</a>."},"article_processing_charge":"No","project":[{"call_identifier":"FP7","name":"Mating system and the evolutionary dynamics of hybrid zones","grant_number":"329960","_id":"25B36484-B435-11E9-9278-68D0E5697425"},{"_id":"25B07788-B435-11E9-9278-68D0E5697425","grant_number":"250152","name":"Limits to selection in biology and in evolutionary computation","call_identifier":"FP7"},{"_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","grant_number":"291734"}],"author":[{"id":"2BA24EA0-F248-11E8-B48F-1D18A9856A87","full_name":"Bodova, Katarina","last_name":"Bodova","first_name":"Katarina","orcid":"0000-0002-7214-0171"},{"first_name":"Tadeas","last_name":"Priklopil","full_name":"Priklopil, Tadeas","id":"3C869AA0-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-4014-8478","first_name":"David","last_name":"Field","full_name":"Field, David","id":"419049E2-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H","last_name":"Barton","orcid":"0000-0002-8548-5240"},{"last_name":"Pickup","id":"2C78037E-F248-11E8-B48F-1D18A9856A87","full_name":"Pickup, Melinda","first_name":"Melinda","orcid":"0000-0001-6118-0541"}],"publication_status":"published","article_type":"original","date_created":"2018-12-11T11:45:47Z","issue":"3","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","external_id":{"isi":["000437171700017"]},"page":"861-883","related_material":{"link":[{"relation":"press_release","description":"News on IST Homepage","url":"https://ist.ac.at/en/news/recognizing-others-but-not-yourself-new-insights-into-the-evolution-of-plant-mating/"}],"record":[{"status":"public","relation":"research_data","id":"9813"}]},"ec_funded":1,"date_updated":"2025-05-28T11:42:44Z","volume":209,"oa_version":"Preprint","status":"public","_id":"316","intvolume":"       209","date_published":"2018-07-01T00:00:00Z","year":"2018","isi":1,"doi":"10.1534/genetics.118.300748","publisher":"Genetics Society of America","publication":"Genetics","title":"Evolutionary pathways for the generation of new self-incompatibility haplotypes in a non-self recognition system","quality_controlled":"1","language":[{"iso":"eng"}],"day":"01","type":"journal_article","oa":1},{"year":"2018","file_date_updated":"2020-07-14T12:46:02Z","date_published":"2018-04-09T00:00:00Z","_id":"317","intvolume":"         8","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"ddc":["539"],"status":"public","oa_version":"Published Version","volume":8,"date_updated":"2023-09-13T09:38:00Z","day":"09","oa":1,"type":"journal_article","language":[{"iso":"eng"}],"quality_controlled":"1","title":"Palladium gates for reproducible quantum dots in silicon","publication":"Scientific Reports","isi":1,"publisher":"Nature Publishing Group","doi":"10.1038/s41598-018-24004-y","article_number":"5690","article_processing_charge":"No","department":[{"_id":"GeKa"}],"citation":{"mla":"Brauns, Matthias, et al. “Palladium Gates for Reproducible Quantum Dots in Silicon.” <i>Scientific Reports</i>, vol. 8, no. 1, 5690, Nature Publishing Group, 2018, doi:<a href=\"https://doi.org/10.1038/s41598-018-24004-y\">10.1038/s41598-018-24004-y</a>.","ista":"Brauns M, Amitonov S, Spruijtenburg P, Zwanenburg F. 2018. Palladium gates for reproducible quantum dots in silicon. Scientific Reports. 8(1), 5690.","ama":"Brauns M, Amitonov S, Spruijtenburg P, Zwanenburg F. Palladium gates for reproducible quantum dots in silicon. <i>Scientific Reports</i>. 2018;8(1). doi:<a href=\"https://doi.org/10.1038/s41598-018-24004-y\">10.1038/s41598-018-24004-y</a>","short":"M. Brauns, S. Amitonov, P. Spruijtenburg, F. Zwanenburg, Scientific Reports 8 (2018).","chicago":"Brauns, Matthias, Sergey Amitonov, Paul Spruijtenburg, and Floris Zwanenburg. “Palladium Gates for Reproducible Quantum Dots in Silicon.” <i>Scientific Reports</i>. Nature Publishing Group, 2018. <a href=\"https://doi.org/10.1038/s41598-018-24004-y\">https://doi.org/10.1038/s41598-018-24004-y</a>.","ieee":"M. Brauns, S. Amitonov, P. Spruijtenburg, and F. Zwanenburg, “Palladium gates for reproducible quantum dots in silicon,” <i>Scientific Reports</i>, vol. 8, no. 1. Nature Publishing Group, 2018.","apa":"Brauns, M., Amitonov, S., Spruijtenburg, P., &#38; Zwanenburg, F. (2018). Palladium gates for reproducible quantum dots in silicon. <i>Scientific Reports</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/s41598-018-24004-y\">https://doi.org/10.1038/s41598-018-24004-y</a>"},"month":"04","publist_id":"7548","pubrep_id":"1016","abstract":[{"text":"We replace the established aluminium gates for the formation of quantum dots in silicon with gates made from palladium. We study the morphology of both aluminium and palladium gates with transmission electron microscopy. The native aluminium oxide is found to be formed all around the aluminium gates, which could lead to the formation of unintentional dots. Therefore, we report on a novel fabrication route that replaces aluminium and its native oxide by palladium with atomic-layer-deposition-grown aluminium oxide. Using this approach, we show the formation of low-disorder gate-defined quantum dots, which are reproducibly fabricated. Furthermore, palladium enables us to further shrink the gate design, allowing us to perform electron transport measurements in the few-electron regime in devices comprising only two gate layers, a major technological advancement. It remains to be seen, whether the introduction of palladium gates can improve the excellent results on electron and nuclear spin qubits defined with an aluminium gate stack.","lang":"eng"}],"file":[{"file_name":"IST-2018-1016-v1+1_2018_Brauns_Palladium_gates.pdf","file_id":"5256","relation":"main_file","date_created":"2018-12-12T10:17:04Z","content_type":"application/pdf","access_level":"open_access","checksum":"20af238ca4ba6491b77270be8d826bf5","date_updated":"2020-07-14T12:46:02Z","creator":"system","file_size":1850530}],"scopus_import":"1","has_accepted_license":"1","external_id":{"isi":["000429404300013"]},"date_created":"2018-12-11T11:45:47Z","issue":"1","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publication_status":"published","author":[{"last_name":"Brauns","id":"33F94E3C-F248-11E8-B48F-1D18A9856A87","full_name":"Brauns, Matthias","first_name":"Matthias"},{"first_name":"Sergey","full_name":"Amitonov, Sergey","last_name":"Amitonov"},{"first_name":"Paul","full_name":"Spruijtenburg, Paul","last_name":"Spruijtenburg"},{"full_name":"Zwanenburg, Floris","last_name":"Zwanenburg","first_name":"Floris"}]},{"publication_status":"published","author":[{"first_name":"Alessandra M","full_name":"Casano, Alessandra M","id":"3DBA3F4E-F248-11E8-B48F-1D18A9856A87","last_name":"Casano","orcid":"0000-0002-6009-6804"},{"orcid":"0000-0002-6620-9179","first_name":"Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","full_name":"Sixt, Michael K","last_name":"Sixt"}],"page":"405 - 406","external_id":{"isi":["000426150700002"],"pmid":["29486189"]},"date_created":"2018-12-11T11:45:47Z","issue":"4","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publist_id":"7547","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pubmed/29486189","open_access":"1"}],"abstract":[{"lang":"eng","text":"The insect’s fat body combines metabolic and immunological functions. In this issue of Developmental Cell, Franz et al. (2018) show that in Drosophila, cells of the fat body are not static, but can actively “swim” toward sites of epithelial injury, where they physically clog the wound and locally secrete antimicrobial peptides."}],"acknowledgement":"Short Survey","scopus_import":"1","article_processing_charge":"No","department":[{"_id":"MiSi"}],"citation":{"ama":"Casano AM, Sixt MK. A fat lot of good for wound healing. <i>Developmental Cell</i>. 2018;44(4):405-406. doi:<a href=\"https://doi.org/10.1016/j.devcel.2018.02.009\">10.1016/j.devcel.2018.02.009</a>","ista":"Casano AM, Sixt MK. 2018. A fat lot of good for wound healing. Developmental Cell. 44(4), 405–406.","short":"A.M. Casano, M.K. Sixt, Developmental Cell 44 (2018) 405–406.","mla":"Casano, Alessandra M., and Michael K. Sixt. “A Fat Lot of Good for Wound Healing.” <i>Developmental Cell</i>, vol. 44, no. 4, Cell Press, 2018, pp. 405–06, doi:<a href=\"https://doi.org/10.1016/j.devcel.2018.02.009\">10.1016/j.devcel.2018.02.009</a>.","chicago":"Casano, Alessandra M, and Michael K Sixt. “A Fat Lot of Good for Wound Healing.” <i>Developmental Cell</i>. Cell Press, 2018. <a href=\"https://doi.org/10.1016/j.devcel.2018.02.009\">https://doi.org/10.1016/j.devcel.2018.02.009</a>.","apa":"Casano, A. M., &#38; Sixt, M. K. (2018). A fat lot of good for wound healing. <i>Developmental Cell</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.devcel.2018.02.009\">https://doi.org/10.1016/j.devcel.2018.02.009</a>","ieee":"A. M. Casano and M. K. Sixt, “A fat lot of good for wound healing,” <i>Developmental Cell</i>, vol. 44, no. 4. Cell Press, pp. 405–406, 2018."},"month":"02","pmid":1,"title":"A fat lot of good for wound healing","publication":"Developmental Cell","isi":1,"publisher":"Cell Press","doi":"10.1016/j.devcel.2018.02.009","day":"26","oa":1,"type":"journal_article","language":[{"iso":"eng"}],"quality_controlled":"1","oa_version":"Published Version","volume":44,"date_updated":"2023-09-08T11:42:28Z","year":"2018","date_published":"2018-02-26T00:00:00Z","_id":"318","intvolume":"        44","status":"public"},{"publication_status":"published","author":[{"last_name":"Chen","full_name":"Chen, Ting","first_name":"Ting"},{"first_name":"Bartosz","last_name":"Kula","full_name":"Kula, Bartosz"},{"first_name":"Balint","full_name":"Nagy, Balint","id":"30F830CE-02D1-11E9-9BAA-DAF4881429F2","last_name":"Nagy","orcid":"0000-0002-4002-4686"},{"first_name":"Ruxandra","full_name":"Barzan, Ruxandra","last_name":"Barzan"},{"first_name":"Andrea","full_name":"Gall, Andrea","last_name":"Gall"},{"full_name":"Ehrlich, Ingrid","last_name":"Ehrlich","first_name":"Ingrid"},{"full_name":"Kukley, Maria","last_name":"Kukley","first_name":"Maria"}],"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","date_created":"2018-12-11T11:44:16Z","issue":"4","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","page":"852 - 861.e7","external_id":{"isi":["000448219500005"]},"acknowledgement":"This work was supported by Deutsche Forschungsgemeinschaft (DFG) grant KU2569/1-1 (to M.K.); DFG project EXC307Centre for Integrative Neuroscience (CIN), including grant Pool Project 2011-12 (jointly to M.K. and I.E.); and the Charitable Hertie Foundation (to I.E.). CIN is an Excellence Cluster funded by the DFG within the framework of the Excellence Initiative for 2008–2018. M.K. is supported by the Tistou & Charlotte Kerstan Foundation.","file":[{"file_name":"2018_CellReports_Chen.pdf","date_created":"2018-12-17T12:42:57Z","relation":"main_file","file_id":"5703","checksum":"d9f74277fd57176e04732707d575cf08","creator":"dernst","file_size":4461997,"date_updated":"2020-07-14T12:46:03Z","content_type":"application/pdf","access_level":"open_access"}],"scopus_import":"1","has_accepted_license":"1","publist_id":"8023","abstract":[{"text":"The functional role of AMPA receptor (AMPAR)-mediated synaptic signaling between neurons and oligodendrocyte precursor cells (OPCs) remains enigmatic. We modified the properties of AMPARs at axon-OPC synapses in the mouse corpus callosum in vivo during the peak of myelination by targeting the GluA2 subunit. Expression of the unedited (Ca2+ permeable) or the pore-dead GluA2 subunit of AMPARs triggered proliferation of OPCs and reduced their differentiation into oligodendrocytes. Expression of the cytoplasmic C-terminal (GluA2(813-862)) of the GluA2 subunit (C-tail), a modification designed to affect the interaction between GluA2 and AMPAR-binding proteins and to perturb trafficking of GluA2-containing AMPARs, decreased the differentiation of OPCs without affecting their proliferation. These findings suggest that ionotropic and non-ionotropic properties of AMPARs in OPCs, as well as specific aspects of AMPAR-mediated signaling at axon-OPC synapses in the mouse corpus callosum, are important for balancing the response of OPCs to proliferation and differentiation cues. In the brain, oligodendrocyte precursor cells (OPCs) receive glutamatergic AMPA-receptor-mediated synaptic input from neurons. Chen et al. show that modifying AMPA-receptor properties at axon-OPC synapses alters proliferation and differentiation of OPCs. This expands the traditional view of synaptic transmission by suggesting neurons also use synapses to modulate behavior of glia.","lang":"eng"}],"department":[{"_id":"SaSi"}],"month":"10","citation":{"apa":"Chen, T., Kula, B., Nagy, B., Barzan, R., Gall, A., Ehrlich, I., &#38; Kukley, M. (2018). In Vivo regulation of Oligodendrocyte processor cell proliferation and differentiation by the AMPA-receptor Subunit GluA2. <i>Cell Reports</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.celrep.2018.09.066\">https://doi.org/10.1016/j.celrep.2018.09.066</a>","ieee":"T. Chen <i>et al.</i>, “In Vivo regulation of Oligodendrocyte processor cell proliferation and differentiation by the AMPA-receptor Subunit GluA2,” <i>Cell Reports</i>, vol. 25, no. 4. Elsevier, p. 852–861.e7, 2018.","chicago":"Chen, Ting, Bartosz Kula, Balint Nagy, Ruxandra Barzan, Andrea Gall, Ingrid Ehrlich, and Maria Kukley. “In Vivo Regulation of Oligodendrocyte Processor Cell Proliferation and Differentiation by the AMPA-Receptor Subunit GluA2.” <i>Cell Reports</i>. Elsevier, 2018. <a href=\"https://doi.org/10.1016/j.celrep.2018.09.066\">https://doi.org/10.1016/j.celrep.2018.09.066</a>.","mla":"Chen, Ting, et al. “In Vivo Regulation of Oligodendrocyte Processor Cell Proliferation and Differentiation by the AMPA-Receptor Subunit GluA2.” <i>Cell Reports</i>, vol. 25, no. 4, Elsevier, 2018, p. 852–861.e7, doi:<a href=\"https://doi.org/10.1016/j.celrep.2018.09.066\">10.1016/j.celrep.2018.09.066</a>.","ama":"Chen T, Kula B, Nagy B, et al. In Vivo regulation of Oligodendrocyte processor cell proliferation and differentiation by the AMPA-receptor Subunit GluA2. <i>Cell Reports</i>. 2018;25(4):852-861.e7. doi:<a href=\"https://doi.org/10.1016/j.celrep.2018.09.066\">10.1016/j.celrep.2018.09.066</a>","ista":"Chen T, Kula B, Nagy B, Barzan R, Gall A, Ehrlich I, Kukley M. 2018. In Vivo regulation of Oligodendrocyte processor cell proliferation and differentiation by the AMPA-receptor Subunit GluA2. Cell Reports. 25(4), 852–861.e7.","short":"T. Chen, B. Kula, B. Nagy, R. Barzan, A. Gall, I. Ehrlich, M. Kukley, Cell Reports 25 (2018) 852–861.e7."},"article_processing_charge":"No","publication":"Cell Reports","isi":1,"doi":"10.1016/j.celrep.2018.09.066","publisher":"Elsevier","title":"In Vivo regulation of Oligodendrocyte processor cell proliferation and differentiation by the AMPA-receptor Subunit GluA2","quality_controlled":"1","day":"23","oa":1,"type":"journal_article","language":[{"iso":"eng"}],"oa_version":"Published Version","volume":25,"date_updated":"2023-09-11T14:13:32Z","intvolume":"        25","_id":"32","ddc":["570"],"tmp":{"short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png"},"status":"public","year":"2018","file_date_updated":"2020-07-14T12:46:03Z","date_published":"2018-10-23T00:00:00Z"},{"quality_controlled":"1","day":"04","type":"journal_article","oa":1,"language":[{"iso":"eng"}],"publication":"Neuron","isi":1,"publisher":"Elsevier","doi":"10.1016/j.neuron.2018.02.024","title":"Complementary tuning of Na+ and K+ channel gating underlies fast and energy-efficient action potentials in GABAergic interneuron axons","_id":"320","intvolume":"        98","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"ddc":["570"],"status":"public","year":"2018","file_date_updated":"2020-07-14T12:46:03Z","date_published":"2018-04-04T00:00:00Z","related_material":{"link":[{"relation":"press_release","url":"https://ist.ac.at/en/news/a-certain-type-of-neurons-is-more-energy-efficient-than-previously-assumed/","description":"News on IST Homepage"}]},"volume":98,"oa_version":"Published Version","date_updated":"2023-09-11T12:45:10Z","ec_funded":1,"issue":"1","date_created":"2018-12-11T11:45:48Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","page":"156 - 165","external_id":{"isi":["000429192100016"]},"publication_status":"published","author":[{"last_name":"Hu","id":"4AC0145C-F248-11E8-B48F-1D18A9856A87","full_name":"Hu, Hua","first_name":"Hua"},{"first_name":"Fabian","last_name":"Roth","full_name":"Roth, Fabian"},{"orcid":"0000-0001-7577-1676","first_name":"David H","full_name":"Vandael, David H","id":"3AE48E0A-F248-11E8-B48F-1D18A9856A87","last_name":"Vandael"},{"last_name":"Jonas","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","full_name":"Jonas, Peter M","first_name":"Peter M","orcid":"0000-0001-5001-4804"}],"department":[{"_id":"PeJo"}],"citation":{"chicago":"Hu, Hua, Fabian Roth, David H Vandael, and Peter M Jonas. “Complementary Tuning of Na+ and K+ Channel Gating Underlies Fast and Energy-Efficient Action Potentials in GABAergic Interneuron Axons.” <i>Neuron</i>. Elsevier, 2018. <a href=\"https://doi.org/10.1016/j.neuron.2018.02.024\">https://doi.org/10.1016/j.neuron.2018.02.024</a>.","apa":"Hu, H., Roth, F., Vandael, D. H., &#38; Jonas, P. M. (2018). Complementary tuning of Na+ and K+ channel gating underlies fast and energy-efficient action potentials in GABAergic interneuron axons. <i>Neuron</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.neuron.2018.02.024\">https://doi.org/10.1016/j.neuron.2018.02.024</a>","ieee":"H. Hu, F. Roth, D. H. Vandael, and P. M. Jonas, “Complementary tuning of Na+ and K+ channel gating underlies fast and energy-efficient action potentials in GABAergic interneuron axons,” <i>Neuron</i>, vol. 98, no. 1. Elsevier, pp. 156–165, 2018.","ista":"Hu H, Roth F, Vandael DH, Jonas PM. 2018. Complementary tuning of Na+ and K+ channel gating underlies fast and energy-efficient action potentials in GABAergic interneuron axons. Neuron. 98(1), 156–165.","mla":"Hu, Hua, et al. “Complementary Tuning of Na+ and K+ Channel Gating Underlies Fast and Energy-Efficient Action Potentials in GABAergic Interneuron Axons.” <i>Neuron</i>, vol. 98, no. 1, Elsevier, 2018, pp. 156–65, doi:<a href=\"https://doi.org/10.1016/j.neuron.2018.02.024\">10.1016/j.neuron.2018.02.024</a>.","short":"H. Hu, F. Roth, D.H. Vandael, P.M. Jonas, Neuron 98 (2018) 156–165.","ama":"Hu H, Roth F, Vandael DH, Jonas PM. Complementary tuning of Na+ and K+ channel gating underlies fast and energy-efficient action potentials in GABAergic interneuron axons. <i>Neuron</i>. 2018;98(1):156-165. doi:<a href=\"https://doi.org/10.1016/j.neuron.2018.02.024\">10.1016/j.neuron.2018.02.024</a>"},"month":"04","article_processing_charge":"Yes (in subscription journal)","project":[{"_id":"25C0F108-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Nanophysiology of fast-spiking, parvalbumin-expressing GABAergic interneurons","grant_number":"268548"},{"_id":"25B7EB9E-B435-11E9-9278-68D0E5697425","name":"Biophysics and circuit function of a giant cortical glumatergic synapse","call_identifier":"H2020","grant_number":"692692"},{"_id":"25C26B1E-B435-11E9-9278-68D0E5697425","name":"Mechanisms of transmitter release at GABAergic synapses","call_identifier":"FWF","grant_number":"P24909-B24"},{"name":"The Wittgenstein Prize","call_identifier":"FWF","grant_number":"Z00312","_id":"25C5A090-B435-11E9-9278-68D0E5697425"}],"scopus_import":"1","file":[{"file_id":"5690","date_created":"2018-12-17T10:37:50Z","relation":"main_file","file_name":"2018_Neuron_Hu.pdf","content_type":"application/pdf","access_level":"open_access","date_updated":"2020-07-14T12:46:03Z","creator":"dernst","file_size":3180444,"checksum":"76070f3729f9c603e1080d0151aa2b11"}],"has_accepted_license":"1","publist_id":"7545","abstract":[{"lang":"eng","text":"Fast-spiking, parvalbumin-expressing GABAergic interneurons (PV+-BCs) express a complex machinery of rapid signaling mechanisms, including specialized voltage-gated ion channels to generate brief action potentials (APs). However, short APs are associated with overlapping Na+ and K+ fluxes and are therefore energetically expensive. How the potentially vicious combination of high AP frequency and inefficient spike generation can be reconciled with limited energy supply is presently unclear. To address this question, we performed direct recordings from the PV+-BC axon, the subcellular structure where active conductances for AP initiation and propagation are located. Surprisingly, the energy required for the AP was, on average, only ∼1.6 times the theoretical minimum. High energy efficiency emerged from the combination of fast inactivation of Na+ channels and delayed activation of Kv3-type K+ channels, which minimized ion flux overlap during APs. Thus, the complementary tuning of axonal Na+ and K+ channel gating optimizes both fast signaling properties and metabolic efficiency. Hu et al. demonstrate that action potentials in parvalbumin-expressing GABAergic interneuron axons are energetically efficient, which is highly unexpected given their brief duration. High energy efficiency emerges from the combination of fast inactivation of voltage-gated Na+ channels and delayed activation of Kv3 channels in the axon. "}]},{"title":"Guest editors' introduction to the special section on learning with Shared information for computer vision and multimedia analysis","publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","publisher":"IEEE","doi":"10.1109/TPAMI.2018.2804998","isi":1,"oa":1,"type":"journal_article","day":"01","language":[{"iso":"eng"}],"quality_controlled":"1","oa_version":"Published Version","volume":40,"date_updated":"2023-09-11T14:07:54Z","file_date_updated":"2020-07-14T12:46:03Z","year":"2018","date_published":"2018-05-01T00:00:00Z","intvolume":"        40","_id":"321","status":"public","ddc":["000"],"article_type":"original","publication_status":"published","author":[{"last_name":"Darrell","full_name":"Darrell, Trevor","first_name":"Trevor"},{"orcid":"0000-0001-8622-7887","first_name":"Christoph","last_name":"Lampert","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Sebe, Nico","last_name":"Sebe","first_name":"Nico"},{"first_name":"Ying","last_name":"Wu","full_name":"Wu, Ying"},{"first_name":"Yan","last_name":"Yan","full_name":"Yan, Yan"}],"page":"1029 - 1031","external_id":{"isi":["000428901200001"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","issue":"5","date_created":"2018-12-11T11:45:48Z","publist_id":"7544","abstract":[{"lang":"eng","text":"The twelve papers in this special section focus on learning systems with shared information for computer vision and multimedia communication analysis. In the real world, a realistic setting for computer vision or multimedia recognition problems is that we have some classes containing lots of training data and many classes containing a small amount of training data. Therefore, how to use frequent classes to help learning rare classes for which it is harder to collect the training data is an open question. Learning with shared information is an emerging topic in machine learning, computer vision and multimedia analysis. There are different levels of components that can be shared during concept modeling and machine learning stages, such as sharing generic object parts, sharing attributes, sharing transformations, sharing regularization parameters and sharing training examples, etc. Regarding the specific methods, multi-task learning, transfer learning and deep learning can be seen as using different strategies to share information. These learning with shared information methods are very effective in solving real-world large-scale problems."}],"has_accepted_license":"1","scopus_import":"1","file":[{"access_level":"open_access","content_type":"application/pdf","creator":"dernst","file_size":141724,"date_updated":"2020-07-14T12:46:03Z","checksum":"b19c75da06faf3291a3ca47dfa50ef63","date_created":"2020-05-14T12:50:48Z","relation":"main_file","file_id":"7835","file_name":"2018_IEEE_Darrell.pdf"}],"article_processing_charge":"No","citation":{"short":"T. Darrell, C. Lampert, N. Sebe, Y. Wu, Y. Yan, IEEE Transactions on Pattern Analysis and Machine Intelligence 40 (2018) 1029–1031.","ista":"Darrell T, Lampert C, Sebe N, Wu Y, Yan Y. 2018. Guest editors’ introduction to the special section on learning with Shared information for computer vision and multimedia analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence. 40(5), 1029–1031.","mla":"Darrell, Trevor, et al. “Guest Editors’ Introduction to the Special Section on Learning with Shared Information for Computer Vision and Multimedia Analysis.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 40, no. 5, IEEE, 2018, pp. 1029–31, doi:<a href=\"https://doi.org/10.1109/TPAMI.2018.2804998\">10.1109/TPAMI.2018.2804998</a>.","ama":"Darrell T, Lampert C, Sebe N, Wu Y, Yan Y. Guest editors’ introduction to the special section on learning with Shared information for computer vision and multimedia analysis. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. 2018;40(5):1029-1031. doi:<a href=\"https://doi.org/10.1109/TPAMI.2018.2804998\">10.1109/TPAMI.2018.2804998</a>","chicago":"Darrell, Trevor, Christoph Lampert, Nico Sebe, Ying Wu, and Yan Yan. “Guest Editors’ Introduction to the Special Section on Learning with Shared Information for Computer Vision and Multimedia Analysis.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE, 2018. <a href=\"https://doi.org/10.1109/TPAMI.2018.2804998\">https://doi.org/10.1109/TPAMI.2018.2804998</a>.","ieee":"T. Darrell, C. Lampert, N. Sebe, Y. Wu, and Y. Yan, “Guest editors’ introduction to the special section on learning with Shared information for computer vision and multimedia analysis,” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 40, no. 5. IEEE, pp. 1029–1031, 2018.","apa":"Darrell, T., Lampert, C., Sebe, N., Wu, Y., &#38; Yan, Y. (2018). Guest editors’ introduction to the special section on learning with Shared information for computer vision and multimedia analysis. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE. <a href=\"https://doi.org/10.1109/TPAMI.2018.2804998\">https://doi.org/10.1109/TPAMI.2018.2804998</a>"},"month":"05","department":[{"_id":"ChLa"}]},{"quality_controlled":"1","oa":1,"type":"journal_article","day":"15","language":[{"iso":"eng"}],"publication":"Journal of Algebra","doi":"10.1016/j.jalgebra.2018.03.015","publisher":"World Scientific Publishing","isi":1,"arxiv":1,"title":"Quantizations of multiplicative hypertoric varieties at a root of unity","intvolume":"       506","_id":"322","status":"public","year":"2018","date_published":"2018-07-15T00:00:00Z","volume":506,"oa_version":"Preprint","ec_funded":1,"date_updated":"2023-09-15T12:08:38Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_created":"2018-12-11T11:45:49Z","page":"92 - 128","external_id":{"arxiv":["1412.7211"],"isi":["000433270600005"]},"publication_status":"published","author":[{"first_name":"Iordan V","last_name":"Ganev","id":"447491B8-F248-11E8-B48F-1D18A9856A87","full_name":"Ganev, Iordan V"}],"month":"07","citation":{"chicago":"Ganev, Iordan V. “Quantizations of Multiplicative Hypertoric Varieties at a Root of Unity.” <i>Journal of Algebra</i>. World Scientific Publishing, 2018. <a href=\"https://doi.org/10.1016/j.jalgebra.2018.03.015\">https://doi.org/10.1016/j.jalgebra.2018.03.015</a>.","apa":"Ganev, I. V. (2018). Quantizations of multiplicative hypertoric varieties at a root of unity. <i>Journal of Algebra</i>. World Scientific Publishing. <a href=\"https://doi.org/10.1016/j.jalgebra.2018.03.015\">https://doi.org/10.1016/j.jalgebra.2018.03.015</a>","ieee":"I. V. Ganev, “Quantizations of multiplicative hypertoric varieties at a root of unity,” <i>Journal of Algebra</i>, vol. 506. World Scientific Publishing, pp. 92–128, 2018.","short":"I.V. Ganev, Journal of Algebra 506 (2018) 92–128.","ista":"Ganev IV. 2018. Quantizations of multiplicative hypertoric varieties at a root of unity. Journal of Algebra. 506, 92–128.","mla":"Ganev, Iordan V. “Quantizations of Multiplicative Hypertoric Varieties at a Root of Unity.” <i>Journal of Algebra</i>, vol. 506, World Scientific Publishing, 2018, pp. 92–128, doi:<a href=\"https://doi.org/10.1016/j.jalgebra.2018.03.015\">10.1016/j.jalgebra.2018.03.015</a>.","ama":"Ganev IV. Quantizations of multiplicative hypertoric varieties at a root of unity. <i>Journal of Algebra</i>. 2018;506:92-128. doi:<a href=\"https://doi.org/10.1016/j.jalgebra.2018.03.015\">10.1016/j.jalgebra.2018.03.015</a>"},"department":[{"_id":"TaHa"}],"project":[{"name":"Arithmetic and physics of Higgs moduli spaces","call_identifier":"FP7","grant_number":"320593","_id":"25E549F4-B435-11E9-9278-68D0E5697425"}],"article_processing_charge":"No","scopus_import":"1","acknowledgement":"National Science Foundation: Graduate Research Fellowship and grant No.0932078000; ERC Advanced Grant “Arithmetic and Physics of Higgs moduli spaces” No. 320593 \r\nThe author is grateful to David Jordan for suggesting this project and providing guidance throughout, particularly for the formulation of Frobenius quantum moment maps and key ideas in the proofs of Theorems 3.12 and 4.8. Special thanks to David Ben-Zvi (the author's PhD advisor) for numerous discussions and constant encouragement, and for suggesting the term ‘hypertoric quantum group.’ Many results appearing in the current paper were proven independently by Nicholas Cooney; the author is grateful to Nicholas for sharing his insight on various topics, including Proposition 3.8. The author also thanks Nicholas Proudfoot for relating the definition of multiplicative hypertoric varieties, as well as the content of Remark 2.14. The author also benefited immensely from the close reading and detailed comments of an anonymous referee, and from conversations with Justin Hilburn, Kobi Kremnitzer, Michael McBreen, Tom Nevins, Travis Schedler, and Ben Webster. \r\n\r\n\r\n\r\n","publist_id":"7543","abstract":[{"text":"We construct quantizations of multiplicative hypertoric varieties using an algebra of q-difference operators on affine space, where q is a root of unity in C. The quantization defines a matrix bundle (i.e. Azumaya algebra) over the multiplicative hypertoric variety and admits an explicit finite étale splitting. The global sections of this Azumaya algebra is a hypertoric quantum group, and we prove a localization theorem. We introduce a general framework of Frobenius quantum moment maps and their Hamiltonian reductions; our results shed light on an instance of this framework.","lang":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/1412.7211","open_access":"1"}]},{"page":"99","degree_awarded":"PhD","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_created":"2018-12-11T11:45:49Z","supervisor":[{"last_name":"Sixt","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","full_name":"Sixt, Michael K","first_name":"Michael K","orcid":"0000-0002-6620-9179"}],"publication_identifier":{"issn":["2663-337X"]},"author":[{"first_name":"Alexander F","last_name":"Leithner","full_name":"Leithner, Alexander F","id":"3B1B77E4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1073-744X"}],"publication_status":"published","article_processing_charge":"No","citation":{"ama":"Leithner AF. Branched actin networks in dendritic cell biology. 2018. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_998\">10.15479/AT:ISTA:th_998</a>","ista":"Leithner AF. 2018. Branched actin networks in dendritic cell biology. Institute of Science and Technology Austria.","mla":"Leithner, Alexander F. <i>Branched Actin Networks in Dendritic Cell Biology</i>. Institute of Science and Technology Austria, 2018, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_998\">10.15479/AT:ISTA:th_998</a>.","short":"A.F. Leithner, Branched Actin Networks in Dendritic Cell Biology, Institute of Science and Technology Austria, 2018.","chicago":"Leithner, Alexander F. “Branched Actin Networks in Dendritic Cell Biology.” Institute of Science and Technology Austria, 2018. <a href=\"https://doi.org/10.15479/AT:ISTA:th_998\">https://doi.org/10.15479/AT:ISTA:th_998</a>.","apa":"Leithner, A. F. (2018). <i>Branched actin networks in dendritic cell biology</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:th_998\">https://doi.org/10.15479/AT:ISTA:th_998</a>","ieee":"A. F. Leithner, “Branched actin networks in dendritic cell biology,” Institute of Science and Technology Austria, 2018."},"month":"04","alternative_title":["ISTA Thesis"],"department":[{"_id":"MiSi"}],"abstract":[{"lang":"eng","text":"In the here presented thesis, we explore the role of branched actin networks in cell migration and antigen presentation, the two most relevant processes in dendritic cell biology. Branched actin networks construct lamellipodial protrusions at the leading edge of migrating cells. These are typically seen as adhesive structures, which mediate force transduction to the extracellular matrix that leads to forward locomotion. We ablated Arp2/3 nucleation promoting factor WAVE in DCs and found that the resulting cells lack lamellipodial protrusions. Instead, depending on the maturation state, one or multiple filopodia were formed. By challenging these cells in a variety of migration assays we found that lamellipodial protrusions are dispensable for the locomotion of leukocytes and actually dampen the speed of migration. However, lamellipodia are critically required to negotiate complex environments that DCs experience while they travel to the next draining lymph node. Taken together our results suggest that leukocyte lamellipodia have rather a sensory- than a force transducing function. Furthermore, we show for the first time structure and dynamics of dendritic cell F-actin at the immunological synapse with naïve T cells. Dendritic cell F-actin appears as dynamic foci that are nucleated by the Arp2/3 complex. WAVE ablated dendritic cells show increased membrane tension, leading to an altered ultrastructure of the immunological synapse and severe T cell priming defects. These results point towards a previously unappreciated role of the cellular mechanics of dendritic cells in T cell activation. Additionally, we present a novel cell culture based system for the differentiation of dendritic cells from conditionally immortalized hematopoietic precursors. These precursor cells are genetically tractable via the CRISPR/Cas9 system while they retain their ability to differentiate into highly migratory dendritic cells and other immune cells. This will foster the study of all aspects of dendritic cell biology and beyond. "}],"pubrep_id":"998","publist_id":"7542","has_accepted_license":"1","file":[{"content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","access_level":"closed","creator":"dernst","file_size":29027671,"date_updated":"2021-02-11T23:30:17Z","checksum":"d5e3edbac548c26c1fa43a4b37a54a4c","relation":"source_file","date_created":"2019-04-05T09:23:11Z","file_id":"6219","file_name":"PhD_thesis_AlexLeithner_final_version.docx","embargo_to":"open_access"},{"embargo":"2019-04-15","file_name":"PhD_thesis_AlexLeithner.pdf","file_id":"6220","date_created":"2019-04-05T09:23:11Z","relation":"main_file","checksum":"071f7476db29e41146824ebd0697cb10","date_updated":"2021-02-11T11:17:16Z","creator":"dernst","file_size":66045341,"access_level":"open_access","content_type":"application/pdf"}],"acknowledgement":"First of all I would like to thank Michael Sixt for giving me the opportunity to work in \r\nhis group and for his support throughout the years. He is a truly inspiring person and \r\nthe  best  boss  one  can  imagine.  I  would  also  like  to  thank  all  current  and  past \r\nmembers of the Sixt group for their help and the great working atmosphere in the lab. \r\nIt is a true privilege to work with such a bright, funny and friendly group of people and \r\nI’m  proud  that  I  could  be  part  of  it.  Furthermore,  I  would  like  to  say  ‘thank  you’  to Daria Siekhaus for all the meetings and discussion we had throughout the years \r\nand to  Federica  Benvenuti  for  being  part  of  my  committee.  I  am  also  grateful  to  Jack \r\nMerrin  in  the  nanofabrication  facility  and  all  the  people  working  in  the  bioimaging-\r\n, the electron microscopy- and the preclinical facilities.","language":[{"iso":"eng"}],"oa":1,"type":"dissertation","day":"12","title":"Branched actin networks in dendritic cell biology","doi":"10.15479/AT:ISTA:th_998","publisher":"Institute of Science and Technology Austria","date_published":"2018-04-12T00:00:00Z","file_date_updated":"2021-02-11T23:30:17Z","year":"2018","status":"public","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"ddc":["571","599","610"],"_id":"323","date_updated":"2023-09-07T12:39:44Z","oa_version":"Published Version","acknowledged_ssus":[{"_id":"NanoFab"},{"_id":"Bio"},{"_id":"PreCl"},{"_id":"EM-Fac"}],"related_material":{"record":[{"status":"public","id":"1321","relation":"part_of_dissertation"}]}},{"month":"03","alternative_title":["ISTA Thesis"],"citation":{"ista":"Chen C. 2018. Synaptotagmins ensure speed and efficiency of inhibitory neurotransmitter release. Institute of Science and Technology Austria.","mla":"Chen, Chong. <i>Synaptotagmins Ensure Speed and Efficiency of Inhibitory Neurotransmitter Release</i>. Institute of Science and Technology Austria, 2018, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_997\">10.15479/AT:ISTA:th_997</a>.","short":"C. Chen, Synaptotagmins Ensure Speed and Efficiency of Inhibitory Neurotransmitter Release, Institute of Science and Technology Austria, 2018.","ama":"Chen C. Synaptotagmins ensure speed and efficiency of inhibitory neurotransmitter release. 2018. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_997\">10.15479/AT:ISTA:th_997</a>","chicago":"Chen, Chong. “Synaptotagmins Ensure Speed and Efficiency of Inhibitory Neurotransmitter Release.” Institute of Science and Technology Austria, 2018. <a href=\"https://doi.org/10.15479/AT:ISTA:th_997\">https://doi.org/10.15479/AT:ISTA:th_997</a>.","ieee":"C. Chen, “Synaptotagmins ensure speed and efficiency of inhibitory neurotransmitter release,” Institute of Science and Technology Austria, 2018.","apa":"Chen, C. (2018). <i>Synaptotagmins ensure speed and efficiency of inhibitory neurotransmitter release</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:th_997\">https://doi.org/10.15479/AT:ISTA:th_997</a>"},"department":[{"_id":"PeJo"}],"article_processing_charge":"No","has_accepted_license":"1","file":[{"file_id":"5046","date_created":"2018-12-12T10:13:58Z","relation":"main_file","file_name":"IST-2018-997-v1+1_Thesis_chong_a.pdf","content_type":"application/pdf","access_level":"open_access","date_updated":"2020-07-14T12:46:04Z","creator":"system","file_size":8719458,"checksum":"8e163ae9e927401b9fa7c1b3e6a3631a"},{"relation":"source_file","date_created":"2019-04-05T09:25:26Z","file_id":"6221","file_name":"2018_Thesis_chong_source.pages","file_size":47841940,"creator":"dernst","date_updated":"2020-07-14T12:46:04Z","checksum":"f7d7260029a5fbb5c982db61328ade52","content_type":"application/octet-stream","access_level":"closed"}],"abstract":[{"lang":"eng","text":"Neuronal networks in the brain consist of two main types of neuron, glutamatergic principal neurons and GABAergic interneurons. Although these interneurons only represent 10–20% of the whole population, they mediate feedback and feedforward inhibition and are involved in the generation of high-frequency network oscillations. A hallmark functional property of GABAergic interneurons, especially of the parvalbumin‑expressing (PV+) subtypes, is the speed of signaling at their output synapse across species and brain regions. Several molecular and subcellular factors may underlie the submillisecond signaling at GABAergic synapses. Such as the selective use of P/Q type Ca2+ channels and the tight coupling between Ca2+ channels and Ca2+ sensors of exocytosis. However, whether the molecular identity of the release sensor contributes to these signaling properties remains unclear. Besides, these interneurons are mainly show depression in response to train of stimuli. How could they keep sufficient release to control the activity of postsynaptic principal neurons during high network activity, is largely elusive. For my Ph.D. work, we firstly examined the Ca2+ sensor of exocytosis at the GABAergic basket cell (BC) to Purkinje cell (PC) synapse in the cerebellum. Immunolabeling suggested that BC terminals selectively expressed synaptotagmin 2 (Syt2), whereas synaptotagmin 1 (Syt1) was enriched in excitatory terminals. Genetic elimination of Syt2 reduced action potential-evoked release to ~10% compared to the wild-type control, identifying Syt2 as the major Ca2+ sensor at BC‑PC synapses. Differential adenovirus-mediated rescue revealed Syt2 triggered release with shorter latency and higher temporal precision, and mediated faster vesicle pool replenishment than Syt1. Furthermore, deletion of Syt2 severely reduced and delayed disynaptic inhibition following parallel fiber stimulation. Thus, the selective use of Syt2 as the release sensor at BC–PC synapse ensures fast feedforward inhibition in cerebellar microcircuits. Additionally, we tested the function of another synaptotagmin member, Syt7, for inhibitory synaptic transmission at the BC–PC synapse. Syt7 is thought to be a Ca2+ sensor that mediates asynchronous transmitter release and facilitation at synapses. However, it is strongly expressed in fast-spiking, PV+ GABAergic interneurons and the output synapses of these neurons produce only minimal asynchronous release and show depression rather than facilitation. How could Syt7, a facilitation sensor, contribute to the depressed inhibitory synaptic transmission needs to be further investigated and understood. Our results indicated that at the BC–PC synapse, Syt7 contributes to asynchronous release, pool replenishment and facilitation. In combination, these three effects ensure efficient transmitter release during high‑frequency activity and guarantee frequency independence of inhibition. Taken together, our results confirmed that Syt2, which has the fastest kinetic properties among all synaptotagmin members, is mainly used by the inhibitory BC‑PC synapse for synaptic transmission, contributing to the speed and temporal precision of transmitter release. Furthermore, we showed that Syt7, another highly expressed synaptotagmin member in the output synapses of cerebellar BCs, is used for ensuring efficient inhibitor synaptic transmission during high activity."}],"pubrep_id":"997","publist_id":"7541","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_created":"2018-12-11T11:45:49Z","page":"110","degree_awarded":"PhD","author":[{"first_name":"Chong","last_name":"Chen","full_name":"Chen, Chong","id":"3DFD581A-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"published","publication_identifier":{"issn":["2663-337X"]},"supervisor":[{"first_name":"Peter M","full_name":"Jonas, Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","last_name":"Jonas","orcid":"0000-0001-5001-4804"}],"status":"public","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"ddc":["571"],"_id":"324","date_published":"2018-03-01T00:00:00Z","file_date_updated":"2020-07-14T12:46:04Z","year":"2018","related_material":{"record":[{"status":"public","id":"1117","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"749","status":"public"}]},"date_updated":"2023-09-27T12:26:03Z","oa_version":"Published Version","language":[{"iso":"eng"}],"type":"dissertation","oa":1,"day":"01","publisher":"Institute of Science and Technology Austria","doi":"10.15479/AT:ISTA:th_997","title":"Synaptotagmins ensure speed and efficiency of inhibitory neurotransmitter release"},{"year":"2018","date_published":"2018-01-01T00:00:00Z","_id":"325","intvolume":"         2","status":"public","oa_version":"Preprint","volume":2,"date_updated":"2021-01-12T07:42:07Z","type":"conference","oa":1,"day":"01","language":[{"iso":"eng"}],"quality_controlled":"1","title":"Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs","arxiv":1,"doi":"10.1145/3158122","publisher":"ACM","article_number":"34","project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"month":"01","citation":{"ieee":"S. Agrawal, K. Chatterjee, and P. Novotný, “Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs,” presented at the POPL: Principles of Programming Languages, Los Angeles, CA, USA, 2018, vol. 2, no. POPL.","apa":"Agrawal, S., Chatterjee, K., &#38; Novotný, P. (2018). Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs (Vol. 2). Presented at the POPL: Principles of Programming Languages, Los Angeles, CA, USA: ACM. <a href=\"https://doi.org/10.1145/3158122\">https://doi.org/10.1145/3158122</a>","chicago":"Agrawal, Sheshansh, Krishnendu Chatterjee, and Petr Novotný. “Lexicographic Ranking Supermartingales: An Efficient Approach to Termination of Probabilistic Programs,” Vol. 2. ACM, 2018. <a href=\"https://doi.org/10.1145/3158122\">https://doi.org/10.1145/3158122</a>.","ista":"Agrawal S, Chatterjee K, Novotný P. 2018. Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs. POPL: Principles of Programming Languages vol. 2, 34.","short":"S. Agrawal, K. Chatterjee, P. Novotný, in:, ACM, 2018.","mla":"Agrawal, Sheshansh, et al. <i>Lexicographic Ranking Supermartingales: An Efficient Approach to Termination of Probabilistic Programs</i>. Vol. 2, no. POPL, 34, ACM, 2018, doi:<a href=\"https://doi.org/10.1145/3158122\">10.1145/3158122</a>.","ama":"Agrawal S, Chatterjee K, Novotný P. Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs. In: Vol 2. ACM; 2018. doi:<a href=\"https://doi.org/10.1145/3158122\">10.1145/3158122</a>"},"department":[{"_id":"KrCh"}],"publist_id":"7540","abstract":[{"text":"Probabilistic programs extend classical imperative programs with real-valued random variables and random branching. The most basic liveness property for such programs is the termination property. The qualitative (aka almost-sure) termination problem asks whether a given program program terminates with probability 1. While ranking functions provide a sound and complete method for non-probabilistic programs, the extension of them to probabilistic programs is achieved via ranking supermartingales (RSMs). Although deep theoretical results have been established about RSMs, their application to probabilistic programs with nondeterminism has been limited only to programs of restricted control-flow structure. For non-probabilistic programs, lexicographic ranking functions provide a compositional and practical approach for termination analysis of real-world programs. In this work we introduce lexicographic RSMs and show that they present a sound method for almost-sure termination of probabilistic programs with nondeterminism. We show that lexicographic RSMs provide a tool for compositional reasoning about almost-sure termination, and for probabilistic programs with linear arithmetic they can be synthesized efficiently (in polynomial time). We also show that with additional restrictions even asymptotic bounds on expected termination time can be obtained through lexicographic RSMs. Finally, we present experimental results on benchmarks adapted from previous work to demonstrate the effectiveness of our approach.","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1709.04037"}],"conference":{"location":"Los Angeles, CA, USA","start_date":"2018-01-07","name":"POPL: Principles of Programming Languages","end_date":"2018-01-13"},"external_id":{"arxiv":["1709.04037"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:45:50Z","issue":"POPL","publication_status":"published","author":[{"last_name":"Agrawal","full_name":"Agrawal, Sheshansh","first_name":"Sheshansh"},{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","full_name":"Novotny, Petr","last_name":"Novotny","first_name":"Petr"}]},{"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","issue":"9","date_created":"2018-12-11T11:45:50Z","license":"https://creativecommons.org/licenses/by-nc/4.0/","external_id":{"isi":["000431496400001"]},"page":"1033 - 1042","author":[{"first_name":"Kazuaki","full_name":"Sawada, Kazuaki","last_name":"Sawada"},{"first_name":"Ryosuke","full_name":"Kawakami, Ryosuke","last_name":"Kawakami"},{"first_name":"Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","full_name":"Shigemoto, Ryuichi","last_name":"Shigemoto","orcid":"0000-0001-8761-9444"},{"first_name":"Tomomi","full_name":"Nemoto, Tomomi","last_name":"Nemoto"}],"publication_status":"published","citation":{"ieee":"K. Sawada, R. Kawakami, R. Shigemoto, and T. Nemoto, “Super resolution structural analysis of dendritic spines using three-dimensional structured illumination microscopy in cleared mouse brain slices,” <i>European Journal of Neuroscience</i>, vol. 47, no. 9. Wiley, pp. 1033–1042, 2018.","apa":"Sawada, K., Kawakami, R., Shigemoto, R., &#38; Nemoto, T. (2018). Super resolution structural analysis of dendritic spines using three-dimensional structured illumination microscopy in cleared mouse brain slices. <i>European Journal of Neuroscience</i>. Wiley. <a href=\"https://doi.org/10.1111/ejn.13901\">https://doi.org/10.1111/ejn.13901</a>","chicago":"Sawada, Kazuaki, Ryosuke Kawakami, Ryuichi Shigemoto, and Tomomi Nemoto. “Super Resolution Structural Analysis of Dendritic Spines Using Three-Dimensional Structured Illumination Microscopy in Cleared Mouse Brain Slices.” <i>European Journal of Neuroscience</i>. Wiley, 2018. <a href=\"https://doi.org/10.1111/ejn.13901\">https://doi.org/10.1111/ejn.13901</a>.","short":"K. Sawada, R. Kawakami, R. Shigemoto, T. Nemoto, European Journal of Neuroscience 47 (2018) 1033–1042.","mla":"Sawada, Kazuaki, et al. “Super Resolution Structural Analysis of Dendritic Spines Using Three-Dimensional Structured Illumination Microscopy in Cleared Mouse Brain Slices.” <i>European Journal of Neuroscience</i>, vol. 47, no. 9, Wiley, 2018, pp. 1033–42, doi:<a href=\"https://doi.org/10.1111/ejn.13901\">10.1111/ejn.13901</a>.","ista":"Sawada K, Kawakami R, Shigemoto R, Nemoto T. 2018. Super resolution structural analysis of dendritic spines using three-dimensional structured illumination microscopy in cleared mouse brain slices. European Journal of Neuroscience. 47(9), 1033–1042.","ama":"Sawada K, Kawakami R, Shigemoto R, Nemoto T. Super resolution structural analysis of dendritic spines using three-dimensional structured illumination microscopy in cleared mouse brain slices. <i>European Journal of Neuroscience</i>. 2018;47(9):1033-1042. doi:<a href=\"https://doi.org/10.1111/ejn.13901\">10.1111/ejn.13901</a>"},"month":"03","department":[{"_id":"RySh"}],"article_processing_charge":"No","has_accepted_license":"1","scopus_import":"1","file":[{"file_id":"5721","date_created":"2018-12-17T16:16:50Z","relation":"main_file","file_name":"2018_EJN_Sawada.pdf","access_level":"open_access","content_type":"application/pdf","date_updated":"2020-07-14T12:46:06Z","file_size":4850261,"creator":"dernst","checksum":"98e901d8229e44aa8f3b51d248dedd09"}],"abstract":[{"lang":"eng","text":"Three-dimensional (3D) super-resolution microscopy technique structured illumination microscopy (SIM) imaging of dendritic spines along the dendrite has not been previously performed in fixed tissues, mainly due to deterioration of the stripe pattern of the excitation laser induced by light scattering and optical aberrations. To address this issue and solve these optical problems, we applied a novel clearing reagent, LUCID, to fixed brains. In SIM imaging, the penetration depth and the spatial resolution were improved in LUCID-treated slices, and 160-nm spatial resolution was obtained in a large portion of the imaging volume on a single apical dendrite. Furthermore, in a morphological analysis of spine heads of layer V pyramidal neurons (L5PNs) in the medial prefrontal cortex (mPFC) of chronic dexamethasone (Dex)-treated mice, SIM imaging revealed an altered distribution of spine forms that could not be detected by high-NA confocal imaging. Thus, super-resolution SIM imaging represents a promising high-throughput method for revealing spine morphologies in single dendrites."}],"publist_id":"7539","quality_controlled":"1","language":[{"iso":"eng"}],"type":"journal_article","oa":1,"day":"07","publisher":"Wiley","doi":"10.1111/ejn.13901","isi":1,"publication":"European Journal of Neuroscience","title":"Super resolution structural analysis of dendritic spines using three-dimensional structured illumination microscopy in cleared mouse brain slices","status":"public","ddc":["570"],"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"},"intvolume":"        47","_id":"326","date_published":"2018-03-07T00:00:00Z","file_date_updated":"2020-07-14T12:46:06Z","year":"2018","date_updated":"2023-09-19T09:58:40Z","volume":47,"oa_version":"Published Version","acknowledged_ssus":[{"_id":"EM-Fac"}]},{"article_number":"104307","article_processing_charge":"No","department":[{"_id":"MaSe"}],"citation":{"short":"A. Michailidis, M. Žnidarič, M. Medvedyeva, D. Abanin, T. Prosen, Z. Papić, Physical Review B 97 (2018).","ista":"Michailidis A, Žnidarič M, Medvedyeva M, Abanin D, Prosen T, Papić Z. 2018. Slow dynamics in translation-invariant quantum lattice models. Physical Review B. 97(10), 104307.","mla":"Michailidis, Alexios, et al. “Slow Dynamics in Translation-Invariant Quantum Lattice Models.” <i>Physical Review B</i>, vol. 97, no. 10, 104307, American Physical Society, 2018, doi:<a href=\"https://doi.org/10.1103/PhysRevB.97.104307\">10.1103/PhysRevB.97.104307</a>.","ama":"Michailidis A, Žnidarič M, Medvedyeva M, Abanin D, Prosen T, Papić Z. Slow dynamics in translation-invariant quantum lattice models. <i>Physical Review B</i>. 2018;97(10). doi:<a href=\"https://doi.org/10.1103/PhysRevB.97.104307\">10.1103/PhysRevB.97.104307</a>","chicago":"Michailidis, Alexios, Marko Žnidarič, Mariya Medvedyeva, Dmitry Abanin, Tomaž Prosen, and Zlatko Papić. “Slow Dynamics in Translation-Invariant Quantum Lattice Models.” <i>Physical Review B</i>. American Physical Society, 2018. <a href=\"https://doi.org/10.1103/PhysRevB.97.104307\">https://doi.org/10.1103/PhysRevB.97.104307</a>.","ieee":"A. Michailidis, M. Žnidarič, M. Medvedyeva, D. Abanin, T. Prosen, and Z. Papić, “Slow dynamics in translation-invariant quantum lattice models,” <i>Physical Review B</i>, vol. 97, no. 10. American Physical Society, 2018.","apa":"Michailidis, A., Žnidarič, M., Medvedyeva, M., Abanin, D., Prosen, T., &#38; Papić, Z. (2018). Slow dynamics in translation-invariant quantum lattice models. <i>Physical Review B</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevB.97.104307\">https://doi.org/10.1103/PhysRevB.97.104307</a>"},"month":"03","publist_id":"7538","main_file_link":[{"url":"https://arxiv.org/abs/1706.05026","open_access":"1"}],"abstract":[{"text":"Many-body quantum systems typically display fast dynamics and ballistic spreading of information. Here we address the open problem of how slow the dynamics can be after a generic breaking of integrability by local interactions. We develop a method based on degenerate perturbation theory that reveals slow dynamical regimes and delocalization processes in general translation invariant models, along with accurate estimates of their delocalization time scales. Our results shed light on the fundamental questions of the robustness of quantum integrable systems and the possibility of many-body localization without disorder. As an example, we construct a large class of one-dimensional lattice models where, despite the absence of asymptotic localization, the transient dynamics is exceptionally slow, i.e., the dynamics is indistinguishable from that of many-body localized systems for the system sizes and time scales accessible in experiments and numerical simulations.","lang":"eng"}],"scopus_import":"1","acknowledgement":"We thank F. Huveneers for useful discussions. Z.P. and A.M. acknowledge support by EPSRC Grant No. EP/P009409/1 and and the Royal Society Research Grant No. RG160635. Statement of compliance with EPSRC policy framework on research data: This publication is theoretical work that does not require supporting research data. D.A. acknowledges support by the Swiss National Science Foundation. M.Z., M.M. and T.P. acknowledge Grants J1-7279 (M.Z.) and N1-0025 (M.M. and T.P.) of Slovenian Research Agency, and Advanced Grant of European Research Council, Grant No. 694544 - OMNES (T.P.).","external_id":{"isi":["000427798800005"]},"date_created":"2018-12-11T11:45:50Z","issue":"10","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publication_status":"published","author":[{"orcid":"0000-0002-8443-1064","first_name":"Alexios","full_name":"Michailidis, Alexios","id":"36EBAD38-F248-11E8-B48F-1D18A9856A87","last_name":"Michailidis"},{"last_name":"Žnidarič","full_name":"Žnidarič, Marko","first_name":"Marko"},{"first_name":"Mariya","full_name":"Medvedyeva, Mariya","last_name":"Medvedyeva"},{"full_name":"Abanin, Dmitry","last_name":"Abanin","first_name":"Dmitry"},{"first_name":"Tomaž","full_name":"Prosen, Tomaž","last_name":"Prosen"},{"full_name":"Papić, Zlatko","last_name":"Papić","first_name":"Zlatko"}],"year":"2018","date_published":"2018-03-19T00:00:00Z","intvolume":"        97","_id":"327","status":"public","oa_version":"Preprint","volume":97,"date_updated":"2023-09-18T09:31:46Z","day":"19","oa":1,"type":"journal_article","language":[{"iso":"eng"}],"quality_controlled":"1","title":"Slow dynamics in translation-invariant quantum lattice models","publication":"Physical Review B","isi":1,"publisher":"American Physical Society","doi":"10.1103/PhysRevB.97.104307"},{"ec_funded":1,"date_updated":"2023-10-10T13:27:44Z","oa_version":"Preprint","volume":120,"acknowledged_ssus":[{"_id":"SSU"}],"date_published":"2018-03-19T00:00:00Z","year":"2018","status":"public","_id":"328","intvolume":"       120","title":"Exceeding the asymptotic limit of polymer drag reduction","doi":"10.1103/PhysRevLett.120.124501","publisher":"American Physical Society","isi":1,"publication":"Physical Review Letters","language":[{"iso":"eng"}],"type":"journal_article","oa":1,"day":"19","quality_controlled":"1","abstract":[{"text":"The drag of turbulent flows can be drastically decreased by adding small amounts of high molecular weight polymers. While drag reduction initially increases with polymer concentration, it eventually saturates to what is known as the maximum drag reduction (MDR) asymptote; this asymptote is generally attributed to the dynamics being reduced to a marginal yet persistent state of subdued turbulent motion. Contrary to this accepted view, we show that, for an appropriate choice of parameters, polymers can reduce the drag beyond the suggested asymptotic limit, eliminating turbulence and giving way to laminar flow. At higher polymer concentrations, however, the laminar state becomes unstable, resulting in a fluctuating flow with the characteristic drag of the MDR asymptote. Our findings indicate that the asymptotic state is hence dynamically disconnected from ordinary turbulence. © 2018 American Physical Society.","lang":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/1703.06271","open_access":"1"}],"publist_id":"7537","acknowledgement":"The authors thank Philipp Maier and the IST Austria workshop for their dedicated technical support.","scopus_import":"1","project":[{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"},{"_id":"25152F3A-B435-11E9-9278-68D0E5697425","name":"Decoding the complexity of turbulence at its origin","call_identifier":"FP7","grant_number":"306589"}],"article_processing_charge":"No","article_number":"124501","citation":{"apa":"Choueiri, G. H., Lopez Alonso, J. M., &#38; Hof, B. (2018). Exceeding the asymptotic limit of polymer drag reduction. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevLett.120.124501\">https://doi.org/10.1103/PhysRevLett.120.124501</a>","ieee":"G. H. Choueiri, J. M. Lopez Alonso, and B. Hof, “Exceeding the asymptotic limit of polymer drag reduction,” <i>Physical Review Letters</i>, vol. 120, no. 12. American Physical Society, 2018.","chicago":"Choueiri, George H, Jose M Lopez Alonso, and Björn Hof. “Exceeding the Asymptotic Limit of Polymer Drag Reduction.” <i>Physical Review Letters</i>. American Physical Society, 2018. <a href=\"https://doi.org/10.1103/PhysRevLett.120.124501\">https://doi.org/10.1103/PhysRevLett.120.124501</a>.","ama":"Choueiri GH, Lopez Alonso JM, Hof B. Exceeding the asymptotic limit of polymer drag reduction. <i>Physical Review Letters</i>. 2018;120(12). doi:<a href=\"https://doi.org/10.1103/PhysRevLett.120.124501\">10.1103/PhysRevLett.120.124501</a>","mla":"Choueiri, George H., et al. “Exceeding the Asymptotic Limit of Polymer Drag Reduction.” <i>Physical Review Letters</i>, vol. 120, no. 12, 124501, American Physical Society, 2018, doi:<a href=\"https://doi.org/10.1103/PhysRevLett.120.124501\">10.1103/PhysRevLett.120.124501</a>.","ista":"Choueiri GH, Lopez Alonso JM, Hof B. 2018. Exceeding the asymptotic limit of polymer drag reduction. Physical Review Letters. 120(12), 124501.","short":"G.H. Choueiri, J.M. Lopez Alonso, B. Hof, Physical Review Letters 120 (2018)."},"month":"03","department":[{"_id":"BjHo"}],"author":[{"first_name":"George H","last_name":"Choueiri","full_name":"Choueiri, George H","id":"448BD5BC-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-0384-2022","first_name":"Jose M","last_name":"Lopez Alonso","full_name":"Lopez Alonso, Jose M","id":"40770848-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Hof","full_name":"Hof, Björn","id":"3A374330-F248-11E8-B48F-1D18A9856A87","first_name":"Björn","orcid":"0000-0003-2057-2754"}],"publication_status":"published","external_id":{"isi":["000427804000005"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:45:51Z","issue":"12"},{"date_updated":"2023-10-17T12:24:43Z","oa_version":"Published Version","volume":2018,"status":"public","ddc":["576"],"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"intvolume":"      2018","_id":"33","date_published":"2018-10-01T00:00:00Z","file_date_updated":"2020-07-14T12:46:06Z","year":"2018","publisher":"PeerJ","doi":"10.7717/peerj.5325","isi":1,"publication":"PeerJ","pmid":1,"title":"Can secondary contact following range expansion be distinguished from barriers to gene flow?","quality_controlled":"1","language":[{"iso":"eng"}],"type":"journal_article","oa":1,"day":"01","has_accepted_license":"1","acknowledgement":"Johanna Bertl was supported by the Vienna Graduate School of Population Genetics (Austrian Science Fund (FWF): W1225-B20) and worked on this project while employed at the Department of Statistics and Operations Research, University of Vienna, Austria. This article was developed in the framework of the Grenoble Alpes Data Institute, which is supported by the French National Research Agency under the “Investissments d’avenir” program (ANR-15-IDEX-02).","file":[{"access_level":"open_access","content_type":"application/pdf","date_updated":"2020-07-14T12:46:06Z","creator":"dernst","file_size":1328344,"checksum":"3334886c4b39678db4c4b74299ca14ba","file_id":"5692","date_created":"2018-12-17T10:46:06Z","relation":"main_file","file_name":"2018_PeerJ_Bertl.pdf"}],"scopus_import":"1","abstract":[{"text":"Secondary contact is the reestablishment of gene flow between sister populations that have diverged. For instance, at the end of the Quaternary glaciations in Europe, secondary contact occurred during the northward expansion of the populations which had found refugia in the southern peninsulas. With the advent of multi-locus markers, secondary contact can be investigated using various molecular signatures including gradients of allele frequency, admixture clines, and local increase of genetic differentiation. We use coalescent simulations to investigate if molecular data provide enough information to distinguish between secondary contact following range expansion and an alternative evolutionary scenario consisting of a barrier to gene flow in an isolation-by-distance model. We find that an excess of linkage disequilibrium and of genetic diversity at the suture zone is a unique signature of secondary contact. We also find that the directionality index ψ, which was proposed to study range expansion, is informative to distinguish between the two hypotheses. However, although evidence for secondary contact is usually conveyed by statistics related to admixture coefficients, we find that they can be confounded by isolation-by-distance. We recommend to account for the spatial repartition of individuals when investigating secondary contact in order to better reflect the complex spatio-temporal evolution of populations and species.","lang":"eng"}],"publist_id":"8022","month":"10","citation":{"ista":"Bertl J, Ringbauer H, Blum M. 2018. Can secondary contact following range expansion be distinguished from barriers to gene flow? PeerJ. 2018(10), e5325.","ama":"Bertl J, Ringbauer H, Blum M. Can secondary contact following range expansion be distinguished from barriers to gene flow? <i>PeerJ</i>. 2018;2018(10). doi:<a href=\"https://doi.org/10.7717/peerj.5325\">10.7717/peerj.5325</a>","short":"J. Bertl, H. Ringbauer, M. Blum, PeerJ 2018 (2018).","mla":"Bertl, Johanna, et al. “Can Secondary Contact Following Range Expansion Be Distinguished from Barriers to Gene Flow?” <i>PeerJ</i>, vol. 2018, no. 10, e5325, PeerJ, 2018, doi:<a href=\"https://doi.org/10.7717/peerj.5325\">10.7717/peerj.5325</a>.","apa":"Bertl, J., Ringbauer, H., &#38; Blum, M. (2018). Can secondary contact following range expansion be distinguished from barriers to gene flow? <i>PeerJ</i>. PeerJ. <a href=\"https://doi.org/10.7717/peerj.5325\">https://doi.org/10.7717/peerj.5325</a>","ieee":"J. Bertl, H. Ringbauer, and M. Blum, “Can secondary contact following range expansion be distinguished from barriers to gene flow?,” <i>PeerJ</i>, vol. 2018, no. 10. PeerJ, 2018.","chicago":"Bertl, Johanna, Harald Ringbauer, and Michaël Blum. “Can Secondary Contact Following Range Expansion Be Distinguished from Barriers to Gene Flow?” <i>PeerJ</i>. PeerJ, 2018. <a href=\"https://doi.org/10.7717/peerj.5325\">https://doi.org/10.7717/peerj.5325</a>."},"department":[{"_id":"NiBa"}],"article_processing_charge":"No","article_number":"e5325","author":[{"first_name":"Johanna","last_name":"Bertl","full_name":"Bertl, Johanna"},{"orcid":"0000-0002-4884-9682","last_name":"Ringbauer","id":"417FCFF4-F248-11E8-B48F-1D18A9856A87","full_name":"Ringbauer, Harald","first_name":"Harald"},{"first_name":"Michaël","full_name":"Blum, Michaël","last_name":"Blum"}],"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"10","date_created":"2018-12-11T11:44:16Z","external_id":{"isi":["000447204400001"],"pmid":["30294507"]}},{"_id":"3300","citation":{"ieee":"E. M. Clarke, T. A. Henzinger, H. Veith, and R. Bloem, <i>Handbook of Model Checking</i>, 1st ed. Cham: Springer Nature, 2018.","apa":"Clarke, E. M., Henzinger, T. A., Veith, H., &#38; Bloem, R. (2018). <i>Handbook of Model Checking</i> (1st ed.). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-319-10575-8\">https://doi.org/10.1007/978-3-319-10575-8</a>","chicago":"Clarke, Edmund M., Thomas A Henzinger, Helmut Veith, and Roderick Bloem. <i>Handbook of Model Checking</i>. 1st ed. Cham: Springer Nature, 2018. <a href=\"https://doi.org/10.1007/978-3-319-10575-8\">https://doi.org/10.1007/978-3-319-10575-8</a>.","ama":"Clarke EM, Henzinger TA, Veith H, Bloem R. <i>Handbook of Model Checking</i>. 1st ed. Cham: Springer Nature; 2018. doi:<a href=\"https://doi.org/10.1007/978-3-319-10575-8\">10.1007/978-3-319-10575-8</a>","short":"E.M. Clarke, T.A. Henzinger, H. Veith, R. Bloem, Handbook of Model Checking, 1st ed., Springer Nature, Cham, 2018.","mla":"Clarke, Edmund M., et al. <i>Handbook of Model Checking</i>. 1st ed., Springer Nature, 2018, doi:<a href=\"https://doi.org/10.1007/978-3-319-10575-8\">10.1007/978-3-319-10575-8</a>.","ista":"Clarke EM, Henzinger TA, Veith H, Bloem R. 2018. Handbook of Model Checking 1st ed., Cham: Springer Nature, XLVIII, 1212p."},"month":"06","status":"public","department":[{"_id":"ToHe"}],"year":"2018","date_published":"2018-06-08T00:00:00Z","article_processing_charge":"No","edition":"1","scopus_import":"1","oa_version":"None","publist_id":"3340","abstract":[{"text":"This book first explores the origins of this idea, grounded in theoretical work on temporal logic and automata. The editors and authors are among the world's leading researchers in this domain, and they contributed 32 chapters representing a thorough view of the development and application of the technique. Topics covered include binary decision diagrams, symbolic model checking, satisfiability modulo theories, partial-order reduction, abstraction, interpolation, concurrency, security protocols, games, probabilistic model checking, and process algebra, and chapters on the transfer of theory to industrial practice, property specification languages for hardware, and verification of real-time systems and hybrid systems.\r\n\r\nThe book will be valuable for researchers and graduate students engaged with the development of formal methods and verification tools.","lang":"eng"}],"date_updated":"2025-07-24T09:25:31Z","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T12:02:32Z","type":"book","place":"Cham","page":"XLVIII, 1212","day":"08","retracted":"1","language":[{"iso":"eng"}],"publication_status":"published","author":[{"full_name":"Clarke, Edmund M.","last_name":"Clarke","first_name":"Edmund M."},{"first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"last_name":"Veith","full_name":"Veith, Helmut","first_name":"Helmut"},{"first_name":"Roderick","last_name":"Bloem","full_name":"Bloem, Roderick"}],"publisher":"Springer Nature","doi":"10.1007/978-3-319-10575-8","title":"Handbook of Model Checking","publication_identifier":{"eisbn":["978-3-319-10575-8"],"isbn":["978-3-319-10574-1"]}}]