[{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer","doi":"10.1007/978-3-642-33090-2_27","status":"public","_id":"10905","type":"conference","project":[{"call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"page":"301-312","date_updated":"2026-07-08T05:50:39Z","title":"Polynomial-time algorithms for energy games with special weight structures","abstract":[{"lang":"eng","text":"Energy games belong to a class of turn-based two-player infinite-duration games played on a weighted directed graph. It is one of the rare and intriguing combinatorial problems that lie in NP ∩ co−NP, but are not known to be in P. While the existence of polynomial-time algorithms has been a major open problem for decades, there is no algorithm that solves any non-trivial subclass in polynomial time.\r\nIn this paper, we give several results based on the weight structures of the graph. First, we identify a notion of penalty and present a polynomial-time algorithm when the penalty is large. Our algorithm is the first polynomial-time algorithm on a large class of weighted graphs. It includes several counter examples that show that many previous algorithms, such as value iteration and random facet algorithms, require at least sub-exponential time. Our main technique is developing the first non-trivial approximation algorithm and showing how to convert it to an exact algorithm. Moreover, we show that in a practical case in verification where weights are clustered around a constant number of values, the energy game problem can be solved in polynomial time. We also show that the problem is still as hard as in general when the clique-width is bounded or the graph is strongly ergodic, suggesting that restricting graph structures need not help."}],"conference":{"end_date":"2012-09-12","start_date":"2012-09-10","location":"Ljubljana, Slovenia","name":"ESA: European Symposium on Algorithms"},"external_id":{"arxiv":["1604.08234"]},"language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.1007/978-3-642-33090-2_27","day":"01","date_published":"2012-10-01T00:00:00Z","acknowledgement":"Supported by the Austrian Science Fund (FWF): P23499-N23, the Austrian Science Fund (FWF): S11407-N23 (RiSE), an ERC Start Grant (279307: Graph Games), and a Microsoft Faculty Fellows Award","publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"eisbn":["9783642330902"],"isbn":["9783642330896"]},"ec_funded":1,"volume":7501,"arxiv":1,"quality_controlled":"1","citation":{"mla":"Chatterjee, Krishnendu, et al. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.” <i>20th Annual European Symposium on Algorithms </i>, vol. 7501, Springer, 2012, pp. 301–12, doi:<a href=\"https://doi.org/10.1007/978-3-642-33090-2_27\">10.1007/978-3-642-33090-2_27</a>.","ama":"Chatterjee K, Henzinger M, Krinninger S, Nanongkai D. Polynomial-time algorithms for energy games with special weight structures. In: <i>20th Annual European Symposium on Algorithms </i>. Vol 7501. Springer; 2012:301-312. doi:<a href=\"https://doi.org/10.1007/978-3-642-33090-2_27\">10.1007/978-3-642-33090-2_27</a>","ista":"Chatterjee K, Henzinger M, Krinninger S, Nanongkai D. 2012. Polynomial-time algorithms for energy games with special weight structures. 20th Annual European Symposium on Algorithms . ESA: European Symposium on Algorithms, LNCS, vol. 7501, 301–312.","chicago":"Chatterjee, Krishnendu, Monika Henzinger, Sebastian Krinninger, and Danupon Nanongkai. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.” In <i>20th Annual European Symposium on Algorithms </i>, 7501:301–12. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33090-2_27\">https://doi.org/10.1007/978-3-642-33090-2_27</a>.","short":"K. Chatterjee, M. Henzinger, S. Krinninger, D. Nanongkai, in:, 20th Annual European Symposium on Algorithms , Springer, 2012, pp. 301–312.","apa":"Chatterjee, K., Henzinger, M., Krinninger, S., &#38; Nanongkai, D. (2012). Polynomial-time algorithms for energy games with special weight structures. In <i>20th Annual European Symposium on Algorithms </i> (Vol. 7501, pp. 301–312). Ljubljana, Slovenia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-33090-2_27\">https://doi.org/10.1007/978-3-642-33090-2_27</a>","ieee":"K. Chatterjee, M. Henzinger, S. Krinninger, and D. Nanongkai, “Polynomial-time algorithms for energy games with special weight structures,” in <i>20th Annual European Symposium on Algorithms </i>, Ljubljana, Slovenia, 2012, vol. 7501, pp. 301–312."},"corr_author":"1","alternative_title":["LNCS"],"related_material":{"record":[{"id":"535","status":"public","relation":"later_version"}]},"das_tickbox":"1","date_created":"2022-03-21T08:01:45Z","department":[{"_id":"KrCh"}],"scopus_import":"1","publication":"20th Annual European Symposium on Algorithms ","year":"2012","oa":1,"article_processing_charge":"No","month":"10","intvolume":"      7501","oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1604.08234"}],"author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","last_name":"Henzinger"},{"full_name":"Krinninger, Sebastian","first_name":"Sebastian","last_name":"Krinninger"},{"first_name":"Danupon","full_name":"Nanongkai, Danupon","last_name":"Nanongkai"}],"publication_status":"published"},{"fulldoi":"https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362","publist_id":"3867","file":[{"file_name":"IST-2017-805-v1+1_34.pdf","content_type":"application/pdf","access_level":"open_access","file_id":"4826","relation":"main_file","date_created":"2018-12-12T10:10:37Z","creator":"system","file_size":559069,"date_updated":"2020-07-14T12:45:52Z","checksum":"88da18d3e2cb2e5011d7d10ce38a3864"}],"language":[{"iso":"eng"}],"day":"01","date_published":"2012-12-01T00:00:00Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (3.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)"},"page":"362 - 373","license":"https://creativecommons.org/licenses/by-nc-nd/3.0/","date_updated":"2026-07-28T09:20:59Z","title":"Approximate determinization of quantitative automata","conference":{"end_date":"2012-12-17","name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science","start_date":"2012-12-15","location":"Hyderabad, India"},"file_date_updated":"2020-07-14T12:45:52Z","abstract":[{"lang":"eng","text":"Quantitative automata are nondeterministic finite automata with edge weights. They value a\r\nrun by some function from the sequence of visited weights to the reals, and value a word by its\r\nminimal/maximal run. They generalize boolean automata, and have gained much attention in\r\nrecent years. Unfortunately, important automaton classes, such as sum, discounted-sum, and\r\nlimit-average automata, cannot be determinized. Yet, the quantitative setting provides the potential\r\nof approximate determinization. We define approximate determinization with respect to\r\na distance function, and investigate this potential.\r\nWe show that sum automata cannot be determinized approximately with respect to any\r\ndistance function. However, restricting to nonnegative weights allows for approximate determinization\r\nwith respect to some distance functions.\r\nDiscounted-sum automata allow for approximate determinization, as the influence of a word’s\r\nsuffix is decaying. However, the naive approach, of unfolding the automaton computations up\r\nto a sufficient level, is shown to be doubly exponential in the discount factor. We provide an\r\nalternative construction that is singly exponential in the discount factor, in the precision, and\r\nin the number of states. We prove matching lower bounds, showing exponential dependency on\r\neach of these three parameters.\r\nAverage and limit-average automata are shown to prohibit approximate determinization with\r\nrespect to any distance function, and this is the case even for two weights, 0 and 1."}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.4230/LIPIcs.FSTTCS.2012.362","project":[{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7"}],"type":"conference","status":"public","_id":"2891","publication_status":"published","author":[{"id":"31E297B6-F248-11E8-B48F-1D18A9856A87","first_name":"Udi","full_name":"Boker, Udi","last_name":"Boker"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"ddc":["004"],"pubrep_id":"805","article_processing_charge":"No","oa":1,"year":"2012","month":"12","intvolume":"        18","oa_version":"Published Version","corr_author":"1","citation":{"short":"U. Boker, T.A. Henzinger, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 362–373.","apa":"Boker, U., &#38; Henzinger, T. A. (2012). Approximate determinization of quantitative automata. In <i>Leibniz International Proceedings in Informatics</i> (Vol. 18, pp. 362–373). Hyderabad, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362\">https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362</a>","ieee":"U. Boker and T. A. Henzinger, “Approximate determinization of quantitative automata,” in <i>Leibniz International Proceedings in Informatics</i>, Hyderabad, India, 2012, vol. 18, pp. 362–373.","chicago":"Boker, Udi, and Thomas A Henzinger. “Approximate Determinization of Quantitative Automata.” In <i>Leibniz International Proceedings in Informatics</i>, 18:362–73. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362\">https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362</a>.","ista":"Boker U, Henzinger TA. 2012. Approximate determinization of quantitative automata. Leibniz International Proceedings in Informatics. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 18, 362–373.","mla":"Boker, Udi, and Thomas A. Henzinger. “Approximate Determinization of Quantitative Automata.” <i>Leibniz International Proceedings in Informatics</i>, vol. 18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 362–73, doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362\">10.4230/LIPIcs.FSTTCS.2012.362</a>.","ama":"Boker U, Henzinger TA. Approximate determinization of quantitative automata. In: <i>Leibniz International Proceedings in Informatics</i>. Vol 18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2012:362-373. doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362\">10.4230/LIPIcs.FSTTCS.2012.362</a>"},"alternative_title":["LIPIcs"],"has_accepted_license":"1","scopus_import":"1","department":[{"_id":"ToHe"}],"date_created":"2018-12-11T12:00:10Z","das_tickbox":"1","publication":"Leibniz International Proceedings in Informatics","acknowledgement":"We thank Laurent Doyen for great ideas and valuable help in analyzing discounted-sum automata.","ec_funded":1,"volume":18,"quality_controlled":"1"},{"date_published":"2012-04-01T00:00:00Z","day":"01","fulldoi":"https://doi.org/10.1007/978-3-642-28756-5_46","language":[{"iso":"eng"}],"type":"conference","status":"public","_id":"10906","publisher":"Springer","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1007/978-3-642-28756-5_46","title":"HSF(C): A software verifier based on Horn clauses","conference":{"end_date":"2012-04-01","start_date":"2012-03-24","location":"Tallinn, Estonia","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems"},"editor":[{"last_name":"Flanagan","first_name":"Cormac","full_name":"Flanagan, Cormac"},{"last_name":"König","first_name":"Barbara","full_name":"König, Barbara"}],"abstract":[{"text":"HSF(C) is a tool that automates verification of safety and liveness properties for C programs. This paper describes the verification approach taken by HSF(C) and provides instructions on how to install and use the tool.","lang":"eng"}],"date_updated":"2026-07-28T09:23:52Z","page":"549-551","month":"04","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1007/978-3-642-28756-5_46"}],"intvolume":"      7214","oa_version":"Published Version","article_processing_charge":"No","oa":1,"year":"2012","ddc":["000"],"publication_status":"published","author":[{"last_name":"Grebenshchikov","full_name":"Grebenshchikov, Sergey","first_name":"Sergey"},{"last_name":"Gupta","full_name":"Gupta, Ashutosh","first_name":"Ashutosh","id":"335E5684-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Lopes","full_name":"Lopes, Nuno P.","first_name":"Nuno P."},{"first_name":"Corneliu","full_name":"Popeea, Corneliu","last_name":"Popeea"},{"first_name":"Andrey","full_name":"Rybalchenko, Andrey","last_name":"Rybalchenko"}],"volume":7214,"publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783642287558"],"eisbn":["9783642287565"]},"OA_type":"free access","place":"Berlin, Heidelberg","quality_controlled":"1","series_title":"LNCS","scopus_import":"1","department":[{"_id":"ToHe"}],"das_tickbox":"1","date_created":"2022-03-21T08:03:30Z","publication":"Tools and Algorithms for the Construction and Analysis of Systems","corr_author":"1","citation":{"chicago":"Grebenshchikov, Sergey, Ashutosh Gupta, Nuno P. Lopes, Corneliu Popeea, and Andrey Rybalchenko. “HSF(C): A Software Verifier Based on Horn Clauses.” In <i>Tools and Algorithms for the Construction and Analysis of Systems</i>, edited by Cormac Flanagan and Barbara König, 7214:549–51. LNCS. Berlin, Heidelberg: Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-28756-5_46\">https://doi.org/10.1007/978-3-642-28756-5_46</a>.","short":"S. Grebenshchikov, A. Gupta, N.P. Lopes, C. Popeea, A. Rybalchenko, in:, C. Flanagan, B. König (Eds.), Tools and Algorithms for the Construction and Analysis of Systems, Springer, Berlin, Heidelberg, 2012, pp. 549–551.","apa":"Grebenshchikov, S., Gupta, A., Lopes, N. P., Popeea, C., &#38; Rybalchenko, A. (2012). HSF(C): A software verifier based on Horn clauses. In C. Flanagan &#38; B. König (Eds.), <i>Tools and Algorithms for the Construction and Analysis of Systems</i> (Vol. 7214, pp. 549–551). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-642-28756-5_46\">https://doi.org/10.1007/978-3-642-28756-5_46</a>","ieee":"S. Grebenshchikov, A. Gupta, N. P. Lopes, C. Popeea, and A. Rybalchenko, “HSF(C): A software verifier based on Horn clauses,” in <i>Tools and Algorithms for the Construction and Analysis of Systems</i>, Tallinn, Estonia, 2012, vol. 7214, pp. 549–551.","ama":"Grebenshchikov S, Gupta A, Lopes NP, Popeea C, Rybalchenko A. HSF(C): A software verifier based on Horn clauses. In: Flanagan C, König B, eds. <i>Tools and Algorithms for the Construction and Analysis of Systems</i>. Vol 7214. LNCS. Berlin, Heidelberg: Springer; 2012:549-551. doi:<a href=\"https://doi.org/10.1007/978-3-642-28756-5_46\">10.1007/978-3-642-28756-5_46</a>","mla":"Grebenshchikov, Sergey, et al. “HSF(C): A Software Verifier Based on Horn Clauses.” <i>Tools and Algorithms for the Construction and Analysis of Systems</i>, edited by Cormac Flanagan and Barbara König, vol. 7214, Springer, 2012, pp. 549–51, doi:<a href=\"https://doi.org/10.1007/978-3-642-28756-5_46\">10.1007/978-3-642-28756-5_46</a>.","ista":"Grebenshchikov S, Gupta A, Lopes NP, Popeea C, Rybalchenko A. 2012. HSF(C): A software verifier based on Horn clauses. Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of SystemsLNCS, LNCS, vol. 7214, 549–551."},"alternative_title":["LNCS"]},{"author":[{"id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K","first_name":"Michael K","last_name":"Sixt"}],"article_type":"original","publication_status":"published","ddc":["570"],"year":"2012","oa":1,"article_processing_charge":"No","month":"04","issue":"3","intvolume":"       197","oa_version":"Published Version","citation":{"ista":"Sixt MK. 2012. Cell migration: Fibroblasts find a new way to get ahead. Journal of Cell Biology. 197(3), 347–349.","ama":"Sixt MK. Cell migration: Fibroblasts find a new way to get ahead. <i>Journal of Cell Biology</i>. 2012;197(3):347-349. doi:<a href=\"https://doi.org/10.1083/jcb.201204039\">10.1083/jcb.201204039</a>","mla":"Sixt, Michael K. “Cell Migration: Fibroblasts Find a New Way to Get Ahead.” <i>Journal of Cell Biology</i>, vol. 197, no. 3, Rockefeller University Press, 2012, pp. 347–49, doi:<a href=\"https://doi.org/10.1083/jcb.201204039\">10.1083/jcb.201204039</a>.","short":"M.K. Sixt, Journal of Cell Biology 197 (2012) 347–349.","ieee":"M. K. Sixt, “Cell migration: Fibroblasts find a new way to get ahead,” <i>Journal of Cell Biology</i>, vol. 197, no. 3. Rockefeller University Press, pp. 347–349, 2012.","apa":"Sixt, M. K. (2012). Cell migration: Fibroblasts find a new way to get ahead. <i>Journal of Cell Biology</i>. Rockefeller University Press. <a href=\"https://doi.org/10.1083/jcb.201204039\">https://doi.org/10.1083/jcb.201204039</a>","chicago":"Sixt, Michael K. “Cell Migration: Fibroblasts Find a New Way to Get Ahead.” <i>Journal of Cell Biology</i>. Rockefeller University Press, 2012. <a href=\"https://doi.org/10.1083/jcb.201204039\">https://doi.org/10.1083/jcb.201204039</a>."},"corr_author":"1","has_accepted_license":"1","das_tickbox":"1","date_created":"2018-12-11T11:46:51Z","scopus_import":"1","department":[{"_id":"MiSi"}],"publication":"Journal of Cell Biology","volume":197,"quality_controlled":"1","external_id":{"isi":["000303467800004"]},"language":[{"iso":"eng"}],"publist_id":"7314","fulldoi":"https://doi.org/10.1083/jcb.201204039","isi":1,"file":[{"access_level":"open_access","file_id":"5957","file_name":"2012_CellBiology_Sixt.pdf","content_type":"application/pdf","file_size":986566,"date_updated":"2020-07-14T12:46:36Z","checksum":"45c02be33ebd99fc3077d60b9c90bdfa","relation":"main_file","date_created":"2019-02-12T09:03:09Z","creator":"kschuh"}],"date_published":"2012-04-30T00:00:00Z","day":"30","tmp":{"short":"CC BY-NC-SA (3.0)","image":"/images/cc_by_nc_sa.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/3.0/legalcode","name":"Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported (CC BY-NC-SA 3.0)"},"page":"347 - 349","license":"https://creativecommons.org/licenses/by-nc-sa/3.0/","date_updated":"2026-07-28T09:22:21Z","title":"Cell migration: Fibroblasts find a new way to get ahead","file_date_updated":"2020-07-14T12:46:36Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Rockefeller University Press","doi":"10.1083/jcb.201204039","_id":"506","status":"public","type":"journal_article"},{"publication":"CONCUR 2012 - Concurrency Theory","date_created":"2022-03-21T08:00:21Z","department":[{"_id":"KrCh"}],"scopus_import":"1","alternative_title":["LNCS"],"related_material":{"record":[{"relation":"later_version","status":"public","id":"2716"}]},"citation":{"mla":"Chatterjee, Krishnendu, et al. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.” <i>CONCUR 2012 - Concurrency Theory</i>, edited by Maciej Koutny and Irek Ulidowski, vol. 7454, Springer, 2012, pp. 115–31, doi:<a href=\"https://doi.org/10.1007/978-3-642-32940-1_10\">10.1007/978-3-642-32940-1_10</a>.","ama":"Chatterjee K, Randour M, Raskin J-F. Strategy synthesis for multi-dimensional quantitative objectives. In: Koutny M, Ulidowski I, eds. <i>CONCUR 2012 - Concurrency Theory</i>. Vol 7454. Berlin, Heidelberg: Springer; 2012:115-131. doi:<a href=\"https://doi.org/10.1007/978-3-642-32940-1_10\">10.1007/978-3-642-32940-1_10</a>","ista":"Chatterjee K, Randour M, Raskin J-F. 2012. Strategy synthesis for multi-dimensional quantitative objectives. CONCUR 2012 - Concurrency Theory. CONCUR: Conference on Concurrency Theory, LNCS, vol. 7454, 115–131.","chicago":"Chatterjee, Krishnendu, Mickael Randour, and Jean-François Raskin. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.” In <i>CONCUR 2012 - Concurrency Theory</i>, edited by Maciej Koutny and Irek Ulidowski, 7454:115–31. Berlin, Heidelberg: Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-32940-1_10\">https://doi.org/10.1007/978-3-642-32940-1_10</a>.","ieee":"K. Chatterjee, M. Randour, and J.-F. Raskin, “Strategy synthesis for multi-dimensional quantitative objectives,” in <i>CONCUR 2012 - Concurrency Theory</i>, Newcastle upon Tyne, United Kingdom, 2012, vol. 7454, pp. 115–131.","apa":"Chatterjee, K., Randour, M., &#38; Raskin, J.-F. (2012). Strategy synthesis for multi-dimensional quantitative objectives. In M. Koutny &#38; I. Ulidowski (Eds.), <i>CONCUR 2012 - Concurrency Theory</i> (Vol. 7454, pp. 115–131). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-642-32940-1_10\">https://doi.org/10.1007/978-3-642-32940-1_10</a>","short":"K. Chatterjee, M. Randour, J.-F. Raskin, in:, M. Koutny, I. Ulidowski (Eds.), CONCUR 2012 - Concurrency Theory, Springer, Berlin, Heidelberg, 2012, pp. 115–131."},"corr_author":"1","arxiv":1,"place":"Berlin, Heidelberg","quality_controlled":"1","OA_place":"repository","OA_type":"green","ec_funded":1,"volume":7454,"publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"eisbn":["9783642329401"],"isbn":["9783642329395"]},"acknowledgement":"Author supported by Austrian Science Fund (FWF) Grant No P 23499-N23, FWF NFN Grant No S11407 (RiSE), ERC Start Grant (279307: Graph Games), Microsoft faculty fellowship.","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"last_name":"Randour","first_name":"Mickael","full_name":"Randour, Mickael"},{"first_name":"Jean-François","full_name":"Raskin, Jean-François","last_name":"Raskin"}],"publication_status":"published","intvolume":"      7454","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1201.5073","open_access":"1"}],"oa_version":"Preprint","month":"09","year":"2012","oa":1,"article_processing_charge":"No","abstract":[{"text":"Multi-dimensional mean-payoff and energy games provide the mathematical foundation for the quantitative study of reactive systems, and play a central role in the emerging quantitative theory of verification and synthesis. In this work, we study the strategy synthesis problem for games with such multi-dimensional objectives along with a parity condition, a canonical way to express ω-regular conditions. While in general, the winning strategies in such games may require infinite memory, for synthesis the most relevant problem is the construction of a finite-memory winning strategy (if one exists). Our main contributions are as follows. First, we show a tight exponential bound (matching upper and lower bounds) on the memory required for finite-memory winning strategies in both multi-dimensional mean-payoff and energy games along with parity objectives. This significantly improves the triple exponential upper bound for multi energy games (without parity) that could be derived from results in literature for games on VASS (vector addition systems with states). Second, we present an optimal symbolic and incremental algorithm to compute a finite-memory winning strategy (if one exists) in such games. Finally, we give a complete characterization of when finite memory of strategies can be traded off for randomness. In particular, we show that for one-dimension mean-payoff parity games, randomized memoryless strategies are as powerful as their pure finite-memory counterparts.","lang":"eng"}],"editor":[{"last_name":"Koutny","first_name":"Maciej","full_name":"Koutny, Maciej"},{"last_name":"Ulidowski","first_name":"Irek","full_name":"Ulidowski, Irek"}],"conference":{"start_date":"2012-09-04","location":"Newcastle upon Tyne, United Kingdom","name":"CONCUR: Conference on Concurrency Theory","end_date":"2012-09-07"},"title":"Strategy synthesis for multi-dimensional quantitative objectives","page":"115-131","date_updated":"2026-07-28T11:24:51Z","_id":"10904","status":"public","type":"conference","project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"doi":"10.1007/978-3-642-32940-1_10","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer","day":"15","date_published":"2012-09-15T00:00:00Z","language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.1007/978-3-642-32940-1_10","external_id":{"arxiv":["1201.5073"]}},{"date_published":"2012-03-01T00:00:00Z","day":"01","language":[{"iso":"ger"}],"publist_id":"3433","popular_science":"1","abstract":[{"lang":"eng","text":"Wie wandelt sich das Berufsbild in Wissenschaftlichen Bibliotheken? Patrick Danowski gibt seine Einschätzung ab. "}],"title":"Zwischen Technologie und Kommunikation","date_updated":"2026-07-28T09:15:13Z","page":"11","status":"public","_id":"3243","type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Büchereiverband Österreichs","ddc":["020"],"author":[{"last_name":"Danowski","orcid":"0000-0002-6026-4409","full_name":"Danowski, Patrick","first_name":"Patrick","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87"}],"article_type":"comment","publication_status":"published","intvolume":"      2012","main_file_link":[{"url":"https://www.bvoe.at/sites/default/files/2022-07/BP_1_12.pdf","open_access":"1"}],"oa_version":"Published Version","issue":"1","month":"03","year":"2012","oa":1,"article_processing_charge":"No","publication":"Büchereiperspektiven","date_created":"2018-12-11T12:02:13Z","das_tickbox":"1","department":[{"_id":"E-Lib"}],"citation":{"ama":"Danowski P. Zwischen Technologie und Kommunikation. <i>Büchereiperspektiven</i>. 2012;2012(1):11.","mla":"Danowski, Patrick. “Zwischen Technologie und Kommunikation.” <i>Büchereiperspektiven</i>, vol. 2012, no. 1, Büchereiverband Österreichs, 2012, p. 11.","ista":"Danowski P. 2012. Zwischen Technologie und Kommunikation. Büchereiperspektiven. 2012(1), 11.","chicago":"Danowski, Patrick. “Zwischen Technologie und Kommunikation.” <i>Büchereiperspektiven</i>. Büchereiverband Österreichs, 2012.","short":"P. Danowski, Büchereiperspektiven 2012 (2012) 11.","apa":"Danowski, P. (2012). Zwischen Technologie und Kommunikation. <i>Büchereiperspektiven</i>. Büchereiverband Österreichs.","ieee":"P. Danowski, “Zwischen Technologie und Kommunikation,” <i>Büchereiperspektiven</i>, vol. 2012, no. 1. Büchereiverband Österreichs, p. 11, 2012."},"corr_author":"1","OA_type":"free access","volume":2012,"publication_identifier":{"issn":["1607-7172"]}},{"department":[{"_id":"CaHe"},{"_id":"Bio"}],"scopus_import":"1","date_created":"2018-12-11T12:00:30Z","publication":"Science","corr_author":"1","citation":{"short":"M. Behrndt, G. Salbreux, P. Campinho, R. Hauschild, F. Oswald, J. Roensch, S. Grill, C.-P.J. Heisenberg, Science 338 (2012) 257–260.","ieee":"M. Behrndt <i>et al.</i>, “Forces driving epithelial spreading in zebrafish gastrulation,” <i>Science</i>, vol. 338, no. 6104. American Association for the Advancement of Science, pp. 257–260, 2012.","apa":"Behrndt, M., Salbreux, G., Campinho, P., Hauschild, R., Oswald, F., Roensch, J., … Heisenberg, C.-P. J. (2012). Forces driving epithelial spreading in zebrafish gastrulation. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.1224143\">https://doi.org/10.1126/science.1224143</a>","chicago":"Behrndt, Martin, Guillaume Salbreux, Pedro Campinho, Robert Hauschild, Felix Oswald, Julia Roensch, Stephan Grill, and Carl-Philipp J Heisenberg. “Forces Driving Epithelial Spreading in Zebrafish Gastrulation.” <i>Science</i>. American Association for the Advancement of Science, 2012. <a href=\"https://doi.org/10.1126/science.1224143\">https://doi.org/10.1126/science.1224143</a>.","ista":"Behrndt M, Salbreux G, Campinho P, Hauschild R, Oswald F, Roensch J, Grill S, Heisenberg C-PJ. 2012. Forces driving epithelial spreading in zebrafish gastrulation. Science. 338(6104), 257–260.","mla":"Behrndt, Martin, et al. “Forces Driving Epithelial Spreading in Zebrafish Gastrulation.” <i>Science</i>, vol. 338, no. 6104, American Association for the Advancement of Science, 2012, pp. 257–60, doi:<a href=\"https://doi.org/10.1126/science.1224143\">10.1126/science.1224143</a>.","ama":"Behrndt M, Salbreux G, Campinho P, et al. Forces driving epithelial spreading in zebrafish gastrulation. <i>Science</i>. 2012;338(6104):257-260. doi:<a href=\"https://doi.org/10.1126/science.1224143\">10.1126/science.1224143</a>"},"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"1403"}]},"acknowledged_ssus":[{"_id":"SSU"}],"volume":338,"OA_type":"closed access","quality_controlled":"1","acknowledgement":"We are grateful to M. Sixt, T. Bollenbach, and E. Martin-Blanco for advice and the service facilities of the IST Austria and MPI-CBG for continuous help. M.B., G.S., S.W.G., and C.-P.H. synergistically and equally developed the presented ideas and the experimental and theoretical approaches. M.B. and P.C. performed the experiments; G.S. developed the theory; and R.H., F.O., and J.R. contributed to the experimental work. This work was supported by a grant from the Fonds zur Förderung der wissenschaftlichen Forschung (FWF) and the Deutsche Forschungsgemeinschaft (DFG) (I930-B20) to C.-P.H., S.W.G., and G.S.","article_type":"original","publication_status":"published","author":[{"id":"3ECECA3A-F248-11E8-B48F-1D18A9856A87","full_name":"Behrndt, Martin","first_name":"Martin","last_name":"Behrndt"},{"last_name":"Salbreux","first_name":"Guillaume","full_name":"Salbreux, Guillaume"},{"last_name":"Campinho","full_name":"Campinho, Pedro","orcid":"0000-0002-8526-5416","first_name":"Pedro","id":"3AFBBC42-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Hauschild","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87","first_name":"Robert","orcid":"0000-0001-9843-3522","full_name":"Hauschild, Robert"},{"first_name":"Felix","full_name":"Oswald, Felix","last_name":"Oswald"},{"last_name":"Roensch","full_name":"Roensch, Julia","first_name":"Julia","id":"4220E59C-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Stephan","full_name":"Grill, Stephan","last_name":"Grill"},{"first_name":"Carl-Philipp J","orcid":"0000-0002-0912-4566","full_name":"Heisenberg, Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87","last_name":"Heisenberg"}],"month":"10","intvolume":"       338","issue":"6104","oa_version":"None","article_processing_charge":"No","year":"2012","title":"Forces driving epithelial spreading in zebrafish gastrulation","abstract":[{"text":"Contractile actomyosin rings drive various fundamental morphogenetic processes ranging from cytokinesis to wound healing. Actomyosin rings are generally thought to function by circumferential contraction. Here, we show that the spreading of the enveloping cell layer (EVL) over the yolk cell during zebrafish gastrulation is driven by a contractile actomyosin ring. In contrast to previous suggestions, we find that this ring functions not only by circumferential contraction but also by a flow-friction mechanism. This generates a pulling force through resistance against retrograde actomyosin flow. EVL spreading proceeds normally in situations where circumferential contraction is unproductive, indicating that the flow-friction mechanism is sufficient. Thus, actomyosin rings can function in epithelial morphogenesis through a combination of cable-constriction and flow-friction mechanisms.","lang":"eng"}],"pmid":1,"page":"257 - 260","date_updated":"2026-07-29T10:07:18Z","type":"journal_article","project":[{"grant_number":"I930-B20","name":"Control of Epithelial Cell Layer Spreading in Zebrafish","call_identifier":"FWF","_id":"252ABD0A-B435-11E9-9278-68D0E5697425"}],"status":"public","_id":"2950","publisher":"American Association for the Advancement of Science","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","doi":"10.1126/science.1224143","day":"12","date_published":"2012-10-12T00:00:00Z","external_id":{"isi":["000309712300046"],"pmid":["23066079"]},"publist_id":"3778","fulldoi":"https://doi.org/10.1126/science.1224143","isi":1,"language":[{"iso":"eng"}]},{"citation":{"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.","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.","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>.","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>","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>."},"related_material":{"record":[{"id":"1400","status":"public","relation":"dissertation_contains"}]},"date_created":"2018-12-11T12:01:43Z","scopus_import":"1","department":[{"_id":"KrCh"}],"publication":"Nature","ec_funded":1,"volume":486,"quality_controlled":"1","author":[{"last_name":"Diaz Jr","first_name":"Luis","full_name":"Diaz Jr, Luis"},{"first_name":"Richard","full_name":"Williams, Richard","last_name":"Williams"},{"last_name":"Wu","full_name":"Wu, Jian","first_name":"Jian"},{"last_name":"Kinde","full_name":"Kinde, Isaac","first_name":"Isaac"},{"first_name":"Joel","full_name":"Hecht, Joel","last_name":"Hecht"},{"last_name":"Berlin","full_name":"Berlin, Jordan","first_name":"Jordan"},{"last_name":"Allen","first_name":"Benjamin","full_name":"Allen, Benjamin"},{"full_name":"Božić, Ivana","first_name":"Ivana","last_name":"Božić"},{"last_name":"Reiter","id":"4A918E98-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0170-7353","full_name":"Reiter, Johannes","first_name":"Johannes"},{"full_name":"Nowak, Martin","first_name":"Martin","last_name":"Nowak"},{"full_name":"Kinzler, Kenneth","first_name":"Kenneth","last_name":"Kinzler"},{"full_name":"Oliner, Kelly","first_name":"Kelly","last_name":"Oliner"},{"first_name":"Bert","full_name":"Vogelstein, Bert","last_name":"Vogelstein"}],"publication_status":"published","oa":1,"year":"2012","article_processing_charge":"No","month":"06","intvolume":"       486","issue":"7404","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3436069/"}],"oa_version":"Submitted Version","pmid":1,"page":"537 - 540","date_updated":"2026-07-29T10:15:25Z","title":"The molecular evolution of acquired resistance to targeted EGFR blockade in colorectal cancers","abstract":[{"lang":"eng","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."}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publisher":"Nature Publishing Group","doi":"10.1038/nature11219","status":"public","_id":"3157","type":"journal_article","project":[{"grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"}],"external_id":{"isi":["000305760600044"],"pmid":["22722843"]},"language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.1038/nature11219","isi":1,"publist_id":"3537","day":"28","date_published":"2012-06-28T00:00:00Z"},{"author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-0170-7353","full_name":"Reiter, Johannes","first_name":"Johannes","id":"4A918E98-F248-11E8-B48F-1D18A9856A87","last_name":"Reiter"},{"full_name":"Nowak, Martin","first_name":"Martin","last_name":"Nowak"}],"publication_status":"published","month":"02","oa_version":"Submitted Version","intvolume":"        81","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3279759/ ","open_access":"1"}],"issue":"1","year":"2012","oa":1,"article_processing_charge":"No","date_created":"2018-12-11T12:02:19Z","department":[{"_id":"KrCh"}],"scopus_import":"1","publication":"Theoretical Population Biology","citation":{"mla":"Chatterjee, Krishnendu, et al. “Evolutionary Dynamics of Biological Auctions.” <i>Theoretical Population Biology</i>, vol. 81, no. 1, Academic Press, 2012, pp. 69–80, doi:<a href=\"https://doi.org/10.1016/j.tpb.2011.11.003\">10.1016/j.tpb.2011.11.003</a>.","ama":"Chatterjee K, Reiter J, Nowak M. Evolutionary dynamics of biological auctions. <i>Theoretical Population Biology</i>. 2012;81(1):69-80. doi:<a href=\"https://doi.org/10.1016/j.tpb.2011.11.003\">10.1016/j.tpb.2011.11.003</a>","ista":"Chatterjee K, Reiter J, Nowak M. 2012. Evolutionary dynamics of biological auctions. Theoretical Population Biology. 81(1), 69–80.","chicago":"Chatterjee, Krishnendu, Johannes Reiter, and Martin Nowak. “Evolutionary Dynamics of Biological Auctions.” <i>Theoretical Population Biology</i>. Academic Press, 2012. <a href=\"https://doi.org/10.1016/j.tpb.2011.11.003\">https://doi.org/10.1016/j.tpb.2011.11.003</a>.","apa":"Chatterjee, K., Reiter, J., &#38; Nowak, M. (2012). Evolutionary dynamics of biological auctions. <i>Theoretical Population Biology</i>. Academic Press. <a href=\"https://doi.org/10.1016/j.tpb.2011.11.003\">https://doi.org/10.1016/j.tpb.2011.11.003</a>","ieee":"K. Chatterjee, J. Reiter, and M. Nowak, “Evolutionary dynamics of biological auctions,” <i>Theoretical Population Biology</i>, vol. 81, no. 1. Academic Press, pp. 69–80, 2012.","short":"K. Chatterjee, J. Reiter, M. Nowak, Theoretical Population Biology 81 (2012) 69–80."},"corr_author":"1","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"1400"}]},"ec_funded":1,"volume":81,"quality_controlled":"1","date_published":"2012-02-01T00:00:00Z","day":"01","external_id":{"isi":["000298938200006"],"pmid":["22120126"]},"language":[{"iso":"eng"}],"publist_id":"3388","fulldoi":"https://doi.org/10.1016/j.tpb.2011.11.003","isi":1,"title":"Evolutionary dynamics of biological auctions","abstract":[{"lang":"eng","text":"Many scenarios in the living world, where individual organisms compete for winning positions (or resources), have properties of auctions. Here we study the evolution of bids in biological auctions. For each auction, n individuals are drawn at random from a population of size N. Each individual makes a bid which entails a cost. The winner obtains a benefit of a certain value. Costs and benefits are translated into reproductive success (fitness). Therefore, successful bidding strategies spread in the population. We compare two types of auctions. In “biological all-pay auctions”, the costs are the bid for every participating individual. In “biological second price all-pay auctions”, the cost for everyone other than the winner is the bid, but the cost for the winner is the second highest bid. Second price all-pay auctions are generalizations of the “war of attrition” introduced by Maynard Smith. We study evolutionary dynamics in both types of auctions. We calculate pairwise invasion plots and evolutionarily stable distributions over the continuous strategy space. We find that the average bid in second price all-pay auctions is higher than in all-pay auctions, but the average cost for the winner is similar in both auctions. In both cases, the average bid is a declining function of the number of participants, n. The more individuals participate in an auction the smaller is the chance of winning, and thus expensive bids must be avoided.\r\n"}],"pmid":1,"page":"69 - 80","date_updated":"2026-07-29T10:15:25Z","_id":"3260","status":"public","project":[{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"type":"journal_article","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publisher":"Academic Press","doi":"10.1016/j.tpb.2011.11.003"},{"OA_type":"closed access","quality_controlled":"1","volume":4,"publication_identifier":{"eissn":["1942-2466"]},"article_number":"2011MS000087","publication":"Journal of Advances in Modeling Earth Systems","scopus_import":"1","das_tickbox":"1","date_created":"2026-07-27T12:30:23Z","extern":"1","citation":{"chicago":"Fatichi, Simone, V. Y. Ivanov, and E. Caporali. “A Mechanistic Ecohydrological Model to Investigate Complex Interactions in Cold and Warm Water‐controlled Environments: 2. Spatiotemporal Analyses.” <i>Journal of Advances in Modeling Earth Systems</i>. American Geophysical Union, 2012. <a href=\"https://doi.org/10.1029/2011ms000087\">https://doi.org/10.1029/2011ms000087</a>.","apa":"Fatichi, S., Ivanov, V. Y., &#38; Caporali, E. (2012). A mechanistic ecohydrological model to investigate complex interactions in cold and warm water‐controlled environments: 2. Spatiotemporal analyses. <i>Journal of Advances in Modeling Earth Systems</i>. American Geophysical Union. <a href=\"https://doi.org/10.1029/2011ms000087\">https://doi.org/10.1029/2011ms000087</a>","ieee":"S. Fatichi, V. Y. Ivanov, and E. Caporali, “A mechanistic ecohydrological model to investigate complex interactions in cold and warm water‐controlled environments: 2. Spatiotemporal analyses,” <i>Journal of Advances in Modeling Earth Systems</i>, vol. 4, no. 2. American Geophysical Union, 2012.","short":"S. Fatichi, V.Y. Ivanov, E. Caporali, Journal of Advances in Modeling Earth Systems 4 (2012).","ama":"Fatichi S, Ivanov VY, Caporali E. A mechanistic ecohydrological model to investigate complex interactions in cold and warm water‐controlled environments: 2. Spatiotemporal analyses. <i>Journal of Advances in Modeling Earth Systems</i>. 2012;4(2). doi:<a href=\"https://doi.org/10.1029/2011ms000087\">10.1029/2011ms000087</a>","mla":"Fatichi, Simone, et al. “A Mechanistic Ecohydrological Model to Investigate Complex Interactions in Cold and Warm Water‐controlled Environments: 2. Spatiotemporal Analyses.” <i>Journal of Advances in Modeling Earth Systems</i>, vol. 4, no. 2, 2011MS000087, American Geophysical Union, 2012, doi:<a href=\"https://doi.org/10.1029/2011ms000087\">10.1029/2011ms000087</a>.","ista":"Fatichi S, Ivanov VY, Caporali E. 2012. A mechanistic ecohydrological model to investigate complex interactions in cold and warm water‐controlled environments: 2. Spatiotemporal analyses. Journal of Advances in Modeling Earth Systems. 4(2), 2011MS000087."},"oa_version":"None","intvolume":"         4","issue":"2","month":"05","article_processing_charge":"No","year":"2012","article_type":"original","publication_status":"published","author":[{"last_name":"Fatichi","id":"cf8e546b-a9b0-11f0-a43b-aa89ed1b56d6","first_name":"Simone","full_name":"Fatichi, Simone"},{"full_name":"Ivanov, V. Y.","first_name":"V. Y.","last_name":"Ivanov"},{"full_name":"Caporali, E.","first_name":"E.","last_name":"Caporali"}],"type":"journal_article","_id":"22482","status":"public","doi":"10.1029/2011ms000087","publisher":"American Geophysical Union","DOAJ_listed":"1","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","abstract":[{"text":"An ecohydrological model Tethys‐Chloris (T&amp;C) described in the companion paper is applied to two semiarid systems characterized by different climate and vegetation cover conditions. The Lucky Hills watershed in Arizona represents a typical small, “unit‐source” catchment of a desert shrub system of the U.S. southwest. Two nested basins of the Reynolds Creek Experimental watershed (Idaho, U.S.A.), the Reynolds Creek Mountain East and Tollgate catchments, are representative of a semiarid cold climate with seasonal snow cover. Both exhibit a highly non‐uniform vegetation cover. A range of ecohydrological metrics of the long‐term model performance is presented to highlight the model capabilities in reproducing hydrological and vegetation dynamics both at the plot and the watershed scales. A diverse set of observations is used to confirm the simulated dynamics. Highly satisfactory results are obtained without significant (or any) calibration efforts despite the large phase‐space dimensionality of the model, the uncertainty of imposed boundary conditions, and limited data availability. It is argued that a significant investment into the model design based on the description of physical, biophysical, and ecological processes leads to such a consistent simulation skill. The simulated patterns mimic the outcome of hydrological and vegetation dynamics with high realism, as confirmed from spatially distributed remote sensing data. Further community efforts are warranted to address the issue of thorough quantitative assessment. The current lack of appropriate data hampers the development and testing of process‐based ecohydrological models. It is further argued that the mechanistic nature of the T&amp;C model can be valuable for designing virtual experiments and developing questions of scientific inquiry at a range of spatiotemporal scales.","lang":"eng"}],"title":"A mechanistic ecohydrological model to investigate complex interactions in cold and warm water‐controlled environments: 2. Spatiotemporal analyses","date_updated":"2026-08-03T14:04:42Z","date_published":"2012-05-30T00:00:00Z","day":"30","fulldoi":"https://doi.org/10.1029/2011ms000087","language":[{"iso":"eng"}]},{"date_updated":"2026-08-06T09:54:05Z","page":"5512-5523","title":"Investigating interannual variability of precipitation at the global scale: Is there a connection with seasonality?","abstract":[{"text":"Interannual variability of precipitation can directly or indirectly affect many hydrological, ecological, and biogeochemical processes that, in turn, influence climate. Despite the significant importance of the phenomenon, few studies have attempted to elucidate spatial patterns of this variability at the global scale. This study uses land gauge precipitation records of the Global Historical Climatology Network, version 2, as well as reanalysis data to provide an assessment of the spatial organization of characteristics of precipitation interannual variability. The coefficient of variation, skewness, and short- and long-range dependence of the precipitation variability are analyzed. Among the major inferences is that the coefficient of variation of annual precipitation shows a significant correlation with intra-annual seasonality. Specifically, subyearly precipitation anomalies occurring in locations with pronounced seasonality affect the total yearly amount, imposing a higher variability in the annual precipitation fluctuations. Furthermore, the study illustrates that a positive skewness of the distribution of annual precipitation is a robust property worldwide and its magnitude is related to the coefficient of variation. Additionally, annual precipitation exhibits very weak small-lag autocorrelation. Conversely, the intensity of long-memory–long-range dependence is significantly larger than zero, hinting that organized long-term variations are an important feature of the interannual variability of precipitation.\r\n\r\n","lang":"eng"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","publisher":"American Meteorological Society","doi":"10.1175/jcli-d-11-00356.1","status":"public","_id":"22518","type":"journal_article","language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.1175/jcli-d-11-00356.1","date_published":"2012-08-15T00:00:00Z","day":"15","citation":{"short":"S. Fatichi, V.Y. Ivanov, E. Caporali, Journal of Climate 25 (2012) 5512–5523.","ieee":"S. Fatichi, V. Y. Ivanov, and E. Caporali, “Investigating interannual variability of precipitation at the global scale: Is there a connection with seasonality?,” <i>Journal of Climate</i>, vol. 25, no. 16. American Meteorological Society, pp. 5512–5523, 2012.","apa":"Fatichi, S., Ivanov, V. Y., &#38; Caporali, E. (2012). Investigating interannual variability of precipitation at the global scale: Is there a connection with seasonality? <i>Journal of Climate</i>. American Meteorological Society. <a href=\"https://doi.org/10.1175/jcli-d-11-00356.1\">https://doi.org/10.1175/jcli-d-11-00356.1</a>","chicago":"Fatichi, Simone, V. Yu. Ivanov, and E. Caporali. “Investigating Interannual Variability of Precipitation at the Global Scale: Is There a Connection with Seasonality?” <i>Journal of Climate</i>. American Meteorological Society, 2012. <a href=\"https://doi.org/10.1175/jcli-d-11-00356.1\">https://doi.org/10.1175/jcli-d-11-00356.1</a>.","ista":"Fatichi S, Ivanov VY, Caporali E. 2012. Investigating interannual variability of precipitation at the global scale: Is there a connection with seasonality? Journal of Climate. 25(16), 5512–5523.","ama":"Fatichi S, Ivanov VY, Caporali E. Investigating interannual variability of precipitation at the global scale: Is there a connection with seasonality? <i>Journal of Climate</i>. 2012;25(16):5512-5523. doi:<a href=\"https://doi.org/10.1175/jcli-d-11-00356.1\">10.1175/jcli-d-11-00356.1</a>","mla":"Fatichi, Simone, et al. “Investigating Interannual Variability of Precipitation at the Global Scale: Is There a Connection with Seasonality?” <i>Journal of Climate</i>, vol. 25, no. 16, American Meteorological Society, 2012, pp. 5512–23, doi:<a href=\"https://doi.org/10.1175/jcli-d-11-00356.1\">10.1175/jcli-d-11-00356.1</a>."},"extern":"1","das_tickbox":"1","date_created":"2026-07-27T12:30:24Z","scopus_import":"1","publication":"Journal of Climate","publication_identifier":{"issn":["0894-8755"],"eissn":["1520-0442"]},"volume":25,"quality_controlled":"1","OA_type":"closed access","author":[{"last_name":"Fatichi","id":"cf8e546b-a9b0-11f0-a43b-aa89ed1b56d6","full_name":"Fatichi, Simone","first_name":"Simone"},{"full_name":"Ivanov, V. Yu.","first_name":"V. Yu.","last_name":"Ivanov"},{"last_name":"Caporali","full_name":"Caporali, E.","first_name":"E."}],"publication_status":"published","article_type":"original","year":"2012","article_processing_charge":"No","month":"08","oa_version":"None","intvolume":"        25","issue":"16"},{"abstract":[{"lang":"eng","text":"Nestin-cre transgenic mice have been widely used to direct recombination to neural stem cells (NSCs) and intermediate neural progenitor cells (NPCs). Here we report that a readily utilized, and the only commercially available, Nestin-cre line is insufficient for directing recombination in early embryonic NSCs and NPCs. Analysis of recombination efficiency in multiple cre-dependent reporters and a genetic mosaic line revealed consistent temporal and spatial patterns of recombination in NSCs and NPCs. For comparison we utilized a knock-in Emx1cre line and found robust recombination in NSCs and NPCs in ventricular and subventricular zones of the cerebral cortices as early as embryonic day 12.5. In addition we found that the rate of Nestin-cre driven recombination only reaches sufficiently high levels in NSCs and NPCs during late embryonic and early postnatal periods. These findings are important when commercially available cre lines are considered for directing recombination to embryonic NSCs and NPCs."}],"file_date_updated":"2020-07-14T12:45:35Z","title":"A Nestin-cre transgenic mouse is insufficient for recombination in early embryonic neural progenitors","license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","date_updated":"2026-08-12T09:32:12Z","page":"1200 - 1203","_id":"2263","status":"public","type":"journal_article","doi":"10.1242/bio.20122287","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Company of Biologists","date_published":"2012-12-15T00:00:00Z","day":"15","language":[{"iso":"eng"}],"file":[{"access_level":"open_access","file_id":"4990","content_type":"application/pdf","file_name":"IST-2015-387-v1+1_1200.full.pdf","file_size":726695,"date_updated":"2020-07-14T12:45:35Z","checksum":"605a1800b81227848c361fd6ba7d22ba","date_created":"2018-12-12T10:13:09Z","relation":"main_file","creator":"system"}],"fulldoi":"https://doi.org/10.1242/bio.20122287","isi":1,"publist_id":"4682","external_id":{"isi":["000209205700005"]},"tmp":{"image":"/images/cc_by_nc_sa.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","short":"CC BY-NC-SA (4.0)","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)"},"publication":"Biology Open","date_created":"2018-12-11T11:56:38Z","scopus_import":"1","department":[{"_id":"SiHi"}],"has_accepted_license":"1","citation":{"ista":"Liang H, Hippenmeyer S, Ghashghaei H. 2012. A Nestin-cre transgenic mouse is insufficient for recombination in early embryonic neural progenitors. Biology Open. 1(12), 1200–1203.","ama":"Liang H, Hippenmeyer S, Ghashghaei H. A Nestin-cre transgenic mouse is insufficient for recombination in early embryonic neural progenitors. <i>Biology Open</i>. 2012;1(12):1200-1203. doi:<a href=\"https://doi.org/10.1242/bio.20122287\">10.1242/bio.20122287</a>","mla":"Liang, Huixuan, et al. “A Nestin-Cre Transgenic Mouse Is Insufficient for Recombination in Early Embryonic Neural Progenitors.” <i>Biology Open</i>, vol. 1, no. 12, Company of Biologists, 2012, pp. 1200–03, doi:<a href=\"https://doi.org/10.1242/bio.20122287\">10.1242/bio.20122287</a>.","short":"H. Liang, S. Hippenmeyer, H. Ghashghaei, Biology Open 1 (2012) 1200–1203.","apa":"Liang, H., Hippenmeyer, S., &#38; Ghashghaei, H. (2012). A Nestin-cre transgenic mouse is insufficient for recombination in early embryonic neural progenitors. <i>Biology Open</i>. Company of Biologists. <a href=\"https://doi.org/10.1242/bio.20122287\">https://doi.org/10.1242/bio.20122287</a>","ieee":"H. Liang, S. Hippenmeyer, and H. Ghashghaei, “A Nestin-cre transgenic mouse is insufficient for recombination in early embryonic neural progenitors,” <i>Biology Open</i>, vol. 1, no. 12. Company of Biologists, pp. 1200–1203, 2012.","chicago":"Liang, Huixuan, Simon Hippenmeyer, and H. Ghashghaei. “A Nestin-Cre Transgenic Mouse Is Insufficient for Recombination in Early Embryonic Neural Progenitors.” <i>Biology Open</i>. Company of Biologists, 2012. <a href=\"https://doi.org/10.1242/bio.20122287\">https://doi.org/10.1242/bio.20122287</a>."},"quality_controlled":"1","volume":1,"pubrep_id":"387","ddc":["576"],"author":[{"last_name":"Liang","first_name":"Huixuan","full_name":"Liang, Huixuan"},{"last_name":"Hippenmeyer","first_name":"Simon","orcid":"0000-0003-2279-1061","full_name":"Hippenmeyer, Simon","id":"37B36620-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Ghashghaei","full_name":"Ghashghaei, H.","first_name":"H."}],"publication_status":"published","oa_version":"Published Version","issue":"12","intvolume":"         1","month":"12","year":"2012","oa":1,"article_processing_charge":"No"},{"publication_status":"published","article_type":"original","author":[{"id":"cf8e546b-a9b0-11f0-a43b-aa89ed1b56d6","first_name":"Simone","full_name":"Fatichi, Simone","last_name":"Fatichi"},{"last_name":"Ivanov","first_name":"V. Y.","full_name":"Ivanov, V. Y."},{"last_name":"Caporali","full_name":"Caporali, E.","first_name":"E."}],"article_processing_charge":"No","oa":1,"year":"2012","month":"05","main_file_link":[{"url":"https://doi.org/10.1029/2011MS000086","open_access":"1"}],"intvolume":"         4","issue":"2","oa_version":"Published Version","citation":{"ista":"Fatichi S, Ivanov VY, Caporali E. 2012. A mechanistic ecohydrological model to investigate complex interactions in cold and warm water‐controlled environments: 1. Theoretical framework and plot‐scale analysis. Journal of Advances in Modeling Earth Systems. 4(2), 2011MS000086.","mla":"Fatichi, Simone, et al. “A Mechanistic Ecohydrological Model to Investigate Complex Interactions in Cold and Warm Water‐controlled Environments: 1. Theoretical Framework and Plot‐scale Analysis.” <i>Journal of Advances in Modeling Earth Systems</i>, vol. 4, no. 2, 2011MS000086, American Geophysical Union, 2012, doi:<a href=\"https://doi.org/10.1029/2011ms000086\">10.1029/2011ms000086</a>.","ama":"Fatichi S, Ivanov VY, Caporali E. A mechanistic ecohydrological model to investigate complex interactions in cold and warm water‐controlled environments: 1. Theoretical framework and plot‐scale analysis. <i>Journal of Advances in Modeling Earth Systems</i>. 2012;4(2). doi:<a href=\"https://doi.org/10.1029/2011ms000086\">10.1029/2011ms000086</a>","short":"S. Fatichi, V.Y. Ivanov, E. Caporali, Journal of Advances in Modeling Earth Systems 4 (2012).","apa":"Fatichi, S., Ivanov, V. Y., &#38; Caporali, E. (2012). A mechanistic ecohydrological model to investigate complex interactions in cold and warm water‐controlled environments: 1. Theoretical framework and plot‐scale analysis. <i>Journal of Advances in Modeling Earth Systems</i>. American Geophysical Union. <a href=\"https://doi.org/10.1029/2011ms000086\">https://doi.org/10.1029/2011ms000086</a>","ieee":"S. Fatichi, V. Y. Ivanov, and E. Caporali, “A mechanistic ecohydrological model to investigate complex interactions in cold and warm water‐controlled environments: 1. Theoretical framework and plot‐scale analysis,” <i>Journal of Advances in Modeling Earth Systems</i>, vol. 4, no. 2. American Geophysical Union, 2012.","chicago":"Fatichi, Simone, V. Y. Ivanov, and E. Caporali. “A Mechanistic Ecohydrological Model to Investigate Complex Interactions in Cold and Warm Water‐controlled Environments: 1. Theoretical Framework and Plot‐scale Analysis.” <i>Journal of Advances in Modeling Earth Systems</i>. American Geophysical Union, 2012. <a href=\"https://doi.org/10.1029/2011ms000086\">https://doi.org/10.1029/2011ms000086</a>."},"extern":"1","scopus_import":"1","date_created":"2026-07-27T12:30:24Z","das_tickbox":"1","publication":"Journal of Advances in Modeling Earth Systems","article_number":"2011MS000086","publication_identifier":{"eissn":["1942-2466"]},"volume":4,"OA_type":"gold","OA_place":"publisher","quality_controlled":"1","fulldoi":"https://doi.org/10.1029/2011ms000086","language":[{"iso":"eng"}],"date_published":"2012-05-30T00:00:00Z","day":"30","date_updated":"2026-08-12T12:02:45Z","title":"A mechanistic ecohydrological model to investigate complex interactions in cold and warm water‐controlled environments: 1. Theoretical framework and plot‐scale analysis","abstract":[{"lang":"eng","text":"Numerous studies have explored the role of vegetation in controlling and mediating hydrological states and fluxes at the level of individual processes, which has led to improvements in our understanding of plot-scale dynamics. Relatively less effort has been directed toward spatially-explicit studies of vegetation-hydrology interactions at larger scales of a landscape. Only few continuous, process-oriented ecohydrological models had been proposed with structures of varying complexity. This study contributes to their further evolution and presents a novel ecohydrological model, Tethys-Chloris. The model synthesizes the state-of-the-art knowledge on individual processes and coupling mechanisms drawn from the disciplines of hydrology, plant physiology, and ecology. Specifically, the model reproduces all essential components of the hydrological cycle: it resolves the mass and energy budgets in the atmospheric surface layer at the hourly scale, while representing up to two layers of vegetation; it includes a module of snowpack evolution; it describes the saturated and unsaturated soil water dynamics, processes of runoff generation and flow routing. The component of vegetation dynamics parameterizes life cycle processes of different plant functional types, including photosynthesis, phenology, carbon allocation, and tissue turnover. This study presents a confirmation of the long-term, plot-scale model performance by simulating two types of ecosystems corresponding to different climate conditions. A consistent and highly satisfactory model skill in reproducing the energy and water budgets as well as physiological cycles of plants with minimum calibration overhead is demonstrated. Furthermore, these applications demonstrate that the model permits the identification of data types and observation frequencies crucial for appropriate evaluation of modeled dynamics. More importantly, through a synthesis of a wide array of process representations, the model ensures that climate, soil, vegetation, and topography collectively identify essential modes controlling ecohydrological systems, i.e., that satisfactory performance is a result of appropriate mimicking of internal processes."}],"publisher":"American Geophysical Union","DOAJ_listed":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1029/2011ms000086","type":"journal_article","_id":"22538","status":"public"},{"das_tickbox":"1","date_created":"2018-12-11T12:00:35Z","scopus_import":"1","department":[{"_id":"E-Lib"}],"publication":"Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare","citation":{"chicago":"Danowski, Patrick. “Kontext Open Access: Creative Commons.” <i>Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare</i>. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, 2012.","apa":"Danowski, P. (2012). Kontext Open Access: Creative Commons. <i>Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare</i>. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare.","ieee":"P. Danowski, “Kontext Open Access: Creative Commons,” <i>Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare</i>, vol. 65, no. 2. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, pp. 200–212, 2012.","short":"P. Danowski, Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare 65 (2012) 200–212.","ama":"Danowski P. Kontext Open Access: Creative Commons. <i>Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare</i>. 2012;65(2):200-212.","mla":"Danowski, Patrick. “Kontext Open Access: Creative Commons.” <i>Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare</i>, vol. 65, no. 2, Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, 2012, pp. 200–12.","ista":"Danowski P. 2012. Kontext Open Access: Creative Commons. Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. 65(2), 200–212."},"corr_author":"1","has_accepted_license":"1","volume":65,"ddc":["020"],"pubrep_id":"95","author":[{"id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","full_name":"Danowski, Patrick","orcid":"0000-0002-6026-4409","first_name":"Patrick","last_name":"Danowski"}],"publication_status":"published","month":"09","main_file_link":[{"open_access":"1","url":" http://hdl.handle.net/10760/17625"}],"oa_version":"Published Version","intvolume":"        65","issue":"2","year":"2012","oa":1,"article_processing_charge":"No","title":"Kontext Open Access: Creative Commons","abstract":[{"text":"Dieser Artikel soll die sechs verschiedenen Creative Commons Lizenzen erläutern und ihre Bedeutung im Rahmen des wissenschaftlichen Publizierens und des Open Access erklären (CC-BY, CC-BY-SA, CC-BY-NC, CC-BY-ND, CC-BYNC-SA, CC-BY-NC-ND).","lang":"eng"}],"file_date_updated":"2020-07-14T12:45:57Z","page":"200 - 212","date_updated":"2026-08-12T14:15:14Z","status":"public","_id":"2965","type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare","day":"01","date_published":"2012-09-01T00:00:00Z","language":[{"iso":"ger"}],"popular_science":"1","file":[{"file_id":"4703","access_level":"open_access","content_type":"application/pdf","file_name":"IST-2012-95-v1+1_sp-beitrag_danowski_kontext_open_access_creative_commons.pdf","date_updated":"2020-07-14T12:45:57Z","checksum":"162eea47d9d840c26b496ba6ae4d1c09","file_size":503345,"creator":"system","date_created":"2018-12-12T10:08:42Z","relation":"main_file"}],"publist_id":"3754","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"}},{"issue":"4","intvolume":"        85","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1112.5026"}],"oa_version":"Preprint","month":"04","year":"2012","oa":1,"article_processing_charge":"No","author":[{"last_name":"Tkacik","full_name":"Tkacik, Gasper","orcid":"0000-0002-6699-1455","first_name":"Gasper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Walczak","first_name":"Aleksandra","full_name":"Walczak, Aleksandra"},{"full_name":"Bialek, William","first_name":"William","last_name":"Bialek"}],"publication_status":"published","quality_controlled":"1","arxiv":1,"volume":85,"article_number":"041903","acknowledgement":"We thank T. Gregor, E. F. Wieschaus, and, especially, C. G. Callan for helpful discussions.\r\nWork at Princeton was supported in part by NSF Grants No. PHY–0957573 and No. CCF–0939370, by NIH Grant No. R01 GM077599, and by the W. M. Keck Foundation. For part of this work, G.T. was supported in part by NSF Grant No. EF–0928048 and by the Vice Provost for Research at the University of Pennsylvania.","publication":"Physical Review E","das_tickbox":"1","date_created":"2018-12-11T12:02:20Z","department":[{"_id":"GaTk"}],"scopus_import":"1","citation":{"apa":"Tkačik, G., Walczak, A., &#38; Bialek, W. (2012). Optimizing information flow in small genetic networks. III. A self-interacting gene. <i>Physical Review E</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevE.85.041903\">https://doi.org/10.1103/PhysRevE.85.041903</a>","ieee":"G. Tkačik, A. Walczak, and W. Bialek, “Optimizing information flow in small genetic networks. III. A self-interacting gene,” <i>Physical Review E</i>, vol. 85, no. 4. American Physical Society, 2012.","short":"G. Tkačik, A. Walczak, W. Bialek, Physical Review E 85 (2012).","chicago":"Tkačik, Gašper, Aleksandra Walczak, and William Bialek. “Optimizing Information Flow in Small Genetic Networks. III. A Self-Interacting Gene.” <i>Physical Review E</i>. American Physical Society, 2012. <a href=\"https://doi.org/10.1103/PhysRevE.85.041903\">https://doi.org/10.1103/PhysRevE.85.041903</a>.","ista":"Tkačik G, Walczak A, Bialek W. 2012. Optimizing information flow in small genetic networks. III. A self-interacting gene. Physical Review E. 85(4), 041903.","mla":"Tkačik, Gašper, et al. “Optimizing Information Flow in Small Genetic Networks. III. A Self-Interacting Gene.” <i>Physical Review E</i>, vol. 85, no. 4, 041903, American Physical Society, 2012, doi:<a href=\"https://doi.org/10.1103/PhysRevE.85.041903\">10.1103/PhysRevE.85.041903</a>.","ama":"Tkačik G, Walczak A, Bialek W. Optimizing information flow in small genetic networks. III. A self-interacting gene. <i>Physical Review E</i>. 2012;85(4). doi:<a href=\"https://doi.org/10.1103/PhysRevE.85.041903\">10.1103/PhysRevE.85.041903</a>"},"corr_author":"1","date_published":"2012-04-01T00:00:00Z","day":"01","language":[{"iso":"eng"}],"isi":1,"fulldoi":"https://doi.org/10.1103/PhysRevE.85.041903","publist_id":"3386","external_id":{"arxiv":["1112.5026"],"isi":["000302410200006"]},"_id":"3262","status":"public","type":"journal_article","doi":"10.1103/PhysRevE.85.041903","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"American Physical Society","abstract":[{"lang":"eng","text":"Living cells must control the reading out or &quot;expression&quot; of information encoded in their genomes, and this regulation often is mediated by transcription factors--proteins that bind to DNA and either enhance or repress the expression of nearby genes. But the expression of transcription factor proteins is itself regulated, and many transcription factors regulate their own expression in addition to responding to other input signals. Here we analyze the simplest of such self-regulatory circuits, asking how parameters can be chosen to optimize information transmission from inputs to outputs in the steady state. Some nonzero level of self-regulation is almost always optimal, with self-activation dominant when transcription factor concentrations are low and self-repression dominant when concentrations are high. In steady state the optimal self-activation is never strong enough to induce bistability, although there is a limit in which the optimal parameters are very close to the critical point."}],"title":"Optimizing information flow in small genetic networks. III. A self-interacting gene","date_updated":"2026-08-12T14:29:02Z"},{"author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"full_name":"Prabhu, Vinayak","first_name":"Vinayak","last_name":"Prabhu"}],"publication_status":"published","oa":1,"year":"2012","article_processing_charge":"No","main_file_link":[{"url":"http://arxiv.org/abs/1207.7019","open_access":"1"}],"oa_version":"Preprint","month":"10","citation":{"ieee":"K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Finite automata with time delay blocks,” in <i>Proceedings of the 10th ACM international conference on Embedded software</i>, Tampere, Finland, 2012, pp. 43–52.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Prabhu, V. (2012). Finite automata with time delay blocks. In <i>Proceedings of the 10th ACM international conference on Embedded software</i> (pp. 43–52). Tampere, Finland: ACM. <a href=\"https://doi.org/10.1145/2380356.2380370\">https://doi.org/10.1145/2380356.2380370</a>","short":"K. Chatterjee, T.A. Henzinger, V. Prabhu, in:, Proceedings of the 10th ACM International Conference on Embedded Software, ACM, 2012, pp. 43–52.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Finite Automata with Time Delay Blocks.” In <i>Proceedings of the 10th ACM International Conference on Embedded Software</i>, 43–52. ACM, 2012. <a href=\"https://doi.org/10.1145/2380356.2380370\">https://doi.org/10.1145/2380356.2380370</a>.","ista":"Chatterjee K, Henzinger TA, Prabhu V. 2012. Finite automata with time delay blocks. Proceedings of the 10th ACM international conference on Embedded software. EMSOFT: Embedded Software , 43–52.","mla":"Chatterjee, Krishnendu, et al. “Finite Automata with Time Delay Blocks.” <i>Proceedings of the 10th ACM International Conference on Embedded Software</i>, ACM, 2012, pp. 43–52, doi:<a href=\"https://doi.org/10.1145/2380356.2380370\">10.1145/2380356.2380370</a>.","ama":"Chatterjee K, Henzinger TA, Prabhu V. Finite automata with time delay blocks. In: <i>Proceedings of the 10th ACM International Conference on Embedded Software</i>. ACM; 2012:43-52. doi:<a href=\"https://doi.org/10.1145/2380356.2380370\">10.1145/2380356.2380370</a>"},"publication":"Proceedings of the 10th ACM international conference on Embedded software","date_created":"2018-12-11T12:00:26Z","scopus_import":"1","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"acknowledgement":"This work has been financially supported in part by the European Commission FP7-ICT Cognitive Systems, Interaction, and Robotics under the contract # 270180 (NOPTILUS); by Fundacao para Ciencia e Tecnologia under project PTDC/EEA-CRO/104901/2008 (Modeling and control of Networked vehicle systems in persistent autonomous operations); by Austrian Science Fund (FWF) Grant No P 23499-N23 on Modern Graph Algorithmic Techniques in Formal Verification; FWF NFN Grant No S11407-N23 (RiSE); ERC Start grant (279307: Graph Games); Microsoft faculty fellows award; ERC Advanced grant QUAREM; and FWF Grant No S11403-N23 (RiSE).","quality_controlled":"1","arxiv":1,"ec_funded":1,"language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.1145/2380356.2380370","publist_id":"3799","external_id":{"arxiv":["1207.7019"]},"date_published":"2012-10-01T00:00:00Z","day":"01","page":"43 - 52","date_updated":"2026-08-12T14:34:15Z","abstract":[{"lang":"eng","text":"The notion of delays arises naturally in many computational models, such as, in the design of circuits, control systems, and dataflow languages. In this work, we introduce automata with delay blocks (ADBs), extending finite state automata with variable time delay blocks, for deferring individual transition output symbols, in a discrete-time setting. We show that the ADB languages strictly subsume the regular languages, and are incomparable in expressive power to the context-free languages. We show that ADBs are closed under union, concatenation and Kleene star, and under intersection with regular languages, but not closed under complementation and intersection with other ADB languages. We show that the emptiness and the membership problems are decidable in polynomial time for ADBs, whereas the universality problem is undecidable. Finally we consider the linear-time model checking problem, i.e., whether the language of an ADB is contained in a regular language, and show that the model checking problem is PSPACE-complete. Copyright 2012 ACM."}],"conference":{"end_date":"2012-10-12","location":"Tampere, Finland","start_date":"2012-10-07","name":"EMSOFT: Embedded Software "},"title":"Finite automata with time delay blocks","doi":"10.1145/2380356.2380370","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"ACM","status":"public","_id":"2936","project":[{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"}],"type":"conference"},{"day":"01","date_published":"2011-06-01T00:00:00Z","language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.1007/978-3-642-20844-7_22","abstract":[{"lang":"eng","text":"This paper presents a method to create a model of an articulated object using the planar motion in an initialization video. The model consists of rigid parts connected by points of articulation. The rigid parts are described by the positions of salient feature-points tracked throughout the video. Following a filtering step that identifies points that belong to different objects, rigid parts are found by a grouping process in a graph pyramid. Valid articulation points are selected by verifying multiple hypotheses for each pair of parts."}],"conference":{"name":"GbRPR: Graph-based Representations in Pattern Recognition","location":"Münster, Germany","start_date":"2011-05-18","end_date":"2011-05-20"},"editor":[{"first_name":"Xiaoyi","full_name":"Jiang, Xiaoyi","last_name":"Jiang"},{"full_name":"Ferrer, Miquel","first_name":"Miquel","last_name":"Ferrer"},{"full_name":"Torsello, Andrea","first_name":"Andrea","last_name":"Torsello"}],"title":"Spatio-temporal extraction of articulated models in a graph pyramid","page":"215-224","date_updated":"2024-10-09T21:02:32Z","status":"public","_id":"10907","type":"conference","doi":"10.1007/978-3-642-20844-7_22","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"Springer","author":[{"last_name":"Artner","first_name":"Nicole M.","full_name":"Artner, Nicole M."},{"last_name":"Ion","full_name":"Ion, Adrian","first_name":"Adrian","id":"29F89302-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kropatsch","first_name":"Walter G.","full_name":"Kropatsch, Walter G."}],"publication_status":"published","intvolume":"      6658","oa_version":"None","month":"06","year":"2011","article_processing_charge":"No","publication":"Graph-Based Representations in Pattern Recognition","date_created":"2022-03-21T08:08:35Z","scopus_import":"1","department":[{"_id":"HeEd"}],"alternative_title":["LNCS"],"citation":{"short":"N.M. Artner, A. Ion, W.G. Kropatsch, in:, X. Jiang, M. Ferrer, A. Torsello (Eds.), Graph-Based Representations in Pattern Recognition, Springer, Berlin, Heidelberg, 2011, pp. 215–224.","apa":"Artner, N. M., Ion, A., &#38; Kropatsch, W. G. (2011). Spatio-temporal extraction of articulated models in a graph pyramid. In X. Jiang, M. Ferrer, &#38; A. Torsello (Eds.), <i>Graph-Based Representations in Pattern Recognition</i> (Vol. 6658, pp. 215–224). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-642-20844-7_22\">https://doi.org/10.1007/978-3-642-20844-7_22</a>","ieee":"N. M. Artner, A. Ion, and W. G. Kropatsch, “Spatio-temporal extraction of articulated models in a graph pyramid,” in <i>Graph-Based Representations in Pattern Recognition</i>, Münster, Germany, 2011, vol. 6658, pp. 215–224.","chicago":"Artner, Nicole M., Adrian Ion, and Walter G. Kropatsch. “Spatio-Temporal Extraction of Articulated Models in a Graph Pyramid.” In <i>Graph-Based Representations in Pattern Recognition</i>, edited by Xiaoyi Jiang, Miquel Ferrer, and Andrea Torsello, 6658:215–24. LNIP. Berlin, Heidelberg: Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-20844-7_22\">https://doi.org/10.1007/978-3-642-20844-7_22</a>.","ista":"Artner NM, Ion A, Kropatsch WG. 2011. Spatio-temporal extraction of articulated models in a graph pyramid. Graph-Based Representations in Pattern Recognition. GbRPR: Graph-based Representations in Pattern RecognitionLNIP, LNCS, vol. 6658, 215–224.","ama":"Artner NM, Ion A, Kropatsch WG. Spatio-temporal extraction of articulated models in a graph pyramid. In: Jiang X, Ferrer M, Torsello A, eds. <i>Graph-Based Representations in Pattern Recognition</i>. Vol 6658. LNIP. Berlin, Heidelberg: Springer; 2011:215-224. doi:<a href=\"https://doi.org/10.1007/978-3-642-20844-7_22\">10.1007/978-3-642-20844-7_22</a>","mla":"Artner, Nicole M., et al. “Spatio-Temporal Extraction of Articulated Models in a Graph Pyramid.” <i>Graph-Based Representations in Pattern Recognition</i>, edited by Xiaoyi Jiang et al., vol. 6658, Springer, 2011, pp. 215–24, doi:<a href=\"https://doi.org/10.1007/978-3-642-20844-7_22\">10.1007/978-3-642-20844-7_22</a>."},"corr_author":"1","place":"Berlin, Heidelberg","quality_controlled":"1","volume":6658,"publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783642208430"],"eisbn":["9783642208447"]},"acknowledgement":"This work has been partially supported by the Austrian Science Fund under grants S9103-N13 and P18716-N13.","series_title":"LNIP"},{"publisher":"Rockefeller University Press","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1083/jcb.201012154","type":"journal_article","status":"public","_id":"11094","pmid":1,"date_updated":"2024-10-14T11:26:10Z","page":"27-37","title":"POM121 and Sun1 play a role in early steps of interphase NPC assembly","abstract":[{"text":"Nuclear pore complexes (NPCs) assemble at the end of mitosis during nuclear envelope (NE) reformation and into an intact NE as cells progress through interphase. Although recent studies have shown that NPC formation occurs by two different molecular mechanisms at two distinct cell cycle stages, little is known about the molecular players that mediate the fusion of the outer and inner nuclear membranes to form pores. In this paper, we provide evidence that the transmembrane nucleoporin (Nup), POM121, but not the Nup107–160 complex, is present at new pore assembly sites at a time that coincides with inner nuclear membrane (INM) and outer nuclear membrane (ONM) fusion. Overexpression of POM121 resulted in juxtaposition of the INM and ONM. Additionally, Sun1, an INM protein that is known to interact with the cytoskeleton, was specifically required for interphase assembly and localized with POM121 at forming pores. We propose a model in which POM121 and Sun1 interact transiently to promote early steps of interphase NPC assembly.","lang":"eng"}],"keyword":["Cell Biology"],"external_id":{"pmid":["21727197"]},"fulldoi":"https://doi.org/10.1083/jcb.201012154","language":[{"iso":"eng"}],"day":"04","date_published":"2011-07-04T00:00:00Z","publication_identifier":{"issn":["0021-9525"],"eissn":["1540-8140"]},"volume":194,"quality_controlled":"1","citation":{"apa":"Talamas, J. A., &#38; Hetzer, M. (2011). POM121 and Sun1 play a role in early steps of interphase NPC assembly. <i>Journal of Cell Biology</i>. Rockefeller University Press. <a href=\"https://doi.org/10.1083/jcb.201012154\">https://doi.org/10.1083/jcb.201012154</a>","ieee":"J. A. Talamas and M. Hetzer, “POM121 and Sun1 play a role in early steps of interphase NPC assembly,” <i>Journal of Cell Biology</i>, vol. 194, no. 1. Rockefeller University Press, pp. 27–37, 2011.","short":"J.A. Talamas, M. Hetzer, Journal of Cell Biology 194 (2011) 27–37.","chicago":"Talamas, Jessica A., and Martin Hetzer. “POM121 and Sun1 Play a Role in Early Steps of Interphase NPC Assembly.” <i>Journal of Cell Biology</i>. Rockefeller University Press, 2011. <a href=\"https://doi.org/10.1083/jcb.201012154\">https://doi.org/10.1083/jcb.201012154</a>.","ista":"Talamas JA, Hetzer M. 2011. POM121 and Sun1 play a role in early steps of interphase NPC assembly. Journal of Cell Biology. 194(1), 27–37.","ama":"Talamas JA, Hetzer M. POM121 and Sun1 play a role in early steps of interphase NPC assembly. <i>Journal of Cell Biology</i>. 2011;194(1):27-37. doi:<a href=\"https://doi.org/10.1083/jcb.201012154\">10.1083/jcb.201012154</a>","mla":"Talamas, Jessica A., and Martin Hetzer. “POM121 and Sun1 Play a Role in Early Steps of Interphase NPC Assembly.” <i>Journal of Cell Biology</i>, vol. 194, no. 1, Rockefeller University Press, 2011, pp. 27–37, doi:<a href=\"https://doi.org/10.1083/jcb.201012154\">10.1083/jcb.201012154</a>."},"extern":"1","scopus_import":"1","date_created":"2022-04-07T07:52:18Z","publication":"Journal of Cell Biology","article_processing_charge":"No","year":"2011","oa":1,"month":"07","issue":"1","intvolume":"       194","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1083/jcb.201012154"}],"oa_version":"Published Version","article_type":"original","publication_status":"published","author":[{"first_name":"Jessica A.","full_name":"Talamas, Jessica A.","last_name":"Talamas"},{"full_name":"HETZER, Martin W","orcid":"0000-0002-2111-992X","first_name":"Martin W","id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed","last_name":"HETZER"}]},{"quality_controlled":"1","volume":23,"publication_identifier":{"issn":["0955-0674"]},"extern":"1","citation":{"ista":"Hetzer M, Cavalli G. 2011. Editorial overview. Current Opinion in Cell Biology. 23(3), 255–257.","mla":"Hetzer, Martin, and Giacomo Cavalli. “Editorial Overview.” <i>Current Opinion in Cell Biology</i>, vol. 23, no. 3, Elsevier, 2011, pp. 255–57, doi:<a href=\"https://doi.org/10.1016/j.ceb.2011.04.013\">10.1016/j.ceb.2011.04.013</a>.","ama":"Hetzer M, Cavalli G. Editorial overview. <i>Current Opinion in Cell Biology</i>. 2011;23(3):255-257. doi:<a href=\"https://doi.org/10.1016/j.ceb.2011.04.013\">10.1016/j.ceb.2011.04.013</a>","ieee":"M. Hetzer and G. Cavalli, “Editorial overview,” <i>Current Opinion in Cell Biology</i>, vol. 23, no. 3. Elsevier, pp. 255–257, 2011.","apa":"Hetzer, M., &#38; Cavalli, G. (2011). Editorial overview. <i>Current Opinion in Cell Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ceb.2011.04.013\">https://doi.org/10.1016/j.ceb.2011.04.013</a>","short":"M. Hetzer, G. Cavalli, Current Opinion in Cell Biology 23 (2011) 255–257.","chicago":"Hetzer, Martin, and Giacomo Cavalli. “Editorial Overview.” <i>Current Opinion in Cell Biology</i>. Elsevier, 2011. <a href=\"https://doi.org/10.1016/j.ceb.2011.04.013\">https://doi.org/10.1016/j.ceb.2011.04.013</a>."},"publication":"Current Opinion in Cell Biology","scopus_import":"1","date_created":"2022-04-07T07:52:27Z","article_processing_charge":"No","year":"2011","intvolume":"        23","oa_version":"None","issue":"3","month":"06","publication_status":"published","article_type":"letter_note","author":[{"id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed","orcid":"0000-0002-2111-992X","full_name":"HETZER, Martin W","first_name":"Martin W","last_name":"HETZER"},{"last_name":"Cavalli","first_name":"Giacomo","full_name":"Cavalli, Giacomo"}],"doi":"10.1016/j.ceb.2011.04.013","publisher":"Elsevier","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","status":"public","_id":"11095","date_updated":"2024-10-14T11:26:20Z","page":"255-257","pmid":1,"title":"Editorial overview","keyword":["Cell Biology"],"fulldoi":"https://doi.org/10.1016/j.ceb.2011.04.013","language":[{"iso":"eng"}],"external_id":{"pmid":["21592757"]},"day":"01","date_published":"2011-06-01T00:00:00Z"},{"keyword":["Cell Biology"],"language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.1016/j.ceb.2010.09.008","external_id":{"pmid":["21030234"]},"day":"01","date_published":"2011-02-01T00:00:00Z","doi":"10.1016/j.ceb.2010.09.008","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Elsevier","status":"public","_id":"11096","type":"journal_article","date_updated":"2024-10-14T11:26:31Z","page":"65-70","pmid":1,"abstract":[{"lang":"eng","text":"As the gatekeepers of the eukaryotic cell nucleus, nuclear pore complexes (NPCs) mediate all molecular trafficking between the nucleoplasm and the cytoplasm. In recent years, transport-independent functions of NPC components, nucleoporins, have been identified including roles in chromatin organization and gene regulation. Here, we summarize our current view of the NPC as a dynamic hub for the integration of chromatin regulation and nuclear trafficking and discuss the functional interplay between nucleoporins and the nuclear genome."}],"title":"Functional interactions between nucleoporins and chromatin","year":"2011","article_processing_charge":"No","oa_version":"None","intvolume":"        23","issue":"1","month":"02","author":[{"full_name":"Liang, Yun","first_name":"Yun","last_name":"Liang"},{"last_name":"HETZER","id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed","full_name":"HETZER, Martin W","orcid":"0000-0002-2111-992X","first_name":"Martin W"}],"publication_status":"published","article_type":"original","quality_controlled":"1","volume":23,"publication_identifier":{"issn":["0955-0674"]},"extern":"1","citation":{"short":"Y. Liang, M. Hetzer, Current Opinion in Cell Biology 23 (2011) 65–70.","apa":"Liang, Y., &#38; Hetzer, M. (2011). Functional interactions between nucleoporins and chromatin. <i>Current Opinion in Cell Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ceb.2010.09.008\">https://doi.org/10.1016/j.ceb.2010.09.008</a>","ieee":"Y. Liang and M. Hetzer, “Functional interactions between nucleoporins and chromatin,” <i>Current Opinion in Cell Biology</i>, vol. 23, no. 1. Elsevier, pp. 65–70, 2011.","chicago":"Liang, Yun, and Martin Hetzer. “Functional Interactions between Nucleoporins and Chromatin.” <i>Current Opinion in Cell Biology</i>. Elsevier, 2011. <a href=\"https://doi.org/10.1016/j.ceb.2010.09.008\">https://doi.org/10.1016/j.ceb.2010.09.008</a>.","ista":"Liang Y, Hetzer M. 2011. Functional interactions between nucleoporins and chromatin. Current Opinion in Cell Biology. 23(1), 65–70.","ama":"Liang Y, Hetzer M. Functional interactions between nucleoporins and chromatin. <i>Current Opinion in Cell Biology</i>. 2011;23(1):65-70. doi:<a href=\"https://doi.org/10.1016/j.ceb.2010.09.008\">10.1016/j.ceb.2010.09.008</a>","mla":"Liang, Yun, and Martin Hetzer. “Functional Interactions between Nucleoporins and Chromatin.” <i>Current Opinion in Cell Biology</i>, vol. 23, no. 1, Elsevier, 2011, pp. 65–70, doi:<a href=\"https://doi.org/10.1016/j.ceb.2010.09.008\">10.1016/j.ceb.2010.09.008</a>."},"publication":"Current Opinion in Cell Biology","date_created":"2022-04-07T07:52:37Z","scopus_import":"1"}]