[{"type":"conference","oa_version":"Published Version","publication_status":"published","doi":"10.4230/LIPIcs.MFCS.2017.61","status":"public","department":[{"_id":"KrCh"}],"date_updated":"2025-07-10T11:52:51Z","article_processing_charge":"No","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen","id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389","first_name":"Rasmus"},{"first_name":"Martin","full_name":"Nowak, Martin","last_name":"Nowak"}],"corr_author":"1","license":"https://creativecommons.org/licenses/by/4.0/","file_date_updated":"2020-07-14T12:47:00Z","scopus_import":"1","language":[{"iso":"eng"}],"pubrep_id":"924","citation":{"apa":"Chatterjee, K., Ibsen-Jensen, R., &#38; Nowak, M. (2017). Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs. In <i>Leibniz International Proceedings in Informatics</i> (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2017.61\">https://doi.org/10.4230/LIPIcs.MFCS.2017.61</a>","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. “Faster Monte Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs.” In <i>Leibniz International Proceedings in Informatics</i>, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2017.61\">https://doi.org/10.4230/LIPIcs.MFCS.2017.61</a>.","ama":"Chatterjee K, Ibsen-Jensen R, Nowak M. Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs. In: <i>Leibniz International Proceedings in Informatics</i>. Vol 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2017.61\">10.4230/LIPIcs.MFCS.2017.61</a>","ieee":"K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, “Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs,” in <i>Leibniz International Proceedings in Informatics</i>, Aalborg, Denmark, 2017, vol. 83.","short":"K. Chatterjee, R. Ibsen-Jensen, M. Nowak, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","ista":"Chatterjee K, Ibsen-Jensen R, Nowak M. 2017. Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs. Leibniz International Proceedings in Informatics. MFCS: Mathematical Foundations of Computer Science, LIPIcs, vol. 83, 61.","mla":"Chatterjee, Krishnendu, et al. “Faster Monte Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs.” <i>Leibniz International Proceedings in Informatics</i>, vol. 83, 61, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2017.61\">10.4230/LIPIcs.MFCS.2017.61</a>."},"article_number":"61","has_accepted_license":"1","publication_identifier":{"isbn":["978-395977046-0"]},"file":[{"content_type":"application/pdf","creator":"system","file_id":"5322","date_created":"2018-12-12T10:18:04Z","access_level":"open_access","checksum":"2eed5224c0e4e259484a1d71acb8ba6a","relation":"main_file","file_size":535077,"file_name":"IST-2018-924-v1+1_LIPIcs-MFCS-2017-61.pdf","date_updated":"2020-07-14T12:47:00Z"}],"month":"11","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"end_date":"2017-08-25","name":"MFCS: Mathematical Foundations of Computer Science","location":"Aalborg, Denmark","start_date":"2017-08-21"},"quality_controlled":"1","date_created":"2018-12-11T11:47:08Z","intvolume":"        83","abstract":[{"text":"Evolutionary graph theory studies the evolutionary dynamics in a population structure given as a connected graph. Each node of the graph represents an individual of the population, and edges determine how offspring are placed. We consider the classical birth-death Moran process where there are two types of individuals, namely, the residents with fitness 1 and mutants with fitness r. The fitness indicates the reproductive strength. The evolutionary dynamics happens as follows: in the initial step, in a population of all resident individuals a mutant is introduced, and then at each step, an individual is chosen proportional to the fitness of its type to reproduce, and the offspring replaces a neighbor uniformly at random. The process stops when all individuals are either residents or mutants. The probability that all individuals in the end are mutants is called the fixation probability, which is a key factor in the rate of evolution. We consider the problem of approximating the fixation probability. The class of algorithms that is extremely relevant for approximation of the fixation probabilities is the Monte-Carlo simulation of the process. Previous results present a polynomial-time Monte-Carlo algorithm for undirected graphs when r is given in unary. First, we present a simple modification: instead of simulating each step, we discard ineffective steps, where no node changes type (i.e., either residents replace residents, or mutants replace mutants). Using the above simple modification and our result that the number of effective steps is concentrated around the expected number of effective steps, we present faster polynomial-time Monte-Carlo algorithms for undirected graphs. Our algorithms are always at least a factor O(n2/ log n) faster as compared to the previous algorithms, where n is the number of nodes, and is polynomial even if r is given in binary. We also present lower bounds showing that the upper bound on the expected number of effective steps we present is asymptotically tight for undirected graphs. ","lang":"eng"}],"year":"2017","alternative_title":["LIPIcs"],"date_published":"2017-11-01T00:00:00Z","oa":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","day":"01","_id":"551","ddc":["004"],"publication":"Leibniz International Proceedings in Informatics","title":"Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs","volume":83,"publist_id":"7263"},{"author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"last_name":"Henzinger","full_name":"Henzinger, Monika H","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530"},{"full_name":"Svozil, Alexander","last_name":"Svozil","first_name":"Alexander"}],"article_processing_charge":"No","date_updated":"2025-07-10T11:52:52Z","department":[{"_id":"KrCh"}],"status":"public","doi":"10.4230/LIPIcs.MFCS.2017.39","publication_status":"published","oa_version":"Published Version","type":"conference","conference":{"start_date":"2017-08-21","location":"Aalborg, Denmark","name":"MFCS: Mathematical Foundations of Computer Science","end_date":"2017-08-25"},"month":"11","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"checksum":"c67f4866ddbfd555afef1f63ae9a8fc7","relation":"main_file","file_size":610339,"file_name":"IST-2018-923-v1+1_LIPIcs-MFCS-2017-39.pdf","date_updated":"2020-07-14T12:47:00Z","content_type":"application/pdf","creator":"system","file_id":"5248","date_created":"2018-12-12T10:16:57Z","access_level":"open_access"}],"publication_identifier":{"isbn":["978-395977046-0"]},"article_number":"39","has_accepted_license":"1","citation":{"ieee":"K. Chatterjee, M. Henzinger, and A. Svozil, “Faster algorithms for mean-payoff parity games,” in <i>Leibniz International Proceedings in Informatics</i>, Aalborg, Denmark, 2017, vol. 83.","ista":"Chatterjee K, Henzinger M, Svozil A. 2017. Faster algorithms for mean-payoff parity games. Leibniz International Proceedings in Informatics. MFCS: Mathematical Foundations of Computer Science, LIPIcs, vol. 83, 39.","short":"K. Chatterjee, M. Henzinger, A. Svozil, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","mla":"Chatterjee, Krishnendu, et al. “Faster Algorithms for Mean-Payoff Parity Games.” <i>Leibniz International Proceedings in Informatics</i>, vol. 83, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2017.39\">10.4230/LIPIcs.MFCS.2017.39</a>.","apa":"Chatterjee, K., Henzinger, M., &#38; Svozil, A. (2017). Faster algorithms for mean-payoff parity games. In <i>Leibniz International Proceedings in Informatics</i> (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2017.39\">https://doi.org/10.4230/LIPIcs.MFCS.2017.39</a>","chicago":"Chatterjee, Krishnendu, Monika Henzinger, and Alexander Svozil. “Faster Algorithms for Mean-Payoff Parity Games.” In <i>Leibniz International Proceedings in Informatics</i>, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2017.39\">https://doi.org/10.4230/LIPIcs.MFCS.2017.39</a>.","ama":"Chatterjee K, Henzinger M, Svozil A. Faster algorithms for mean-payoff parity games. In: <i>Leibniz International Proceedings in Informatics</i>. Vol 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2017.39\">10.4230/LIPIcs.MFCS.2017.39</a>"},"pubrep_id":"923","language":[{"iso":"eng"}],"scopus_import":"1","project":[{"grant_number":"S11407","name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"file_date_updated":"2020-07-14T12:47:00Z","corr_author":"1","license":"https://creativecommons.org/licenses/by/3.0/","tmp":{"short":"CC BY (3.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)"},"oa":1,"date_published":"2017-11-01T00:00:00Z","alternative_title":["LIPIcs"],"year":"2017","date_created":"2018-12-11T11:47:08Z","intvolume":"        83","abstract":[{"text":"Graph games provide the foundation for modeling and synthesis of reactive processes. Such games are played over graphs where the vertices are controlled by two adversarial players. We consider graph games where the objective of the first player is the conjunction of a qualitative objective (specified as a parity condition) and a quantitative objective (specified as a meanpayoff condition). There are two variants of the problem, namely, the threshold problem where the quantitative goal is to ensure that the mean-payoff value is above a threshold, and the value problem where the quantitative goal is to ensure the optimal mean-payoff value; in both cases ensuring the qualitative parity objective. The previous best-known algorithms for game graphs with n vertices, m edges, parity objectives with d priorities, and maximal absolute reward value W for mean-payoff objectives, are as follows: O(nd+1 . m . w) for the threshold problem, and O(nd+2 · m · W) for the value problem. Our main contributions are faster algorithms, and the running times of our algorithms are as follows: O(nd-1 · m ·W) for the threshold problem, and O(nd · m · W · log(n · W)) for the value problem. For mean-payoff parity objectives with two priorities, our algorithms match the best-known bounds of the algorithms for mean-payoff games (without conjunction with parity objectives). Our results are relevant in synthesis of reactive systems with both functional requirement (given as a qualitative objective) and performance requirement (given as a quantitative objective).","lang":"eng"}],"quality_controlled":"1","volume":83,"publist_id":"7262","title":"Faster algorithms for mean-payoff parity games","ec_funded":1,"publication":"Leibniz International Proceedings in Informatics","ddc":["004"],"_id":"552","day":"01","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik"},{"status":"public","doi":"10.4230/LIPIcs.MFCS.2017.55","publication_status":"published","oa_version":"Published Version","type":"conference","article_processing_charge":"No","author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Kristofer","full_name":"Hansen, Kristofer","last_name":"Hansen"},{"orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus","last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus"}],"date_updated":"2025-06-04T09:37:06Z","department":[{"_id":"KrCh"}],"article_number":"55","has_accepted_license":"1","citation":{"ama":"Chatterjee K, Hansen K, Ibsen-Jensen R. Strategy complexity of concurrent safety games. In: <i>Leibniz International Proceedings in Informatics</i>. Vol 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2017.55\">10.4230/LIPIcs.MFCS.2017.55</a>","apa":"Chatterjee, K., Hansen, K., &#38; Ibsen-Jensen, R. (2017). Strategy complexity of concurrent safety games. In <i>Leibniz International Proceedings in Informatics</i> (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2017.55\">https://doi.org/10.4230/LIPIcs.MFCS.2017.55</a>","chicago":"Chatterjee, Krishnendu, Kristofer Hansen, and Rasmus Ibsen-Jensen. “Strategy Complexity of Concurrent Safety Games.” In <i>Leibniz International Proceedings in Informatics</i>, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2017.55\">https://doi.org/10.4230/LIPIcs.MFCS.2017.55</a>.","ieee":"K. Chatterjee, K. Hansen, and R. Ibsen-Jensen, “Strategy complexity of concurrent safety games,” in <i>Leibniz International Proceedings in Informatics</i>, Aalborg, Denmark, 2017, vol. 83.","short":"K. Chatterjee, K. Hansen, R. Ibsen-Jensen, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","ista":"Chatterjee K, Hansen K, Ibsen-Jensen R. 2017. Strategy complexity of concurrent safety games. Leibniz International Proceedings in Informatics. MFCS: Mathematical Foundations of Computer Science, LIPIcs, vol. 83, 55.","mla":"Chatterjee, Krishnendu, et al. “Strategy Complexity of Concurrent Safety Games.” <i>Leibniz International Proceedings in Informatics</i>, vol. 83, 55, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2017.55\">10.4230/LIPIcs.MFCS.2017.55</a>."},"language":[{"iso":"eng"}],"pubrep_id":"922","scopus_import":"1","file_date_updated":"2020-07-14T12:47:00Z","corr_author":"1","conference":{"start_date":"2017-08-21","location":"Aalborg, Denmark","name":"MFCS: Mathematical Foundations of Computer Science","end_date":"2017-08-25"},"month":"11","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1506.02434"]},"file":[{"file_name":"IST-2018-922-v1+1_LIPIcs-MFCS-2017-55.pdf","date_updated":"2020-07-14T12:47:00Z","relation":"main_file","checksum":"7101facb56ade363205c695d72dbd173","file_size":549967,"file_id":"4753","access_level":"open_access","date_created":"2018-12-12T10:09:29Z","content_type":"application/pdf","creator":"system"}],"publication_identifier":{"isbn":["978-395977046-0"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1506.02434"}],"intvolume":"        83","abstract":[{"text":"We consider two player, zero-sum, finite-state concurrent reachability games, played for an infinite number of rounds, where in every round, each player simultaneously and independently of the other players chooses an action, whereafter the successor state is determined by a probability distribution given by the current state and the chosen actions. Player 1 wins iff a designated goal state is eventually visited. We are interested in the complexity of stationary strategies measured by their patience, which is defined as the inverse of the smallest non-zero probability employed. Our main results are as follows: We show that: (i) the optimal bound on the patience of optimal and -optimal strategies, for both players is doubly exponential; and (ii) even in games with a single non-absorbing state exponential (in the number of actions) patience is necessary. ","lang":"eng"}],"date_created":"2018-12-11T11:47:08Z","quality_controlled":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"oa":1,"date_published":"2017-11-01T00:00:00Z","alternative_title":["LIPIcs"],"year":"2017","ddc":["004"],"_id":"553","day":"01","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","arxiv":1,"volume":83,"publist_id":"7261","title":"Strategy complexity of concurrent safety games","publication":"Leibniz International Proceedings in Informatics"},{"department":[{"_id":"KrCh"}],"year":"2017","date_updated":"2025-04-15T08:12:19Z","date_published":"2017-01-02T00:00:00Z","oa":1,"article_processing_charge":"No","author":[{"full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis","orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas"},{"first_name":"Josef","orcid":"0000-0002-1097-9684","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","full_name":"Tkadlec, Josef","last_name":"Tkadlec"},{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Nowak , Martin","last_name":"Nowak ","first_name":"Martin"}],"oa_version":"Published Version","type":"research_data","doi":"10.15479/AT:ISTA:51","date_created":"2018-12-12T12:31:32Z","abstract":[{"text":"Strong amplifiers of natural selection","lang":"eng"}],"status":"public","related_material":{"record":[{"status":"public","relation":"research_paper","id":"5452"},{"id":"5751","relation":"research_paper","status":"public"}]},"file":[{"relation":"main_file","checksum":"b427dd46a30096a1911b245640c47af8","file_size":32987015,"date_updated":"2020-07-14T12:47:02Z","file_name":"IST-2017-51-v1+2_illustration.mp4","creator":"system","content_type":"video/mp4","file_id":"5644","access_level":"open_access","date_created":"2018-12-12T13:05:18Z"}],"keyword":["natural selection"],"title":"Strong amplifiers of natural selection","ec_funded":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"01","file_date_updated":"2020-07-14T12:47:02Z","day":"02","project":[{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"}],"publisher":"Institute of Science and Technology Austria","_id":"5559","datarep_id":"51","has_accepted_license":"1","ddc":["519"],"citation":{"apa":"Pavlogiannis, A., Tkadlec, J., Chatterjee, K., &#38; Nowak , M. (2017). Strong amplifiers of natural selection. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:51\">https://doi.org/10.15479/AT:ISTA:51</a>","chicago":"Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak . “Strong Amplifiers of Natural Selection.” Institute of Science and Technology Austria, 2017. <a href=\"https://doi.org/10.15479/AT:ISTA:51\">https://doi.org/10.15479/AT:ISTA:51</a>.","ama":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak  M. Strong amplifiers of natural selection. 2017. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:51\">10.15479/AT:ISTA:51</a>","ieee":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak , “Strong amplifiers of natural selection.” Institute of Science and Technology Austria, 2017.","ista":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak  M. 2017. Strong amplifiers of natural selection, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:51\">10.15479/AT:ISTA:51</a>.","short":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak , (2017).","mla":"Pavlogiannis, Andreas, et al. <i>Strong Amplifiers of Natural Selection</i>. Institute of Science and Technology Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:51\">10.15479/AT:ISTA:51</a>."}},{"title":"Biased partitioning of the multi-drug efflux pump AcrAB-TolC underlies long-lived phenotypic heterogeneity","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"03","related_material":{"record":[{"id":"665","relation":"research_paper","status":"public"}]},"keyword":["single cell microscopy","mother machine microfluidic device","AcrAB-TolC pump","multi-drug efflux","Escherichia coli"],"file":[{"checksum":"d77859af757ac8025c50c7b12b52eaf3","relation":"main_file","file_size":6773204,"date_updated":"2020-07-14T12:47:03Z","file_name":"IST-2017-53-v1+1_Data_MDE.zip","content_type":"application/zip","creator":"system","file_id":"5603","date_created":"2018-12-12T13:02:38Z","access_level":"open_access"}],"datarep_id":"53","ddc":["571"],"citation":{"ieee":"T. Bergmiller <i>et al.</i>, “Biased partitioning of the multi-drug efflux pump AcrAB-TolC underlies long-lived phenotypic heterogeneity.” Institute of Science and Technology Austria, 2017.","ista":"Bergmiller T, Andersson AM, Tomasek K, Balleza E, Kiviet D, Hauschild R, Tkačik G, Guet CC. 2017. Biased partitioning of the multi-drug efflux pump AcrAB-TolC underlies long-lived phenotypic heterogeneity, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:53\">10.15479/AT:ISTA:53</a>.","short":"T. Bergmiller, A.M. Andersson, K. Tomasek, E. Balleza, D. Kiviet, R. Hauschild, G. Tkačik, C.C. Guet, (2017).","mla":"Bergmiller, Tobias, et al. <i>Biased Partitioning of the Multi-Drug Efflux Pump AcrAB-TolC Underlies Long-Lived Phenotypic Heterogeneity</i>. Institute of Science and Technology Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:53\">10.15479/AT:ISTA:53</a>.","apa":"Bergmiller, T., Andersson, A. M., Tomasek, K., Balleza, E., Kiviet, D., Hauschild, R., … Guet, C. C. (2017). Biased partitioning of the multi-drug efflux pump AcrAB-TolC underlies long-lived phenotypic heterogeneity. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:53\">https://doi.org/10.15479/AT:ISTA:53</a>","chicago":"Bergmiller, Tobias, Anna M Andersson, Kathrin Tomasek, Enrique Balleza, Daniel Kiviet, Robert Hauschild, Gašper Tkačik, and Calin C Guet. “Biased Partitioning of the Multi-Drug Efflux Pump AcrAB-TolC Underlies Long-Lived Phenotypic Heterogeneity.” Institute of Science and Technology Austria, 2017. <a href=\"https://doi.org/10.15479/AT:ISTA:53\">https://doi.org/10.15479/AT:ISTA:53</a>.","ama":"Bergmiller T, Andersson AM, Tomasek K, et al. Biased partitioning of the multi-drug efflux pump AcrAB-TolC underlies long-lived phenotypic heterogeneity. 2017. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:53\">10.15479/AT:ISTA:53</a>"},"has_accepted_license":"1","license":"https://creativecommons.org/publicdomain/zero/1.0/","publisher":"Institute of Science and Technology Austria","day":"10","file_date_updated":"2020-07-14T12:47:03Z","_id":"5560","oa":1,"tmp":{"image":"/images/cc_0.png","name":"Creative Commons Public Domain Dedication (CC0 1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","short":"CC0 (1.0)"},"article_processing_charge":"No","author":[{"id":"2C471CFA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5396-4346","first_name":"Tobias","full_name":"Bergmiller, Tobias","last_name":"Bergmiller"},{"first_name":"Anna M","orcid":"0000-0003-2912-6769","id":"2B8A40DA-F248-11E8-B48F-1D18A9856A87","last_name":"Andersson","full_name":"Andersson, Anna M"},{"first_name":"Kathrin","orcid":"0000-0003-3768-877X","id":"3AEC8556-F248-11E8-B48F-1D18A9856A87","full_name":"Tomasek, Kathrin","last_name":"Tomasek"},{"full_name":"Balleza, Enrique","last_name":"Balleza","first_name":"Enrique"},{"first_name":"Daniel","full_name":"Kiviet, Daniel","last_name":"Kiviet"},{"last_name":"Hauschild","full_name":"Hauschild, Robert","first_name":"Robert","orcid":"0000-0001-9843-3522","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Gasper","orcid":"0000-0002-6699-1455","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","last_name":"Tkacik","full_name":"Tkacik, Gasper"},{"first_name":"Calin C","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6220-2052","last_name":"Guet","full_name":"Guet, Calin C"}],"year":"2017","department":[{"_id":"CaGu"},{"_id":"GaTk"},{"_id":"Bio"}],"date_published":"2017-03-10T00:00:00Z","date_updated":"2025-09-11T07:05:03Z","status":"public","type":"research_data","oa_version":"Published Version","abstract":[{"lang":"eng","text":"This repository contains the data collected for the manuscript \"Biased partitioning of the multi-drug efflux pump AcrAB-TolC underlies long-lived phenotypic heterogeneity\".\r\nThe data is compressed into a single archive. Within the archive, different folders correspond to figures of the main text and the SI of the related publication.\r\nData is saved as plain text, with each folder containing a separate readme file describing the format. Typically, the data is from fluorescence microscopy measurements of single cells growing in a microfluidic \"mother machine\" device, and consists of relevant values (primarily arbitrary unit or normalized fluorescence measurements, and division times / growth rates) after raw microscopy images have been processed, segmented, and their features extracted, as described in the methods section of the related publication."}],"date_created":"2018-12-12T12:31:32Z","doi":"10.15479/AT:ISTA:53"},{"file":[{"file_id":"5614","date_created":"2018-12-12T13:02:54Z","access_level":"open_access","content_type":"application/zip","creator":"system","file_name":"IST-2017-57-v1+1_wormMatchingProblems.zip","date_updated":"2020-07-14T12:47:03Z","checksum":"3dc3e1306a66028a34181ebef2923139","relation":"main_file","file_size":327042819}],"keyword":["graph matching","feature matching","QAP","MAP-inference"],"acknowledgement":"We thank Vladimir Kolmogorov and Stephan Saalfeld forinspiring discussions.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"02","title":"Graph matching problems for annotating C. Elegans","_id":"5561","publisher":"Institute of Science and Technology Austria","day":"13","file_date_updated":"2020-07-14T12:47:03Z","citation":{"ama":"Kainmueller D, Jug F, Rother C, Meyers G. Graph matching problems for annotating C. Elegans. 2017. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:57\">10.15479/AT:ISTA:57</a>","apa":"Kainmueller, D., Jug, F., Rother, C., &#38; Meyers, G. (2017). Graph matching problems for annotating C. Elegans. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:57\">https://doi.org/10.15479/AT:ISTA:57</a>","chicago":"Kainmueller, Dagmar, Florian Jug, Carsten Rother, and Gene Meyers. “Graph Matching Problems for Annotating C. Elegans.” Institute of Science and Technology Austria, 2017. <a href=\"https://doi.org/10.15479/AT:ISTA:57\">https://doi.org/10.15479/AT:ISTA:57</a>.","short":"D. Kainmueller, F. Jug, C. Rother, G. Meyers, (2017).","ista":"Kainmueller D, Jug F, Rother C, Meyers G. 2017. Graph matching problems for annotating C. Elegans, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:57\">10.15479/AT:ISTA:57</a>.","ieee":"D. Kainmueller, F. Jug, C. Rother, and G. Meyers, “Graph matching problems for annotating C. Elegans.” Institute of Science and Technology Austria, 2017.","mla":"Kainmueller, Dagmar, et al. <i>Graph Matching Problems for Annotating C. Elegans</i>. Institute of Science and Technology Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:57\">10.15479/AT:ISTA:57</a>."},"ddc":["000"],"has_accepted_license":"1","datarep_id":"57","date_published":"2017-02-13T00:00:00Z","date_updated":"2024-02-21T13:46:31Z","year":"2017","department":[{"_id":"VlKo"}],"article_processing_charge":"No","tmp":{"image":"/images/cc_0.png","name":"Creative Commons Public Domain Dedication (CC0 1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","short":"CC0 (1.0)"},"author":[{"full_name":"Kainmueller, Dagmar","last_name":"Kainmueller","first_name":"Dagmar"},{"first_name":"Florian","last_name":"Jug","full_name":"Jug, Florian"},{"first_name":"Carsten","last_name":"Rother","full_name":"Rother, Carsten"},{"last_name":"Meyers","full_name":"Meyers, Gene","first_name":"Gene"}],"oa":1,"date_created":"2018-12-12T12:31:32Z","abstract":[{"lang":"eng","text":"Graph matching problems as described in \"Active Graph Matching for Automatic Joint Segmentation and Annotation of C. Elegans.\" by Kainmueller, Dagmar and Jug, Florian and Rother, Carsten and Myers, Gene, MICCAI 2014. Problems are in OpenGM2 hdf5 format (see http://hciweb2.iwr.uni-heidelberg.de/opengm/) and a custom text format used by the feature matching solver described in \"Feature Correspondence via Graph Matching: Models and Global Optimization.\" by Lorenzo Torresani, Vladimir Kolmogorov and Carsten Rother, ECCV 2008, code at http://pub.ist.ac.at/~vnk/software/GraphMatching-v1.02.src.zip. "}],"doi":"10.15479/AT:ISTA:57","type":"research_data","oa_version":"Published Version","status":"public"},{"date_updated":"2025-09-29T11:14:05Z","date_published":"2017-02-27T00:00:00Z","department":[{"_id":"GaTk"}],"year":"2017","author":[{"full_name":"Marre, Olivier","last_name":"Marre","first_name":"Olivier"},{"orcid":"0000-0002-6699-1455","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","first_name":"Gasper","last_name":"Tkacik","full_name":"Tkacik, Gasper"},{"first_name":"Dario","full_name":"Amodei, Dario","last_name":"Amodei"},{"first_name":"Elad","full_name":"Schneidman, Elad","last_name":"Schneidman"},{"last_name":"Bialek","full_name":"Bialek, William","first_name":"William"},{"first_name":"Michael","last_name":"Berry","full_name":"Berry, Michael"}],"tmp":{"image":"/images/cc_0.png","name":"Creative Commons Public Domain Dedication (CC0 1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","short":"CC0 (1.0)"},"article_processing_charge":"No","oa":1,"doi":"10.15479/AT:ISTA:61","date_created":"2018-12-12T12:31:33Z","abstract":[{"text":"This data was collected as part of the study [1]. It consists of preprocessed multi-electrode array recording from 160 salamander retinal ganglion cells responding to 297 repeats of a 19 s natural movie. The data is available in two formats: (1) a .mat file containing an array with dimensions “number of repeats” x “number of neurons” x “time in a repeat”; (2) a zipped .txt file containing the same data represented as an array with dimensions “number of neurons” x “number of samples”, where the number of samples is equal to the product of the number of repeats and timebins within a repeat. The time dimension is divided into 20 ms time windows, and the array is binary indicating whether a given cell elicited at least one spike in a given time window during a particular repeat. See the reference below for details regarding collection and preprocessing:\r\n\r\n[1] Tkačik G, Marre O, Amodei D, Schneidman E, Bialek W, Berry MJ II. Searching for Collective Behavior in a Large Network of Sensory Neurons. PLoS Comput Biol. 2014;10(1):e1003408.","lang":"eng"}],"oa_version":"Published Version","type":"research_data","status":"public","file":[{"file_size":1336936,"relation":"main_file","checksum":"e620eff260646f57b479a69492c8b765","file_name":"IST-2017-61-v1+1_bint_fishmovie32_100.mat","date_updated":"2020-07-14T12:47:03Z","creator":"system","content_type":"application/octet-stream","access_level":"open_access","date_created":"2018-12-12T13:03:04Z","file_id":"5622"},{"file_name":"IST-2017-61-v1+2_bint_fishmovie32_100.zip","date_updated":"2020-07-14T12:47:03Z","relation":"main_file","checksum":"de83f9b81ea0aae3cddfc3ed982e0759","file_size":1897543,"file_id":"5623","access_level":"open_access","date_created":"2018-12-12T13:03:05Z","creator":"system","content_type":"application/zip"}],"related_material":{"record":[{"id":"2257","relation":"used_in_publication","status":"public"}]},"keyword":["multi-electrode recording","retinal ganglion cells"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"02","title":"Multi-electrode array recording from salamander retinal ganglion cells","_id":"5562","day":"27","file_date_updated":"2020-07-14T12:47:03Z","publisher":"Institute of Science and Technology Austria","has_accepted_license":"1","ddc":["570"],"citation":{"mla":"Marre, Olivier, et al. <i>Multi-Electrode Array Recording from Salamander Retinal Ganglion Cells</i>. Institute of Science and Technology Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:61\">10.15479/AT:ISTA:61</a>.","ista":"Marre O, Tkačik G, Amodei D, Schneidman E, Bialek W, Berry M. 2017. Multi-electrode array recording from salamander retinal ganglion cells, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:61\">10.15479/AT:ISTA:61</a>.","ieee":"O. Marre, G. Tkačik, D. Amodei, E. Schneidman, W. Bialek, and M. Berry, “Multi-electrode array recording from salamander retinal ganglion cells.” Institute of Science and Technology Austria, 2017.","short":"O. Marre, G. Tkačik, D. Amodei, E. Schneidman, W. Bialek, M. Berry, (2017).","ama":"Marre O, Tkačik G, Amodei D, Schneidman E, Bialek W, Berry M. Multi-electrode array recording from salamander retinal ganglion cells. 2017. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:61\">10.15479/AT:ISTA:61</a>","chicago":"Marre, Olivier, Gašper Tkačik, Dario Amodei, Elad Schneidman, William Bialek, and Michael Berry. “Multi-Electrode Array Recording from Salamander Retinal Ganglion Cells.” Institute of Science and Technology Austria, 2017. <a href=\"https://doi.org/10.15479/AT:ISTA:61\">https://doi.org/10.15479/AT:ISTA:61</a>.","apa":"Marre, O., Tkačik, G., Amodei, D., Schneidman, E., Bialek, W., &#38; Berry, M. (2017). Multi-electrode array recording from salamander retinal ganglion cells. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:61\">https://doi.org/10.15479/AT:ISTA:61</a>"},"datarep_id":"61"},{"tmp":{"name":"Creative Commons Attribution-ShareAlike 4.0 International Public License (CC BY-SA 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","image":"/images/cc_by_sa.png","short":"CC BY-SA (4.0)"},"author":[{"full_name":"Lukacisin, Martin","last_name":"Lukacisin","first_name":"Martin","id":"298FFE8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6549-4177"}],"article_processing_charge":"No","oa":1,"date_published":"2017-03-20T00:00:00Z","date_updated":"2024-02-21T13:46:47Z","year":"2017","department":[{"_id":"ToBo"}],"status":"public","date_created":"2018-12-12T12:31:33Z","abstract":[{"text":"MATLAB code and processed datasets available for reproducing the results in: \r\nLukačišin, M.*, Landon, M.*, Jajoo, R*. (2016) Sequence-Specific Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking in Yeast.\r\n*equal contributions","lang":"eng"}],"doi":"10.15479/AT:ISTA:64","type":"research_data","oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"03","title":"MATLAB analysis code for 'Sequence-Specific Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking in Yeast'","file":[{"date_updated":"2020-07-14T12:47:03Z","file_name":"IST-2016-45-v1+1_PaperCode.zip","file_size":296722548,"relation":"main_file","checksum":"ee697f2b1ade4dc14d6ac0334dd832ab","access_level":"open_access","date_created":"2018-12-12T13:02:37Z","file_id":"5602","content_type":"application/zip","creator":"system"}],"ddc":["571"],"citation":{"mla":"Lukacisin, Martin. <i>MATLAB Analysis Code for “Sequence-Specific Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking in Yeast.”</i> Institute of Science and Technology Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:64\">10.15479/AT:ISTA:64</a>.","ieee":"M. Lukacisin, “MATLAB analysis code for ‘Sequence-Specific Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking in Yeast.’” Institute of Science and Technology Austria, 2017.","ista":"Lukacisin M. 2017. MATLAB analysis code for ‘Sequence-Specific Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking in Yeast’, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:64\">10.15479/AT:ISTA:64</a>.","short":"M. Lukacisin, (2017).","chicago":"Lukacisin, Martin. “MATLAB Analysis Code for ‘Sequence-Specific Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking in Yeast.’” Institute of Science and Technology Austria, 2017. <a href=\"https://doi.org/10.15479/AT:ISTA:64\">https://doi.org/10.15479/AT:ISTA:64</a>.","apa":"Lukacisin, M. (2017). MATLAB analysis code for “Sequence-Specific Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking in Yeast.” Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:64\">https://doi.org/10.15479/AT:ISTA:64</a>","ama":"Lukacisin M. MATLAB analysis code for “Sequence-Specific Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking in Yeast.” 2017. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:64\">10.15479/AT:ISTA:64</a>"},"has_accepted_license":"1","datarep_id":"64","_id":"5563","publisher":"Institute of Science and Technology Austria","license":"https://creativecommons.org/licenses/by-sa/4.0/","file_date_updated":"2020-07-14T12:47:03Z","day":"20"},{"doi":"10.15479/AT:ISTA:65","abstract":[{"text":"Compressed Fastq files with whole-genome sequencing data of IS-wt strain D and clones from four evolved populations (A11, C08, C10, D08). Information on this data collection is available in the Methods Section of the primary publication.","lang":"eng"}],"date_created":"2018-12-12T12:31:33Z","oa_version":"Published Version","type":"research_data","status":"public","date_updated":"2025-09-10T11:06:52Z","date_published":"2017-04-11T00:00:00Z","department":[{"_id":"CaGu"}],"year":"2017","article_processing_charge":"No","tmp":{"image":"/images/cc_0.png","name":"Creative Commons Public Domain Dedication (CC0 1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","short":"CC0 (1.0)"},"author":[{"full_name":"Steinrück, Magdalena","last_name":"Steinrück","first_name":"Magdalena","orcid":"0000-0003-1229-9719","id":"2C023F40-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Guet, Calin C","last_name":"Guet","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6220-2052","first_name":"Calin C"}],"oa":1,"_id":"5564","file_date_updated":"2020-07-14T12:47:03Z","day":"11","publisher":"Institute of Science and Technology Austria","has_accepted_license":"1","citation":{"chicago":"Steinrück, Magdalena, and Calin C Guet. “Fastq Files for ‘Complex Chromosomal Neighborhood Effects Determine the Adaptive Potential of a Gene under Selection.’” Institute of Science and Technology Austria, 2017. <a href=\"https://doi.org/10.15479/AT:ISTA:65\">https://doi.org/10.15479/AT:ISTA:65</a>.","apa":"Steinrück, M., &#38; Guet, C. C. (2017). Fastq files for “Complex chromosomal neighborhood effects determine the adaptive potential of a gene under selection.” Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:65\">https://doi.org/10.15479/AT:ISTA:65</a>","ama":"Steinrück M, Guet CC. Fastq files for “Complex chromosomal neighborhood effects determine the adaptive potential of a gene under selection.” 2017. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:65\">10.15479/AT:ISTA:65</a>","mla":"Steinrück, Magdalena, and Calin C. Guet. <i>Fastq Files for “Complex Chromosomal Neighborhood Effects Determine the Adaptive Potential of a Gene under Selection.”</i> Institute of Science and Technology Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:65\">10.15479/AT:ISTA:65</a>.","ista":"Steinrück M, Guet CC. 2017. Fastq files for ‘Complex chromosomal neighborhood effects determine the adaptive potential of a gene under selection’, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:65\">10.15479/AT:ISTA:65</a>.","ieee":"M. Steinrück and C. C. Guet, “Fastq files for ‘Complex chromosomal neighborhood effects determine the adaptive potential of a gene under selection.’” Institute of Science and Technology Austria, 2017.","short":"M. Steinrück, C.C. Guet, (2017)."},"ddc":["576"],"datarep_id":"65","related_material":{"record":[{"status":"public","relation":"research_paper","id":"704"}]},"file":[{"checksum":"31a0c01d022721073241a23d192cc37e","relation":"main_file","file_size":1225959109,"file_name":"IST-2017-65-v1+1_D_anc_1.fastq.zip","date_updated":"2020-07-14T12:47:03Z","creator":"system","content_type":"application/zip","file_id":"5627","date_created":"2018-12-12T13:03:18Z","access_level":"open_access"},{"content_type":"application/zip","creator":"system","access_level":"open_access","date_created":"2018-12-12T13:03:30Z","file_id":"5628","file_size":1422656107,"relation":"main_file","checksum":"d8f26f83ce7e7e45436121f9c6cd9b83","date_updated":"2020-07-14T12:47:03Z","file_name":"IST-2017-65-v1+1_D_anc_2.fastq.zip"},{"file_name":"IST-2017-65-v1+2_D_A11_1.fastq.zip","date_updated":"2020-07-14T12:47:03Z","file_size":565014975,"relation":"main_file","checksum":"e07b99bcfe55b5f132ca03b8b48c8cbc","access_level":"open_access","date_created":"2018-12-12T13:03:33Z","file_id":"5629","creator":"system","content_type":"application/zip"},{"content_type":"application/zip","creator":"system","file_id":"5630","access_level":"open_access","date_created":"2018-12-12T13:03:42Z","relation":"main_file","checksum":"eda86143d5f32d844b54f8530041e32b","file_size":564490030,"date_updated":"2020-07-14T12:47:03Z","file_name":"IST-2017-65-v1+3_D_A11_2.fastq.zip"},{"access_level":"open_access","date_created":"2018-12-12T13:03:46Z","file_id":"5631","content_type":"application/zip","creator":"system","file_name":"IST-2017-65-v1+4_D_C10_1.fastq.zip","date_updated":"2020-07-14T12:47:03Z","file_size":875430169,"relation":"main_file","checksum":"906d44f950c1626d9b99f34fbf89cb12"},{"file_name":"IST-2017-65-v1+6_D_C08_2.fastq.zip","date_updated":"2020-07-14T12:47:03Z","file_size":638298201,"relation":"main_file","checksum":"6ca14a032a79e0c787106bdf635725c9","access_level":"open_access","date_created":"2018-12-12T13:03:54Z","file_id":"5632","creator":"system","content_type":"application/zip"},{"date_updated":"2020-07-14T12:47:03Z","file_name":"IST-2017-65-v1+5_D_C10_2.fastq.zip","checksum":"66ab16ddb5ba64b2e263ef746ebf2893","relation":"main_file","file_size":894702866,"file_id":"5633","date_created":"2018-12-12T13:04:01Z","access_level":"open_access","content_type":"application/zip","creator":"system"},{"content_type":"application/zip","creator":"system","file_id":"5634","access_level":"open_access","date_created":"2018-12-12T13:04:07Z","relation":"main_file","checksum":"82607970174f8d37773b7d3acc712195","file_size":623648989,"file_name":"IST-2017-65-v1+7_D_C08_1.fastq.zip","date_updated":"2020-07-14T12:47:03Z"},{"file_name":"IST-2017-65-v1+8_D_D08_1.fastq.zip","date_updated":"2020-07-14T12:47:03Z","checksum":"225c30b243268c7dda9d6f8327933252","relation":"main_file","file_size":259359583,"file_id":"5635","date_created":"2018-12-12T13:04:11Z","access_level":"open_access","content_type":"application/zip","creator":"system"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"04","title":"Fastq files for \"Complex chromosomal neighborhood effects determine the adaptive potential of a gene under selection\""},{"ec_funded":1,"title":"Light Sheet Fluorescence microscopy of plant roots growing on the surface of a gel","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"04","publist_id":"6302","acknowledgement":"fund: FP7-ERC 0101109","file":[{"date_updated":"2020-07-14T12:47:03Z","file_name":"IST-2017-66-v1+1_WangenheimHighResolution55044-NEW_1.mp4","relation":"main_file","checksum":"b7552fc23540a85dc5a22fd4484eae71","file_size":101497758,"file_id":"5599","access_level":"open_access","date_created":"2018-12-12T13:02:33Z","content_type":"video/mp4","creator":"system"}],"related_material":{"record":[{"id":"1078","relation":"research_paper","status":"public"}]},"datarep_id":"66","citation":{"apa":"von Wangenheim, D., Hauschild, R., &#38; Friml, J. (2017). Light Sheet Fluorescence microscopy of plant roots growing on the surface of a gel. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:66\">https://doi.org/10.15479/AT:ISTA:66</a>","chicago":"Wangenheim, Daniel von, Robert Hauschild, and Jiří Friml. “Light Sheet Fluorescence Microscopy of Plant Roots Growing on the Surface of a Gel.” Institute of Science and Technology Austria, 2017. <a href=\"https://doi.org/10.15479/AT:ISTA:66\">https://doi.org/10.15479/AT:ISTA:66</a>.","ama":"von Wangenheim D, Hauschild R, Friml J. Light Sheet Fluorescence microscopy of plant roots growing on the surface of a gel. 2017. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:66\">10.15479/AT:ISTA:66</a>","ista":"von Wangenheim D, Hauschild R, Friml J. 2017. Light Sheet Fluorescence microscopy of plant roots growing on the surface of a gel, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:66\">10.15479/AT:ISTA:66</a>.","ieee":"D. von Wangenheim, R. Hauschild, and J. Friml, “Light Sheet Fluorescence microscopy of plant roots growing on the surface of a gel.” Institute of Science and Technology Austria, 2017.","short":"D. von Wangenheim, R. Hauschild, J. Friml, (2017).","mla":"von Wangenheim, Daniel, et al. <i>Light Sheet Fluorescence Microscopy of Plant Roots Growing on the Surface of a Gel</i>. Institute of Science and Technology Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:66\">10.15479/AT:ISTA:66</a>."},"ddc":["580"],"has_accepted_license":"1","publisher":"Institute of Science and Technology Austria","file_date_updated":"2020-07-14T12:47:03Z","project":[{"name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"291734"}],"day":"10","_id":"5565","oa":1,"author":[{"last_name":"Von Wangenheim","full_name":"Von Wangenheim, Daniel","first_name":"Daniel","id":"49E91952-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6862-1247"},{"id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9843-3522","first_name":"Robert","last_name":"Hauschild","full_name":"Hauschild, Robert"},{"full_name":"Friml, Jirí","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596","first_name":"Jirí"}],"article_processing_charge":"No","year":"2017","department":[{"_id":"JiFr"},{"_id":"Bio"}],"date_published":"2017-04-10T00:00:00Z","date_updated":"2025-04-15T07:48:04Z","status":"public","type":"research_data","oa_version":"Published Version","abstract":[{"text":"One of the key questions in understanding plant development is how single cells behave in a larger context of the tissue. Therefore, it requires the observation of the whole organ with a high spatial- as well as temporal resolution over prolonged periods of time, which may cause photo-toxic effects. This protocol shows a plant sample preparation method for light-sheet microscopy, which is characterized by mounting the plant vertically on the surface of a gel. The plant is mounted in such a way that the roots are submerged in a liquid medium while the leaves remain in the air. In order to ensure photosynthetic activity of the plant, a custom-made lighting system illuminates the leaves. To keep the roots in darkness the water surface is covered with sheets of black plastic foil. This method allows long-term imaging of plant organ development in standardized conditions. \r\nThe Video is licensed under a CC BY NC ND license. ","lang":"eng"}],"date_created":"2018-12-12T12:31:34Z","doi":"10.15479/AT:ISTA:66"},{"date_updated":"2025-04-15T07:48:05Z","date_published":"2017-07-21T00:00:00Z","department":[{"_id":"Bio"}],"year":"2017","article_processing_charge":"No","tmp":{"name":"Creative Commons Attribution-ShareAlike 4.0 International Public License (CC BY-SA 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","image":"/images/cc_by_sa.png","short":"CC BY-SA (4.0)"},"author":[{"first_name":"Robert","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9843-3522","last_name":"Hauschild","full_name":"Hauschild, Robert"}],"oa":1,"doi":"10.15479/AT:ISTA:69","abstract":[{"lang":"eng","text":"Current minimal version of TipTracker"}],"date_created":"2018-12-12T12:31:34Z","oa_version":"Published Version","type":"research_data","status":"public","related_material":{"record":[{"id":"946","status":"public","relation":"research_paper"}]},"file":[{"file_name":"IST-2017-69-v1+2_TipTrackerZeissLSM700.zip","date_updated":"2020-07-14T12:47:04Z","checksum":"a976000e6715106724a271cc9422be4a","relation":"main_file","file_size":1587986,"file_id":"5636","date_created":"2018-12-12T13:04:12Z","access_level":"open_access","content_type":"application/zip","creator":"system"}],"keyword":["tool","tracking","confocal microscopy"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"07","title":"Live tracking of moving samples in confocal microscopy for vertically grown roots","_id":"5566","file_date_updated":"2020-07-14T12:47:04Z","day":"21","publisher":"Institute of Science and Technology Austria","has_accepted_license":"1","citation":{"apa":"Hauschild, R. (2017). Live tracking of moving samples in confocal microscopy for vertically grown roots. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:69\">https://doi.org/10.15479/AT:ISTA:69</a>","chicago":"Hauschild, Robert. “Live Tracking of Moving Samples in Confocal Microscopy for Vertically Grown Roots.” Institute of Science and Technology Austria, 2017. <a href=\"https://doi.org/10.15479/AT:ISTA:69\">https://doi.org/10.15479/AT:ISTA:69</a>.","ama":"Hauschild R. Live tracking of moving samples in confocal microscopy for vertically grown roots. 2017. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:69\">10.15479/AT:ISTA:69</a>","short":"R. Hauschild, (2017).","ista":"Hauschild R. 2017. Live tracking of moving samples in confocal microscopy for vertically grown roots, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:69\">10.15479/AT:ISTA:69</a>.","ieee":"R. Hauschild, “Live tracking of moving samples in confocal microscopy for vertically grown roots.” Institute of Science and Technology Austria, 2017.","mla":"Hauschild, Robert. <i>Live Tracking of Moving Samples in Confocal Microscopy for Vertically Grown Roots</i>. Institute of Science and Technology Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:69\">10.15479/AT:ISTA:69</a>."},"ddc":["570"],"datarep_id":"69"},{"_id":"5567","publisher":"Institute of Science and Technology Austria","file_date_updated":"2020-07-14T12:47:04Z","day":"09","ddc":["570"],"citation":{"apa":"Leithner, A. F. (2017). Immunological synapse DC-Tcells. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:71\">https://doi.org/10.15479/AT:ISTA:71</a>","chicago":"Leithner, Alexander F. “Immunological Synapse DC-Tcells.” Institute of Science and Technology Austria, 2017. <a href=\"https://doi.org/10.15479/AT:ISTA:71\">https://doi.org/10.15479/AT:ISTA:71</a>.","ama":"Leithner AF. Immunological synapse DC-Tcells. 2017. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:71\">10.15479/AT:ISTA:71</a>","ista":"Leithner AF. 2017. Immunological synapse DC-Tcells, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:71\">10.15479/AT:ISTA:71</a>.","short":"A.F. Leithner, (2017).","ieee":"A. F. Leithner, “Immunological synapse DC-Tcells.” Institute of Science and Technology Austria, 2017.","mla":"Leithner, Alexander F. <i>Immunological Synapse DC-Tcells</i>. Institute of Science and Technology Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:71\">10.15479/AT:ISTA:71</a>."},"has_accepted_license":"1","datarep_id":"71","keyword":["Immunological synapse"],"file":[{"relation":"main_file","checksum":"3d6942d47d0737d064706b5728c4d8c8","file_size":236204020,"file_name":"IST-2017-71-v1+1_Synapse_1.avi","date_updated":"2020-07-14T12:47:04Z","content_type":"video/x-msvideo","creator":"system","file_id":"5612","access_level":"open_access","date_created":"2018-12-12T13:02:47Z"},{"relation":"main_file","checksum":"4850006c047b0147a9e85b3c2f6f0af4","file_size":226232496,"file_name":"IST-2017-71-v1+2_Synapse_2.avi","date_updated":"2020-07-14T12:47:04Z","content_type":"video/x-msvideo","creator":"system","file_id":"5613","access_level":"open_access","date_created":"2018-12-12T13:02:51Z"}],"month":"08","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Immunological synapse DC-Tcells","date_created":"2018-12-12T12:31:34Z","abstract":[{"text":"Immunological synapse DC-Tcells","lang":"eng"}],"doi":"10.15479/AT:ISTA:71","type":"research_data","oa_version":"Published Version","status":"public","date_published":"2017-08-09T00:00:00Z","date_updated":"2024-02-21T13:47:00Z","year":"2017","department":[{"_id":"MiSi"}],"tmp":{"image":"/images/cc_0.png","name":"Creative Commons Public Domain Dedication (CC0 1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","short":"CC0 (1.0)"},"author":[{"first_name":"Alexander F","orcid":"0000-0002-1073-744X","id":"3B1B77E4-F248-11E8-B48F-1D18A9856A87","full_name":"Leithner, Alexander F","last_name":"Leithner"}],"article_processing_charge":"No","oa":1},{"oa":1,"tmp":{"image":"/images/cc_0.png","name":"Creative Commons Public Domain Dedication (CC0 1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","short":"CC0 (1.0)"},"article_processing_charge":"No","author":[{"full_name":"Hauschild, Robert","last_name":"Hauschild","orcid":"0000-0001-9843-3522","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87","first_name":"Robert"}],"department":[{"_id":"Bio"}],"year":"2017","date_updated":"2024-02-21T13:47:14Z","date_published":"2017-10-04T00:00:00Z","status":"public","oa_version":"Published Version","type":"research_data","doi":"10.15479/AT:ISTA:75","date_created":"2018-12-12T12:31:35Z","abstract":[{"lang":"eng","text":"Matlab script to calculate the forward migration indexes (<d_y>/<L>) from TrackMate spot-statistics files."}],"title":"Forward migration indexes","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"10","keyword":["Cell migration","tracking","forward migration index","FMI"],"file":[{"date_updated":"2020-07-14T12:47:04Z","file_name":"IST-2017-75-v1+1_FMI.m","file_size":799,"relation":"main_file","checksum":"cb7a2fa622460eca6231d659ce590e32","access_level":"open_access","date_created":"2018-12-12T13:02:29Z","file_id":"5596","creator":"system","content_type":"application/octet-stream"}],"datarep_id":"75","has_accepted_license":"1","ddc":["570"],"citation":{"ama":"Hauschild R. Forward migration indexes. 2017. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:75\">10.15479/AT:ISTA:75</a>","chicago":"Hauschild, Robert. “Forward Migration Indexes.” Institute of Science and Technology Austria, 2017. <a href=\"https://doi.org/10.15479/AT:ISTA:75\">https://doi.org/10.15479/AT:ISTA:75</a>.","apa":"Hauschild, R. (2017). Forward migration indexes. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:75\">https://doi.org/10.15479/AT:ISTA:75</a>","mla":"Hauschild, Robert. <i>Forward Migration Indexes</i>. Institute of Science and Technology Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:75\">10.15479/AT:ISTA:75</a>.","ieee":"R. Hauschild, “Forward migration indexes.” Institute of Science and Technology Austria, 2017.","short":"R. Hauschild, (2017).","ista":"Hauschild R. 2017. Forward migration indexes, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:75\">10.15479/AT:ISTA:75</a>."},"file_date_updated":"2020-07-14T12:47:04Z","day":"04","publisher":"Institute of Science and Technology Austria","_id":"5570"},{"date_created":"2018-12-12T12:31:36Z","abstract":[{"text":"This folder contains all the data used in each of the main figures of \"The genomic characterization of the t-haplotype, a mouse meiotic driver, highlights its complex history and specialized biology\" (Kelemen, R., Vicoso, B.), as well as in the supplementary figures. \r\n","lang":"eng"}],"doi":"10.15479/AT:ISTA:78","type":"research_data","oa_version":"Submitted Version","status":"public","date_published":"2017-11-06T00:00:00Z","date_updated":"2025-04-15T07:49:49Z","year":"2017","department":[{"_id":"BeVi"}],"tmp":{"image":"/images/cc_0.png","name":"Creative Commons Public Domain Dedication (CC0 1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","short":"CC0 (1.0)"},"author":[{"full_name":"Vicoso, Beatriz","last_name":"Vicoso","id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4579-8306","first_name":"Beatriz"}],"article_processing_charge":"No","oa":1,"_id":"5571","publisher":"Institute of Science and Technology Austria","file_date_updated":"2020-07-14T12:47:04Z","day":"06","ddc":["576"],"citation":{"chicago":"Vicoso, Beatriz. “Data for ‘The Genomic Characterization of the t-Haplotype, a Mouse Meiotic Driver, Highlights Its Complex History and Specialized Biology.’” Institute of Science and Technology Austria, 2017. <a href=\"https://doi.org/10.15479/AT:ISTA:78\">https://doi.org/10.15479/AT:ISTA:78</a>.","apa":"Vicoso, B. (2017). Data for “The genomic characterization of the t-haplotype, a mouse meiotic driver, highlights its complex history and specialized biology.” Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:78\">https://doi.org/10.15479/AT:ISTA:78</a>","ama":"Vicoso B. Data for “The genomic characterization of the t-haplotype, a mouse meiotic driver, highlights its complex history and specialized biology.” 2017. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:78\">10.15479/AT:ISTA:78</a>","mla":"Vicoso, Beatriz. <i>Data for “The Genomic Characterization of the t-Haplotype, a Mouse Meiotic Driver, Highlights Its Complex History and Specialized Biology.”</i> Institute of Science and Technology Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:78\">10.15479/AT:ISTA:78</a>.","short":"B. Vicoso, (2017).","ieee":"B. Vicoso, “Data for ‘The genomic characterization of the t-haplotype, a mouse meiotic driver, highlights its complex history and specialized biology.’” Institute of Science and Technology Austria, 2017.","ista":"Vicoso B. 2017. Data for ‘The genomic characterization of the t-haplotype, a mouse meiotic driver, highlights its complex history and specialized biology’, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:78\">10.15479/AT:ISTA:78</a>."},"has_accepted_license":"1","contributor":[{"contributor_type":"contact_person","first_name":"Beatriz","id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87","last_name":"Vicoso"}],"datarep_id":"78","related_material":{"record":[{"id":"542","status":"public","relation":"research_paper"}]},"file":[{"relation":"main_file","checksum":"4520eb2b8379417ee916995719158f16","file_size":143697895,"date_updated":"2020-07-14T12:47:04Z","file_name":"IST-2017-78-v1+1_Data.zip","content_type":"application/zip","creator":"system","file_id":"5618","access_level":"open_access","date_created":"2018-12-12T13:03:00Z"}],"month":"11","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Data for \"The genomic characterization of the t-haplotype, a mouse meiotic driver, highlights its complex history and specialized biology\""},{"date_published":"2017-11-06T00:00:00Z","date_updated":"2025-04-15T07:49:49Z","year":"2017","department":[{"_id":"BeVi"}],"tmp":{"image":"/images/cc_0.png","name":"Creative Commons Public Domain Dedication (CC0 1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","short":"CC0 (1.0)"},"author":[{"id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4579-8306","first_name":"Beatriz","full_name":"Vicoso, Beatriz","last_name":"Vicoso"}],"article_processing_charge":"No","oa":1,"date_created":"2018-12-12T12:31:36Z","abstract":[{"text":"Code described in the Supplementary Methods of \"The genomic characterization of the t-haplotype, a mouse meiotic driver, highlights its complex history and specialized biology\" (Kelemen, R., Vicoso, B.)","lang":"eng"}],"doi":"10.15479/AT:ISTA:79 ","type":"research_data","oa_version":"Submitted Version","status":"public","file":[{"content_type":"application/zip","creator":"system","date_created":"2018-12-12T13:05:15Z","access_level":"open_access","file_id":"5643","file_size":49823,"checksum":"3e70a7bcd6ff0c38b79e4c8a7d137034","relation":"main_file","date_updated":"2020-07-14T12:47:05Z","file_name":"IST-2017-79-v1+1_Code.zip"}],"related_material":{"record":[{"status":"public","relation":"research_paper","id":"542"}]},"month":"11","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Code for \"The genomic characterization of the t-haplotype, a mouse meiotic driver, highlights its complex history and specialized biology\"","_id":"5572","publisher":"Institute of Science and Technology Austria","day":"06","file_date_updated":"2020-07-14T12:47:05Z","ddc":["576"],"citation":{"ieee":"B. Vicoso, “Code for ‘The genomic characterization of the t-haplotype, a mouse meiotic driver, highlights its complex history and specialized biology.’” Institute of Science and Technology Austria, 2017.","ista":"Vicoso B. 2017. Code for ‘The genomic characterization of the t-haplotype, a mouse meiotic driver, highlights its complex history and specialized biology’, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:79 \">10.15479/AT:ISTA:79 </a>.","short":"B. Vicoso, (2017).","mla":"Vicoso, Beatriz. <i>Code for “The Genomic Characterization of the t-Haplotype, a Mouse Meiotic Driver, Highlights Its Complex History and Specialized Biology.”</i> Institute of Science and Technology Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:79 \">10.15479/AT:ISTA:79 </a>.","ama":"Vicoso B. Code for “The genomic characterization of the t-haplotype, a mouse meiotic driver, highlights its complex history and specialized biology.” 2017. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:79 \">10.15479/AT:ISTA:79 </a>","apa":"Vicoso, B. (2017). Code for “The genomic characterization of the t-haplotype, a mouse meiotic driver, highlights its complex history and specialized biology.” Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:79 \">https://doi.org/10.15479/AT:ISTA:79 </a>","chicago":"Vicoso, Beatriz. “Code for ‘The Genomic Characterization of the t-Haplotype, a Mouse Meiotic Driver, Highlights Its Complex History and Specialized Biology.’” Institute of Science and Technology Austria, 2017. <a href=\"https://doi.org/10.15479/AT:ISTA:79 \">https://doi.org/10.15479/AT:ISTA:79 </a>."},"has_accepted_license":"1","datarep_id":"79"},{"quality_controlled":"1","date_created":"2018-12-11T11:47:10Z","abstract":[{"text":"Immune specificity is the degree to which a host’s immune system discriminates among various pathogens or antigenic variants. Vertebrate immune memory is highly specific due to antibody responses. On the other hand, some invertebrates show immune priming, i.e. improved survival after secondary exposure to a previously encountered pathogen. Until now, specificity of priming has only been demonstrated via the septic infection route or when live pathogens were used for priming. Therefore, we tested for specificity in the oral priming route in the red flour beetle, Tribolium castaneum. For priming, we used pathogen-free supernatants derived from three different strains of the entomopathogen, Bacillus thuringiensis, which express different Cry toxin variants known for their toxicity against this beetle. Subsequent exposure to the infective spores showed that oral priming was specific for two naturally occurring strains, while a third engineered strain did not induce any priming effect. Our data demonstrate that oral immune priming with a non-infectious bacterial agent can be specific, but the priming effect is not universal across all bacterial strains.","lang":"eng"}],"intvolume":"        13","year":"2017","issue":"12","date_published":"2017-12-01T00:00:00Z","publisher":"The Royal Society","day":"01","_id":"558","pmid":1,"publication":"Biology Letters","article_type":"original","title":"Specificity of oral immune priming in the red flour beetle Tribolium castaneum","volume":13,"publist_id":"7255","type":"journal_article","oa_version":"None","publication_status":"published","doi":"10.1098/rsbl.2017.0632","status":"public","isi":1,"department":[{"_id":"SyCr"}],"date_updated":"2025-09-11T08:07:58Z","author":[{"first_name":"Momir","last_name":"Futo","full_name":"Futo, Momir"},{"full_name":"Sell, Marie","last_name":"Sell","first_name":"Marie"},{"first_name":"Megan","orcid":"0000-0002-8696-6978","id":"29D0B332-F248-11E8-B48F-1D18A9856A87","last_name":"Kutzer","full_name":"Kutzer, Megan"},{"first_name":"Joachim","full_name":"Kurtz, Joachim","last_name":"Kurtz"}],"article_processing_charge":"No","scopus_import":"1","language":[{"iso":"eng"}],"citation":{"short":"M. Futo, M. Sell, M. Kutzer, J. Kurtz, Biology Letters 13 (2017).","ieee":"M. Futo, M. Sell, M. Kutzer, and J. Kurtz, “Specificity of oral immune priming in the red flour beetle Tribolium castaneum,” <i>Biology Letters</i>, vol. 13, no. 12. The Royal Society, 2017.","ista":"Futo M, Sell M, Kutzer M, Kurtz J. 2017. Specificity of oral immune priming in the red flour beetle Tribolium castaneum. Biology Letters. 13(12), 0632.","mla":"Futo, Momir, et al. “Specificity of Oral Immune Priming in the Red Flour Beetle Tribolium Castaneum.” <i>Biology Letters</i>, vol. 13, no. 12, 0632, The Royal Society, 2017, doi:<a href=\"https://doi.org/10.1098/rsbl.2017.0632\">10.1098/rsbl.2017.0632</a>.","ama":"Futo M, Sell M, Kutzer M, Kurtz J. Specificity of oral immune priming in the red flour beetle Tribolium castaneum. <i>Biology Letters</i>. 2017;13(12). doi:<a href=\"https://doi.org/10.1098/rsbl.2017.0632\">10.1098/rsbl.2017.0632</a>","apa":"Futo, M., Sell, M., Kutzer, M., &#38; Kurtz, J. (2017). Specificity of oral immune priming in the red flour beetle Tribolium castaneum. <i>Biology Letters</i>. The Royal Society. <a href=\"https://doi.org/10.1098/rsbl.2017.0632\">https://doi.org/10.1098/rsbl.2017.0632</a>","chicago":"Futo, Momir, Marie Sell, Megan Kutzer, and Joachim Kurtz. “Specificity of Oral Immune Priming in the Red Flour Beetle Tribolium Castaneum.” <i>Biology Letters</i>. The Royal Society, 2017. <a href=\"https://doi.org/10.1098/rsbl.2017.0632\">https://doi.org/10.1098/rsbl.2017.0632</a>."},"article_number":"0632","publication_identifier":{"issn":["1744-9561"]},"external_id":{"pmid":["29237813"],"isi":["000418695400010"]},"month":"12","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345"},{"language":[{"iso":"eng"}],"article_number":"0104","citation":{"ista":"Gerencser M, Jentzen A, Salimova D. 2017. On stochastic differential equations with arbitrarily slow convergence rates for strong approximation in two space dimensions. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. 473(2207), 0104.","ieee":"M. Gerencser, A. Jentzen, and D. Salimova, “On stochastic differential equations with arbitrarily slow convergence rates for strong approximation in two space dimensions,” <i>Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences</i>, vol. 473, no. 2207. Royal Society of London, 2017.","short":"M. Gerencser, A. Jentzen, D. Salimova, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 473 (2017).","mla":"Gerencser, Mate, et al. “On Stochastic Differential Equations with Arbitrarily Slow Convergence Rates for Strong Approximation in Two Space Dimensions.” <i>Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences</i>, vol. 473, no. 2207, 0104, Royal Society of London, 2017, doi:<a href=\"https://doi.org/10.1098/rspa.2017.0104\">10.1098/rspa.2017.0104</a>.","ama":"Gerencser M, Jentzen A, Salimova D. On stochastic differential equations with arbitrarily slow convergence rates for strong approximation in two space dimensions. <i>Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences</i>. 2017;473(2207). doi:<a href=\"https://doi.org/10.1098/rspa.2017.0104\">10.1098/rspa.2017.0104</a>","apa":"Gerencser, M., Jentzen, A., &#38; Salimova, D. (2017). On stochastic differential equations with arbitrarily slow convergence rates for strong approximation in two space dimensions. <i>Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences</i>. Royal Society of London. <a href=\"https://doi.org/10.1098/rspa.2017.0104\">https://doi.org/10.1098/rspa.2017.0104</a>","chicago":"Gerencser, Mate, Arnulf Jentzen, and Diyora Salimova. “On Stochastic Differential Equations with Arbitrarily Slow Convergence Rates for Strong Approximation in Two Space Dimensions.” <i>Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences</i>. Royal Society of London, 2017. <a href=\"https://doi.org/10.1098/rspa.2017.0104\">https://doi.org/10.1098/rspa.2017.0104</a>."},"project":[{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"}],"scopus_import":"1","month":"11","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_identifier":{"issn":["1364-5021"]},"external_id":{"isi":["000416736700003"],"arxiv":["1702.03229"]},"status":"public","isi":1,"oa_version":"Submitted Version","type":"journal_article","doi":"10.1098/rspa.2017.0104","publication_status":"published","article_processing_charge":"No","author":[{"id":"44ECEDF2-F248-11E8-B48F-1D18A9856A87","first_name":"Mate","full_name":"Gerencser, Mate","last_name":"Gerencser"},{"full_name":"Jentzen, Arnulf","last_name":"Jentzen","first_name":"Arnulf"},{"last_name":"Salimova","full_name":"Salimova, Diyora","first_name":"Diyora"}],"department":[{"_id":"JaMa"}],"date_updated":"2025-09-18T07:33:24Z","day":"01","arxiv":1,"publisher":"Royal Society of London","_id":"560","title":"On stochastic differential equations with arbitrarily slow convergence rates for strong approximation in two space dimensions","ec_funded":1,"volume":473,"publist_id":"7256","publication":"Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1702.03229"}],"intvolume":"       473","abstract":[{"text":"In a recent article (Jentzen et al. 2016 Commun. Math. Sci. 14, 1477–1500 (doi:10.4310/CMS.2016.v14. n6.a1)), it has been established that, for every arbitrarily slow convergence speed and every natural number d ? {4, 5, . . .}, there exist d-dimensional stochastic differential equations with infinitely often differentiable and globally bounded coefficients such that no approximation method based on finitely many observations of the driving Brownian motion can converge in absolute mean to the solution faster than the given speed of convergence. In this paper, we strengthen the above result by proving that this slow convergence phenomenon also arises in two (d = 2) and three (d = 3) space dimensions.","lang":"eng"}],"date_created":"2018-12-11T11:47:11Z","oa":1,"issue":"2207","year":"2017","date_published":"2017-11-01T00:00:00Z"},{"language":[{"iso":"eng"}],"citation":{"mla":"Erdös, László, and Horng Yau. <i>A Dynamical Approach to Random Matrix Theory</i>. Vol. 28, American Mathematical Society, 2017, doi:<a href=\"https://doi.org/10.1090/cln/028\">10.1090/cln/028</a>.","ieee":"L. Erdös and H. Yau, <i>A Dynamical Approach to Random Matrix Theory</i>, vol. 28. American Mathematical Society, 2017.","short":"L. Erdös, H. Yau, A Dynamical Approach to Random Matrix Theory, American Mathematical Society, 2017.","ista":"Erdös L, Yau H. 2017. A Dynamical Approach to Random Matrix Theory, American Mathematical Society, 226p.","chicago":"Erdös, László, and Horng Yau. <i>A Dynamical Approach to Random Matrix Theory</i>. Vol. 28. Courant Lecture Notes. American Mathematical Society, 2017. <a href=\"https://doi.org/10.1090/cln/028\">https://doi.org/10.1090/cln/028</a>.","apa":"Erdös, L., &#38; Yau, H. (2017). <i>A Dynamical Approach to Random Matrix Theory</i> (Vol. 28). American Mathematical Society. <a href=\"https://doi.org/10.1090/cln/028\">https://doi.org/10.1090/cln/028</a>","ama":"Erdös L, Yau H. <i>A Dynamical Approach to Random Matrix Theory</i>. Vol 28. American Mathematical Society; 2017. doi:<a href=\"https://doi.org/10.1090/cln/028\">10.1090/cln/028</a>"},"project":[{"grant_number":"338804","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7"}],"corr_author":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"01","publication_identifier":{"eisbn":["978-1-4704-4194-4"],"isbn":["9-781-4704-3648-3"]},"page":"226","status":"public","oa_version":"None","type":"book","doi":"10.1090/cln/028","publication_status":"published","author":[{"first_name":"László","orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös","full_name":"Erdös, László"},{"first_name":"Horng","full_name":"Yau, Horng","last_name":"Yau"}],"article_processing_charge":"No","department":[{"_id":"LaEr"}],"date_updated":"2025-04-15T08:05:02Z","day":"01","publisher":"American Mathematical Society","_id":"567","title":"A Dynamical Approach to Random Matrix Theory","ec_funded":1,"volume":28,"publist_id":"7247","series_title":"Courant Lecture Notes","quality_controlled":"1","intvolume":"        28","date_created":"2018-12-11T11:47:13Z","abstract":[{"text":"This book is a concise and self-contained introduction of recent techniques to prove local spectral universality for large random matrices. Random matrix theory is a fast expanding research area, and this book mainly focuses on the methods that the authors participated in developing over the past few years. Many other interesting topics are not included, and neither are several new developments within the framework of these methods. The authors have chosen instead to present key concepts that they believe are the core of these methods and should be relevant for future applications. They keep technicalities to a minimum to make the book accessible to graduate students. With this in mind, they include in this book the basic notions and tools for high-dimensional analysis, such as large deviation, entropy, Dirichlet form, and the logarithmic Sobolev inequality.\r\n","lang":"eng"}],"alternative_title":["Courant Lecture Notes"],"year":"2017","date_published":"2017-01-01T00:00:00Z"},{"isi":1,"status":"public","doi":"10.4310/HHA.2017.v19.n2.a16","publication_status":"published","oa_version":"Submitted Version","type":"journal_article","author":[{"full_name":"Franek, Peter","last_name":"Franek","id":"473294AE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8878-8397","first_name":"Peter"},{"full_name":"Krcál, Marek","last_name":"Krcál","first_name":"Marek","id":"33E21118-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","date_updated":"2025-09-11T07:41:51Z","department":[{"_id":"UlWa"},{"_id":"HeEd"}],"citation":{"chicago":"Franek, Peter, and Marek Krcál. “Persistence of Zero Sets.” <i>Homology, Homotopy and Applications</i>. International Press, 2017. <a href=\"https://doi.org/10.4310/HHA.2017.v19.n2.a16\">https://doi.org/10.4310/HHA.2017.v19.n2.a16</a>.","apa":"Franek, P., &#38; Krcál, M. (2017). Persistence of zero sets. <i>Homology, Homotopy and Applications</i>. International Press. <a href=\"https://doi.org/10.4310/HHA.2017.v19.n2.a16\">https://doi.org/10.4310/HHA.2017.v19.n2.a16</a>","ama":"Franek P, Krcál M. Persistence of zero sets. <i>Homology, Homotopy and Applications</i>. 2017;19(2):313-342. doi:<a href=\"https://doi.org/10.4310/HHA.2017.v19.n2.a16\">10.4310/HHA.2017.v19.n2.a16</a>","mla":"Franek, Peter, and Marek Krcál. “Persistence of Zero Sets.” <i>Homology, Homotopy and Applications</i>, vol. 19, no. 2, International Press, 2017, pp. 313–42, doi:<a href=\"https://doi.org/10.4310/HHA.2017.v19.n2.a16\">10.4310/HHA.2017.v19.n2.a16</a>.","short":"P. Franek, M. Krcál, Homology, Homotopy and Applications 19 (2017) 313–342.","ista":"Franek P, Krcál M. 2017. Persistence of zero sets. Homology, Homotopy and Applications. 19(2), 313–342.","ieee":"P. Franek and M. Krcál, “Persistence of zero sets,” <i>Homology, Homotopy and Applications</i>, vol. 19, no. 2. International Press, pp. 313–342, 2017."},"language":[{"iso":"eng"}],"scopus_import":"1","project":[{"name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"291734"},{"_id":"2590DB08-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Atomic Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes","grant_number":"701309"}],"corr_author":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"01","external_id":{"arxiv":["1507.04310"],"isi":["000440749400010"]},"page":"313 - 342","publication_identifier":{"issn":["1532-0073"]},"main_file_link":[{"url":"https://arxiv.org/abs/1507.04310","open_access":"1"}],"abstract":[{"lang":"eng","text":"We study robust properties of zero sets of continuous maps f: X → ℝn. Formally, we analyze the family Z&lt; r(f) := (g-1(0): ||g - f|| &lt; r) of all zero sets of all continuous maps g closer to f than r in the max-norm. All of these sets are outside A := (x: |f(x)| ≥ r) and we claim that Z&lt; r(f) is fully determined by A and an element of a certain cohomotopy group which (by a recent result) is computable whenever the dimension of X is at most 2n - 3. By considering all r &gt; 0 simultaneously, the pointed cohomotopy groups form a persistence module-a structure leading to persistence diagrams as in the case of persistent homology or well groups. Eventually, we get a descriptor of persistent robust properties of zero sets that has better descriptive power (Theorem A) and better computability status (Theorem B) than the established well diagrams. Moreover, if we endow every point of each zero set with gradients of the perturbation, the robust description of the zero sets by elements of cohomotopy groups is in some sense the best possible (Theorem C)."}],"intvolume":"        19","date_created":"2018-12-11T11:47:14Z","quality_controlled":"1","oa":1,"date_published":"2017-01-01T00:00:00Z","issue":"2","year":"2017","_id":"568","day":"01","publisher":"International Press","arxiv":1,"publist_id":"7246","volume":19,"title":"Persistence of zero sets","ec_funded":1,"publication":"Homology, Homotopy and Applications"},{"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"oa":1,"date_published":"2017-11-06T00:00:00Z","year":"2017","intvolume":"         6","date_created":"2018-12-11T11:47:14Z","abstract":[{"lang":"eng","text":"The actomyosin ring generates force to ingress the cytokinetic cleavage furrow in animal cells, yet its filament organization and the mechanism of contractility is not well understood. We quantified actin filament order in human cells using fluorescence polarization microscopy and found that cleavage furrow ingression initiates by contraction of an equatorial actin network with randomly oriented filaments. The network subsequently gradually reoriented actin filaments along the cell equator. This strictly depended on myosin II activity, suggesting local network reorganization by mechanical forces. Cortical laser microsurgery revealed that during cytokinesis progression, mechanical tension increased substantially along the direction of the cell equator, while the network contracted laterally along the pole-to-pole axis without a detectable increase in tension. Our data suggest that an asymmetric increase in cortical tension promotes filament reorientation along the cytokinetic cleavage furrow, which might have implications for diverse other biological processes involving actomyosin rings."}],"quality_controlled":"1","volume":6,"publist_id":"7245","title":"Cytokinesis in vertebrate cells initiates by contraction of an equatorial actomyosin network composed of randomly oriented filaments","publication":"eLife","ddc":["570"],"_id":"569","day":"06","publisher":"eLife Sciences Publications","article_processing_charge":"No","author":[{"last_name":"Spira","full_name":"Spira, Felix","first_name":"Felix"},{"full_name":"Cuylen Haering, Sara","last_name":"Cuylen Haering","first_name":"Sara"},{"first_name":"Shalin","last_name":"Mehta","full_name":"Mehta, Shalin"},{"first_name":"Matthias","last_name":"Samwer","full_name":"Samwer, Matthias"},{"first_name":"Anne","orcid":"0000-0003-0666-8928","id":"35B76592-F248-11E8-B48F-1D18A9856A87","full_name":"Reversat, Anne","last_name":"Reversat"},{"first_name":"Amitabh","full_name":"Verma, Amitabh","last_name":"Verma"},{"first_name":"Rudolf","last_name":"Oldenbourg","full_name":"Oldenbourg, Rudolf"},{"orcid":"0000-0002-6620-9179","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","first_name":"Michael K","full_name":"Sixt, Michael K","last_name":"Sixt"},{"first_name":"Daniel","full_name":"Gerlich, Daniel","last_name":"Gerlich"}],"date_updated":"2025-09-11T07:41:10Z","department":[{"_id":"MiSi"}],"isi":1,"status":"public","doi":"10.7554/eLife.30867","publication_status":"published","oa_version":"Published Version","type":"journal_article","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"11","external_id":{"isi":["000414407700001"]},"file":[{"content_type":"application/pdf","creator":"system","date_created":"2018-12-12T10:10:40Z","access_level":"open_access","file_id":"4829","file_size":9666973,"checksum":"ba09c1451153d39e4f4b7cee013e314c","relation":"main_file","file_name":"IST-2017-919-v1+1_elife-30867-figures-v1.pdf","date_updated":"2020-07-14T12:47:10Z"},{"date_updated":"2020-07-14T12:47:10Z","file_name":"IST-2017-919-v1+2_elife-30867-v1.pdf","checksum":"01eb51f1d6ad679947415a51c988e137","relation":"main_file","file_size":5951246,"file_id":"4830","date_created":"2018-12-12T10:10:41Z","access_level":"open_access","content_type":"application/pdf","creator":"system"}],"publication_identifier":{"issn":["2050-084X"]},"has_accepted_license":"1","article_number":"e30867","citation":{"apa":"Spira, F., Cuylen Haering, S., Mehta, S., Samwer, M., Reversat, A., Verma, A., … Gerlich, D. (2017). Cytokinesis in vertebrate cells initiates by contraction of an equatorial actomyosin network composed of randomly oriented filaments. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/eLife.30867\">https://doi.org/10.7554/eLife.30867</a>","chicago":"Spira, Felix, Sara Cuylen Haering, Shalin Mehta, Matthias Samwer, Anne Reversat, Amitabh Verma, Rudolf Oldenbourg, Michael K Sixt, and Daniel Gerlich. “Cytokinesis in Vertebrate Cells Initiates by Contraction of an Equatorial Actomyosin Network Composed of Randomly Oriented Filaments.” <i>ELife</i>. eLife Sciences Publications, 2017. <a href=\"https://doi.org/10.7554/eLife.30867\">https://doi.org/10.7554/eLife.30867</a>.","ama":"Spira F, Cuylen Haering S, Mehta S, et al. Cytokinesis in vertebrate cells initiates by contraction of an equatorial actomyosin network composed of randomly oriented filaments. <i>eLife</i>. 2017;6. doi:<a href=\"https://doi.org/10.7554/eLife.30867\">10.7554/eLife.30867</a>","ieee":"F. Spira <i>et al.</i>, “Cytokinesis in vertebrate cells initiates by contraction of an equatorial actomyosin network composed of randomly oriented filaments,” <i>eLife</i>, vol. 6. eLife Sciences Publications, 2017.","ista":"Spira F, Cuylen Haering S, Mehta S, Samwer M, Reversat A, Verma A, Oldenbourg R, Sixt MK, Gerlich D. 2017. Cytokinesis in vertebrate cells initiates by contraction of an equatorial actomyosin network composed of randomly oriented filaments. eLife. 6, e30867.","short":"F. Spira, S. Cuylen Haering, S. Mehta, M. Samwer, A. Reversat, A. Verma, R. Oldenbourg, M.K. Sixt, D. Gerlich, ELife 6 (2017).","mla":"Spira, Felix, et al. “Cytokinesis in Vertebrate Cells Initiates by Contraction of an Equatorial Actomyosin Network Composed of Randomly Oriented Filaments.” <i>ELife</i>, vol. 6, e30867, eLife Sciences Publications, 2017, doi:<a href=\"https://doi.org/10.7554/eLife.30867\">10.7554/eLife.30867</a>."},"pubrep_id":"919","language":[{"iso":"eng"}],"scopus_import":"1","file_date_updated":"2020-07-14T12:47:10Z"}]