[{"isi":1,"publication":"Naturwissenschaften","publisher":"Springer","page":"627 - 636","acknowledgement":"We like to thank the editor and three anonymous reviewers for their time and constructive criticism and Inon Scharf, Volker Witte and Andreas Modlmeier for helpful comments on earlier versions of the manuscript. The first and second authors appear in alphabetical order and contributed equally to this paper.","status":"public","date_created":"2018-12-11T12:01:34Z","day":"01","type":"journal_article","date_updated":"2025-09-30T07:56:20Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","abstract":[{"text":"Reproductive division of labour is a characteristic trait of social insects. The dominant reproductive individual, often the queen, uses chemical communication and/or behaviour to maintain her social status. Queens of many social insects communicate their fertility status via cuticle-bound substances. As these substances usually possess a low volatility, their range in queen–worker communication is potentially limited. Here, we investigate the range and impact of behavioural and chemical queen signals on workers of the ant Temnothorax longispinosus. We compared the behaviour and ovary development of workers subjected to three different treatments: workers with direct chemical and physical contact to the queen, those solely under the influence of volatile queen substances and those entirely separated from the queen. In addition to short-ranged queen signals preventing ovary development in workers, we discovered a novel secondary pathway influencing worker behaviour. Workers with no physical contact to the queen, but exposed to volatile substances, started to develop their ovaries, but did not change their behaviour compared to workers in direct contact to the queen. In contrast, workers in queen-separated groups showed both increased ovary development and aggressive dominance interactions. We conclude that T. longispinosus queens influence worker ovary development and behaviour via two independent signals, both ensuring social harmony within the colony.","lang":"eng"}],"article_processing_charge":"No","scopus_import":"1","language":[{"iso":"eng"}],"volume":99,"external_id":{"isi":["000307245100004"]},"doi":"10.1007/s00114-012-0943-z","department":[{"_id":"SyCr"}],"publist_id":"3565","quality_controlled":"1","intvolume":"        99","_id":"3132","title":"Two pathways ensuring social harmony","oa_version":"None","publication_status":"published","year":"2012","date_published":"2012-08-01T00:00:00Z","author":[{"first_name":"Matthias","last_name":"Konrad","full_name":"Konrad, Matthias","id":"46528076-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Pamminger","first_name":"Tobias","full_name":"Pamminger, Tobias"},{"full_name":"Foitzik, Susanne","last_name":"Foitzik","first_name":"Susanne"}],"issue":"8","citation":{"apa":"Konrad, M., Pamminger, T., &#38; Foitzik, S. (2012). Two pathways ensuring social harmony. <i>Naturwissenschaften</i>. Springer. <a href=\"https://doi.org/10.1007/s00114-012-0943-z\">https://doi.org/10.1007/s00114-012-0943-z</a>","ieee":"M. Konrad, T. Pamminger, and S. Foitzik, “Two pathways ensuring social harmony,” <i>Naturwissenschaften</i>, vol. 99, no. 8. Springer, pp. 627–636, 2012.","mla":"Konrad, Matthias, et al. “Two Pathways Ensuring Social Harmony.” <i>Naturwissenschaften</i>, vol. 99, no. 8, Springer, 2012, pp. 627–36, doi:<a href=\"https://doi.org/10.1007/s00114-012-0943-z\">10.1007/s00114-012-0943-z</a>.","ama":"Konrad M, Pamminger T, Foitzik S. Two pathways ensuring social harmony. <i>Naturwissenschaften</i>. 2012;99(8):627-636. doi:<a href=\"https://doi.org/10.1007/s00114-012-0943-z\">10.1007/s00114-012-0943-z</a>","chicago":"Konrad, Matthias, Tobias Pamminger, and Susanne Foitzik. “Two Pathways Ensuring Social Harmony.” <i>Naturwissenschaften</i>. Springer, 2012. <a href=\"https://doi.org/10.1007/s00114-012-0943-z\">https://doi.org/10.1007/s00114-012-0943-z</a>.","short":"M. Konrad, T. Pamminger, S. Foitzik, Naturwissenschaften 99 (2012) 627–636.","ista":"Konrad M, Pamminger T, Foitzik S. 2012. Two pathways ensuring social harmony. Naturwissenschaften. 99(8), 627–636."},"month":"08"},{"external_id":{"arxiv":["1109.5052"]},"doi":"10.1145/2261250.2261287","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"This note contributes to the point calculus of persistent homology by extending Alexander duality from spaces to real-valued functions. Given a perfect Morse function f: S n+1 →[0, 1 and a decomposition S n+1 = U ∪ V into two (n + 1)-manifolds with common boundary M, we prove elementary relationships between the persistence diagrams of f restricted to U, to V, and to M. ","lang":"eng"}],"article_processing_charge":"No","scopus_import":"1","language":[{"iso":"eng"}],"status":"public","date_created":"2018-12-11T12:01:35Z","day":"20","type":"conference","arxiv":1,"date_updated":"2025-06-11T08:10:04Z","publication":"Proceedings of the twenty-eighth annual symposium on Computational geometry ","publisher":"ACM","page":"249 - 258","acknowledgement":"his research is partially supported by the National Science Foundation (NSF) under grant DBI-0820624, the European Science Foundation under the Research Networking Programme, and the Russian Government Project 11.G34.31.0053.\r\nThe authors thank an anonymous referee for suggesting the simplified proof of the Contravariant PE Theorem given in this paper. They also thank Frederick Cohen, Yuriy Mileyko and Amit Patel for helpful discussions.","author":[{"full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-8030-9299","id":"36E4574A-F248-11E8-B48F-1D18A9856A87","first_name":"Michael","last_name":"Kerber","full_name":"Kerber, Michael"}],"citation":{"chicago":"Edelsbrunner, Herbert, and Michael Kerber. “Alexander Duality for Functions: The Persistent Behavior of Land and Water and Shore.” In <i>Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry </i>, 249–58. ACM, 2012. <a href=\"https://doi.org/10.1145/2261250.2261287\">https://doi.org/10.1145/2261250.2261287</a>.","short":"H. Edelsbrunner, M. Kerber, in:, Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry , ACM, 2012, pp. 249–258.","ista":"Edelsbrunner H, Kerber M. 2012. Alexander duality for functions: The persistent behavior of land and water and shore. Proceedings of the twenty-eighth annual symposium on Computational geometry . SCG: Symposium on Computational Geometry, 249–258.","ama":"Edelsbrunner H, Kerber M. Alexander duality for functions: The persistent behavior of land and water and shore. In: <i>Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry </i>. ACM; 2012:249-258. doi:<a href=\"https://doi.org/10.1145/2261250.2261287\">10.1145/2261250.2261287</a>","ieee":"H. Edelsbrunner and M. Kerber, “Alexander duality for functions: The persistent behavior of land and water and shore,” in <i>Proceedings of the twenty-eighth annual symposium on Computational geometry </i>, Chapel Hill, NC, USA, 2012, pp. 249–258.","apa":"Edelsbrunner, H., &#38; Kerber, M. (2012). Alexander duality for functions: The persistent behavior of land and water and shore. In <i>Proceedings of the twenty-eighth annual symposium on Computational geometry </i> (pp. 249–258). Chapel Hill, NC, USA: ACM. <a href=\"https://doi.org/10.1145/2261250.2261287\">https://doi.org/10.1145/2261250.2261287</a>","mla":"Edelsbrunner, Herbert, and Michael Kerber. “Alexander Duality for Functions: The Persistent Behavior of Land and Water and Shore.” <i>Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry </i>, ACM, 2012, pp. 249–58, doi:<a href=\"https://doi.org/10.1145/2261250.2261287\">10.1145/2261250.2261287</a>."},"month":"06","publication_status":"published","oa_version":"Preprint","year":"2012","date_published":"2012-06-20T00:00:00Z","corr_author":"1","quality_controlled":"1","_id":"3133","title":"Alexander duality for functions: The persistent behavior of land and water and shore","oa":1,"department":[{"_id":"HeEd"}],"publist_id":"3564","conference":{"name":"SCG: Symposium on Computational Geometry","end_date":"2012-06-20","start_date":"2012-06-17","location":"Chapel Hill, NC, USA"},"main_file_link":[{"url":"http://arxiv.org/abs/1109.5052","open_access":"1"}]},{"language":[{"iso":"eng"}],"scopus_import":1,"abstract":[{"lang":"eng","text":"It has been an open question whether the sum of finitely many isotropic Gaussian kernels in n ≥ 2 dimensions can have more modes than kernels, until in 2003 Carreira-Perpiñán and Williams exhibited n +1 isotropic Gaussian kernels in ℝ n with n + 2 modes. We give a detailed analysis of this example, showing that it has exponentially many critical points and that the resilience of the extra mode grows like √n. In addition, we exhibit finite configurations of isotropic Gaussian kernels with superlinearly many modes. "}],"date_published":"2012-06-20T00:00:00Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publication_status":"published","oa_version":"None","year":"2012","citation":{"mla":"Edelsbrunner, Herbert, et al. “Add Isotropic Gaussian Kernels at Own Risk: More and More Resilient Modes in Higher Dimensions.” <i>Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry </i>, ACM, 2012, pp. 91–100, doi:<a href=\"https://doi.org/10.1145/2261250.2261265\">10.1145/2261250.2261265</a>.","ieee":"H. Edelsbrunner, B. Fasy, and G. Rote, “Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions,” in <i>Proceedings of the twenty-eighth annual symposium on Computational geometry </i>, Chapel Hill, NC, USA, 2012, pp. 91–100.","apa":"Edelsbrunner, H., Fasy, B., &#38; Rote, G. (2012). Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions. In <i>Proceedings of the twenty-eighth annual symposium on Computational geometry </i> (pp. 91–100). Chapel Hill, NC, USA: ACM. <a href=\"https://doi.org/10.1145/2261250.2261265\">https://doi.org/10.1145/2261250.2261265</a>","ama":"Edelsbrunner H, Fasy B, Rote G. Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions. In: <i>Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry </i>. ACM; 2012:91-100. doi:<a href=\"https://doi.org/10.1145/2261250.2261265\">10.1145/2261250.2261265</a>","ista":"Edelsbrunner H, Fasy B, Rote G. 2012. Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions. Proceedings of the twenty-eighth annual symposium on Computational geometry . SCG: Symposium on Computational Geometry, 91–100.","short":"H. Edelsbrunner, B. Fasy, G. Rote, in:, Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry , ACM, 2012, pp. 91–100.","chicago":"Edelsbrunner, Herbert, Brittany Fasy, and Günter Rote. “Add Isotropic Gaussian Kernels at Own Risk: More and More Resilient Modes in Higher Dimensions.” In <i>Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry </i>, 91–100. ACM, 2012. <a href=\"https://doi.org/10.1145/2261250.2261265\">https://doi.org/10.1145/2261250.2261265</a>."},"month":"06","related_material":{"record":[{"relation":"later_version","status":"public","id":"2815"}]},"doi":"10.1145/2261250.2261265","author":[{"first_name":"Herbert","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833"},{"full_name":"Fasy, Brittany","last_name":"Fasy","first_name":"Brittany"},{"last_name":"Rote","first_name":"Günter","full_name":"Rote, Günter"}],"acknowledgement":"This research is partially supported by the National Science Foun- dation (NSF) under grant DBI-0820624, by the European Science Foundation under the Research Networking Programme, and the Russian Government Project 11.G34.31.0053.","page":"91 - 100","department":[{"_id":"HeEd"}],"conference":{"name":"SCG: Symposium on Computational Geometry","start_date":"2012-06-17","end_date":"2012-06-20","location":"Chapel Hill, NC, USA"},"publist_id":"3563","publication":"Proceedings of the twenty-eighth annual symposium on Computational geometry ","publisher":"ACM","_id":"3134","date_updated":"2025-09-29T14:02:00Z","title":"Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions","day":"20","type":"conference","date_created":"2018-12-11T12:01:35Z","status":"public","quality_controlled":"1"},{"alternative_title":["LNCS"],"quality_controlled":"1","intvolume":"      7358","title":"Efficient controller synthesis for consumption games with multiple resource types","_id":"3135","oa":1,"publist_id":"3562","conference":{"start_date":"2012-07-07","end_date":"2012-07-13","name":"CAV: Computer Aided Verification","location":"Berkeley, CA, USA"},"department":[{"_id":"KrCh"}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1202.0796"}],"author":[{"full_name":"Brázdil, Brázdil","first_name":"Brázdil","last_name":"Brázdil"},{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kučera, Antonín","first_name":"Antonín","last_name":"Kučera"},{"id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","full_name":"Novotny, Petr","last_name":"Novotny","first_name":"Petr"}],"month":"07","citation":{"ama":"Brázdil B, Chatterjee K, Kučera A, Novotný P. Efficient controller synthesis for consumption games with multiple resource types. In: Vol 7358. Springer; 2012:23-38. doi:<a href=\"https://doi.org/10.1007/978-3-642-31424-7_8\">10.1007/978-3-642-31424-7_8</a>","mla":"Brázdil, Brázdil, et al. <i>Efficient Controller Synthesis for Consumption Games with Multiple Resource Types</i>. Vol. 7358, Springer, 2012, pp. 23–38, doi:<a href=\"https://doi.org/10.1007/978-3-642-31424-7_8\">10.1007/978-3-642-31424-7_8</a>.","apa":"Brázdil, B., Chatterjee, K., Kučera, A., &#38; Novotný, P. (2012). Efficient controller synthesis for consumption games with multiple resource types (Vol. 7358, pp. 23–38). Presented at the CAV: Computer Aided Verification, Berkeley, CA, USA: Springer. <a href=\"https://doi.org/10.1007/978-3-642-31424-7_8\">https://doi.org/10.1007/978-3-642-31424-7_8</a>","ieee":"B. Brázdil, K. Chatterjee, A. Kučera, and P. Novotný, “Efficient controller synthesis for consumption games with multiple resource types,” presented at the CAV: Computer Aided Verification, Berkeley, CA, USA, 2012, vol. 7358, pp. 23–38.","ista":"Brázdil B, Chatterjee K, Kučera A, Novotný P. 2012. Efficient controller synthesis for consumption games with multiple resource types. CAV: Computer Aided Verification, LNCS, vol. 7358, 23–38.","short":"B. Brázdil, K. Chatterjee, A. Kučera, P. Novotný, in:, Springer, 2012, pp. 23–38.","chicago":"Brázdil, Brázdil, Krishnendu Chatterjee, Antonín Kučera, and Petr Novotný. “Efficient Controller Synthesis for Consumption Games with Multiple Resource Types,” 7358:23–38. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-31424-7_8\">https://doi.org/10.1007/978-3-642-31424-7_8</a>."},"year":"2012","publication_status":"published","oa_version":"Preprint","date_published":"2012-07-01T00:00:00Z","date_created":"2018-12-11T12:01:35Z","status":"public","type":"conference","day":"01","date_updated":"2025-06-11T08:10:20Z","arxiv":1,"ec_funded":1,"publisher":"Springer","page":"23 - 38","acknowledgement":"Tomas Brazdil, Antonin Kucera, and Petr Novotny are supported by the Czech Science Foundation, grant No. P202/10/1469. Krishnendu Chatterjee is supported by the FWF (Austrian Science Fund) NFN Grant No S11407-N23 (RiSE) and ERC Start grant (279307: Graph Games).","volume":7358,"doi":"10.1007/978-3-642-31424-7_8","external_id":{"arxiv":["1202.0796"]},"project":[{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","abstract":[{"text":"We introduce consumption games, a model for discrete interactive system with multiple resources that are consumed or reloaded independently. More precisely, a consumption game is a finite-state graph where each transition is labeled by a vector of resource updates, where every update is a non-positive number or ω. The ω updates model the reloading of a given resource. Each vertex belongs either to player □ or player ◇, where the aim of player □ is to play so that the resources are never exhausted. We consider several natural algorithmic problems about consumption games, and show that although these problems are computationally hard in general, they are solvable in polynomial time for every fixed number of resource types (i.e., the dimension of the update vectors) and bounded resource updates. ","lang":"eng"}],"scopus_import":"1","language":[{"iso":"eng"}]},{"publist_id":"3561","conference":{"name":"CAV: Computer Aided Verification","end_date":"2012-07-13","start_date":"2012-07-07","location":"Berkeley, CA, USA"},"department":[{"_id":"CaGu"},{"_id":"ToHe"}],"alternative_title":["LNCS"],"quality_controlled":"1","title":"Delayed continuous time Markov chains for genetic regulatory circuits","_id":"3136","date_published":"2012-07-01T00:00:00Z","year":"2012","oa_version":"None","publication_status":"published","corr_author":"1","author":[{"id":"47F8433E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6220-2052","last_name":"Guet","first_name":"Calin C","full_name":"Guet, Calin C"},{"id":"335E5684-F248-11E8-B48F-1D18A9856A87","full_name":"Gupta, Ashutosh","last_name":"Gupta","first_name":"Ashutosh"},{"first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"last_name":"Mateescu","first_name":"Maria","full_name":"Mateescu, Maria","id":"3B43276C-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Ali","last_name":"Sezgin","full_name":"Sezgin, Ali","id":"4C7638DA-F248-11E8-B48F-1D18A9856A87"}],"month":"07","citation":{"short":"C.C. Guet, A. Gupta, T.A. Henzinger, M. Mateescu, A. Sezgin, in:, Springer, 2012, pp. 294–309.","chicago":"Guet, Calin C, Ashutosh Gupta, Thomas A Henzinger, Maria Mateescu, and Ali Sezgin. “Delayed Continuous Time Markov Chains for Genetic Regulatory Circuits,” 7358:294–309. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-31424-7_24\">https://doi.org/10.1007/978-3-642-31424-7_24</a>.","ista":"Guet CC, Gupta A, Henzinger TA, Mateescu M, Sezgin A. 2012. Delayed continuous time Markov chains for genetic regulatory circuits. CAV: Computer Aided Verification, LNCS, vol. 7358, 294–309.","ama":"Guet CC, Gupta A, Henzinger TA, Mateescu M, Sezgin A. Delayed continuous time Markov chains for genetic regulatory circuits. In: Vol 7358. Springer; 2012:294-309. doi:<a href=\"https://doi.org/10.1007/978-3-642-31424-7_24\">10.1007/978-3-642-31424-7_24</a>","apa":"Guet, C. C., Gupta, A., Henzinger, T. A., Mateescu, M., &#38; Sezgin, A. (2012). Delayed continuous time Markov chains for genetic regulatory circuits (Vol. 7358, pp. 294–309). Presented at the CAV: Computer Aided Verification, Berkeley, CA, USA: Springer. <a href=\"https://doi.org/10.1007/978-3-642-31424-7_24\">https://doi.org/10.1007/978-3-642-31424-7_24</a>","ieee":"C. C. Guet, A. Gupta, T. A. Henzinger, M. Mateescu, and A. Sezgin, “Delayed continuous time Markov chains for genetic regulatory circuits,” presented at the CAV: Computer Aided Verification, Berkeley, CA, USA, 2012, vol. 7358, pp. 294–309.","mla":"Guet, Calin C., et al. <i>Delayed Continuous Time Markov Chains for Genetic Regulatory Circuits</i>. Vol. 7358, Springer, 2012, pp. 294–309, doi:<a href=\"https://doi.org/10.1007/978-3-642-31424-7_24\">10.1007/978-3-642-31424-7_24</a>."},"publisher":"Springer","ec_funded":1,"acknowledgement":"This work was supported by the ERC Advanced Investigator grant on Quantitative Reactive Modeling (QUAREM) and by the Swiss National Science Foundation.","page":"294 - 309","status":"public","date_created":"2018-12-11T12:01:36Z","date_updated":"2024-10-09T20:54:47Z","type":"conference","day":"01","abstract":[{"text":"Continuous-time Markov chains (CTMC) with their rich theory and efficient simulation algorithms have been successfully used in modeling stochastic processes in diverse areas such as computer science, physics, and biology. However, systems that comprise non-instantaneous events cannot be accurately and efficiently modeled with CTMCs. In this paper we define delayed CTMCs, an extension of CTMCs that allows for the specification of a lower bound on the time interval between an event's initiation and its completion, and we propose an algorithm for the computation of their behavior. Our algorithm effectively decomposes the computation into two stages: a pure CTMC governs event initiations while a deterministic process guarantees lower bounds on event completion times. Furthermore, from the nature of delayed CTMCs, we obtain a parallelized version of our algorithm. We use our formalism to model genetic regulatory circuits (biological systems where delayed events are common) and report on the results of our numerical algorithm as run on a cluster. We compare performance and accuracy of our results with results obtained by using pure CTMCs. © 2012 Springer-Verlag.","lang":"eng"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"scopus_import":1,"volume":"7358 ","project":[{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989"}],"doi":"10.1007/978-3-642-31424-7_24"},{"month":"06","citation":{"apa":"Delahaye, B., Fahrenberg, U., Henzinger, T. A., Legay, A., &#38; Nickovic, D. (2012). Synchronous interface theories and time triggered scheduling (Vol. 7273, pp. 203–218). Presented at the FORTE: Formal Techniques for Networked and Distributed Systems &#38; FMOODS: Formal Methods for Open Object-Based Distributed Systems , Stockholm, Sweden: Springer. <a href=\"https://doi.org/10.1007/978-3-642-30793-5_13\">https://doi.org/10.1007/978-3-642-30793-5_13</a>","ieee":"B. Delahaye, U. Fahrenberg, T. A. Henzinger, A. Legay, and D. Nickovic, “Synchronous interface theories and time triggered scheduling,” presented at the FORTE: Formal Techniques for Networked and Distributed Systems &#38; FMOODS: Formal Methods for Open Object-Based Distributed Systems , Stockholm, Sweden, 2012, vol. 7273, pp. 203–218.","mla":"Delahaye, Benoît, et al. <i>Synchronous Interface Theories and Time Triggered Scheduling</i>. Vol. 7273, Springer, 2012, pp. 203–18, doi:<a href=\"https://doi.org/10.1007/978-3-642-30793-5_13\">10.1007/978-3-642-30793-5_13</a>.","ama":"Delahaye B, Fahrenberg U, Henzinger TA, Legay A, Nickovic D. Synchronous interface theories and time triggered scheduling. In: Vol 7273. Springer; 2012:203-218. doi:<a href=\"https://doi.org/10.1007/978-3-642-30793-5_13\">10.1007/978-3-642-30793-5_13</a>","chicago":"Delahaye, Benoît, Uli Fahrenberg, Thomas A Henzinger, Axel Legay, and Dejan Nickovic. “Synchronous Interface Theories and Time Triggered Scheduling,” 7273:203–18. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-30793-5_13\">https://doi.org/10.1007/978-3-642-30793-5_13</a>.","short":"B. Delahaye, U. Fahrenberg, T.A. Henzinger, A. Legay, D. Nickovic, in:, Springer, 2012, pp. 203–218.","ista":"Delahaye B, Fahrenberg U, Henzinger TA, Legay A, Nickovic D. 2012. Synchronous interface theories and time triggered scheduling. FORTE: Formal Techniques for Networked and Distributed Systems &#38; FMOODS: Formal Methods for Open Object-Based Distributed Systems , LNCS, vol. 7273, 203–218."},"author":[{"full_name":"Delahaye, Benoît","first_name":"Benoît","last_name":"Delahaye"},{"last_name":"Fahrenberg","first_name":"Uli","full_name":"Fahrenberg, Uli"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger"},{"last_name":"Legay","first_name":"Axel","full_name":"Legay, Axel"},{"full_name":"Nickovic, Dejan","last_name":"Nickovic","first_name":"Dejan","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87"}],"date_published":"2012-06-01T00:00:00Z","year":"2012","publication_status":"published","oa_version":"Submitted Version","title":"Synchronous interface theories and time triggered scheduling","_id":"3155","file":[{"checksum":"feae2e07f2d9a59843f8ddabf25d179f","file_name":"IST-2012-88-v1+1_Synchronous_interface_theories_and_time_triggered_scheduling.pdf","content_type":"application/pdf","relation":"main_file","access_level":"open_access","date_updated":"2020-07-14T12:46:01Z","creator":"system","file_size":493198,"date_created":"2018-12-12T10:11:25Z","file_id":"4879"}],"intvolume":"      7273","alternative_title":["LNCS"],"quality_controlled":"1","conference":{"location":"Stockholm, Sweden","name":"FORTE: Formal Techniques for Networked and Distributed Systems & FMOODS: Formal Methods for Open Object-Based Distributed Systems ","end_date":"2012-06-16","start_date":"2012-06-13"},"publist_id":"3539","department":[{"_id":"ToHe"}],"oa":1,"has_accepted_license":"1","ddc":["004"],"pubrep_id":"88","doi":"10.1007/978-3-642-30793-5_13","volume":7273,"language":[{"iso":"eng"}],"scopus_import":1,"abstract":[{"text":"We propose synchronous interfaces, a new interface theory for discrete-time systems. We use an application to time-triggered scheduling to drive the design choices for our formalism; in particular, additionally to deriving useful mathematical properties, we focus on providing a syntax which is adapted to natural high-level system modeling. As a result, we develop an interface model that relies on a guarded-command based language and is equipped with shared variables and explicit discrete-time clocks. We define all standard interface operations: compatibility checking, composition, refinement, and shared refinement. Apart from the synchronous interface model, the contribution of this paper is the establishment of a formal relation between interface theories and real-time scheduling, where we demonstrate a fully automatic framework for the incremental computation of time-triggered schedules.","lang":"eng"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:41:26Z","type":"conference","day":"01","status":"public","date_created":"2018-12-11T12:01:43Z","acknowledgement":"Research partially supported by the Danish-Chinese Center for Cyber Physical Systems (Grant No.61061130541) and VKR Center of Excellence MT-LAB.","page":"203 - 218","publisher":"Springer","file_date_updated":"2020-07-14T12:46:01Z"},{"corr_author":"1","date_published":"2012-07-01T00:00:00Z","oa_version":"None","publication_status":"published","year":"2012","citation":{"chicago":"Ugelvig, Line V, Anne Andersen, Jacobus Boomsma, and David Nash. “Dispersal and Gene Flow in the Rare Parasitic Large Blue Butterfly Maculinea Arion.” <i>Molecular Ecology</i>. Wiley-Blackwell, 2012. <a href=\"https://doi.org/10.1111/j.1365-294X.2012.05592.x\">https://doi.org/10.1111/j.1365-294X.2012.05592.x</a>.","short":"L.V. Ugelvig, A. Andersen, J. Boomsma, D. Nash, Molecular Ecology 21 (2012) 3224–3236.","ista":"Ugelvig LV, Andersen A, Boomsma J, Nash D. 2012. Dispersal and gene flow in the rare parasitic Large Blue butterfly Maculinea arion. Molecular Ecology. 21(13), 3224–3236.","ieee":"L. V. Ugelvig, A. Andersen, J. Boomsma, and D. Nash, “Dispersal and gene flow in the rare parasitic Large Blue butterfly Maculinea arion,” <i>Molecular Ecology</i>, vol. 21, no. 13. Wiley-Blackwell, pp. 3224–3236, 2012.","apa":"Ugelvig, L. V., Andersen, A., Boomsma, J., &#38; Nash, D. (2012). Dispersal and gene flow in the rare parasitic Large Blue butterfly Maculinea arion. <i>Molecular Ecology</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1365-294X.2012.05592.x\">https://doi.org/10.1111/j.1365-294X.2012.05592.x</a>","mla":"Ugelvig, Line V., et al. “Dispersal and Gene Flow in the Rare Parasitic Large Blue Butterfly Maculinea Arion.” <i>Molecular Ecology</i>, vol. 21, no. 13, Wiley-Blackwell, 2012, pp. 3224–36, doi:<a href=\"https://doi.org/10.1111/j.1365-294X.2012.05592.x\">10.1111/j.1365-294X.2012.05592.x</a>.","ama":"Ugelvig LV, Andersen A, Boomsma J, Nash D. Dispersal and gene flow in the rare parasitic Large Blue butterfly Maculinea arion. <i>Molecular Ecology</i>. 2012;21(13):3224-3236. doi:<a href=\"https://doi.org/10.1111/j.1365-294X.2012.05592.x\">10.1111/j.1365-294X.2012.05592.x</a>"},"issue":"13","month":"07","author":[{"last_name":"Ugelvig","first_name":"Line V","full_name":"Ugelvig, Line V","orcid":"0000-0003-1832-8883","id":"3DC97C8E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Andersen, Anne","first_name":"Anne","last_name":"Andersen"},{"full_name":"Boomsma, Jacobus","last_name":"Boomsma","first_name":"Jacobus"},{"full_name":"Nash, David","first_name":"David","last_name":"Nash"}],"department":[{"_id":"SyCr"}],"publist_id":"3538","_id":"3156","title":"Dispersal and gene flow in the rare parasitic Large Blue butterfly Maculinea arion","intvolume":"        21","quality_controlled":"1","language":[{"iso":"eng"}],"scopus_import":"1","abstract":[{"text":"Dispersal is crucial for gene flow and often determines the long-term stability of meta-populations, particularly in rare species with specialized life cycles. Such species are often foci of conservation efforts because they suffer disproportionally from degradation and fragmentation of their habitat. However, detailed knowledge of effective gene flow through dispersal is often missing, so that conservation strategies have to be based on mark-recapture observations that are suspected to be poor predictors of long-distance dispersal. These constraints have been especially severe in the study of butterfly populations, where microsatellite markers have been difficult to develop. We used eight microsatellite markers to analyse genetic population structure of the Large Blue butterfly Maculinea arion in Sweden. During recent decades, this species has become an icon of insect conservation after massive decline throughout Europe and extinction in Britain followed by reintroduction of a seed population from the Swedish island of Öland. We find that populations are highly structured genetically, but that gene flow occurs over distances 15 times longer than the maximum distance recorded from mark-recapture studies, which can only be explained by maximum dispersal distances at least twice as large as previously accepted. However, we also find evidence that gaps between sites with suitable habitat exceeding ∼ 20 km induce genetic erosion that can be detected from bottleneck analyses. Although further work is needed, our results suggest that M. arion can maintain fully functional metapopulations when they consist of optimal habitat patches that are no further apart than ∼10 km.","lang":"eng"}],"article_processing_charge":"No","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","external_id":{"isi":["000305582200012"]},"doi":"10.1111/j.1365-294X.2012.05592.x","volume":21,"acknowledgement":"The work was financed by the Danish National Science Research Foundation via a grant to the Centre for Social Evolution.\r\nWe thank four anonymous reviewers for useful comments on the manuscript, J. Bergsten, P. Bina, B. Carlsson, M. Johannesson and A.E. Lomborg for providing additional wingtip samples, A. Illum for assistance in the field, and in particular P.S. Nielsen for mediating the contact to the collectors and the Swedish authorities. Collection was made possible through a permit by the Åtgärdsprogrammet, supported by the Swedish Environmental Protection Agency.","page":"3224 - 3236","publication":"Molecular Ecology","publisher":"Wiley-Blackwell","isi":1,"date_updated":"2025-09-30T07:55:21Z","day":"01","type":"journal_article","status":"public","date_created":"2018-12-11T12:01:43Z"},{"scopus_import":"1","language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_processing_charge":"No","abstract":[{"text":"Colorectal tumours that are wild type for KRAS are often sensitive to EGFR blockade, but almost always develop resistance within several months of initiating therapy. The mechanisms underlying this acquired resistance to anti-EGFR antibodies are largely unknown. This situation is in marked contrast to that of small-molecule targeted agents, such as inhibitors of ABL, EGFR, BRAF and MEK, in which mutations in the genes encoding the protein targets render the tumours resistant to the effects of the drugs. The simplest hypothesis to account for the development of resistance to EGFR blockade is that rare cells with KRAS mutations pre-exist at low levels in tumours with ostensibly wild-type KRAS genes. Although this hypothesis would seem readily testable, there is no evidence in pre-clinical models to support it, nor is there data from patients. To test this hypothesis, we determined whether mutant KRAS DNA could be detected in the circulation of 28 patients receiving monotherapy with panitumumab, a therapeutic anti-EGFR antibody. We found that 9 out of 24 (38%) patients whose tumours were initially KRAS wild type developed detectable mutations in KRAS in their sera, three of which developed multiple different KRAS mutations. The appearance of these mutations was very consistent, generally occurring between 5 and 6months following treatment. Mathematical modelling indicated that the mutations were present in expanded subclones before the initiation of panitumumab treatment. These results suggest that the emergence of KRAS mutations is a mediator of acquired resistance to EGFR blockade and that these mutations can be detected in a non-invasive manner. They explain why solid tumours develop resistance to targeted therapies in a highly reproducible fashion.","lang":"eng"}],"doi":"10.1038/nature11219","external_id":{"isi":["000305760600044"],"pmid":["22722843"]},"project":[{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"volume":486,"page":"537 - 540","pmid":1,"isi":1,"publisher":"Nature Publishing Group","ec_funded":1,"publication":"Nature","type":"journal_article","day":"28","date_updated":"2025-09-30T07:54:56Z","status":"public","date_created":"2018-12-11T12:01:43Z","year":"2012","publication_status":"published","oa_version":"Submitted Version","date_published":"2012-06-28T00:00:00Z","related_material":{"record":[{"id":"1400","relation":"dissertation_contains","status":"public"}]},"month":"06","issue":"7404","citation":{"chicago":"Diaz Jr, Luis, Richard Williams, Jian Wu, Isaac Kinde, Joel Hecht, Jordan Berlin, Benjamin Allen, et al. “The Molecular Evolution of Acquired Resistance to Targeted EGFR Blockade in Colorectal Cancers.” <i>Nature</i>. Nature Publishing Group, 2012. <a href=\"https://doi.org/10.1038/nature11219\">https://doi.org/10.1038/nature11219</a>.","short":"L. Diaz Jr, R. Williams, J. Wu, I. Kinde, J. Hecht, J. Berlin, B. Allen, I. Božić, J. Reiter, M. Nowak, K. Kinzler, K. Oliner, B. Vogelstein, Nature 486 (2012) 537–540.","ista":"Diaz Jr L, Williams R, Wu J, Kinde I, Hecht J, Berlin J, Allen B, Božić I, Reiter J, Nowak M, Kinzler K, Oliner K, Vogelstein B. 2012. The molecular evolution of acquired resistance to targeted EGFR blockade in colorectal cancers. Nature. 486(7404), 537–540.","ama":"Diaz Jr L, Williams R, Wu J, et al. The molecular evolution of acquired resistance to targeted EGFR blockade in colorectal cancers. <i>Nature</i>. 2012;486(7404):537-540. doi:<a href=\"https://doi.org/10.1038/nature11219\">10.1038/nature11219</a>","apa":"Diaz Jr, L., Williams, R., Wu, J., Kinde, I., Hecht, J., Berlin, J., … Vogelstein, B. (2012). The molecular evolution of acquired resistance to targeted EGFR blockade in colorectal cancers. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nature11219\">https://doi.org/10.1038/nature11219</a>","ieee":"L. Diaz Jr <i>et al.</i>, “The molecular evolution of acquired resistance to targeted EGFR blockade in colorectal cancers,” <i>Nature</i>, vol. 486, no. 7404. Nature Publishing Group, pp. 537–540, 2012.","mla":"Diaz Jr, Luis, et al. “The Molecular Evolution of Acquired Resistance to Targeted EGFR Blockade in Colorectal Cancers.” <i>Nature</i>, vol. 486, no. 7404, Nature Publishing Group, 2012, pp. 537–40, doi:<a href=\"https://doi.org/10.1038/nature11219\">10.1038/nature11219</a>."},"author":[{"full_name":"Diaz Jr, Luis","first_name":"Luis","last_name":"Diaz Jr"},{"last_name":"Williams","first_name":"Richard","full_name":"Williams, Richard"},{"full_name":"Wu, Jian","first_name":"Jian","last_name":"Wu"},{"full_name":"Kinde, Isaac","first_name":"Isaac","last_name":"Kinde"},{"full_name":"Hecht, Joel","first_name":"Joel","last_name":"Hecht"},{"full_name":"Berlin, Jordan","first_name":"Jordan","last_name":"Berlin"},{"first_name":"Benjamin","last_name":"Allen","full_name":"Allen, Benjamin"},{"full_name":"Božić, Ivana","last_name":"Božić","first_name":"Ivana"},{"full_name":"Reiter, Johannes","last_name":"Reiter","first_name":"Johannes","id":"4A918E98-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0170-7353"},{"last_name":"Nowak","first_name":"Martin","full_name":"Nowak, Martin"},{"first_name":"Kenneth","last_name":"Kinzler","full_name":"Kinzler, Kenneth"},{"full_name":"Oliner, Kelly","last_name":"Oliner","first_name":"Kelly"},{"full_name":"Vogelstein, Bert","last_name":"Vogelstein","first_name":"Bert"}],"publist_id":"3537","department":[{"_id":"KrCh"}],"main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3436069/"}],"oa":1,"title":"The molecular evolution of acquired resistance to targeted EGFR blockade in colorectal cancers","_id":"3157","quality_controlled":"1","intvolume":"       486"},{"year":"2012","oa_version":"Submitted Version","publication_status":"published","date_published":"2012-11-01T00:00:00Z","month":"11","issue":"11-12","citation":{"mla":"Schachtner, Hannah, et al. “Tissue Inducible Lifeact Expression Allows Visualization of Actin Dynamics in Vivo and Ex Vivo.” <i>European Journal of Cell Biology</i>, vol. 91, no. 11–12, Elsevier, 2012, pp. 923–29, doi:<a href=\"https://doi.org/10.1016/j.ejcb.2012.04.002\">10.1016/j.ejcb.2012.04.002</a>.","apa":"Schachtner, H., Li, A., Stevenson, D., Calaminus, S., Thomas, S., Watson, S., … Machesky, L. (2012). Tissue inducible Lifeact expression allows visualization of actin dynamics in vivo and ex vivo. <i>European Journal of Cell Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ejcb.2012.04.002\">https://doi.org/10.1016/j.ejcb.2012.04.002</a>","ieee":"H. Schachtner <i>et al.</i>, “Tissue inducible Lifeact expression allows visualization of actin dynamics in vivo and ex vivo,” <i>European Journal of Cell Biology</i>, vol. 91, no. 11–12. Elsevier, pp. 923–929, 2012.","ama":"Schachtner H, Li A, Stevenson D, et al. Tissue inducible Lifeact expression allows visualization of actin dynamics in vivo and ex vivo. <i>European Journal of Cell Biology</i>. 2012;91(11-12):923-929. doi:<a href=\"https://doi.org/10.1016/j.ejcb.2012.04.002\">10.1016/j.ejcb.2012.04.002</a>","ista":"Schachtner H, Li A, Stevenson D, Calaminus S, Thomas S, Watson S, Sixt MK, Wedlich Söldner R, Strathdee D, Machesky L. 2012. Tissue inducible Lifeact expression allows visualization of actin dynamics in vivo and ex vivo. European Journal of Cell Biology. 91(11–12), 923–929.","chicago":"Schachtner, Hannah, Ang Li, David Stevenson, Simon Calaminus, Steven Thomas, Steve Watson, Michael K Sixt, Roland Wedlich Söldner, Douglas Strathdee, and Laura Machesky. “Tissue Inducible Lifeact Expression Allows Visualization of Actin Dynamics in Vivo and Ex Vivo.” <i>European Journal of Cell Biology</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.ejcb.2012.04.002\">https://doi.org/10.1016/j.ejcb.2012.04.002</a>.","short":"H. Schachtner, A. Li, D. Stevenson, S. Calaminus, S. Thomas, S. Watson, M.K. Sixt, R. Wedlich Söldner, D. Strathdee, L. Machesky, European Journal of Cell Biology 91 (2012) 923–929."},"author":[{"first_name":"Hannah","last_name":"Schachtner","full_name":"Schachtner, Hannah"},{"first_name":"Ang","last_name":"Li","full_name":"Li, Ang"},{"full_name":"Stevenson, David","last_name":"Stevenson","first_name":"David"},{"last_name":"Calaminus","first_name":"Simon","full_name":"Calaminus, Simon"},{"full_name":"Thomas, Steven","last_name":"Thomas","first_name":"Steven"},{"full_name":"Watson, Steve","last_name":"Watson","first_name":"Steve"},{"full_name":"Sixt, Michael K","first_name":"Michael K","last_name":"Sixt","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179"},{"full_name":"Wedlich Söldner, Roland","last_name":"Wedlich Söldner","first_name":"Roland"},{"first_name":"Douglas","last_name":"Strathdee","full_name":"Strathdee, Douglas"},{"last_name":"Machesky","first_name":"Laura","full_name":"Machesky, Laura"}],"publist_id":"3534","department":[{"_id":"MiSi"}],"main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3930012/"}],"oa":1,"title":"Tissue inducible Lifeact expression allows visualization of actin dynamics in vivo and ex vivo","_id":"3158","quality_controlled":"1","intvolume":"        91","scopus_import":"1","language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_processing_charge":"No","abstract":[{"lang":"eng","text":"We describe here the development and characterization of a conditionally inducible mouse model expressing Lifeact-GFP, a peptide that reports the dynamics of filamentous actin. We have used this model to study platelets, megakaryocytes and melanoblasts and we provide evidence that Lifeact-GFP is a useful reporter in these cell types ex vivo. In the case of platelets and megakaryocytes, these cells are not transfectable by traditional methods, so conditional activation of Lifeact allows the study of actin dynamics in these cells live. We studied melanoblasts in native skin explants from embryos, allowing the visualization of live actin dynamics during cytokinesis and migration. Our study revealed that melanoblasts lacking the small GTPase Rac1 show a delay in the formation of new pseudopodia following cytokinesis that accounts for the previously reported cytokinesis delay in these cells. Thus, through use of this mouse model, we were able to gain insights into the actin dynamics of cells that could only previously be studied using fixed specimens or following isolation from their native tissue environment."}],"doi":"10.1016/j.ejcb.2012.04.002","external_id":{"isi":["000311775000013"],"pmid":["22658956"]},"volume":91,"page":"923 - 929","pmid":1,"isi":1,"publisher":"Elsevier","publication":"European Journal of Cell Biology","type":"journal_article","day":"01","date_updated":"2025-09-30T07:54:24Z","status":"public","date_created":"2018-12-11T12:01:44Z"},{"pubrep_id":"385","external_id":{"isi":["000305348400006"]},"doi":"10.1371/journal.pone.0036715","volume":7,"article_number":"e36715","language":[{"iso":"eng"}],"scopus_import":"1","abstract":[{"text":"The structure of hierarchical networks in biological and physical systems has long been characterized using the Horton-Strahler ordering scheme. The scheme assigns an integer order to each edge in the network based on the topology of branching such that the order increases from distal parts of the network (e.g., mountain streams or capillaries) to the &quot;root&quot; of the network (e.g., the river outlet or the aorta). However, Horton-Strahler ordering cannot be applied to networks with loops because they they create a contradiction in the edge ordering in terms of which edge precedes another in the hierarchy. Here, we present a generalization of the Horton-Strahler order to weighted planar reticular networks, where weights are assumed to correlate with the importance of network edges, e.g., weights estimated from edge widths may correlate to flow capacity. Our method assigns hierarchical levels not only to edges of the network, but also to its loops, and classifies the edges into reticular edges, which are responsible for loop formation, and tree edges. In addition, we perform a detailed and rigorous theoretical analysis of the sensitivity of the hierarchical levels to weight perturbations. In doing so, we show that the ordering of the reticular edges is more robust to noise in weight estimation than is the ordering of the tree edges. We discuss applications of this generalized Horton-Strahler ordering to the study of leaf venation and other biological networks.","lang":"eng"}],"article_processing_charge":"No","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2025-09-30T07:53:26Z","day":"06","type":"journal_article","status":"public","date_created":"2018-12-11T12:01:44Z","acknowledgement":"his work was supported by the National Science Foundation Plant Genome Research Program (grant 0820624 to H.E. and J.S.W.), the Defense Advanced Projects Research Agency (grant HR0011-09-1-0055 to H.E. and J.S.W.), and the European Science Foundation (under the Research Networking Programme on “Applied and Computational Algebraic Topology” run by H.E.). Joshua S. Weitz, Ph.D., holds a Career Award at the Scientific Interface from the Burroughs Wellcome Fund.\r\n\r\n\r\n\r\nDuring preparation of this manuscript the authors became aware of a related work by Katifori and Magnasco (arXiv:1110.1412v1), concurrently submitted and accepted for publication in PLoS ONE.","publication":"PLoS One","publisher":"Public Library of Science","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file_date_updated":"2020-07-14T12:46:01Z","isi":1,"issue":"6","citation":{"ama":"Mileyko Y, Edelsbrunner H, Price C, Weitz J. Hierarchical ordering of reticular networks. <i>PLoS One</i>. 2012;7(6). doi:<a href=\"https://doi.org/10.1371/journal.pone.0036715\">10.1371/journal.pone.0036715</a>","apa":"Mileyko, Y., Edelsbrunner, H., Price, C., &#38; Weitz, J. (2012). Hierarchical ordering of reticular networks. <i>PLoS One</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pone.0036715\">https://doi.org/10.1371/journal.pone.0036715</a>","ieee":"Y. Mileyko, H. Edelsbrunner, C. Price, and J. Weitz, “Hierarchical ordering of reticular networks,” <i>PLoS One</i>, vol. 7, no. 6. Public Library of Science, 2012.","mla":"Mileyko, Yuriy, et al. “Hierarchical Ordering of Reticular Networks.” <i>PLoS One</i>, vol. 7, no. 6, e36715, Public Library of Science, 2012, doi:<a href=\"https://doi.org/10.1371/journal.pone.0036715\">10.1371/journal.pone.0036715</a>.","chicago":"Mileyko, Yuriy, Herbert Edelsbrunner, Charles Price, and Joshua Weitz. “Hierarchical Ordering of Reticular Networks.” <i>PLoS One</i>. Public Library of Science, 2012. <a href=\"https://doi.org/10.1371/journal.pone.0036715\">https://doi.org/10.1371/journal.pone.0036715</a>.","short":"Y. Mileyko, H. Edelsbrunner, C. Price, J. Weitz, PLoS One 7 (2012).","ista":"Mileyko Y, Edelsbrunner H, Price C, Weitz J. 2012. Hierarchical ordering of reticular networks. PLoS One. 7(6), e36715."},"month":"06","author":[{"last_name":"Mileyko","first_name":"Yuriy","full_name":"Mileyko, Yuriy"},{"first_name":"Herbert","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833"},{"full_name":"Price, Charles","last_name":"Price","first_name":"Charles"},{"first_name":"Joshua","last_name":"Weitz","full_name":"Weitz, Joshua"}],"date_published":"2012-06-06T00:00:00Z","license":"https://creativecommons.org/licenses/by/4.0/","publication_status":"published","oa_version":"Published Version","year":"2012","_id":"3159","title":"Hierarchical ordering of reticular networks","file":[{"access_level":"open_access","date_updated":"2020-07-14T12:46:01Z","creator":"kschuh","file_size":541583,"date_created":"2019-02-05T12:38:43Z","file_id":"5922","checksum":"515a98ad72e470752f03f13663dcaff8","file_name":"2012_PLoS_Mileyko.PDF","content_type":"application/pdf","relation":"main_file"}],"intvolume":"         7","quality_controlled":"1","department":[{"_id":"HeEd"}],"publist_id":"3530","oa":1,"ddc":["510"],"has_accepted_license":"1"},{"abstract":[{"text":"There is a long-running controversy about how early cell fate decisions are made in the developing mammalian embryo. 1,2 In particular, it is controversial when the first events that can predict the establishment of the pluripotent and extra-embryonic lineages in the blastocyst of the pre-implantation embryo occur. It has long been proposed that the position and polarity of cells at the 16- to 32-cell stage embryo influence their decision to either give rise to the pluripotent cell lineage that eventually contributes to the inner cell mass (ICM), comprising the primitive endoderm (PE) and the epiblast (EPI), or the extra-embryonic trophectoderm (TE) surrounding the blastocoel. The positioning of cells in the embryo at this developmental stage could largely be the result of random events, making this a stochastic model of cell lineage allocation. Contrary to such a stochastic model, some studies have detected putative differences in the lineage potential of individual blastomeres before compaction, indicating that the first cell fate decisions may occur as early as at the 4-cell stage. Using a non-invasive, quantitative in vivo imaging assay to study the kinetic behavior of Oct4 (also known as POU5F1), a key transcription factor (TF) controlling pre-implantation development in the mouse embryo, 3-5 a recent study identifies Oct4 kinetics as a predictive measure of cell lineage patterning in the early mouse embryo. 6 Here, we discuss the implications of such molecular heterogeneities in early development and offer potential avenues toward a mechanistic understanding of these observations, contributing to the resolution of the controversy of developmental cell lineage allocation.","lang":"eng"}],"article_processing_charge":"No","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"scopus_import":"1","volume":11,"external_id":{"isi":["000304770100011"]},"doi":"10.4161/cc.20118","publication":"Cell Cycle","publisher":"Taylor and Francis","isi":1,"page":"2055 - 2058","status":"public","date_created":"2018-12-11T12:01:44Z","date_updated":"2025-09-30T07:53:56Z","day":"01","type":"journal_article","date_published":"2012-06-01T00:00:00Z","oa_version":"None","publication_status":"published","year":"2012","corr_author":"1","author":[{"full_name":"Pantazis, Periklis","first_name":"Periklis","last_name":"Pantazis"},{"last_name":"Bollenbach","first_name":"Tobias","full_name":"Bollenbach, Tobias","orcid":"0000-0003-4398-476X","id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87"}],"issue":"11","citation":{"mla":"Pantazis, Periklis, and Mark Tobias Bollenbach. “Transcription Factor Kinetics and the Emerging Asymmetry in the Early Mammalian Embryo.” <i>Cell Cycle</i>, vol. 11, no. 11, Taylor and Francis, 2012, pp. 2055–58, doi:<a href=\"https://doi.org/10.4161/cc.20118\">10.4161/cc.20118</a>.","ieee":"P. Pantazis and M. T. Bollenbach, “Transcription factor kinetics and the emerging asymmetry in the early mammalian embryo,” <i>Cell Cycle</i>, vol. 11, no. 11. Taylor and Francis, pp. 2055–2058, 2012.","apa":"Pantazis, P., &#38; Bollenbach, M. T. (2012). Transcription factor kinetics and the emerging asymmetry in the early mammalian embryo. <i>Cell Cycle</i>. Taylor and Francis. <a href=\"https://doi.org/10.4161/cc.20118\">https://doi.org/10.4161/cc.20118</a>","ama":"Pantazis P, Bollenbach MT. Transcription factor kinetics and the emerging asymmetry in the early mammalian embryo. <i>Cell Cycle</i>. 2012;11(11):2055-2058. doi:<a href=\"https://doi.org/10.4161/cc.20118\">10.4161/cc.20118</a>","ista":"Pantazis P, Bollenbach MT. 2012. Transcription factor kinetics and the emerging asymmetry in the early mammalian embryo. Cell Cycle. 11(11), 2055–2058.","chicago":"Pantazis, Periklis, and Mark Tobias Bollenbach. “Transcription Factor Kinetics and the Emerging Asymmetry in the Early Mammalian Embryo.” <i>Cell Cycle</i>. Taylor and Francis, 2012. <a href=\"https://doi.org/10.4161/cc.20118\">https://doi.org/10.4161/cc.20118</a>.","short":"P. Pantazis, M.T. Bollenbach, Cell Cycle 11 (2012) 2055–2058."},"month":"06","department":[{"_id":"ToBo"}],"publist_id":"3531","intvolume":"        11","quality_controlled":"1","_id":"3160","title":"Transcription factor kinetics and the emerging asymmetry in the early mammalian embryo"},{"day":"14","type":"journal_article","date_updated":"2025-09-30T07:52:40Z","date_created":"2018-12-11T12:01:45Z","status":"public","acknowledgement":"Supported by National Institutes of Health grants GM071338 (ML) and AI059355 (BM).\r\nWe acknowledge the expertise of Dr. Martina Ralle in Department of Biochemistry and Molecular Biology at OHSU for measurements of potassium using inductively coupled plasma mass spectrometry.","isi":1,"file_date_updated":"2020-07-14T12:46:01Z","publication":"PLoS One","publisher":"Public Library of Science","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"external_id":{"isi":["000305339400011"]},"doi":"10.1371/journal.pone.0036044","pubrep_id":"97","volume":7,"scopus_import":"1","article_number":"e36044","language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","abstract":[{"text":"Some inflammatory stimuli trigger activation of the NLRP3 inflammasome by inducing efflux of cellular potassium. Loss of cellular potassium is known to potently suppress protein synthesis, leading us to test whether the inhibition of protein synthesis itself serves as an activating signal for the NLRP3 inflammasome. Murine bone marrow-derived macrophages, either primed by LPS or unprimed, were exposed to a panel of inhibitors of ribosomal function: ricin, cycloheximide, puromycin, pactamycin, and anisomycin. Macrophages were also exposed to nigericin, ATP, monosodium urate (MSU), and poly I:C. Synthesis of pro-IL-ß and release of IL-1ß from cells in response to these agents was detected by immunoblotting and ELISA. Release of intracellular potassium was measured by mass spectrometry. Inhibition of translation by each of the tested translation inhibitors led to processing of IL-1ß, which was released from cells. Processing and release of IL-1ß was reduced or absent from cells deficient in NLRP3, ASC, or caspase-1, demonstrating the role of the NLRP3 inflammasome. Despite the inability of these inhibitors to trigger efflux of intracellular potassium, the addition of high extracellular potassium suppressed activation of the NLRP3 inflammasome. MSU and double-stranded RNA, which are known to activate the NLRP3 inflammasome, also substantially inhibited protein translation, supporting a close association between inhibition of translation and inflammasome activation. These data demonstrate that translational inhibition itself constitutes a heretofore-unrecognized mechanism underlying IL-1ß dependent inflammatory signaling and that other physical, chemical, or pathogen-associated agents that impair translation may lead to IL-1ß-dependent inflammation through activation of the NLRP3 inflammasome. For agents that inhibit translation through decreased cellular potassium, the application of high extracellular potassium restores protein translation and suppresses activation of the NLRP inflammasome. For agents that inhibit translation through mechanisms that do not involve loss of potassium, high extracellular potassium suppresses IL-1ß processing through a mechanism that remains undefined.","lang":"eng"}],"article_processing_charge":"No","file":[{"date_created":"2018-12-12T10:14:30Z","file_size":2984012,"file_id":"5082","creator":"system","date_updated":"2020-07-14T12:46:01Z","access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"30cef37e27eaa467f6571b3640282010","file_name":"IST-2012-97-v1+1_journal.pone.0036044.pdf"}],"_id":"3161","title":"Suppression of ribosomal function triggers innate immune signaling through activation of the NLRP3 inflammasome","quality_controlled":"1","intvolume":"         7","department":[{"_id":"SyCr"}],"publist_id":"3526","ddc":["610"],"has_accepted_license":"1","oa":1,"issue":"5","citation":{"short":"M. Vyleta, J. Wong, B. Magun, PLoS One 7 (2012).","chicago":"Vyleta, Meghan, John Wong, and Bruce Magun. “Suppression of Ribosomal Function Triggers Innate Immune Signaling through Activation of the NLRP3 Inflammasome.” <i>PLoS One</i>. Public Library of Science, 2012. <a href=\"https://doi.org/10.1371/journal.pone.0036044\">https://doi.org/10.1371/journal.pone.0036044</a>.","ista":"Vyleta M, Wong J, Magun B. 2012. Suppression of ribosomal function triggers innate immune signaling through activation of the NLRP3 inflammasome. PLoS One. 7(5), e36044.","ieee":"M. Vyleta, J. Wong, and B. Magun, “Suppression of ribosomal function triggers innate immune signaling through activation of the NLRP3 inflammasome,” <i>PLoS One</i>, vol. 7, no. 5. Public Library of Science, 2012.","apa":"Vyleta, M., Wong, J., &#38; Magun, B. (2012). Suppression of ribosomal function triggers innate immune signaling through activation of the NLRP3 inflammasome. <i>PLoS One</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pone.0036044\">https://doi.org/10.1371/journal.pone.0036044</a>","mla":"Vyleta, Meghan, et al. “Suppression of Ribosomal Function Triggers Innate Immune Signaling through Activation of the NLRP3 Inflammasome.” <i>PLoS One</i>, vol. 7, no. 5, e36044, Public Library of Science, 2012, doi:<a href=\"https://doi.org/10.1371/journal.pone.0036044\">10.1371/journal.pone.0036044</a>.","ama":"Vyleta M, Wong J, Magun B. Suppression of ribosomal function triggers innate immune signaling through activation of the NLRP3 inflammasome. <i>PLoS One</i>. 2012;7(5). doi:<a href=\"https://doi.org/10.1371/journal.pone.0036044\">10.1371/journal.pone.0036044</a>"},"month":"05","author":[{"full_name":"Vyleta, Meghan","last_name":"Vyleta","first_name":"Meghan","id":"418901AA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Wong, John","first_name":"John","last_name":"Wong"},{"full_name":"Magun, Bruce","first_name":"Bruce","last_name":"Magun"}],"publication_status":"published","oa_version":"Published Version","year":"2012","date_published":"2012-05-14T00:00:00Z"},{"day":"01","type":"conference","date_updated":"2021-01-12T07:41:29Z","status":"public","date_created":"2018-12-11T12:01:45Z","page":"147 - 160","file_date_updated":"2020-07-14T12:46:01Z","publisher":"Springer","doi":"10.1007/978-3-642-29860-8_12","volume":7186,"scopus_import":1,"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Given a dense-time real-valued signal and a parameterized temporal logic formula with both magnitude and timing parameters, we compute the subset of the parameter space that renders the formula satisfied by the trace. We provide two preliminary implementations, one which follows the exact semantics and attempts to compute the validity domain by quantifier elimination in linear arithmetics and one which conducts adaptive search in the parameter space."}],"article_processing_charge":"No","file":[{"file_id":"7862","date_created":"2020-05-15T12:50:15Z","file_size":374726,"creator":"dernst","date_updated":"2020-07-14T12:46:01Z","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_name":"2012_RV_Asarin.pdf","checksum":"ba4a75287008fc64b8fbf78a7476ec32"}],"_id":"3162","title":"Parametric identification of temporal properties","quality_controlled":"1","alternative_title":["LNCS"],"intvolume":"      7186","department":[{"_id":"ToHe"}],"publist_id":"3525","conference":{"location":"San Francisco, CA, United States","name":"RV: Runtime Verification","start_date":"2011-09-27","end_date":"2011-09-30"},"ddc":["000"],"has_accepted_license":"1","oa":1,"citation":{"ista":"Asarin E, Donzé A, Maler O, Nickovic D. 2012. Parametric identification of temporal properties. RV: Runtime Verification, LNCS, vol. 7186, 147–160.","short":"E. Asarin, A. Donzé, O. Maler, D. Nickovic, in:, Springer, 2012, pp. 147–160.","chicago":"Asarin, Eugene, Alexandre Donzé, Oded Maler, and Dejan Nickovic. “Parametric Identification of Temporal Properties,” 7186:147–60. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-29860-8_12\">https://doi.org/10.1007/978-3-642-29860-8_12</a>.","ama":"Asarin E, Donzé A, Maler O, Nickovic D. Parametric identification of temporal properties. In: Vol 7186. Springer; 2012:147-160. doi:<a href=\"https://doi.org/10.1007/978-3-642-29860-8_12\">10.1007/978-3-642-29860-8_12</a>","mla":"Asarin, Eugene, et al. <i>Parametric Identification of Temporal Properties</i>. Vol. 7186, Springer, 2012, pp. 147–60, doi:<a href=\"https://doi.org/10.1007/978-3-642-29860-8_12\">10.1007/978-3-642-29860-8_12</a>.","apa":"Asarin, E., Donzé, A., Maler, O., &#38; Nickovic, D. (2012). Parametric identification of temporal properties (Vol. 7186, pp. 147–160). Presented at the RV: Runtime Verification, San Francisco, CA, United States: Springer. <a href=\"https://doi.org/10.1007/978-3-642-29860-8_12\">https://doi.org/10.1007/978-3-642-29860-8_12</a>","ieee":"E. Asarin, A. Donzé, O. Maler, and D. Nickovic, “Parametric identification of temporal properties,” presented at the RV: Runtime Verification, San Francisco, CA, United States, 2012, vol. 7186, pp. 147–160."},"month":"01","author":[{"last_name":"Asarin","first_name":"Eugene","full_name":"Asarin, Eugene"},{"last_name":"Donzé","first_name":"Alexandre","full_name":"Donzé, Alexandre"},{"first_name":"Oded","last_name":"Maler","full_name":"Maler, Oded"},{"id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","last_name":"Nickovic","first_name":"Dejan","full_name":"Nickovic, Dejan"}],"publication_status":"published","oa_version":"Submitted Version","year":"2012","date_published":"2012-01-01T00:00:00Z"},{"publist_id":"3521","department":[{"_id":"ChLa"}],"title":"Guest editorial: Special issue on structured prediction and inference","_id":"3164","quality_controlled":"1","intvolume":"        99","year":"2012","oa_version":"None","publication_status":"published","date_published":"2012-09-01T00:00:00Z","month":"09","issue":"3","citation":{"mla":"Blaschko, Matthew, and Christoph Lampert. “Guest Editorial: Special Issue on Structured Prediction and Inference.” <i>International Journal of Computer Vision</i>, vol. 99, no. 3, Springer, 2012, pp. 257–58, doi:<a href=\"https://doi.org/10.1007/s11263-012-0530-y\">10.1007/s11263-012-0530-y</a>.","apa":"Blaschko, M., &#38; Lampert, C. (2012). Guest editorial: Special issue on structured prediction and inference. <i>International Journal of Computer Vision</i>. Springer. <a href=\"https://doi.org/10.1007/s11263-012-0530-y\">https://doi.org/10.1007/s11263-012-0530-y</a>","ieee":"M. Blaschko and C. Lampert, “Guest editorial: Special issue on structured prediction and inference,” <i>International Journal of Computer Vision</i>, vol. 99, no. 3. Springer, pp. 257–258, 2012.","ama":"Blaschko M, Lampert C. Guest editorial: Special issue on structured prediction and inference. <i>International Journal of Computer Vision</i>. 2012;99(3):257-258. doi:<a href=\"https://doi.org/10.1007/s11263-012-0530-y\">10.1007/s11263-012-0530-y</a>","ista":"Blaschko M, Lampert C. 2012. Guest editorial: Special issue on structured prediction and inference. International Journal of Computer Vision. 99(3), 257–258.","chicago":"Blaschko, Matthew, and Christoph Lampert. “Guest Editorial: Special Issue on Structured Prediction and Inference.” <i>International Journal of Computer Vision</i>. Springer, 2012. <a href=\"https://doi.org/10.1007/s11263-012-0530-y\">https://doi.org/10.1007/s11263-012-0530-y</a>.","short":"M. Blaschko, C. Lampert, International Journal of Computer Vision 99 (2012) 257–258."},"author":[{"last_name":"Blaschko","first_name":"Matthew","full_name":"Blaschko, Matthew"},{"first_name":"Christoph","last_name":"Lampert","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887"}],"page":"257 - 258","isi":1,"publisher":"Springer","publication":"International Journal of Computer Vision","type":"journal_article","day":"01","date_updated":"2025-09-30T07:52:02Z","date_created":"2018-12-11T12:01:46Z","status":"public","scopus_import":"1","language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_processing_charge":"No","abstract":[{"lang":"eng","text":"Overview of the Special Issue on structured prediction and inference."}],"doi":"10.1007/s11263-012-0530-y","external_id":{"isi":["000304655600001"]},"volume":99},{"date_published":"2012-01-01T00:00:00Z","OA_place":"repository","oa_version":"Preprint","publication_status":"published","year":"2012","corr_author":"1","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","first_name":"Monika H","last_name":"Henzinger"}],"citation":{"mla":"Chatterjee, Krishnendu, and Monika Henzinger. “An O(N2) Time Algorithm for Alternating Büchi Games.” <i>Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms</i>, SIAM, 2012, pp. 1386–99, doi:<a href=\"https://doi.org/10.1137/1.9781611973099.109\">10.1137/1.9781611973099.109</a>.","ieee":"K. Chatterjee and M. Henzinger, “An O(n2) time algorithm for alternating Büchi games,” in <i>Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Kyoto, Japan, 2012, pp. 1386–1399.","apa":"Chatterjee, K., &#38; Henzinger, M. (2012). An O(n2) time algorithm for alternating Büchi games. In <i>Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 1386–1399). Kyoto, Japan: SIAM. <a href=\"https://doi.org/10.1137/1.9781611973099.109\">https://doi.org/10.1137/1.9781611973099.109</a>","ama":"Chatterjee K, Henzinger M. An O(n2) time algorithm for alternating Büchi games. In: <i>Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms</i>. SIAM; 2012:1386-1399. doi:<a href=\"https://doi.org/10.1137/1.9781611973099.109\">10.1137/1.9781611973099.109</a>","ista":"Chatterjee K, Henzinger M. 2012. An O(n2) time algorithm for alternating Büchi games. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1386–1399.","chicago":"Chatterjee, Krishnendu, and Monika Henzinger. “An O(N2) Time Algorithm for Alternating Büchi Games.” In <i>Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 1386–99. SIAM, 2012. <a href=\"https://doi.org/10.1137/1.9781611973099.109\">https://doi.org/10.1137/1.9781611973099.109</a>.","short":"K. Chatterjee, M. Henzinger, in:, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2012, pp. 1386–1399."},"month":"01","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"5379"},{"status":"public","relation":"later_version","id":"2141"}]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1109.5018"}],"department":[{"_id":"KrCh"}],"publist_id":"3519","conference":{"name":"SODA: Symposium on Discrete Algorithms","end_date":"2012-01-19","start_date":"2012-01-17","location":"Kyoto, Japan"},"quality_controlled":"1","_id":"3165","title":"An O(n2) time algorithm for alternating Büchi games","abstract":[{"text":"Computing the winning set for Büchi objectives in alternating games on graphs is a central problem in computer aided verification with a large number of applications. The long standing best known upper bound for solving the problem is Õ(n·m), where n is the number of vertices and m is the number of edges in the graph. We are the first to break the Õ(n·m) boundary by presenting a new technique that reduces the running time to O(n 2). This bound also leads to O(n 2) time algorithms for computing the set of almost-sure winning vertices for Büchi objectives (1) in alternating games with probabilistic transitions (improving an earlier bound of Õ(n·m)), (2) in concurrent graph games with constant actions (improving an earlier bound of O(n 3)), and (3) in Markov decision processes (improving for m &gt; n 4/3 an earlier bound of O(min(m 1.5, m·n 2/3)). We also show that the same technique can be used to compute the maximal end-component decomposition of a graph in time O(n 2), which is an improvement over earlier bounds for m &gt; n 4/3. Finally, we show how to maintain the winning set for Büchi objectives in alternating games under a sequence of edge insertions or a sequence of edge deletions in O(n) amortized time per operation. This is the first dynamic algorithm for this problem.","lang":"eng"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_type":"green","language":[{"iso":"eng"}],"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"pubrep_id":"15","external_id":{"arxiv":["1109.5018"]},"doi":"10.1137/1.9781611973099.109","publication":"Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms","ec_funded":1,"publisher":"SIAM","acknowledgement":"The research was supported by Austrian Science Fund (FWF) Grant No P 23499-N23 on Modern Graph Algorithmic Techniques in Formal Verification, Vienna Science and Technology Fund (WWTF) Grant ICT10-002, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.","page":"1386 - 1399","status":"public","date_created":"2018-12-11T12:01:46Z","date_updated":"2025-09-29T11:45:12Z","arxiv":1,"day":"01","type":"conference"},{"quality_controlled":"1","intvolume":"         7","file":[{"date_updated":"2020-07-14T12:46:02Z","access_level":"open_access","date_created":"2018-12-12T10:15:44Z","file_size":4099536,"file_id":"5166","creator":"system","checksum":"e511e401e239ef608a7fd79b21a06d78","file_name":"IST-2012-99-v1+1_1745-6150-7-6.pdf","relation":"main_file","content_type":"application/pdf"}],"title":"Amino acid fermentation at the origin of the genetic code","_id":"3166","has_accepted_license":"1","ddc":["570","576"],"oa":1,"publist_id":"3518","department":[{"_id":"NiBa"}],"author":[{"first_name":"Harold","last_name":"Vladar","full_name":"Vladar, Harold","id":"2A181218-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5985-7653"}],"month":"02","citation":{"ieee":"H. de Vladar, “Amino acid fermentation at the origin of the genetic code,” <i>Biology Direct</i>, vol. 7. BioMed Central, 2012.","apa":"de Vladar, H. (2012). Amino acid fermentation at the origin of the genetic code. <i>Biology Direct</i>. BioMed Central. <a href=\"https://doi.org/10.1186/1745-6150-7-6\">https://doi.org/10.1186/1745-6150-7-6</a>","mla":"de Vladar, Harold. “Amino Acid Fermentation at the Origin of the Genetic Code.” <i>Biology Direct</i>, vol. 7, 6, BioMed Central, 2012, doi:<a href=\"https://doi.org/10.1186/1745-6150-7-6\">10.1186/1745-6150-7-6</a>.","ama":"de Vladar H. Amino acid fermentation at the origin of the genetic code. <i>Biology Direct</i>. 2012;7. doi:<a href=\"https://doi.org/10.1186/1745-6150-7-6\">10.1186/1745-6150-7-6</a>","short":"H. de Vladar, Biology Direct 7 (2012).","chicago":"Vladar, Harold de. “Amino Acid Fermentation at the Origin of the Genetic Code.” <i>Biology Direct</i>. BioMed Central, 2012. <a href=\"https://doi.org/10.1186/1745-6150-7-6\">https://doi.org/10.1186/1745-6150-7-6</a>.","ista":"de Vladar H. 2012. Amino acid fermentation at the origin of the genetic code. Biology Direct. 7, 6."},"year":"2012","oa_version":"Published Version","publication_status":"published","date_published":"2012-02-10T00:00:00Z","corr_author":"1","status":"public","date_created":"2018-12-11T12:01:46Z","type":"journal_article","day":"10","date_updated":"2025-09-30T07:51:20Z","file_date_updated":"2020-07-14T12:46:02Z","isi":1,"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"ec_funded":1,"publisher":"BioMed Central","publication":"Biology Direct","acknowledgement":"The author was supported by the ERC-2009-AdG Grant for project 250152 SELECTIONINFORMATION. ","volume":7,"doi":"10.1186/1745-6150-7-6","external_id":{"isi":["000305269300001"]},"pubrep_id":"99","project":[{"grant_number":"250152","name":"Limits to selection in biology and in evolutionary computation","call_identifier":"FP7","_id":"25B07788-B435-11E9-9278-68D0E5697425"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_processing_charge":"No","abstract":[{"text":"There is evidence that the genetic code was established prior to the existence of proteins, when metabolism was powered by ribozymes. Also, early proto-organisms had to rely on simple anaerobic bioenergetic processes. In this work I propose that amino acid fermentation powered metabolism in the RNA world, and that this was facilitated by proto-adapters, the precursors of the tRNAs. Amino acids were used as carbon sources rather than as catalytic or structural elements. In modern bacteria, amino acid fermentation is known as the Stickland reaction. This pathway involves two amino acids: the first undergoes oxidative deamination, and the second acts as an electron acceptor through reductive deamination. This redox reaction results in two keto acids that are employed to synthesise ATP via substrate-level phosphorylation. The Stickland reaction is the basic bioenergetic pathway of some bacteria of the genus Clostridium. Two other facts support Stickland fermentation in the RNA world. First, several Stickland amino acid pairs are synthesised in abiotic amino acid synthesis. This suggests that amino acids that could be used as an energy substrate were freely available. Second, anticodons that have complementary sequences often correspond to amino acids that form Stickland pairs. The main hypothesis of this paper is that pairs of complementary proto-adapters were assigned to Stickland amino acids pairs. There are signatures of this hypothesis in the genetic code. Furthermore, it is argued that the proto-adapters formed double strands that brought amino acid pairs into proximity to facilitate their mutual redox reaction, structurally constraining the anticodon pairs that are assigned to these amino acid pairs. Significance tests which randomise the code are performed to study the extent of the variability of the energetic (ATP) yield. Random assignments can lead to a substantial yield of ATP and maintain enough variability, thus selection can act and refine the assignments into a proto-code that optimises the energetic yield. Monte Carlo simulations are performed to evaluate the establishment of these simple proto-codes, based on amino acid substitutions and codon swapping. In all cases, donor amino acids are assigned to anticodons composed of U+G, and have low redundancy (1-2 codons), whereas acceptor amino acids are assigned to the the remaining codons. These bioenergetic and structural constraints allow for a metabolic role for amino acids before their co-option as catalyst cofactors. Reviewers: this article was reviewed by Prof. William Martin, Prof. Eors Szathmary (nominated by Dr. Gaspar Jekely) and Dr. Adam Kun (nominated by Dr. Sandor Pongor)","lang":"eng"}],"language":[{"iso":"eng"}],"article_number":"6"},{"volume":336,"doi":"10.1126/science.336.6077.32","external_id":{"pmid":["22491839"]},"popular_science":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","OA_type":"free access","language":[{"iso":"eng"}],"date_created":"2018-12-11T12:01:47Z","status":"public","type":"journal_article","day":"06","date_updated":"2025-05-20T07:14:51Z","publisher":"American Association for the Advancement of Science","publication":"Science","page":"32-34","pmid":1,"author":[{"full_name":"Weber, Michele","last_name":"Weber","first_name":"Michele","id":"3A3FC708-F248-11E8-B48F-1D18A9856A87"}],"month":"04","citation":{"short":"M. Weber, Science 336 (2012) 32–34.","chicago":"Weber, Michele. “NextGen Speaks 13 .” <i>Science</i>. American Association for the Advancement of Science, 2012. <a href=\"https://doi.org/10.1126/science.336.6077.32\">https://doi.org/10.1126/science.336.6077.32</a>.","ista":"Weber M. 2012. NextGen speaks 13 . Science. 336(6077), 32–34.","apa":"Weber, M. (2012). NextGen speaks 13 . <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.336.6077.32\">https://doi.org/10.1126/science.336.6077.32</a>","ieee":"M. Weber, “NextGen speaks 13 ,” <i>Science</i>, vol. 336, no. 6077. American Association for the Advancement of Science, pp. 32–34, 2012.","mla":"Weber, Michele. “NextGen Speaks 13 .” <i>Science</i>, vol. 336, no. 6077, American Association for the Advancement of Science, 2012, pp. 32–34, doi:<a href=\"https://doi.org/10.1126/science.336.6077.32\">10.1126/science.336.6077.32</a>.","ama":"Weber M. NextGen speaks 13 . <i>Science</i>. 2012;336(6077):32-34. doi:<a href=\"https://doi.org/10.1126/science.336.6077.32\">10.1126/science.336.6077.32</a>"},"issue":"6077","year":"2012","publication_status":"published","oa_version":"None","date_published":"2012-04-06T00:00:00Z","article_type":"letter_note","intvolume":"       336","title":"NextGen speaks 13 ","_id":"3167","oa":1,"publist_id":"3516","department":[{"_id":"MiSi"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1126/science.336.6077.32"}]},{"acknowledgement":"We would like to thank the anonymous reviewers for their comments on the different versions of the paper. We would also like to thank Ferdinanda Camporesi for her careful reading and the useful insights that she gave us about the paper.\r\nJérôme Feret’s contribution was partially supported by the AbstractCell ANR-Chair of Excellence. Heinz Koeppl’s research is supported by the Swiss National Science Foundation, grant no. 200020-117975/1. Tatjana Petrov’s research is supported by SystemsX.ch (the Swiss Initiative in Systems Biology).","page":"137 - 164","publisher":"Elsevier","publication":"Theoretical Computer Science","isi":1,"date_updated":"2025-09-30T07:50:35Z","type":"journal_article","day":"04","status":"public","date_created":"2018-12-11T12:01:47Z","OA_type":"free access","language":[{"iso":"eng"}],"scopus_import":"1","article_processing_charge":"No","abstract":[{"lang":"eng","text":"The induction of a signaling pathway is characterized by transient complex formation and mutual posttranslational modification of proteins. To faithfully capture this combinatorial process in a mathematical model is an important challenge in systems biology. Exploiting the limited context on which most binding and modification events are conditioned, attempts have been made to reduce the combinatorial complexity by quotienting the reachable set of molecular species into species aggregates while preserving the deterministic semantics of the thermodynamic limit. Recently, we proposed a quotienting that also preserves the stochastic semantics and that is complete in the sense that the semantics of individual species can be recovered from the aggregate semantics. In this paper, we prove that this quotienting yields a sufficient condition for weak lumpability (that is to say that the quotient system is still Markovian for a given set of initial distributions) and that it gives rise to a backward Markov bisimulation between the original and aggregated transition system (which means that the conditional probability of being in a given state in the original system knowing that we are in its equivalence class is an invariant of the system). We illustrate the framework on a case study of the epidermal growth factor (EGF)/insulin receptor crosstalk."}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","pubrep_id":"73","doi":"10.1016/j.tcs.2011.12.059","external_id":{"isi":["000303302400010"]},"volume":431,"main_file_link":[{"url":"https://doi.org/10.1016/j.tcs.2011.12.059","open_access":"1"}],"publist_id":"3515","department":[{"_id":"ToHe"}],"oa":1,"title":"Lumpability abstractions of rule based systems","_id":"3168","intvolume":"       431","quality_controlled":"1","article_type":"original","OA_place":"publisher","date_published":"2012-05-04T00:00:00Z","year":"2012","publication_status":"published","oa_version":"Published Version","month":"05","citation":{"ama":"Feret J, Henzinger TA, Koeppl H, Petrov T. Lumpability abstractions of rule based systems. <i>Theoretical Computer Science</i>. 2012;431:137-164. doi:<a href=\"https://doi.org/10.1016/j.tcs.2011.12.059\">10.1016/j.tcs.2011.12.059</a>","ieee":"J. Feret, T. A. Henzinger, H. Koeppl, and T. Petrov, “Lumpability abstractions of rule based systems,” <i>Theoretical Computer Science</i>, vol. 431. Elsevier, pp. 137–164, 2012.","apa":"Feret, J., Henzinger, T. A., Koeppl, H., &#38; Petrov, T. (2012). Lumpability abstractions of rule based systems. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tcs.2011.12.059\">https://doi.org/10.1016/j.tcs.2011.12.059</a>","mla":"Feret, Jérôme, et al. “Lumpability Abstractions of Rule Based Systems.” <i>Theoretical Computer Science</i>, vol. 431, Elsevier, 2012, pp. 137–64, doi:<a href=\"https://doi.org/10.1016/j.tcs.2011.12.059\">10.1016/j.tcs.2011.12.059</a>.","short":"J. Feret, T.A. Henzinger, H. Koeppl, T. Petrov, Theoretical Computer Science 431 (2012) 137–164.","chicago":"Feret, Jérôme, Thomas A Henzinger, Heinz Koeppl, and Tatjana Petrov. “Lumpability Abstractions of Rule Based Systems.” <i>Theoretical Computer Science</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.tcs.2011.12.059\">https://doi.org/10.1016/j.tcs.2011.12.059</a>.","ista":"Feret J, Henzinger TA, Koeppl H, Petrov T. 2012. Lumpability abstractions of rule based systems. Theoretical Computer Science. 431, 137–164."},"related_material":{"record":[{"id":"3719","relation":"earlier_version","status":"public"}]},"author":[{"first_name":"Jérôme","last_name":"Feret","full_name":"Feret, Jérôme"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"last_name":"Koeppl","first_name":"Heinz","full_name":"Koeppl, Heinz"},{"orcid":"0000-0002-9041-0905","id":"3D5811FC-F248-11E8-B48F-1D18A9856A87","last_name":"Petrov","first_name":"Tatjana","full_name":"Petrov, Tatjana"}]},{"citation":{"short":"K.Z. Pietrzak, D. Wikström, Journal of Cryptology 25 (2012) 116–135.","chicago":"Pietrzak, Krzysztof Z, and Douglas Wikström. “Parallel Repetition of Computationally Sound Protocols Revisited.” <i>Journal of Cryptology</i>. Springer, 2012. <a href=\"https://doi.org/10.1007/s00145-010-9090-x\">https://doi.org/10.1007/s00145-010-9090-x</a>.","ista":"Pietrzak KZ, Wikström D. 2012. Parallel repetition of computationally sound protocols revisited. Journal of Cryptology. 25(1), 116–135.","ieee":"K. Z. Pietrzak and D. Wikström, “Parallel repetition of computationally sound protocols revisited,” <i>Journal of Cryptology</i>, vol. 25, no. 1. Springer, pp. 116–135, 2012.","apa":"Pietrzak, K. Z., &#38; Wikström, D. (2012). Parallel repetition of computationally sound protocols revisited. <i>Journal of Cryptology</i>. Springer. <a href=\"https://doi.org/10.1007/s00145-010-9090-x\">https://doi.org/10.1007/s00145-010-9090-x</a>","mla":"Pietrzak, Krzysztof Z., and Douglas Wikström. “Parallel Repetition of Computationally Sound Protocols Revisited.” <i>Journal of Cryptology</i>, vol. 25, no. 1, Springer, 2012, pp. 116–35, doi:<a href=\"https://doi.org/10.1007/s00145-010-9090-x\">10.1007/s00145-010-9090-x</a>.","ama":"Pietrzak KZ, Wikström D. Parallel repetition of computationally sound protocols revisited. <i>Journal of Cryptology</i>. 2012;25(1):116-135. doi:<a href=\"https://doi.org/10.1007/s00145-010-9090-x\">10.1007/s00145-010-9090-x</a>"},"issue":"1","month":"11","doi":"10.1007/s00145-010-9090-x","volume":25,"author":[{"full_name":"Krzysztof Pietrzak","first_name":"Krzysztof Z","last_name":"Pietrzak","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Douglas","last_name":"Wikström","full_name":"Wikström, Douglas"}],"date_published":"2012-11-01T00:00:00Z","abstract":[{"text":"We prove a negative result concerning error reduction by parallel repetition for computationally sound protocols, e.g., interactive arguments. Our main result is a complete and computationally sound eight round interactive argument for which k-fold parallel repetition does not reduce the error below a constant for any polynomial k. The starting point for our construction is the work of Bellare, Impagliazzo and Naor (FOCS'97). For any fixed k, they construct a four round protocol for which k-fold parallel repetition does not lower the soundness error. The communication complexity of this protocol is linear in k. By using universal arguments due to Barak and Goldreich (CCC 2002), we turn this protocol into an eight-round protocol whose complexity is basically independent of k. ","lang":"eng"}],"publication_status":"published","year":"2012","_id":"3241","title":"Parallel repetition of computationally sound protocols revisited","date_updated":"2021-01-12T07:42:03Z","day":"01","type":"journal_article","status":"public","intvolume":"        25","date_created":"2018-12-11T12:02:12Z","quality_controlled":0,"extern":1,"page":"116 - 135","publist_id":"3439","publication":"Journal of Cryptology","publisher":"Springer"},{"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","abstract":[{"lang":"eng","text":"Due to the omnipresent risk of epidemics, insect societies have evolved sophisticated disease defences at the individual and colony level. An intriguing yet little understood phenomenon is that social contact to pathogen-exposed individuals reduces susceptibility of previously naive nestmates to this pathogen. We tested whether such social immunisation in Lasius ants against the entomopathogenic fungus Metarhizium anisopliae is based on active upregulation of the immune system of nestmates following contact to an infectious individual or passive protection via transfer of immune effectors among group members—that is, active versus passive immunisation. We found no evidence for involvement of passive immunisation via transfer of antimicrobials among colony members. Instead, intensive allogrooming behaviour between naive and pathogen-exposed ants before fungal conidia firmly attached to their cuticle suggested passage of the pathogen from the exposed individuals to their nestmates. By tracing fluorescence-labelled conidia we indeed detected frequent pathogen transfer to the nestmates, where they caused low-level infections as revealed by growth of small numbers of fungal colony forming units from their dissected body content. These infections rarely led to death, but instead promoted an enhanced ability to inhibit fungal growth and an active upregulation of immune genes involved in antifungal defences (defensin and prophenoloxidase, PPO). Contrarily, there was no upregulation of the gene cathepsin L, which is associated with antibacterial and antiviral defences, and we found no increased antibacterial activity of nestmates of fungus-exposed ants. This indicates that social immunisation after fungal exposure is specific, similar to recent findings for individual-level immune priming in invertebrates. Epidemiological modeling further suggests that active social immunisation is adaptive, as it leads to faster elimination of the disease and lower death rates than passive immunisation. Interestingly, humans have also utilised the protective effect of low-level infections to fight smallpox by intentional transfer of low pathogen doses (“variolation” or “inoculation”)."}],"article_processing_charge":"No","scopus_import":"1","article_number":"e1001300","language":[{"iso":"eng"}],"volume":10,"external_id":{"isi":["000303541800006"]},"doi":"10.1371/journal.pbio.1001300","project":[{"_id":"25DAF0B2-B435-11E9-9278-68D0E5697425","grant_number":"CR-118/3-1","name":"Host-Parasite Coevolution"},{"_id":"25DC711C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Social Vaccination in Ant Colonies: from Individual Mechanisms to Society Effects","grant_number":"243071"},{"name":"Schnellboot Antnet Junge Akademie","_id":"25E0E184-B435-11E9-9278-68D0E5697425"}],"pubrep_id":"96","file_date_updated":"2020-07-14T12:46:04Z","isi":1,"publication":"PLoS Biology","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","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":"Public Library of Science","ec_funded":1,"acknowledgement":"Funding for this project was obtained by the German Research Foundation DFG (http://www.dfg.de/en/index.jsp) as an Individual Research Grant (CR118/2-1 to SC) and the European Research Council (http://erc.europa.eu/) in form of two ERC Starting Grants (ERC-2009-StG240371-SocialVaccines to SC and ERC-2010-StG259294-LatentCauses to FJT). In addition, the Junge Akademie (Young Academy of the Berlin-Brandenburg Academy of Sciences and Humanities and the National Academy of Sciences Leopoldina (http://www.diejungeakademie.de/english/i​ndex.html) funded this joint Antnet project of SC and FJT. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.","date_created":"2018-12-11T12:02:13Z","status":"public","day":"03","type":"journal_article","date_updated":"2025-09-30T07:50:01Z","oa_version":"Published Version","publication_status":"published","year":"2012","date_published":"2012-04-03T00:00:00Z","corr_author":"1","author":[{"id":"46528076-F248-11E8-B48F-1D18A9856A87","first_name":"Matthias","last_name":"Konrad","full_name":"Konrad, Matthias"},{"full_name":"Vyleta, Meghan","last_name":"Vyleta","first_name":"Meghan","id":"418901AA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Theis, Fabian","first_name":"Fabian","last_name":"Theis"},{"id":"42462816-F248-11E8-B48F-1D18A9856A87","full_name":"Stock, Miriam","last_name":"Stock","first_name":"Miriam"},{"id":"35A7A418-F248-11E8-B48F-1D18A9856A87","last_name":"Tragust","first_name":"Simon","full_name":"Tragust, Simon"},{"full_name":"Klatt, Martina","last_name":"Klatt","first_name":"Martina","id":"E60F29C6-E9AE-11E9-AF6E-D190C7302F38"},{"full_name":"Drescher, Verena","last_name":"Drescher","first_name":"Verena"},{"full_name":"Marr, Carsten","first_name":"Carsten","last_name":"Marr"},{"first_name":"Line V","last_name":"Ugelvig","full_name":"Ugelvig, Line V","id":"3DC97C8E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1832-8883"},{"orcid":"0000-0002-2193-3868","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","first_name":"Sylvia","last_name":"Cremer","full_name":"Cremer, Sylvia"}],"related_material":{"record":[{"relation":"research_data","status":"public","id":"9755"}]},"issue":"4","citation":{"ieee":"M. Konrad <i>et al.</i>, “Social transfer of pathogenic fungus promotes active immunisation in ant colonies,” <i>PLoS Biology</i>, vol. 10, no. 4. Public Library of Science, 2012.","apa":"Konrad, M., Vyleta, M., Theis, F., Stock, M., Tragust, S., Klatt, M., … Cremer, S. (2012). Social transfer of pathogenic fungus promotes active immunisation in ant colonies. <i>PLoS Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pbio.1001300\">https://doi.org/10.1371/journal.pbio.1001300</a>","mla":"Konrad, Matthias, et al. “Social Transfer of Pathogenic Fungus Promotes Active Immunisation in Ant Colonies.” <i>PLoS Biology</i>, vol. 10, no. 4, e1001300, Public Library of Science, 2012, doi:<a href=\"https://doi.org/10.1371/journal.pbio.1001300\">10.1371/journal.pbio.1001300</a>.","ama":"Konrad M, Vyleta M, Theis F, et al. Social transfer of pathogenic fungus promotes active immunisation in ant colonies. <i>PLoS Biology</i>. 2012;10(4). doi:<a href=\"https://doi.org/10.1371/journal.pbio.1001300\">10.1371/journal.pbio.1001300</a>","chicago":"Konrad, Matthias, Meghan Vyleta, Fabian Theis, Miriam Stock, Simon Tragust, Martina Klatt, Verena Drescher, Carsten Marr, Line V Ugelvig, and Sylvia Cremer. “Social Transfer of Pathogenic Fungus Promotes Active Immunisation in Ant Colonies.” <i>PLoS Biology</i>. Public Library of Science, 2012. <a href=\"https://doi.org/10.1371/journal.pbio.1001300\">https://doi.org/10.1371/journal.pbio.1001300</a>.","short":"M. Konrad, M. Vyleta, F. Theis, M. Stock, S. Tragust, M. Klatt, V. Drescher, C. Marr, L.V. Ugelvig, S. Cremer, PLoS Biology 10 (2012).","ista":"Konrad M, Vyleta M, Theis F, Stock M, Tragust S, Klatt M, Drescher V, Marr C, Ugelvig LV, Cremer S. 2012. Social transfer of pathogenic fungus promotes active immunisation in ant colonies. PLoS Biology. 10(4), e1001300."},"month":"04","ddc":["570","579"],"has_accepted_license":"1","oa":1,"department":[{"_id":"SyCr"}],"publist_id":"3434","quality_controlled":"1","intvolume":"        10","file":[{"checksum":"4ebacefd9fbab5c68adf829124115fd1","file_name":"IST-2012-96-v1+1_journal.pbio.1001300.pdf","content_type":"application/pdf","relation":"main_file","access_level":"open_access","date_updated":"2020-07-14T12:46:04Z","creator":"system","file_size":674228,"date_created":"2018-12-12T10:08:28Z","file_id":"4689"}],"_id":"3242","title":"Social transfer of pathogenic fungus promotes active immunisation in ant colonies"}]