[{"page":"20","oa_version":"Published Version","doi":"10.15479/AT:IST-2015-335-v1-1","file_date_updated":"2020-07-14T12:46:55Z","pubrep_id":"335","day":"18","date_created":"2018-12-12T11:39:20Z","publisher":"IST Austria","_id":"5439","month":"05","publication_identifier":{"issn":["2664-1690"]},"department":[{"_id":"ToHe"}],"title":"The target discounted-sum problem","date_updated":"2023-02-23T10:08:48Z","year":"2015","date_published":"2015-05-18T00:00:00Z","author":[{"last_name":"Boker","full_name":"Boker, Udi","first_name":"Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"first_name":"Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","last_name":"Otop","full_name":"Otop, Jan"}],"citation":{"short":"U. Boker, T.A. Henzinger, J. Otop, The Target Discounted-Sum Problem, IST Austria, 2015.","apa":"Boker, U., Henzinger, T. A., &#38; Otop, J. (2015). <i>The target discounted-sum problem</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2015-335-v1-1\">https://doi.org/10.15479/AT:IST-2015-335-v1-1</a>","ieee":"U. Boker, T. A. Henzinger, and J. Otop, <i>The target discounted-sum problem</i>. IST Austria, 2015.","chicago":"Boker, Udi, Thomas A Henzinger, and Jan Otop. <i>The Target Discounted-Sum Problem</i>. IST Austria, 2015. <a href=\"https://doi.org/10.15479/AT:IST-2015-335-v1-1\">https://doi.org/10.15479/AT:IST-2015-335-v1-1</a>.","ama":"Boker U, Henzinger TA, Otop J. <i>The Target Discounted-Sum Problem</i>. IST Austria; 2015. doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-335-v1-1\">10.15479/AT:IST-2015-335-v1-1</a>","ista":"Boker U, Henzinger TA, Otop J. 2015. The target discounted-sum problem, IST Austria, 20p.","mla":"Boker, Udi, et al. <i>The Target Discounted-Sum Problem</i>. IST Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-335-v1-1\">10.15479/AT:IST-2015-335-v1-1</a>."},"type":"technical_report","file":[{"file_size":589619,"date_updated":"2020-07-14T12:46:55Z","content_type":"application/pdf","relation":"main_file","checksum":"40405907aa012acece1bc26cf0be554d","access_level":"open_access","file_name":"IST-2015-335-v1+1_report.pdf","file_id":"5517","creator":"system","date_created":"2018-12-12T11:53:55Z"}],"ddc":["004","512","513"],"status":"public","has_accepted_license":"1","language":[{"iso":"eng"}],"related_material":{"record":[{"status":"public","relation":"later_version","id":"1659"}]},"publication_status":"published","alternative_title":["IST Austria Technical Report"],"abstract":[{"text":"The target discounted-sum problem is the following: Given a rational discount factor 0 < λ < 1 and three rational values a, b, and t, does there exist a finite or an infinite sequence w ε(a, b)∗ or w ε(a, b)w, such that Σ|w| i=0 w(i)λi equals t? The problem turns out to relate to many fields of mathematics and computer science, and its decidability question is surprisingly hard to solve. We solve the finite version of the problem, and show the hardness of the infinite version, linking it to various areas and open problems in mathematics and computer science: β-expansions, discounted-sum automata, piecewise affine maps, and generalizations of the Cantor set. We provide some partial results to the infinite version, among which are solutions to its restriction to eventually-periodic sequences and to the cases that λ λ 1/2 or λ = 1/n, for every n ε N. We use our results for solving some open problems on discounted-sum automata, among which are the exact-value problem for nondeterministic automata over finite words and the universality and inclusion problems for functional automata. ","lang":"eng"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"publication_status":"published","abstract":[{"text":"Evolution occurs in populations of reproducing individuals. The structure of the population affects the outcome of the evolutionary process. Evolutionary graph theory is a powerful approach to study this phenomenon. There are two graphs. The interaction graph specifies who interacts with whom for payoff in the context of evolution. The replacement graph specifies who competes with whom for reproduction. The vertices of the two graphs are the same, and each vertex corresponds to an individual of the population. The fitness (or the reproductive rate) is a non-negative number, and depends on the payoff. A key quantity is the fixation probability of a new mutant. It is defined as the probability that a newly introduced mutant (on a single vertex) generates a lineage of offspring which eventually takes over the entire population of resident individuals. The basic computational questions are as follows: (i) the qualitative question asks whether the fixation probability is positive; and (ii) the quantitative approximation question asks for an approximation of the fixation probability. Our main results are as follows: First, we consider a special case of the general problem, where the residents do not reproduce. We show that the qualitative question is NP-complete, and the quantitative approximation question is #P-complete, and the hardness results hold even in the special case where the interaction and the replacement graphs coincide. Second, we show that in general both the qualitative and the quantitative approximation questions are PSPACE-complete. The PSPACE-hardness result for quantitative approximation holds even when the fitness is always positive.","lang":"eng"}],"alternative_title":["IST Austria Technical Report"],"related_material":{"record":[{"id":"5421","relation":"earlier_version","status":"public"},{"id":"5432","status":"public","relation":"earlier_version"}]},"language":[{"iso":"eng"}],"has_accepted_license":"1","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"file":[{"file_size":466161,"date_updated":"2020-07-14T12:46:56Z","content_type":"application/pdf","relation":"main_file","checksum":"66aace7d367032af97c15e35c9be9636","access_level":"open_access","file_name":"IST-2015-323-v2+2_main.pdf","file_id":"5484","date_created":"2018-12-12T11:53:23Z","creator":"system"}],"citation":{"ama":"Chatterjee K, Ibsen-Jensen R, Nowak M. <i>The Complexity of Evolutionary Games on Graphs</i>. IST Austria; 2015. doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-323-v2-2\">10.15479/AT:IST-2015-323-v2-2</a>","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. <i>The Complexity of Evolutionary Games on Graphs</i>. IST Austria, 2015. <a href=\"https://doi.org/10.15479/AT:IST-2015-323-v2-2\">https://doi.org/10.15479/AT:IST-2015-323-v2-2</a>.","ista":"Chatterjee K, Ibsen-Jensen R, Nowak M. 2015. The complexity of evolutionary games on graphs, IST Austria, 18p.","mla":"Chatterjee, Krishnendu, et al. <i>The Complexity of Evolutionary Games on Graphs</i>. IST Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-323-v2-2\">10.15479/AT:IST-2015-323-v2-2</a>.","short":"K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolutionary Games on Graphs, IST Austria, 2015.","apa":"Chatterjee, K., Ibsen-Jensen, R., &#38; Nowak, M. (2015). <i>The complexity of evolutionary games on graphs</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2015-323-v2-2\">https://doi.org/10.15479/AT:IST-2015-323-v2-2</a>","ieee":"K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, <i>The complexity of evolutionary games on graphs</i>. IST Austria, 2015."},"type":"technical_report","ddc":["005","576"],"title":"The complexity of evolutionary games on graphs","date_updated":"2023-02-23T12:26:10Z","publication_identifier":{"issn":["2664-1690"]},"department":[{"_id":"KrCh"}],"month":"06","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","last_name":"Ibsen-Jensen","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus"},{"first_name":"Martin","last_name":"Nowak","full_name":"Nowak, Martin"}],"date_published":"2015-06-16T00:00:00Z","year":"2015","file_date_updated":"2020-07-14T12:46:56Z","pubrep_id":"338","doi":"10.15479/AT:IST-2015-323-v2-2","oa_version":"Published Version","page":"18","_id":"5440","publisher":"IST Austria","date_created":"2018-12-12T11:39:21Z","day":"16"},{"publisher":"IST Austria","_id":"5441","date_created":"2018-12-12T11:39:21Z","day":"11","pubrep_id":"340","file_date_updated":"2020-07-14T12:46:56Z","doi":"10.15479/AT:IST-2015-340-v1-1","oa_version":"Published Version","page":"24","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"last_name":"Ibsen-Jensen","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus","first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Amir","id":"391365CE-F248-11E8-B48F-1D18A9856A87","full_name":"Goharshady, Amir","orcid":"0000-0003-1702-6584","last_name":"Goharshady"},{"orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas"}],"date_published":"2015-07-11T00:00:00Z","year":"2015","title":"Algorithms for algebraic path properties in concurrent systems of constant treewidth components","date_updated":"2023-09-19T14:36:19Z","publication_identifier":{"issn":["2664-1690"]},"department":[{"_id":"KrCh"}],"month":"07","ddc":["000"],"file":[{"creator":"system","date_created":"2018-12-12T11:54:09Z","file_id":"5531","file_name":"IST-2015-340-v1+1_main.pdf","access_level":"open_access","checksum":"df383dc62c94d7b2ea639aba088a76c6","relation":"main_file","content_type":"application/pdf","date_updated":"2020-07-14T12:46:56Z","file_size":861396}],"citation":{"ista":"Chatterjee K, Ibsen-Jensen R, Goharshady AK, Pavlogiannis A. 2015. Algorithms for algebraic path properties in concurrent systems of constant treewidth components, IST Austria, 24p.","mla":"Chatterjee, Krishnendu, et al. <i>Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components</i>. IST Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-340-v1-1\">10.15479/AT:IST-2015-340-v1-1</a>.","ama":"Chatterjee K, Ibsen-Jensen R, Goharshady AK, Pavlogiannis A. <i>Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components</i>. IST Austria; 2015. doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-340-v1-1\">10.15479/AT:IST-2015-340-v1-1</a>","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Amir Kafshdar Goharshady, and Andreas Pavlogiannis. <i>Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components</i>. IST Austria, 2015. <a href=\"https://doi.org/10.15479/AT:IST-2015-340-v1-1\">https://doi.org/10.15479/AT:IST-2015-340-v1-1</a>.","ieee":"K. Chatterjee, R. Ibsen-Jensen, A. K. Goharshady, and A. Pavlogiannis, <i>Algorithms for algebraic path properties in concurrent systems of constant treewidth components</i>. IST Austria, 2015.","apa":"Chatterjee, K., Ibsen-Jensen, R., Goharshady, A. K., &#38; Pavlogiannis, A. (2015). <i>Algorithms for algebraic path properties in concurrent systems of constant treewidth components</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2015-340-v1-1\">https://doi.org/10.15479/AT:IST-2015-340-v1-1</a>","short":"K. Chatterjee, R. Ibsen-Jensen, A.K. Goharshady, A. Pavlogiannis, Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components, IST Austria, 2015."},"type":"technical_report","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"publication_status":"published","abstract":[{"lang":"eng","text":"We study algorithmic questions for concurrent systems where the transitions are labeled from a complete, closed semiring, and path properties are algebraic with semiring operations. The algebraic path properties can model dataflow analysis problems, the shortest path problem, and many other natural problems that arise in program analysis. We consider that each component of the concurrent system is a graph with constant treewidth, a property satisfied by the controlflow graphs of most programs. We allow for multiple possible queries, which arise naturally in demand driven dataflow analysis. The study of multiple queries allows us to consider the tradeoff between the resource usage of the one-time preprocessing and for each individual query. The traditional approach constructs the product graph of all components and applies the best-known graph algorithm on the product. In this approach, even the answer to a single query requires the transitive closure (i.e., the results of all possible queries), which provides no room for tradeoff between preprocessing and query time. Our main contributions are algorithms that significantly improve the worst-case running time of the traditional approach, and provide various tradeoffs depending on the number of queries. For example, in a concurrent system of two components, the traditional approach requires hexic time in the worst case for answering one query as well as computing the transitive closure, whereas we show that with one-time preprocessing in almost cubic time, each subsequent query can be answered in at most linear time, and even the transitive closure can be computed in almost quartic time. Furthermore, we establish conditional optimality results showing that the worst-case running time of our algorithms cannot be improved without achieving major breakthroughs in graph algorithms (i.e., improving the worst-case bound for the shortest path problem in general graphs). Preliminary experimental results show that our algorithms perform favorably on several benchmarks."}],"alternative_title":["IST Austria Technical Report"],"related_material":{"record":[{"relation":"later_version","status":"public","id":"1437"},{"id":"5442","status":"public","relation":"earlier_version"},{"id":"6009","status":"public","relation":"later_version"}]},"language":[{"iso":"eng"}],"has_accepted_license":"1","status":"public"},{"citation":{"short":"K. Chatterjee, M. Chmelik, J. Davies, A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs, IST Austria, 2015.","apa":"Chatterjee, K., Chmelik, M., &#38; Davies, J. (2015). <i>A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2015-325-v2-1\">https://doi.org/10.15479/AT:IST-2015-325-v2-1</a>","ieee":"K. Chatterjee, M. Chmelik, and J. Davies, <i>A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs</i>. IST Austria, 2015.","chicago":"Chatterjee, Krishnendu, Martin Chmelik, and Jessica Davies. <i>A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs</i>. IST Austria, 2015. <a href=\"https://doi.org/10.15479/AT:IST-2015-325-v2-1\">https://doi.org/10.15479/AT:IST-2015-325-v2-1</a>.","ama":"Chatterjee K, Chmelik M, Davies J. <i>A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs</i>. IST Austria; 2015. doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-325-v2-1\">10.15479/AT:IST-2015-325-v2-1</a>","ista":"Chatterjee K, Chmelik M, Davies J. 2015. A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs, IST Austria, 23p.","mla":"Chatterjee, Krishnendu, et al. <i>A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs</i>. IST Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-325-v2-1\">10.15479/AT:IST-2015-325-v2-1</a>."},"type":"technical_report","file":[{"relation":"main_file","checksum":"f0fa31ad8161ed655137e94012123ef9","file_size":412379,"content_type":"application/pdf","date_updated":"2020-07-14T12:46:57Z","file_name":"IST-2015-325-v2+1_main.pdf","access_level":"open_access","file_id":"5466","date_created":"2018-12-12T11:53:05Z","creator":"system"}],"ddc":["000"],"status":"public","has_accepted_license":"1","language":[{"iso":"eng"}],"related_material":{"record":[{"id":"1166","relation":"later_version","status":"public"}]},"abstract":[{"text":"POMDPs are standard models for probabilistic planning problems, where an agent interacts with an uncertain environment. We study the problem of almost-sure reachability, where given a set of target states, the question is to decide whether there is a policy to ensure that the target set is reached with probability 1 (almost-surely). While in general the problem is EXPTIME-complete, in many practical cases policies with a small amount of memory suffice. Moreover, the existing solution to the problem is explicit, which first requires to construct explicitly an exponential reduction to a belief-support MDP. In this work, we first study the existence of observation-stationary strategies, which is NP-complete, and then small-memory strategies. We present a symbolic algorithm by an efficient encoding to SAT and using a SAT solver for the problem. We report experimental results demonstrating the scalability of our symbolic (SAT-based) approach.","lang":"eng"}],"publication_status":"published","alternative_title":["IST Austria Technical Report"],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"23","oa_version":"Published Version","doi":"10.15479/AT:IST-2015-325-v2-1","pubrep_id":"362","file_date_updated":"2020-07-14T12:46:57Z","day":"06","date_created":"2018-12-12T11:39:22Z","_id":"5443","publisher":"IST Austria","month":"11","publication_identifier":{"issn":["2664-1690"]},"department":[{"_id":"KrCh"}],"date_updated":"2023-02-21T16:24:05Z","title":"A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs","year":"2015","date_published":"2015-11-06T00:00:00Z","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Chmelik","full_name":"Chmelik, Martin","first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jessica","id":"378E0060-F248-11E8-B48F-1D18A9856A87","full_name":"Davies, Jessica","last_name":"Davies"}]},{"has_accepted_license":"1","status":"public","language":[{"iso":"eng"}],"alternative_title":["IST Austria Technical Report"],"publication_status":"published","abstract":[{"lang":"eng","text":"A comprehensive understanding of the clonal evolution of cancer is critical for understanding neoplasia. Genome-wide sequencing data enables evolutionary studies at unprecedented depth. However, classical phylogenetic methods often struggle with noisy sequencing data of impure DNA samples and fail to detect subclones that have different evolutionary trajectories. We have developed a tool, called Treeomics, that allows us to reconstruct the phylogeny of a cancer with commonly available sequencing technologies. Using Bayesian inference and Integer Linear Programming, robust phylogenies consistent with the biological processes underlying cancer evolution were obtained for pancreatic, ovarian, and prostate cancers. Furthermore, Treeomics correctly identified sequencing artifacts such as those resulting from low statistical power; nearly 7% of variants were misclassified by conventional statistical methods. These artifacts can skew phylogenies by creating illusory tumor heterogeneity among distinct samples. Importantly, we show that the evolutionary trees generated with Treeomics are mathematically optimal."}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"technical_report","citation":{"apa":"Reiter, J., Makohon-Moore, A., Gerold, J., Bozic, I., Chatterjee, K., Iacobuzio-Donahue, C., … Nowak, M. (2015). <i>Reconstructing robust phylogenies of metastatic cancers</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2015-399-v1-1\">https://doi.org/10.15479/AT:IST-2015-399-v1-1</a>","short":"J. Reiter, A. Makohon-Moore, J. Gerold, I. Bozic, K. Chatterjee, C. Iacobuzio-Donahue, B. Vogelstein, M. Nowak, Reconstructing Robust Phylogenies of Metastatic Cancers, IST Austria, 2015.","ieee":"J. Reiter <i>et al.</i>, <i>Reconstructing robust phylogenies of metastatic cancers</i>. IST Austria, 2015.","chicago":"Reiter, Johannes, Alvin Makohon-Moore, Jeffrey Gerold, Ivana Bozic, Krishnendu Chatterjee, Christine Iacobuzio-Donahue, Bert Vogelstein, and Martin Nowak. <i>Reconstructing Robust Phylogenies of Metastatic Cancers</i>. IST Austria, 2015. <a href=\"https://doi.org/10.15479/AT:IST-2015-399-v1-1\">https://doi.org/10.15479/AT:IST-2015-399-v1-1</a>.","ama":"Reiter J, Makohon-Moore A, Gerold J, et al. <i>Reconstructing Robust Phylogenies of Metastatic Cancers</i>. IST Austria; 2015. doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-399-v1-1\">10.15479/AT:IST-2015-399-v1-1</a>","ista":"Reiter J, Makohon-Moore A, Gerold J, Bozic I, Chatterjee K, Iacobuzio-Donahue C, Vogelstein B, Nowak M. 2015. Reconstructing robust phylogenies of metastatic cancers, IST Austria, 25p.","mla":"Reiter, Johannes, et al. <i>Reconstructing Robust Phylogenies of Metastatic Cancers</i>. IST Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-399-v1-1\">10.15479/AT:IST-2015-399-v1-1</a>."},"file":[{"access_level":"open_access","file_name":"IST-2015-399-v1+1_treeomics.pdf","date_updated":"2020-07-14T12:46:58Z","content_type":"application/pdf","file_size":3533200,"relation":"main_file","checksum":"c47d33bdda06181753c0af36f16e7b5d","date_created":"2018-12-12T11:53:24Z","creator":"system","file_id":"5485"}],"ddc":["000","576"],"month":"12","department":[{"_id":"KrCh"}],"publication_identifier":{"issn":["2664-1690"]},"date_updated":"2020-07-14T23:05:07Z","title":"Reconstructing robust phylogenies of metastatic cancers","year":"2015","author":[{"id":"4A918E98-F248-11E8-B48F-1D18A9856A87","first_name":"Johannes","last_name":"Reiter","orcid":"0000-0002-0170-7353","full_name":"Reiter, Johannes"},{"first_name":"Alvin","full_name":"Makohon-Moore, Alvin","last_name":"Makohon-Moore"},{"full_name":"Gerold, Jeffrey","last_name":"Gerold","first_name":"Jeffrey"},{"last_name":"Bozic","full_name":"Bozic, Ivana","first_name":"Ivana"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"first_name":"Christine","full_name":"Iacobuzio-Donahue, Christine","last_name":"Iacobuzio-Donahue"},{"first_name":"Bert","last_name":"Vogelstein","full_name":"Vogelstein, Bert"},{"first_name":"Martin","full_name":"Nowak, Martin","last_name":"Nowak"}],"date_published":"2015-12-30T00:00:00Z","page":"25","oa_version":"Published Version","doi":"10.15479/AT:IST-2015-399-v1-1","file_date_updated":"2020-07-14T12:46:58Z","pubrep_id":"399","day":"30","date_created":"2018-12-12T11:39:22Z","publisher":"IST Austria","_id":"5444"},{"tmp":{"legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","name":"Creative Commons Public Domain Dedication (CC0 1.0)","short":"CC0 (1.0)","image":"/images/cc_0.png"},"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"author":[{"first_name":"Andreas","id":"42BABFB4-F248-11E8-B48F-1D18A9856A87","full_name":"Fellner, Andreas","last_name":"Fellner"}],"year":"2015","oa_version":"Published Version","doi":"10.15479/AT:ISTA:28","day":"13","publisher":"Institute of Science and Technology Austria","status":"public","has_accepted_license":"1","abstract":[{"lang":"eng","text":"This repository contains the experimental part of the CAV 2015 publication Counterexample Explanation by Learning Small Strategies in Markov Decision Processes.\r\nWe extended the probabilistic model checker PRISM to represent strategies of Markov Decision Processes as Decision Trees.\r\nThe archive contains a java executable version of the extended tool (prism_dectree.jar) together with a few examples of the PRISM benchmark library.\r\nTo execute the program, please have a look at the README.txt, which provides instructions and further information on the archive.\r\nThe archive contains scripts that (if run often enough) reproduces the data presented in the publication."}],"publist_id":"5564","type":"research_data","citation":{"short":"A. Fellner, (2015).","apa":"Fellner, A. (2015). Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:28\">https://doi.org/10.15479/AT:ISTA:28</a>","ieee":"A. Fellner, “Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes.” Institute of Science and Technology Austria, 2015.","chicago":"Fellner, Andreas. “Experimental Part of CAV 2015 Publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes.” Institute of Science and Technology Austria, 2015. <a href=\"https://doi.org/10.15479/AT:ISTA:28\">https://doi.org/10.15479/AT:ISTA:28</a>.","ama":"Fellner A. Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes. 2015. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:28\">10.15479/AT:ISTA:28</a>","ista":"Fellner A. 2015. Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:28\">10.15479/AT:ISTA:28</a>.","mla":"Fellner, Andreas. <i>Experimental Part of CAV 2015 Publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes</i>. Institute of Science and Technology Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:28\">10.15479/AT:ISTA:28</a>."},"file":[{"access_level":"open_access","file_name":"IST-2015-28-v1+2_Fellner_DataRep.zip","file_size":49557109,"date_updated":"2020-07-14T12:47:00Z","content_type":"application/zip","relation":"main_file","checksum":"b8bcb43c0893023cda66c1b69c16ac62","date_created":"2018-12-12T13:02:31Z","creator":"system","file_id":"5597"}],"ddc":["004"],"month":"08","date_updated":"2024-02-21T13:52:07Z","title":"Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes","ec_funded":1,"date_published":"2015-08-13T00:00:00Z","keyword":["Markov Decision Process","Decision Tree","Probabilistic Verification","Counterexample Explanation"],"article_processing_charge":"No","file_date_updated":"2020-07-14T12:47:00Z","contributor":[{"last_name":"Kretinsky","first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2018-12-12T12:31:29Z","project":[{"call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF"}],"_id":"5549","datarep_id":"28","related_material":{"record":[{"id":"1603","relation":"popular_science","status":"public"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"license":"https://creativecommons.org/publicdomain/zero/1.0/"},{"article_number":"42","acknowledgement":"The authors would like to acknowledge contributions from Baptiste Mottet who performed preliminary analysis regarding parameter inference for the considered case study in a student project (Mottet, 2014/2015).\r\nThe research leading to these results has received funding from the People Programme (Marie Curie Actions) of the European Union's Seventh Framework Programme (FP7/2007-2013) under REA grant agreement No. [291734] and from SystemsX under the project SignalX.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"intvolume":"         3","volume":3,"scopus_import":"1","license":"https://creativecommons.org/licenses/by/4.0/","date_published":"2015-06-10T00:00:00Z","article_processing_charge":"No","keyword":["General Environmental Science"],"ec_funded":1,"title":"Bayesian inference for stochastic individual-based models of ecological systems: a pest control simulation study","date_updated":"2022-02-25T11:59:23Z","month":"06","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"}],"_id":"10794","date_created":"2022-02-25T11:42:25Z","file_date_updated":"2022-02-25T11:55:26Z","publication":"Frontiers in Environmental Science","quality_controlled":"1","abstract":[{"lang":"eng","text":"Mathematical models are of fundamental importance in the understanding of complex population dynamics. For instance, they can be used to predict the population evolution starting from different initial conditions or to test how a system responds to external perturbations. For this analysis to be meaningful in real applications, however, it is of paramount importance to choose an appropriate model structure and to infer the model parameters from measured data. While many parameter inference methods are available for models based on deterministic ordinary differential equations, the same does not hold for more detailed individual-based models. Here we consider, in particular, stochastic models in which the time evolution of the species abundances is described by a continuous-time Markov chain. These models are governed by a master equation that is typically difficult to solve. Consequently, traditional inference methods that rely on iterative evaluation of parameter likelihoods are computationally intractable. The aim of this paper is to present recent advances in parameter inference for continuous-time Markov chain models, based on a moment closure approximation of the parameter likelihood, and to investigate how these results can help in understanding, and ultimately controlling, complex systems in ecology. Specifically, we illustrate through an agricultural pest case study how parameters of a stochastic individual-based model can be identified from measured data and how the resulting model can be used to solve an optimal control problem in a stochastic setting. In particular, we show how the matter of determining the optimal combination of two different pest control methods can be formulated as a chance constrained optimization problem where the control action is modeled as a state reset, leading to a hybrid system formulation."}],"publication_status":"published","language":[{"iso":"eng"}],"has_accepted_license":"1","status":"public","ddc":["000","570"],"article_type":"original","file":[{"file_id":"10795","date_created":"2022-02-25T11:55:26Z","creator":"dernst","date_updated":"2022-02-25T11:55:26Z","content_type":"application/pdf","file_size":1371201,"checksum":"26c222487564e1be02a11d688d6f769d","relation":"main_file","success":1,"access_level":"open_access","file_name":"2015_FrontiersEnvironmScience_Parise.pdf"}],"citation":{"ista":"Parise F, Lygeros J, Ruess J. 2015. Bayesian inference for stochastic individual-based models of ecological systems: a pest control simulation study. Frontiers in Environmental Science. 3, 42.","mla":"Parise, Francesca, et al. “Bayesian Inference for Stochastic Individual-Based Models of Ecological Systems: A Pest Control Simulation Study.” <i>Frontiers in Environmental Science</i>, vol. 3, 42, Frontiers, 2015, doi:<a href=\"https://doi.org/10.3389/fenvs.2015.00042\">10.3389/fenvs.2015.00042</a>.","ama":"Parise F, Lygeros J, Ruess J. Bayesian inference for stochastic individual-based models of ecological systems: a pest control simulation study. <i>Frontiers in Environmental Science</i>. 2015;3. doi:<a href=\"https://doi.org/10.3389/fenvs.2015.00042\">10.3389/fenvs.2015.00042</a>","chicago":"Parise, Francesca, John Lygeros, and Jakob Ruess. “Bayesian Inference for Stochastic Individual-Based Models of Ecological Systems: A Pest Control Simulation Study.” <i>Frontiers in Environmental Science</i>. Frontiers, 2015. <a href=\"https://doi.org/10.3389/fenvs.2015.00042\">https://doi.org/10.3389/fenvs.2015.00042</a>.","ieee":"F. Parise, J. Lygeros, and J. Ruess, “Bayesian inference for stochastic individual-based models of ecological systems: a pest control simulation study,” <i>Frontiers in Environmental Science</i>, vol. 3. Frontiers, 2015.","apa":"Parise, F., Lygeros, J., &#38; Ruess, J. (2015). Bayesian inference for stochastic individual-based models of ecological systems: a pest control simulation study. <i>Frontiers in Environmental Science</i>. Frontiers. <a href=\"https://doi.org/10.3389/fenvs.2015.00042\">https://doi.org/10.3389/fenvs.2015.00042</a>","short":"F. Parise, J. Lygeros, J. Ruess, Frontiers in Environmental Science 3 (2015)."},"type":"journal_article","author":[{"first_name":"Francesca","last_name":"Parise","full_name":"Parise, Francesca"},{"last_name":"Lygeros","full_name":"Lygeros, John","first_name":"John"},{"last_name":"Ruess","orcid":"0000-0003-1615-3282","full_name":"Ruess, Jakob","first_name":"Jakob","id":"4A245D00-F248-11E8-B48F-1D18A9856A87"}],"year":"2015","department":[{"_id":"ToHe"},{"_id":"GaTk"}],"publication_identifier":{"issn":["2296-665X"]},"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publisher":"Frontiers","day":"10","doi":"10.3389/fenvs.2015.00042","oa_version":"Published Version"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"The research was partly supported by FWF Grant No P 23499-N23, FWF NFN Grant\r\nNo S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.","issue":"1","intvolume":"      2015","volume":2015,"scopus_import":"1","ec_funded":1,"date_published":"2015-01-01T00:00:00Z","article_processing_charge":"No","month":"01","title":"The value 1 problem under finite-memory strategies for concurrent mean-payoff games","date_updated":"2022-02-25T12:33:32Z","date_created":"2022-02-25T12:18:43Z","external_id":{"arxiv":["1409.6690"]},"_id":"10796","project":[{"call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"name":"Game Theory","call_identifier":"FWF","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"page":"1018-1029","publication":"Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms","quality_controlled":"1","language":[{"iso":"eng"}],"status":"public","abstract":[{"lang":"eng","text":"We consider concurrent mean-payoff games, a very well-studied class of two-player (player 1 vs player 2) zero-sum games on finite-state graphs where every transition is assigned a reward between 0 and 1, and the payoff function is the long-run average of the rewards. The value is the maximal expected payoff that player 1 can guarantee against all strategies of player 2. We consider the computation of the set of states with value 1 under finite-memory strategies for player 1, and our main results for the problem are as follows: (1) we present a polynomial-time algorithm; (2) we show that whenever there is a finite-memory strategy, there is a stationary strategy that does not need memory at all; and (3) we present an optimal bound (which is double exponential) on the patience of stationary strategies (where patience of a distribution is the inverse of the smallest positive probability and represents a complexity measure of a stationary strategy)."}],"publication_status":"published","citation":{"ista":"Chatterjee K, Ibsen-Jensen R. 2015. The value 1 problem under finite-memory strategies for concurrent mean-payoff games. Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms vol. 2015, 1018–1029.","mla":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “The Value 1 Problem under Finite-Memory Strategies for Concurrent Mean-Payoff Games.” <i>Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms</i>, vol. 2015, no. 1, SIAM, 2015, pp. 1018–29, doi:<a href=\"https://doi.org/10.1137/1.9781611973730.69\">10.1137/1.9781611973730.69</a>.","ama":"Chatterjee K, Ibsen-Jensen R. The value 1 problem under finite-memory strategies for concurrent mean-payoff games. In: <i>Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms</i>. Vol 2015. SIAM; 2015:1018-1029. doi:<a href=\"https://doi.org/10.1137/1.9781611973730.69\">10.1137/1.9781611973730.69</a>","chicago":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “The Value 1 Problem under Finite-Memory Strategies for Concurrent Mean-Payoff Games.” In <i>Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 2015:1018–29. SIAM, 2015. <a href=\"https://doi.org/10.1137/1.9781611973730.69\">https://doi.org/10.1137/1.9781611973730.69</a>.","ieee":"K. Chatterjee and R. Ibsen-Jensen, “The value 1 problem under finite-memory strategies for concurrent mean-payoff games,” in <i>Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms</i>, San Diego, CA, United States, 2015, vol. 2015, no. 1, pp. 1018–1029.","apa":"Chatterjee, K., &#38; Ibsen-Jensen, R. (2015). The value 1 problem under finite-memory strategies for concurrent mean-payoff games. In <i>Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms</i> (Vol. 2015, pp. 1018–1029). San Diego, CA, United States: SIAM. <a href=\"https://doi.org/10.1137/1.9781611973730.69\">https://doi.org/10.1137/1.9781611973730.69</a>","short":"K. Chatterjee, R. Ibsen-Jensen, in:, Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2015, pp. 1018–1029."},"type":"conference","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","last_name":"Ibsen-Jensen"}],"year":"2015","conference":{"name":"SODA: Symposium on Discrete Algorithms","location":"San Diego, CA, United States","start_date":"2015-01-04","end_date":"2015-01-06"},"publication_identifier":{"isbn":["978-161197374-7"]},"department":[{"_id":"KrCh"}],"day":"01","publisher":"SIAM","oa_version":"Preprint","arxiv":1,"doi":"10.1137/1.9781611973730.69"},{"author":[{"last_name":"Rodrigues","full_name":"Rodrigues, Jessica A.","first_name":"Jessica A."},{"first_name":"Daniel","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","last_name":"Zilberman","full_name":"Zilberman, Daniel","orcid":"0000-0002-0123-8649"}],"year":"2015","department":[{"_id":"DaZi"}],"publication_identifier":{"eissn":["1549-5477"],"issn":["0890-9369"]},"tmp":{"image":"/images/cc_by_nc.png","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","short":"CC BY-NC (4.0)"},"publisher":"Cold Spring Harbor Laboratory Press","day":"15","doi":"10.1101/gad.269902.115","oa_version":"Published Version","quality_controlled":"1","publication_status":"published","abstract":[{"text":"Genomic imprinting, an inherently epigenetic phenomenon defined by parent of origin-dependent gene expression, is observed in mammals and flowering plants. Genome-scale surveys of imprinted expression and the underlying differential epigenetic marks have led to the discovery of hundreds of imprinted plant genes and confirmed DNA and histone methylation as key regulators of plant imprinting. However, the biological roles of the vast majority of imprinted plant genes are unknown, and the evolutionary forces shaping plant imprinting remain rather opaque. Here, we review the mechanisms of plant genomic imprinting and discuss theories of imprinting evolution and biological significance in light of recent findings.","lang":"eng"}],"language":[{"iso":"eng"}],"has_accepted_license":"1","pmid":1,"status":"public","ddc":["570"],"article_type":"review","file":[{"checksum":"086a88cfca4677646da26ed960cb02e9","relation":"main_file","file_size":1116846,"content_type":"application/pdf","date_updated":"2021-06-08T09:55:10Z","file_name":"2015_GenesAndDevelopment_Rodrigues.pdf","access_level":"open_access","success":1,"file_id":"9533","date_created":"2021-06-08T09:55:10Z","creator":"asandaue"}],"citation":{"ieee":"J. A. Rodrigues and D. Zilberman, “Evolution and function of genomic imprinting in plants,” <i>Genes and Development</i>, vol. 29, no. 24. Cold Spring Harbor Laboratory Press, pp. 2517–2531, 2015.","apa":"Rodrigues, J. A., &#38; Zilberman, D. (2015). Evolution and function of genomic imprinting in plants. <i>Genes and Development</i>. Cold Spring Harbor Laboratory Press. <a href=\"https://doi.org/10.1101/gad.269902.115\">https://doi.org/10.1101/gad.269902.115</a>","short":"J.A. Rodrigues, D. Zilberman, Genes and Development 29 (2015) 2517–2531.","mla":"Rodrigues, Jessica A., and Daniel Zilberman. “Evolution and Function of Genomic Imprinting in Plants.” <i>Genes and Development</i>, vol. 29, no. 24, Cold Spring Harbor Laboratory Press, 2015, pp. 2517–2531, doi:<a href=\"https://doi.org/10.1101/gad.269902.115\">10.1101/gad.269902.115</a>.","ista":"Rodrigues JA, Zilberman D. 2015. Evolution and function of genomic imprinting in plants. Genes and Development. 29(24), 2517–2531.","ama":"Rodrigues JA, Zilberman D. Evolution and function of genomic imprinting in plants. <i>Genes and Development</i>. 2015;29(24):2517–2531. doi:<a href=\"https://doi.org/10.1101/gad.269902.115\">10.1101/gad.269902.115</a>","chicago":"Rodrigues, Jessica A., and Daniel Zilberman. “Evolution and Function of Genomic Imprinting in Plants.” <i>Genes and Development</i>. Cold Spring Harbor Laboratory Press, 2015. <a href=\"https://doi.org/10.1101/gad.269902.115\">https://doi.org/10.1101/gad.269902.115</a>."},"type":"journal_article","date_published":"2015-12-15T00:00:00Z","article_processing_charge":"No","title":"Evolution and function of genomic imprinting in plants","date_updated":"2021-12-14T07:58:15Z","month":"12","_id":"9532","date_created":"2021-06-08T09:56:24Z","external_id":{"pmid":["26680300"]},"file_date_updated":"2021-06-08T09:55:10Z","publication":"Genes and Development","page":"2517–2531","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","issue":"24","intvolume":"        29","oa":1,"volume":29,"scopus_import":"1","license":"https://creativecommons.org/licenses/by-nc/4.0/","extern":"1"},{"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"1619"}]},"status":"public","citation":{"ieee":"G. Chevereau <i>et al.</i>, “Excel file containing the raw data for all figures.” Public Library of Science, 2015.","short":"G. Chevereau, M. Lukacisinova, T. Batur, A. Guvenek, D.H. Ayhan, E. Toprak, M.T. Bollenbach, (2015).","apa":"Chevereau, G., Lukacisinova, M., Batur, T., Guvenek, A., Ayhan, D. H., Toprak, E., &#38; Bollenbach, M. T. (2015). Excel file containing the raw data for all figures. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pbio.1002299.s001\">https://doi.org/10.1371/journal.pbio.1002299.s001</a>","mla":"Chevereau, Guillaume, et al. <i>Excel File Containing the Raw Data for All Figures</i>. Public Library of Science, 2015, doi:<a href=\"https://doi.org/10.1371/journal.pbio.1002299.s001\">10.1371/journal.pbio.1002299.s001</a>.","ista":"Chevereau G, Lukacisinova M, Batur T, Guvenek A, Ayhan DH, Toprak E, Bollenbach MT. 2015. Excel file containing the raw data for all figures, Public Library of Science, <a href=\"https://doi.org/10.1371/journal.pbio.1002299.s001\">10.1371/journal.pbio.1002299.s001</a>.","ama":"Chevereau G, Lukacisinova M, Batur T, et al. Excel file containing the raw data for all figures. 2015. doi:<a href=\"https://doi.org/10.1371/journal.pbio.1002299.s001\">10.1371/journal.pbio.1002299.s001</a>","chicago":"Chevereau, Guillaume, Marta Lukacisinova, Tugce Batur, Aysegul Guvenek, Dilay Hazal Ayhan, Erdal Toprak, and Mark Tobias Bollenbach. “Excel File Containing the Raw Data for All Figures.” Public Library of Science, 2015. <a href=\"https://doi.org/10.1371/journal.pbio.1002299.s001\">https://doi.org/10.1371/journal.pbio.1002299.s001</a>."},"type":"research_data_reference","article_processing_charge":"No","year":"2015","author":[{"first_name":"Guillaume","id":"424D78A0-F248-11E8-B48F-1D18A9856A87","last_name":"Chevereau","full_name":"Chevereau, Guillaume"},{"first_name":"Marta","id":"4342E402-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2519-8004","full_name":"Lukacisinova, Marta","last_name":"Lukacisinova"},{"first_name":"Tugce","last_name":"Batur","full_name":"Batur, Tugce"},{"first_name":"Aysegul","full_name":"Guvenek, Aysegul","last_name":"Guvenek"},{"full_name":"Ayhan, Dilay Hazal","last_name":"Ayhan","first_name":"Dilay Hazal"},{"full_name":"Toprak, Erdal","last_name":"Toprak","first_name":"Erdal"},{"orcid":"0000-0003-4398-476X","full_name":"Bollenbach, Mark Tobias","last_name":"Bollenbach","id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","first_name":"Mark Tobias"}],"date_published":"2015-11-18T00:00:00Z","department":[{"_id":"ToBo"}],"title":"Excel file containing the raw data for all figures","date_updated":"2023-02-23T10:07:02Z","month":"11","publisher":"Public Library of Science","_id":"9711","day":"18","date_created":"2021-07-23T11:53:50Z","doi":"10.1371/journal.pbio.1002299.s001","oa_version":"Published Version"},{"month":"11","department":[{"_id":"NiBa"},{"_id":"CaGu"},{"_id":"GaTk"}],"title":"Other fitness models for comparison & for interacting TFBSs","date_updated":"2025-05-28T11:57:04Z","year":"2015","article_processing_charge":"No","author":[{"first_name":"Murat","id":"37C323C6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8523-0758","full_name":"Tugrul, Murat","last_name":"Tugrul"},{"last_name":"Paixao","full_name":"Paixao, Tiago","orcid":"0000-0003-2361-3953","id":"2C5658E6-F248-11E8-B48F-1D18A9856A87","first_name":"Tiago"},{"last_name":"Barton","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H"},{"last_name":"Tkačik","orcid":"0000-0002-6699-1455","full_name":"Tkačik, Gašper","first_name":"Gašper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87"}],"date_published":"2015-11-06T00:00:00Z","oa_version":"Published Version","doi":"10.1371/journal.pgen.1005639.s001","day":"06","date_created":"2021-07-23T12:00:37Z","publisher":"Public Library of Science","_id":"9712","status":"public","related_material":{"record":[{"id":"1666","relation":"used_in_publication","status":"public"}]},"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","type":"research_data_reference","citation":{"ieee":"M. Tugrul, T. Paixao, N. H. Barton, and G. Tkačik, “Other fitness models for comparison &#38; for interacting TFBSs.” Public Library of Science, 2015.","apa":"Tugrul, M., Paixao, T., Barton, N. H., &#38; Tkačik, G. (2015). Other fitness models for comparison &#38; for interacting TFBSs. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pgen.1005639.s001\">https://doi.org/10.1371/journal.pgen.1005639.s001</a>","short":"M. Tugrul, T. Paixao, N.H. Barton, G. Tkačik, (2015).","mla":"Tugrul, Murat, et al. <i>Other Fitness Models for Comparison &#38; for Interacting TFBSs</i>. Public Library of Science, 2015, doi:<a href=\"https://doi.org/10.1371/journal.pgen.1005639.s001\">10.1371/journal.pgen.1005639.s001</a>.","ista":"Tugrul M, Paixao T, Barton NH, Tkačik G. 2015. Other fitness models for comparison &#38; for interacting TFBSs, Public Library of Science, <a href=\"https://doi.org/10.1371/journal.pgen.1005639.s001\">10.1371/journal.pgen.1005639.s001</a>.","ama":"Tugrul M, Paixao T, Barton NH, Tkačik G. Other fitness models for comparison &#38; for interacting TFBSs. 2015. doi:<a href=\"https://doi.org/10.1371/journal.pgen.1005639.s001\">10.1371/journal.pgen.1005639.s001</a>","chicago":"Tugrul, Murat, Tiago Paixao, Nicholas H Barton, and Gašper Tkačik. “Other Fitness Models for Comparison &#38; for Interacting TFBSs.” Public Library of Science, 2015. <a href=\"https://doi.org/10.1371/journal.pgen.1005639.s001\">https://doi.org/10.1371/journal.pgen.1005639.s001</a>."}},{"related_material":{"record":[{"id":"1566","status":"public","relation":"used_in_publication"}]},"status":"public","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","type":"research_data_reference","citation":{"apa":"Gómez Sicilia, À., Sikora, M. K., Cieplak, M., &#38; Carrión Vázquez, M. (2015). An exploration of the universe of polyglutamine structures - submission to PLOS journals. Public Library of Science . <a href=\"https://doi.org/10.1371/journal.pcbi.1004541.s001\">https://doi.org/10.1371/journal.pcbi.1004541.s001</a>","short":"À. Gómez Sicilia, M.K. Sikora, M. Cieplak, M. Carrión Vázquez, (2015).","ieee":"À. Gómez Sicilia, M. K. Sikora, M. Cieplak, and M. Carrión Vázquez, “An exploration of the universe of polyglutamine structures - submission to PLOS journals.” Public Library of Science , 2015.","chicago":"Gómez Sicilia, Àngel, Mateusz K Sikora, Marek Cieplak, and Mariano Carrión Vázquez. “An Exploration of the Universe of Polyglutamine Structures - Submission to PLOS Journals.” Public Library of Science , 2015. <a href=\"https://doi.org/10.1371/journal.pcbi.1004541.s001\">https://doi.org/10.1371/journal.pcbi.1004541.s001</a>.","ama":"Gómez Sicilia À, Sikora MK, Cieplak M, Carrión Vázquez M. An exploration of the universe of polyglutamine structures - submission to PLOS journals. 2015. doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1004541.s001\">10.1371/journal.pcbi.1004541.s001</a>","ista":"Gómez Sicilia À, Sikora MK, Cieplak M, Carrión Vázquez M. 2015. An exploration of the universe of polyglutamine structures - submission to PLOS journals, Public Library of Science , <a href=\"https://doi.org/10.1371/journal.pcbi.1004541.s001\">10.1371/journal.pcbi.1004541.s001</a>.","mla":"Gómez Sicilia, Àngel, et al. <i>An Exploration of the Universe of Polyglutamine Structures - Submission to PLOS Journals</i>. Public Library of Science , 2015, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1004541.s001\">10.1371/journal.pcbi.1004541.s001</a>."},"title":"An exploration of the universe of polyglutamine structures - submission to PLOS journals","date_updated":"2023-02-23T10:04:35Z","department":[{"_id":"CaHe"}],"month":"10","date_published":"2015-10-23T00:00:00Z","author":[{"full_name":"Gómez Sicilia, Àngel","last_name":"Gómez Sicilia","first_name":"Àngel"},{"last_name":"Sikora","full_name":"Sikora, Mateusz K","id":"2F74BCDE-F248-11E8-B48F-1D18A9856A87","first_name":"Mateusz K"},{"full_name":"Cieplak, Marek","last_name":"Cieplak","first_name":"Marek"},{"first_name":"Mariano","last_name":"Carrión Vázquez","full_name":"Carrión Vázquez, Mariano"}],"year":"2015","article_processing_charge":"No","doi":"10.1371/journal.pcbi.1004541.s001","oa_version":"Published Version","publisher":"Public Library of Science ","_id":"9714","date_created":"2021-07-23T12:05:28Z","day":"23"},{"doi":"10.1371/journal.pone.0126907.s001","oa_version":"Published Version","_id":"9715","publisher":"Public Library of Science","day":"18","date_created":"2021-07-23T12:11:30Z","department":[{"_id":"NiBa"}],"date_updated":"2023-02-23T10:15:25Z","title":"Mathematical inference of the results","month":"05","year":"2015","article_processing_charge":"No","author":[{"last_name":"Trubenova","full_name":"Trubenova, Barbora","orcid":"0000-0002-6873-2967","id":"42302D54-F248-11E8-B48F-1D18A9856A87","first_name":"Barbora"},{"full_name":"Novak, Sebastian","last_name":"Novak","id":"461468AE-F248-11E8-B48F-1D18A9856A87","first_name":"Sebastian"},{"last_name":"Hager","full_name":"Hager, Reinmar","first_name":"Reinmar"}],"date_published":"2015-05-18T00:00:00Z","citation":{"short":"B. Trubenova, S. Novak, R. Hager, (2015).","apa":"Trubenova, B., Novak, S., &#38; Hager, R. (2015). Mathematical inference of the results. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pone.0126907.s001\">https://doi.org/10.1371/journal.pone.0126907.s001</a>","ieee":"B. Trubenova, S. Novak, and R. Hager, “Mathematical inference of the results.” Public Library of Science, 2015.","chicago":"Trubenova, Barbora, Sebastian Novak, and Reinmar Hager. “Mathematical Inference of the Results.” Public Library of Science, 2015. <a href=\"https://doi.org/10.1371/journal.pone.0126907.s001\">https://doi.org/10.1371/journal.pone.0126907.s001</a>.","ama":"Trubenova B, Novak S, Hager R. Mathematical inference of the results. 2015. doi:<a href=\"https://doi.org/10.1371/journal.pone.0126907.s001\">10.1371/journal.pone.0126907.s001</a>","ista":"Trubenova B, Novak S, Hager R. 2015. Mathematical inference of the results, Public Library of Science, <a href=\"https://doi.org/10.1371/journal.pone.0126907.s001\">10.1371/journal.pone.0126907.s001</a>.","mla":"Trubenova, Barbora, et al. <i>Mathematical Inference of the Results</i>. Public Library of Science, 2015, doi:<a href=\"https://doi.org/10.1371/journal.pone.0126907.s001\">10.1371/journal.pone.0126907.s001</a>."},"type":"research_data_reference","related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"1809"}]},"status":"public","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf"},{"date_updated":"2023-02-23T10:16:13Z","title":"Supporting information text","department":[{"_id":"GaTk"}],"month":"03","date_published":"2015-03-23T00:00:00Z","author":[{"last_name":"Friedlander","full_name":"Friedlander, Tamar","first_name":"Tamar","id":"36A5845C-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Avraham E.","last_name":"Mayo","full_name":"Mayo, Avraham E."},{"first_name":"Tsvi","last_name":"Tlusty","full_name":"Tlusty, Tsvi"},{"first_name":"Uri","last_name":"Alon","full_name":"Alon, Uri"}],"year":"2015","article_processing_charge":"No","doi":"10.1371/journal.pcbi.1004055.s001","oa_version":"Published Version","_id":"9718","publisher":"Public Library of Science","date_created":"2021-07-26T08:35:23Z","day":"23","related_material":{"record":[{"id":"1827","status":"public","relation":"used_in_publication"}]},"status":"public","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","type":"research_data_reference","citation":{"short":"T. Friedlander, A.E. Mayo, T. Tlusty, U. Alon, (2015).","apa":"Friedlander, T., Mayo, A. E., Tlusty, T., &#38; Alon, U. (2015). Supporting information text. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pcbi.1004055.s001\">https://doi.org/10.1371/journal.pcbi.1004055.s001</a>","ieee":"T. Friedlander, A. E. Mayo, T. Tlusty, and U. Alon, “Supporting information text.” Public Library of Science, 2015.","ama":"Friedlander T, Mayo AE, Tlusty T, Alon U. Supporting information text. 2015. doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1004055.s001\">10.1371/journal.pcbi.1004055.s001</a>","chicago":"Friedlander, Tamar, Avraham E. Mayo, Tsvi Tlusty, and Uri Alon. “Supporting Information Text.” Public Library of Science, 2015. <a href=\"https://doi.org/10.1371/journal.pcbi.1004055.s001\">https://doi.org/10.1371/journal.pcbi.1004055.s001</a>.","mla":"Friedlander, Tamar, et al. <i>Supporting Information Text</i>. Public Library of Science, 2015, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1004055.s001\">10.1371/journal.pcbi.1004055.s001</a>.","ista":"Friedlander T, Mayo AE, Tlusty T, Alon U. 2015. Supporting information text, Public Library of Science, <a href=\"https://doi.org/10.1371/journal.pcbi.1004055.s001\">10.1371/journal.pcbi.1004055.s001</a>."}},{"related_material":{"record":[{"id":"5749","relation":"used_in_publication","status":"public"}]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.5061/dryad.cj910"}],"abstract":[{"text":"Parasitism creates selection for resistance mechanisms in host populations and is hypothesized to promote increased host evolvability. However, the influence of these traits on host evolution when parasites are no longer present is unclear. We used experimental evolution and whole-genome sequencing of Escherichia coli to determine the effects of past and present exposure to parasitic viruses (phages) on the spread of mutator alleles, resistance, and bacterial competitive fitness. We found that mutator alleles spread rapidly during adaptation to any of four different phage species, and this pattern was even more pronounced with multiple phages present simultaneously. However, hypermutability did not detectably accelerate adaptation in the absence of phages and recovery of fitness costs associated with resistance. Several lineages evolved phage resistance through elevated mucoidy, and during subsequent evolution in phage-free conditions they rapidly reverted to nonmucoid, phage-susceptible phenotypes. Genome sequencing revealed that this phenotypic reversion was achieved by additional genetic changes rather than by genotypic reversion of the initial resistance mutations. Insertion sequence (IS) elements played a key role in both the acquisition of resistance and adaptation in the absence of parasites; unlike single nucleotide polymorphisms, IS insertions were not more frequent in mutator lineages. Our results provide a genetic explanation for rapid reversion of mucoidy, a phenotype observed in other bacterial species including human pathogens. Moreover, this demonstrates that the types of genetic change underlying adaptation to fitness costs, and consequently the impact of evolvability mechanisms such as increased point-mutation rates, depend critically on the mechanism of resistance.","lang":"eng"}],"status":"public","oa":1,"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","type":"research_data_reference","citation":{"apa":"Wielgoss, S., Bergmiller, T., Bischofberger, A. M., &#38; Hall, A. R. (2015). Data from: Adaptation to parasites and costs of parasite resistance in mutator and non-mutator bacteria. Dryad. <a href=\"https://doi.org/10.5061/dryad.cj910\">https://doi.org/10.5061/dryad.cj910</a>","short":"S. Wielgoss, T. Bergmiller, A.M. Bischofberger, A.R. Hall, (2015).","ieee":"S. Wielgoss, T. Bergmiller, A. M. Bischofberger, and A. R. Hall, “Data from: Adaptation to parasites and costs of parasite resistance in mutator and non-mutator bacteria.” Dryad, 2015.","ama":"Wielgoss S, Bergmiller T, Bischofberger AM, Hall AR. Data from: Adaptation to parasites and costs of parasite resistance in mutator and non-mutator bacteria. 2015. doi:<a href=\"https://doi.org/10.5061/dryad.cj910\">10.5061/dryad.cj910</a>","chicago":"Wielgoss, Sébastien, Tobias Bergmiller, Anna M. Bischofberger, and Alex R. Hall. “Data from: Adaptation to Parasites and Costs of Parasite Resistance in Mutator and Non-Mutator Bacteria.” Dryad, 2015. <a href=\"https://doi.org/10.5061/dryad.cj910\">https://doi.org/10.5061/dryad.cj910</a>.","ista":"Wielgoss S, Bergmiller T, Bischofberger AM, Hall AR. 2015. Data from: Adaptation to parasites and costs of parasite resistance in mutator and non-mutator bacteria, Dryad, <a href=\"https://doi.org/10.5061/dryad.cj910\">10.5061/dryad.cj910</a>.","mla":"Wielgoss, Sébastien, et al. <i>Data from: Adaptation to Parasites and Costs of Parasite Resistance in Mutator and Non-Mutator Bacteria</i>. Dryad, 2015, doi:<a href=\"https://doi.org/10.5061/dryad.cj910\">10.5061/dryad.cj910</a>."},"department":[{"_id":"CaGu"}],"title":"Data from: Adaptation to parasites and costs of parasite resistance in mutator and non-mutator bacteria","date_updated":"2023-09-05T13:46:04Z","month":"12","year":"2015","article_processing_charge":"No","author":[{"full_name":"Wielgoss, Sébastien","last_name":"Wielgoss","first_name":"Sébastien"},{"full_name":"Bergmiller, Tobias","orcid":"0000-0001-5396-4346","last_name":"Bergmiller","id":"2C471CFA-F248-11E8-B48F-1D18A9856A87","first_name":"Tobias"},{"first_name":"Anna M.","last_name":"Bischofberger","full_name":"Bischofberger, Anna M."},{"first_name":"Alex R.","last_name":"Hall","full_name":"Hall, Alex R."}],"date_published":"2015-12-21T00:00:00Z","doi":"10.5061/dryad.cj910","oa_version":"Published Version","publisher":"Dryad","_id":"9719","day":"21","date_created":"2021-07-26T08:44:04Z"},{"_id":"9721","publisher":"Dryad","day":"29","date_created":"2021-07-26T09:38:36Z","doi":"10.5061/dryad.dj2bf","oa_version":"Published Version","year":"2015","article_processing_charge":"No","author":[{"full_name":"Theis, Fabian","last_name":"Theis","first_name":"Fabian"},{"id":"3DC97C8E-F248-11E8-B48F-1D18A9856A87","first_name":"Line V","last_name":"Ugelvig","full_name":"Ugelvig, Line V","orcid":"0000-0003-1832-8883"},{"full_name":"Marr, Carsten","last_name":"Marr","first_name":"Carsten"},{"last_name":"Cremer","full_name":"Cremer, Sylvia","orcid":"0000-0002-2193-3868","first_name":"Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87"}],"date_published":"2015-12-29T00:00:00Z","department":[{"_id":"SyCr"}],"date_updated":"2023-02-23T10:16:22Z","title":"Data from: Opposing effects of allogrooming on disease transmission in ant societies","month":"12","type":"research_data_reference","citation":{"chicago":"Theis, Fabian, Line V Ugelvig, Carsten Marr, and Sylvia Cremer. “Data from: Opposing Effects of Allogrooming on Disease Transmission in Ant Societies.” Dryad, 2015. <a href=\"https://doi.org/10.5061/dryad.dj2bf\">https://doi.org/10.5061/dryad.dj2bf</a>.","ama":"Theis F, Ugelvig LV, Marr C, Cremer S. Data from: Opposing effects of allogrooming on disease transmission in ant societies. 2015. doi:<a href=\"https://doi.org/10.5061/dryad.dj2bf\">10.5061/dryad.dj2bf</a>","mla":"Theis, Fabian, et al. <i>Data from: Opposing Effects of Allogrooming on Disease Transmission in Ant Societies</i>. Dryad, 2015, doi:<a href=\"https://doi.org/10.5061/dryad.dj2bf\">10.5061/dryad.dj2bf</a>.","ista":"Theis F, Ugelvig LV, Marr C, Cremer S. 2015. Data from: Opposing effects of allogrooming on disease transmission in ant societies, Dryad, <a href=\"https://doi.org/10.5061/dryad.dj2bf\">10.5061/dryad.dj2bf</a>.","apa":"Theis, F., Ugelvig, L. V., Marr, C., &#38; Cremer, S. (2015). Data from: Opposing effects of allogrooming on disease transmission in ant societies. Dryad. <a href=\"https://doi.org/10.5061/dryad.dj2bf\">https://doi.org/10.5061/dryad.dj2bf</a>","short":"F. Theis, L.V. Ugelvig, C. Marr, S. Cremer, (2015).","ieee":"F. Theis, L. V. Ugelvig, C. Marr, and S. Cremer, “Data from: Opposing effects of allogrooming on disease transmission in ant societies.” Dryad, 2015."},"oa":1,"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","main_file_link":[{"open_access":"1","url":"https://doi.org/10.5061/dryad.dj2bf"}],"related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"1830"}]},"abstract":[{"text":"To prevent epidemics, insect societies have evolved collective disease defences that are highly effective at curing exposed individuals and limiting disease transmission to healthy group members. Grooming is an important sanitary behaviour—either performed towards oneself (self-grooming) or towards others (allogrooming)—to remove infectious agents from the body surface of exposed individuals, but at the risk of disease contraction by the groomer. We use garden ants (Lasius neglectus) and the fungal pathogen Metarhizium as a model system to study how pathogen presence affects self-grooming and allogrooming between exposed and healthy individuals. We develop an epidemiological SIS model to explore how experimentally observed grooming patterns affect disease spread within the colony, thereby providing a direct link between the expression and direction of sanitary behaviours, and their effects on colony-level epidemiology. We find that fungus-exposed ants increase self-grooming, while simultaneously decreasing allogrooming. This behavioural modulation seems universally adaptive and is predicted to contain disease spread in a great variety of host–pathogen systems. In contrast, allogrooming directed towards pathogen-exposed individuals might both increase and decrease disease risk. Our model reveals that the effect of allogrooming depends on the balance between pathogen infectiousness and efficiency of social host defences, which are likely to vary across host–pathogen systems.","lang":"eng"}],"status":"public"},{"date_published":"2015-06-01T00:00:00Z","author":[{"id":"3C0C7BC6-F248-11E8-B48F-1D18A9856A87","first_name":"Olga","full_name":"Symonova, Olga","last_name":"Symonova"},{"last_name":"Topp","full_name":"Topp, Christopher","first_name":"Christopher"},{"last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"}],"article_processing_charge":"No","year":"2015","date_updated":"2023-02-23T10:14:42Z","title":"Root traits computed by DynamicRoots for the maize root shown in fig 2","department":[{"_id":"MaJö"},{"_id":"HeEd"}],"month":"06","publisher":"Public Library of Science","_id":"9737","date_created":"2021-07-28T06:20:13Z","day":"01","doi":"10.1371/journal.pone.0127657.s001","oa_version":"Published Version","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","related_material":{"record":[{"id":"1793","status":"public","relation":"used_in_publication"}]},"status":"public","citation":{"ama":"Symonova O, Topp C, Edelsbrunner H. Root traits computed by DynamicRoots for the maize root shown in fig 2. 2015. doi:<a href=\"https://doi.org/10.1371/journal.pone.0127657.s001\">10.1371/journal.pone.0127657.s001</a>","chicago":"Symonova, Olga, Christopher Topp, and Herbert Edelsbrunner. “Root Traits Computed by DynamicRoots for the Maize Root Shown in Fig 2.” Public Library of Science, 2015. <a href=\"https://doi.org/10.1371/journal.pone.0127657.s001\">https://doi.org/10.1371/journal.pone.0127657.s001</a>.","mla":"Symonova, Olga, et al. <i>Root Traits Computed by DynamicRoots for the Maize Root Shown in Fig 2</i>. Public Library of Science, 2015, doi:<a href=\"https://doi.org/10.1371/journal.pone.0127657.s001\">10.1371/journal.pone.0127657.s001</a>.","ista":"Symonova O, Topp C, Edelsbrunner H. 2015. Root traits computed by DynamicRoots for the maize root shown in fig 2, Public Library of Science, <a href=\"https://doi.org/10.1371/journal.pone.0127657.s001\">10.1371/journal.pone.0127657.s001</a>.","short":"O. Symonova, C. Topp, H. Edelsbrunner, (2015).","apa":"Symonova, O., Topp, C., &#38; Edelsbrunner, H. (2015). Root traits computed by DynamicRoots for the maize root shown in fig 2. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pone.0127657.s001\">https://doi.org/10.1371/journal.pone.0127657.s001</a>","ieee":"O. Symonova, C. Topp, and H. Edelsbrunner, “Root traits computed by DynamicRoots for the maize root shown in fig 2.” Public Library of Science, 2015."},"type":"research_data_reference"},{"oa":1,"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","status":"public","related_material":{"record":[{"id":"2161","relation":"used_in_publication","status":"public"}]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.5061/dryad.7kc79"}],"abstract":[{"lang":"eng","text":"Repeated pathogen exposure is a common threat in colonies of social insects, posing selection pressures on colony members to respond with improved disease-defense performance. We here tested whether experience gained by repeated tending of low-level fungus-exposed (Metarhizium robertsii) larvae may alter the performance of sanitary brood care in the clonal ant, Platythyrea punctata. We trained ants individually over nine consecutive trials to either sham-treated or fungus-exposed larvae. We then compared the larval grooming behavior of naive and trained ants and measured how effectively they removed infectious fungal conidiospores from the fungus-exposed larvae. We found that the ants changed the duration of larval grooming in response to both, larval treatment and their level of experience: (1) sham-treated larvae received longer grooming than the fungus-exposed larvae and (2) trained ants performed less self-grooming but longer larval grooming than naive ants, which was true for both, ants trained to fungus-exposed and also to sham-treated larvae. Ants that groomed the fungus-exposed larvae for longer periods removed a higher number of fungal conidiospores from the surface of the fungus-exposed larvae. As experienced ants performed longer larval grooming, they were more effective in fungal removal, thus making them better caretakers under pathogen attack of the colony. By studying this clonal ant, we can thus conclude that even in the absence of genetic variation between colony members, differences in experience levels of brood care may affect performance of sanitary brood care in social insects."}],"type":"research_data_reference","citation":{"mla":"Westhus, Claudia, et al. <i>Data from: Increased Grooming after Repeated Brood Care Provides Sanitary Benefits in a Clonal Ant</i>. Dryad, 2015, doi:<a href=\"https://doi.org/10.5061/dryad.7kc79\">10.5061/dryad.7kc79</a>.","ista":"Westhus C, Ugelvig LV, Tourdot E, Heinze J, Doums C, Cremer S. 2015. Data from: Increased grooming after repeated brood care provides sanitary benefits in a clonal ant, Dryad, <a href=\"https://doi.org/10.5061/dryad.7kc79\">10.5061/dryad.7kc79</a>.","chicago":"Westhus, Claudia, Line V Ugelvig, Edouard Tourdot, Jürgen Heinze, Claudie Doums, and Sylvia Cremer. “Data from: Increased Grooming after Repeated Brood Care Provides Sanitary Benefits in a Clonal Ant.” Dryad, 2015. <a href=\"https://doi.org/10.5061/dryad.7kc79\">https://doi.org/10.5061/dryad.7kc79</a>.","ama":"Westhus C, Ugelvig LV, Tourdot E, Heinze J, Doums C, Cremer S. Data from: Increased grooming after repeated brood care provides sanitary benefits in a clonal ant. 2015. doi:<a href=\"https://doi.org/10.5061/dryad.7kc79\">10.5061/dryad.7kc79</a>","ieee":"C. Westhus, L. V. Ugelvig, E. Tourdot, J. Heinze, C. Doums, and S. Cremer, “Data from: Increased grooming after repeated brood care provides sanitary benefits in a clonal ant.” Dryad, 2015.","apa":"Westhus, C., Ugelvig, L. V., Tourdot, E., Heinze, J., Doums, C., &#38; Cremer, S. (2015). Data from: Increased grooming after repeated brood care provides sanitary benefits in a clonal ant. Dryad. <a href=\"https://doi.org/10.5061/dryad.7kc79\">https://doi.org/10.5061/dryad.7kc79</a>","short":"C. Westhus, L.V. Ugelvig, E. Tourdot, J. Heinze, C. Doums, S. Cremer, (2015)."},"article_processing_charge":"No","year":"2015","date_published":"2015-07-09T00:00:00Z","author":[{"first_name":"Claudia","last_name":"Westhus","full_name":"Westhus, Claudia"},{"orcid":"0000-0003-1832-8883","full_name":"Ugelvig, Line V","last_name":"Ugelvig","first_name":"Line V","id":"3DC97C8E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Tourdot, Edouard","last_name":"Tourdot","first_name":"Edouard"},{"last_name":"Heinze","full_name":"Heinze, Jürgen","first_name":"Jürgen"},{"first_name":"Claudie","full_name":"Doums, Claudie","last_name":"Doums"},{"full_name":"Cremer, Sylvia","orcid":"0000-0002-2193-3868","last_name":"Cremer","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","first_name":"Sylvia"}],"month":"07","department":[{"_id":"SyCr"}],"title":"Data from: Increased grooming after repeated brood care provides sanitary benefits in a clonal ant","date_updated":"2023-02-23T10:30:52Z","day":"09","date_created":"2021-07-28T08:52:53Z","_id":"9742","publisher":"Dryad","oa_version":"Published Version","doi":"10.5061/dryad.7kc79"},{"article_processing_charge":"No","year":"2015","author":[{"first_name":"Guillaume","id":"424D78A0-F248-11E8-B48F-1D18A9856A87","full_name":"Chevereau, Guillaume","last_name":"Chevereau"},{"orcid":"0000-0002-2519-8004","full_name":"Lukacisinova, Marta","last_name":"Lukacisinova","id":"4342E402-F248-11E8-B48F-1D18A9856A87","first_name":"Marta"},{"last_name":"Batur","full_name":"Batur, Tugce","first_name":"Tugce"},{"full_name":"Guvenek, Aysegul","last_name":"Guvenek","first_name":"Aysegul"},{"first_name":"Dilay Hazal","full_name":"Ayhan, Dilay Hazal","last_name":"Ayhan"},{"full_name":"Toprak, Erdal","last_name":"Toprak","first_name":"Erdal"},{"full_name":"Bollenbach, Mark Tobias","orcid":"0000-0003-4398-476X","last_name":"Bollenbach","first_name":"Mark Tobias","id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87"}],"date_published":"2015-11-18T00:00:00Z","month":"11","department":[{"_id":"ToBo"}],"title":"Gene ontology enrichment analysis for the most sensitive gene deletion strains for all drugs","date_updated":"2023-02-23T10:07:02Z","day":"18","date_created":"2021-08-03T07:05:16Z","publisher":"Public Library of Science","_id":"9765","oa_version":"Published Version","doi":"10.1371/journal.pbio.1002299.s008","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","status":"public","related_material":{"record":[{"id":"1619","status":"public","relation":"used_in_publication"}]},"type":"research_data_reference","citation":{"apa":"Chevereau, G., Lukacisinova, M., Batur, T., Guvenek, A., Ayhan, D. H., Toprak, E., &#38; Bollenbach, M. T. (2015). Gene ontology enrichment analysis for the most sensitive gene deletion strains for all drugs. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pbio.1002299.s008\">https://doi.org/10.1371/journal.pbio.1002299.s008</a>","short":"G. Chevereau, M. Lukacisinova, T. Batur, A. Guvenek, D.H. Ayhan, E. Toprak, M.T. Bollenbach, (2015).","ieee":"G. Chevereau <i>et al.</i>, “Gene ontology enrichment analysis for the most sensitive gene deletion strains for all drugs.” Public Library of Science, 2015.","ama":"Chevereau G, Lukacisinova M, Batur T, et al. Gene ontology enrichment analysis for the most sensitive gene deletion strains for all drugs. 2015. doi:<a href=\"https://doi.org/10.1371/journal.pbio.1002299.s008\">10.1371/journal.pbio.1002299.s008</a>","chicago":"Chevereau, Guillaume, Marta Lukacisinova, Tugce Batur, Aysegul Guvenek, Dilay Hazal Ayhan, Erdal Toprak, and Mark Tobias Bollenbach. “Gene Ontology Enrichment Analysis for the Most Sensitive Gene Deletion Strains for All Drugs.” Public Library of Science, 2015. <a href=\"https://doi.org/10.1371/journal.pbio.1002299.s008\">https://doi.org/10.1371/journal.pbio.1002299.s008</a>.","ista":"Chevereau G, Lukacisinova M, Batur T, Guvenek A, Ayhan DH, Toprak E, Bollenbach MT. 2015. Gene ontology enrichment analysis for the most sensitive gene deletion strains for all drugs, Public Library of Science, <a href=\"https://doi.org/10.1371/journal.pbio.1002299.s008\">10.1371/journal.pbio.1002299.s008</a>.","mla":"Chevereau, Guillaume, et al. <i>Gene Ontology Enrichment Analysis for the Most Sensitive Gene Deletion Strains for All Drugs</i>. Public Library of Science, 2015, doi:<a href=\"https://doi.org/10.1371/journal.pbio.1002299.s008\">10.1371/journal.pbio.1002299.s008</a>."}},{"status":"public","related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"1809"}]},"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","type":"research_data_reference","citation":{"chicago":"Trubenova, Barbora, Sebastian Novak, and Reinmar Hager. “Description of the Agent Based Simulations.” Public Library of Science, 2015. <a href=\"https://doi.org/10.1371/journal.pone.0126907.s003\">https://doi.org/10.1371/journal.pone.0126907.s003</a>.","ama":"Trubenova B, Novak S, Hager R. Description of the agent based simulations. 2015. doi:<a href=\"https://doi.org/10.1371/journal.pone.0126907.s003\">10.1371/journal.pone.0126907.s003</a>","mla":"Trubenova, Barbora, et al. <i>Description of the Agent Based Simulations</i>. Public Library of Science, 2015, doi:<a href=\"https://doi.org/10.1371/journal.pone.0126907.s003\">10.1371/journal.pone.0126907.s003</a>.","ista":"Trubenova B, Novak S, Hager R. 2015. Description of the agent based simulations, Public Library of Science, <a href=\"https://doi.org/10.1371/journal.pone.0126907.s003\">10.1371/journal.pone.0126907.s003</a>.","apa":"Trubenova, B., Novak, S., &#38; Hager, R. (2015). Description of the agent based simulations. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pone.0126907.s003\">https://doi.org/10.1371/journal.pone.0126907.s003</a>","short":"B. Trubenova, S. Novak, R. Hager, (2015).","ieee":"B. Trubenova, S. Novak, and R. Hager, “Description of the agent based simulations.” Public Library of Science, 2015."},"month":"05","title":"Description of the agent based simulations","date_updated":"2023-02-23T10:15:25Z","department":[{"_id":"NiBa"}],"date_published":"2015-05-18T00:00:00Z","author":[{"id":"42302D54-F248-11E8-B48F-1D18A9856A87","first_name":"Barbora","last_name":"Trubenova","full_name":"Trubenova, Barbora","orcid":"0000-0002-6873-2967"},{"last_name":"Novak","full_name":"Novak, Sebastian","id":"461468AE-F248-11E8-B48F-1D18A9856A87","first_name":"Sebastian"},{"full_name":"Hager, Reinmar","last_name":"Hager","first_name":"Reinmar"}],"article_processing_charge":"No","year":"2015","oa_version":"Published Version","doi":"10.1371/journal.pone.0126907.s003","date_created":"2021-08-05T12:55:20Z","day":"18","publisher":"Public Library of Science","_id":"9772"}]