[{"fulldoi":"https://doi.org/10.15479/AT:IST-2011-0007","has_accepted_license":"1","alternative_title":["IST Austria Technical Report"],"date_published":"2011-07-05T00:00:00Z","file_date_updated":"2020-07-14T12:46:39Z","publication_status":"published","year":"2011","ddc":["000","005"],"doi":"10.15479/AT:IST-2011-0007","file":[{"file_id":"5488","file_size":574055,"file_name":"IST-2011-0007_IST-2011-0007.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:46:39Z","date_created":"2018-12-12T11:53:27Z","checksum":"06bf6dfc97f6006e3fd0e9a3f31bc961","relation":"main_file","creator":"system","access_level":"open_access"}],"publisher":"IST Austria","month":"07","department":[{"_id":"KrCh"}],"day":"05","oa":1,"pubrep_id":"17","date_updated":"2026-07-07T14:01:25Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"status":"public","relation":"later_version","id":"1903"},{"relation":"later_version","id":"2955","status":"public"},{"relation":"later_version","id":"2211","status":"public"}]},"page":"43","citation":{"apa":"Chatterjee, K., &#38; Doyen, L. (2011). <i>Partial-observation stochastic games: How to win when belief fails</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2011-0007\">https://doi.org/10.15479/AT:IST-2011-0007</a>","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. <i>Partial-Observation Stochastic Games: How to Win When Belief Fails</i>. IST Austria, 2011. <a href=\"https://doi.org/10.15479/AT:IST-2011-0007\">https://doi.org/10.15479/AT:IST-2011-0007</a>.","ista":"Chatterjee K, Doyen L. 2011. Partial-observation stochastic games: How to win when belief fails, IST Austria, 43p.","ieee":"K. Chatterjee and L. Doyen, <i>Partial-observation stochastic games: How to win when belief fails</i>. IST Austria, 2011.","short":"K. Chatterjee, L. Doyen, Partial-Observation Stochastic Games: How to Win When Belief Fails, IST Austria, 2011.","ama":"Chatterjee K, Doyen L. <i>Partial-Observation Stochastic Games: How to Win When Belief Fails</i>. IST Austria; 2011. doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0007\">10.15479/AT:IST-2011-0007</a>","mla":"Chatterjee, Krishnendu, and Laurent Doyen. <i>Partial-Observation Stochastic Games: How to Win When Belief Fails</i>. IST Austria, 2011, doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0007\">10.15479/AT:IST-2011-0007</a>."},"type":"technical_report","oa_version":"Published Version","abstract":[{"lang":"eng","text":"In two-player finite-state stochastic games of partial obser- vation on graphs, in every state of the graph, the players simultaneously choose an action, and their joint actions determine a probability distri- bution over the successor states. The game is played for infinitely many rounds and thus the players construct an infinite path in the graph. We consider reachability objectives where the first player tries to ensure a target state to be visited almost-surely (i.e., with probability 1) or pos- itively (i.e., with positive probability), no matter the strategy of the second player.\r\n\r\nWe classify such games according to the information and to the power of randomization available to the players. On the basis of information, the game can be one-sided with either (a) player 1, or (b) player 2 having partial observation (and the other player has perfect observation), or two- sided with (c) both players having partial observation. On the basis of randomization, (a) the players may not be allowed to use randomization (pure strategies), or (b) they may choose a probability distribution over actions but the actual random choice is external and not visible to the player (actions invisible), or (c) they may use full randomization.\r\n\r\nOur main results for pure strategies are as follows: (1) For one-sided games with player 2 perfect observation we show that (in contrast to full randomized strategies) belief-based (subset-construction based) strate- gies are not sufficient, and present an exponential upper bound on mem- ory both for almost-sure and positive winning strategies; we show that the problem of deciding the existence of almost-sure and positive winning strategies for player 1 is EXPTIME-complete and present symbolic algo- rithms that avoid the explicit exponential construction. (2) For one-sided games with player 1 perfect observation we show that non-elementary memory is both necessary and sufficient for both almost-sure and posi- tive winning strategies. (3) We show that for the general (two-sided) case finite-memory strategies are sufficient for both positive and almost-sure winning, and at least non-elementary memory is required. We establish the equivalence of the almost-sure winning problems for pure strategies and for randomized strategies with actions invisible. Our equivalence re- sult exhibit serious flaws in previous results in the literature: we show a non-elementary memory lower bound for almost-sure winning whereas an exponential upper bound was previously claimed."}],"title":"Partial-observation stochastic games: How to win when belief fails","_id":"5381","status":"public","date_created":"2018-12-12T11:39:00Z","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2664-1690"]}},{"ddc":["000","005"],"intvolume":"        33","year":"2011","quality_controlled":"1","publication_status":"published","article_processing_charge":"No","file_date_updated":"2020-07-14T12:46:09Z","date_published":"2011-07-01T00:00:00Z","has_accepted_license":"1","fulldoi":"https://doi.org/10.1145/1985342.1985345","das_tickbox":"1","pubrep_id":"85","oa":1,"day":"01","month":"07","department":[{"_id":"ToHe"}],"publisher":"ACM","external_id":{"isi":["000292766400003"]},"article_number":"14","isi":1,"file":[{"date_created":"2018-12-12T10:16:45Z","checksum":"5d44a8aa81e33210649beae507602138","access_level":"open_access","relation":"main_file","creator":"system","file_id":"5235","content_type":"application/pdf","date_updated":"2020-07-14T12:46:09Z","file_name":"IST-2012-85-v1+1_A_theory_of_synchronous_relational_interfaces.pdf","file_size":775662}],"doi":"10.1145/1985342.1985345","volume":33,"author":[{"first_name":"Stavros","last_name":"Tripakis","full_name":"Tripakis, Stavros"},{"full_name":"Lickly, Ben","last_name":"Lickly","first_name":"Ben"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Edward","last_name":"Lee","full_name":"Lee, Edward"}],"status":"public","date_created":"2018-12-11T12:02:51Z","_id":"3353","title":"A theory of synchronous relational interfaces","abstract":[{"lang":"eng","text":"Compositional theories are crucial when designing large and complex systems from smaller components. In this work we propose such a theory for synchronous concurrent systems. Our approach follows so-called interface theories, which use game-theoretic interpretations of composition and refinement. These are appropriate for systems with distinct inputs and outputs, and explicit conditions on inputs that must be enforced during composition. Our interfaces model systems that execute in an infinite sequence of synchronous rounds. At each round, a contract must be satisfied. The contract is simply a relation specifying the set of valid input/output pairs. Interfaces can be composed by parallel, serial or feedback composition. A refinement relation between interfaces is defined, and shown to have two main properties: (1) it is preserved by composition, and (2) it is equivalent to substitutability, namely, the ability to replace an interface by another one in any context. Shared refinement and abstraction operators, corresponding to greatest lower and least upper bounds with respect to refinement, are also defined. Input-complete interfaces, that impose no restrictions on inputs, and deterministic interfaces, that produce a unique output for any legal input, are discussed as special cases, and an interesting duality between the two classes is exposed. A number of illustrative examples are provided, as well as algorithms to compute compositions, check refinement, and so on, for finite-state interfaces."}],"oa_version":"Submitted Version","type":"journal_article","project":[{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543"},{"grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Design for Embedded Systems"},{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling"},{"grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","name":"Moderne Concurrency Paradigms","call_identifier":"FWF"}],"citation":{"ama":"Tripakis S, Lickly B, Henzinger TA, Lee E. A theory of synchronous relational interfaces. <i>ACM Transactions on Programming Languages and Systems</i>. 2011;33(4). doi:<a href=\"https://doi.org/10.1145/1985342.1985345\">10.1145/1985342.1985345</a>","mla":"Tripakis, Stavros, et al. “A Theory of Synchronous Relational Interfaces.” <i>ACM Transactions on Programming Languages and Systems</i>, vol. 33, no. 4, 14, ACM, 2011, doi:<a href=\"https://doi.org/10.1145/1985342.1985345\">10.1145/1985342.1985345</a>.","ista":"Tripakis S, Lickly B, Henzinger TA, Lee E. 2011. A theory of synchronous relational interfaces. ACM Transactions on Programming Languages and Systems. 33(4), 14.","ieee":"S. Tripakis, B. Lickly, T. A. Henzinger, and E. Lee, “A theory of synchronous relational interfaces,” <i>ACM Transactions on Programming Languages and Systems</i>, vol. 33, no. 4. ACM, 2011.","short":"S. Tripakis, B. Lickly, T.A. Henzinger, E. Lee, ACM Transactions on Programming Languages and Systems 33 (2011).","chicago":"Tripakis, Stavros, Ben Lickly, Thomas A Henzinger, and Edward Lee. “A Theory of Synchronous Relational Interfaces.” <i>ACM Transactions on Programming Languages and Systems</i>. ACM, 2011. <a href=\"https://doi.org/10.1145/1985342.1985345\">https://doi.org/10.1145/1985342.1985345</a>.","apa":"Tripakis, S., Lickly, B., Henzinger, T. A., &#38; Lee, E. (2011). A theory of synchronous relational interfaces. <i>ACM Transactions on Programming Languages and Systems</i>. ACM. <a href=\"https://doi.org/10.1145/1985342.1985345\">https://doi.org/10.1145/1985342.1985345</a>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-07-07T14:03:34Z","issue":"4","scopus_import":"1","publication":"ACM Transactions on Programming Languages and Systems","ec_funded":1,"language":[{"iso":"eng"}],"publist_id":"3263"},{"das_tickbox":"1","fulldoi":"https://doi.org/10.1145/1970398.1970404","date_published":"2011-07-04T00:00:00Z","article_processing_charge":"No","publication_status":"published","quality_controlled":"1","year":"2011","intvolume":"        12","volume":12,"doi":"10.1145/1970398.1970404","isi":1,"article_number":"28","external_id":{"isi":["000296202300006"]},"publisher":"ACM","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"month":"07","day":"04","corr_author":"1","date_updated":"2026-07-07T14:02:38Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"status":"public","id":"2054","relation":"later_version"}]},"citation":{"short":"K. Chatterjee, L. De Alfaro, T.A. Henzinger, ACM Transactions on Computational Logic 12 (2011).","ieee":"K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “Qualitative concurrent parity games,” <i>ACM Transactions on Computational Logic</i>, vol. 12, no. 4. ACM, 2011.","ista":"Chatterjee K, De Alfaro L, Henzinger TA. 2011. Qualitative concurrent parity games. ACM Transactions on Computational Logic. 12(4), 28.","ama":"Chatterjee K, De Alfaro L, Henzinger TA. Qualitative concurrent parity games. <i>ACM Transactions on Computational Logic</i>. 2011;12(4). doi:<a href=\"https://doi.org/10.1145/1970398.1970404\">10.1145/1970398.1970404</a>","mla":"Chatterjee, Krishnendu, et al. “Qualitative Concurrent Parity Games.” <i>ACM Transactions on Computational Logic</i>, vol. 12, no. 4, 28, ACM, 2011, doi:<a href=\"https://doi.org/10.1145/1970398.1970404\">10.1145/1970398.1970404</a>.","apa":"Chatterjee, K., De Alfaro, L., &#38; Henzinger, T. A. (2011). Qualitative concurrent parity games. <i>ACM Transactions on Computational Logic</i>. ACM. <a href=\"https://doi.org/10.1145/1970398.1970404\">https://doi.org/10.1145/1970398.1970404</a>","chicago":"Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “Qualitative Concurrent Parity Games.” <i>ACM Transactions on Computational Logic</i>. ACM, 2011. <a href=\"https://doi.org/10.1145/1970398.1970404\">https://doi.org/10.1145/1970398.1970404</a>."},"project":[{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"oa_version":"None","type":"journal_article","abstract":[{"lang":"eng","text":"We consider two-player games played on a finite state space for an infinite number of rounds. The games are concurrent: in each round, the two players (player 1 and player 2) choose their moves independently and simultaneously; the current state and the two moves determine the successor state. We consider ω-regular winning conditions specified as parity objectives. Both players are allowed to use randomization when choosing their moves. We study the computation of the limit-winning set of states, consisting of the states where the sup-inf value of the game for player 1 is 1: in other words, a state is limit-winning if player 1 can ensure a probability of winning arbitrarily close to 1. We show that the limit-winning set can be computed in O(n2d+2) time, where n is the size of the game structure and 2d is the number of priorities (or colors). The membership problem of whether a state belongs to the limit-winning set can be decided in NP ∩ coNP. While this complexity is the same as for the simpler class of turn-based parity games, where in each state only one of the two players has a choice of moves, our algorithms are considerably more involved than those for turn-based games. This is because concurrent games do not satisfy two of the most fundamental properties of turn-based parity games. First, in concurrent games limit-winning strategies require randomization; and second, they require infinite memory."}],"title":"Qualitative concurrent parity games","_id":"3354","status":"public","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"De Alfaro, Luca","first_name":"Luca","last_name":"De Alfaro"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2018-12-11T12:02:51Z","language":[{"iso":"eng"}],"publist_id":"3262","publication":"ACM Transactions on Computational Logic","scopus_import":"1","issue":"4"},{"intvolume":"       138","year":"2011","quality_controlled":"1","publication_status":"published","ddc":["570"],"acknowledged_ssus":[{"_id":"Bio"},{"_id":"PreCl"}],"fulldoi":"https://doi.org/10.1242/dev.071233","keyword":["Epithelial cohesion","Hindbrain","Neuronal migration","Zebrafish"],"article_processing_charge":"No","file_date_updated":"2020-07-14T12:46:12Z","date_published":"2011-11-01T00:00:00Z","has_accepted_license":"1","month":"11","department":[{"_id":"CaHe"}],"publisher":"Company of Biologists","external_id":{"isi":["000296060100011"]},"corr_author":"1","oa":1,"day":"01","file":[{"file_id":"6930","content_type":"application/pdf","date_updated":"2020-07-14T12:46:12Z","file_name":"2011_Development_Stockinger.pdf","file_size":4672439,"date_created":"2019-10-07T14:19:42Z","checksum":"ca12b79e01ef36c1ef1aea31cf7e7139","access_level":"open_access","creator":"dernst","relation":"main_file"}],"doi":"10.1242/dev.071233","volume":138,"isi":1,"abstract":[{"text":"Facial branchiomotor neurons (FBMNs) in zebrafish and mouse embryonic hindbrain undergo a characteristic tangential migration from rhombomere (r) 4, where they are born, to r6/7. Cohesion among neuroepithelial cells (NCs) has been suggested to function in FBMN migration by inhibiting FBMNs positioned in the basal neuroepithelium such that they move apically between NCs towards the midline of the neuroepithelium instead of tangentially along the basal side of the neuroepithelium towards r6/7. However, direct experimental evaluation of this hypothesis is still lacking. Here, we have used a combination of biophysical cell adhesion measurements and high-resolution time-lapse microscopy to determine the role of NC cohesion in FBMN migration. We show that reducing NC cohesion by interfering with Cadherin 2 (Cdh2) activity results in FBMNs positioned at the basal side of the neuroepithelium moving apically towards the neural tube midline instead of tangentially towards r6/7. In embryos with strongly reduced NC cohesion, ectopic apical FBMN movement frequently results in fusion of the bilateral FBMN clusters over the apical midline of the neural tube. By contrast, reducing cohesion among FBMNs by interfering with Contactin 2 (Cntn2) expression in these cells has little effect on apical FBMN movement, but reduces the fusion of the bilateral FBMN clusters in embryos with strongly diminished NC cohesion. These data provide direct experimental evidence that NC cohesion functions in tangential FBMN migration by restricting their apical movement.","lang":"eng"}],"article_type":"original","type":"journal_article","oa_version":"Published Version","author":[{"first_name":"Petra","last_name":"Stockinger","id":"261CB030-E90D-11E9-B182-F697D44B663C","full_name":"Stockinger, Petra"},{"id":"39427864-F248-11E8-B48F-1D18A9856A87","first_name":"Carl-Philipp J","last_name":"Heisenberg","orcid":"0000-0002-0912-4566","full_name":"Heisenberg, Carl-Philipp J"},{"id":"48F1E0D8-F248-11E8-B48F-1D18A9856A87","first_name":"Jean-Léon","last_name":"Maître","orcid":"0000-0002-3688-1474","full_name":"Maître, Jean-Léon"}],"status":"public","date_created":"2018-12-11T12:03:06Z","_id":"3396","title":"Defective neuroepithelial cell cohesion affects tangential branchiomotor neuron migration in the zebrafish neural tube","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-07-28T08:23:30Z","page":"4673 - 4683","citation":{"chicago":"Stockinger, Petra, Carl-Philipp J Heisenberg, and Jean-Léon Maître. “Defective Neuroepithelial Cell Cohesion Affects Tangential Branchiomotor Neuron Migration in the Zebrafish Neural Tube.” <i>Development</i>. Company of Biologists, 2011. <a href=\"https://doi.org/10.1242/dev.071233\">https://doi.org/10.1242/dev.071233</a>.","apa":"Stockinger, P., Heisenberg, C.-P. J., &#38; Maître, J.-L. (2011). Defective neuroepithelial cell cohesion affects tangential branchiomotor neuron migration in the zebrafish neural tube. <i>Development</i>. Company of Biologists. <a href=\"https://doi.org/10.1242/dev.071233\">https://doi.org/10.1242/dev.071233</a>","mla":"Stockinger, Petra, et al. “Defective Neuroepithelial Cell Cohesion Affects Tangential Branchiomotor Neuron Migration in the Zebrafish Neural Tube.” <i>Development</i>, vol. 138, no. 21, Company of Biologists, 2011, pp. 4673–83, doi:<a href=\"https://doi.org/10.1242/dev.071233\">10.1242/dev.071233</a>.","ama":"Stockinger P, Heisenberg C-PJ, Maître J-L. Defective neuroepithelial cell cohesion affects tangential branchiomotor neuron migration in the zebrafish neural tube. <i>Development</i>. 2011;138(21):4673-4683. doi:<a href=\"https://doi.org/10.1242/dev.071233\">10.1242/dev.071233</a>","short":"P. Stockinger, C.-P.J. Heisenberg, J.-L. Maître, Development 138 (2011) 4673–4683.","ieee":"P. Stockinger, C.-P. J. Heisenberg, and J.-L. Maître, “Defective neuroepithelial cell cohesion affects tangential branchiomotor neuron migration in the zebrafish neural tube,” <i>Development</i>, vol. 138, no. 21. Company of Biologists, pp. 4673–4683, 2011.","ista":"Stockinger P, Heisenberg C-PJ, Maître J-L. 2011. Defective neuroepithelial cell cohesion affects tangential branchiomotor neuron migration in the zebrafish neural tube. Development. 138(21), 4673–4683."},"acknowledgement":"We thank C. Moens and J. Geiger for critical reading of earlier versions of this manuscript and members of the Heisenberg laboratory for discussions. We are grateful to the microscopy facility of the MPI-CBG and IST Austria for continuous support; I. Nüsslein, J. Compagnon and Alex Eichner for help with cell sorting; and the fish facility of the MPI-CBG and IST Austria for excellent fish care.","issue":"21","scopus_import":"1","publication":"Development","publist_id":"3210","language":[{"iso":"eng"}]},{"scopus_import":"1","issue":"1","publication":"Developmental Biology","acknowledgement":"We thank David Grunwald for providing the spadetail-myc fusion construct. This work was supported by an NIH grant (GM079203) to D.K. and grants from the Austrian Academy of Sciences to P.S., and from the DFG, MPG and IST Austria to C.-P.H. R.R. was supported by a Developmental Biology Predoctoral Training Grant, T32HD007183, from the National Institute of Child Health and Human Development. B.L.M. was supported by an American Cancer Society fellowship (PF-07-048-01-DDC).","OA_place":"repository","OA_type":"green","language":[{"iso":"eng"}],"publist_id":"3228","status":"public","date_created":"2018-12-11T12:03:00Z","author":[{"full_name":"Row, Richard","first_name":"Richard","last_name":"Row"},{"orcid":"0000-0002-3688-1474","full_name":"Maître, Jean-Léon","first_name":"Jean-Léon","last_name":"Maître","id":"48F1E0D8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Benjamin","last_name":"Martin","full_name":"Martin, Benjamin"},{"last_name":"Stockinger","first_name":"Petra","id":"261CB030-E90D-11E9-B182-F697D44B663C","full_name":"Stockinger, Petra"},{"id":"39427864-F248-11E8-B48F-1D18A9856A87","last_name":"Heisenberg","first_name":"Carl-Philipp J","full_name":"Heisenberg, Carl-Philipp J","orcid":"0000-0002-0912-4566"},{"last_name":"Kimelman","first_name":"David","full_name":"Kimelman, David"}],"title":"Completion of the epithelial to mesenchymal transition in zebrafish mesoderm requires Spadetail","_id":"3379","abstract":[{"lang":"eng","text":"The process of gastrulation is highly conserved across vertebrates on both the genetic and morphological levels, despite great variety in embryonic shape and speed of development. This mechanism spatially separates the germ layers and establishes the organizational foundation for future development. Mesodermal identity is specified in a superficial layer of cells, the epiblast, where cells maintain an epithelioid morphology. These cells involute to join the deeper hypoblast layer where they adopt a migratory, mesenchymal morphology. Expression of a cascade of related transcription factors orchestrates the parallel genetic transition from primitive to mature mesoderm. Although the early and late stages of this process are increasingly well understood, the transition between them has remained largely mysterious. We present here the first high resolution in vivo observations of the blebby transitional morphology of involuting mesodermal cells in a vertebrate embryo. We further demonstrate that the zebrafish spadetail mutation creates a reversible block in the maturation program, stalling cells in the transition state. This mutation creates an ideal system for dissecting the specific properties of cells undergoing the morphological transition of maturing mesoderm, as we demonstrate with a direct measurement of cell–cell adhesion."}],"oa_version":"Submitted Version","type":"journal_article","article_type":"original","citation":{"apa":"Row, R., Maître, J.-L., Martin, B., Stockinger, P., Heisenberg, C.-P. J., &#38; Kimelman, D. (2011). Completion of the epithelial to mesenchymal transition in zebrafish mesoderm requires Spadetail. <i>Developmental Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ydbio.2011.03.025\">https://doi.org/10.1016/j.ydbio.2011.03.025</a>","chicago":"Row, Richard, Jean-Léon Maître, Benjamin Martin, Petra Stockinger, Carl-Philipp J Heisenberg, and David Kimelman. “Completion of the Epithelial to Mesenchymal Transition in Zebrafish Mesoderm Requires Spadetail.” <i>Developmental Biology</i>. Elsevier, 2011. <a href=\"https://doi.org/10.1016/j.ydbio.2011.03.025\">https://doi.org/10.1016/j.ydbio.2011.03.025</a>.","ista":"Row R, Maître J-L, Martin B, Stockinger P, Heisenberg C-PJ, Kimelman D. 2011. Completion of the epithelial to mesenchymal transition in zebrafish mesoderm requires Spadetail. Developmental Biology. 354(1), 102–110.","ieee":"R. Row, J.-L. Maître, B. Martin, P. Stockinger, C.-P. J. Heisenberg, and D. Kimelman, “Completion of the epithelial to mesenchymal transition in zebrafish mesoderm requires Spadetail,” <i>Developmental Biology</i>, vol. 354, no. 1. Elsevier, pp. 102–110, 2011.","short":"R. Row, J.-L. Maître, B. Martin, P. Stockinger, C.-P.J. Heisenberg, D. Kimelman, Developmental Biology 354 (2011) 102–110.","ama":"Row R, Maître J-L, Martin B, Stockinger P, Heisenberg C-PJ, Kimelman D. Completion of the epithelial to mesenchymal transition in zebrafish mesoderm requires Spadetail. <i>Developmental Biology</i>. 2011;354(1):102-110. doi:<a href=\"https://doi.org/10.1016/j.ydbio.2011.03.025\">10.1016/j.ydbio.2011.03.025</a>","mla":"Row, Richard, et al. “Completion of the Epithelial to Mesenchymal Transition in Zebrafish Mesoderm Requires Spadetail.” <i>Developmental Biology</i>, vol. 354, no. 1, Elsevier, 2011, pp. 102–10, doi:<a href=\"https://doi.org/10.1016/j.ydbio.2011.03.025\">10.1016/j.ydbio.2011.03.025</a>."},"page":"102 - 110","date_updated":"2026-07-28T08:31:27Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"day":"01","publisher":"Elsevier","month":"06","department":[{"_id":"CaHe"}],"external_id":{"pmid":["21463614"],"isi":["000290550500010"]},"isi":1,"doi":"10.1016/j.ydbio.2011.03.025","volume":354,"intvolume":"       354","publication_status":"published","pmid":1,"year":"2011","quality_controlled":"1","article_processing_charge":"No","date_published":"2011-06-01T00:00:00Z","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3090540/","open_access":"1"}],"das_tickbox":"1","fulldoi":"https://doi.org/10.1016/j.ydbio.2011.03.025"},{"issue":"1-2","publication":"Acta Scientiarum Mathematicarum","publication_identifier":{"issn":["0001-6969"],"eissn":["2064-8316"]},"acknowledgement":"Funded by Graduate Aid in Areas of National Need (GAANN) Fellowship. The author would like to thank Herbert Edelsbrunner for his discussions and guidance.","OA_type":"closed access","publist_id":"2446","language":[{"iso":"eng"}],"status":"public","author":[{"full_name":"Fasy, Brittany Terese","first_name":"Brittany Terese","last_name":"Fasy","id":"F65D502E-E68D-11E9-9252-C644099818F6"}],"date_created":"2018-12-11T12:05:08Z","_id":"3781","title":"The difference in length of curves in R^n","abstract":[{"text":"We bound the difference in length of two curves in terms of their total curvatures and the Fréchet distance. The bound is independent of the dimension of the ambient Euclidean space, it improves upon a bound by Cohen-Steiner and Edelsbrunner, and it generalizes a result by Fáry and Chakerian.","lang":"eng"}],"article_type":"original","oa_version":"None","type":"journal_article","page":"359 - 367","citation":{"chicago":"Fasy, Brittany Terese. “The Difference in Length of Curves in R^n.” <i>Acta Scientiarum Mathematicarum</i>. Springer Nature, 2011. <a href=\"https://doi.org/10.1007/BF03651375\">https://doi.org/10.1007/BF03651375</a>.","apa":"Fasy, B. T. (2011). The difference in length of curves in R^n. <i>Acta Scientiarum Mathematicarum</i>. Springer Nature. <a href=\"https://doi.org/10.1007/BF03651375\">https://doi.org/10.1007/BF03651375</a>","mla":"Fasy, Brittany Terese. “The Difference in Length of Curves in R^n.” <i>Acta Scientiarum Mathematicarum</i>, vol. 77, no. 1–2, Springer Nature, 2011, pp. 359–67, doi:<a href=\"https://doi.org/10.1007/BF03651375\">10.1007/BF03651375</a>.","ama":"Fasy BT. The difference in length of curves in R^n. <i>Acta Scientiarum Mathematicarum</i>. 2011;77(1-2):359-367. doi:<a href=\"https://doi.org/10.1007/BF03651375\">10.1007/BF03651375</a>","ista":"Fasy BT. 2011. The difference in length of curves in R^n. Acta Scientiarum Mathematicarum. 77(1–2), 359–367.","ieee":"B. T. Fasy, “The difference in length of curves in R^n,” <i>Acta Scientiarum Mathematicarum</i>, vol. 77, no. 1–2. Springer Nature, pp. 359–367, 2011.","short":"B.T. Fasy, Acta Scientiarum Mathematicarum 77 (2011) 359–367."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-07-28T08:11:07Z","corr_author":"1","day":"01","month":"06","department":[{"_id":"HeEd"}],"publisher":"Springer Nature","doi":"10.1007/BF03651375","volume":77,"intvolume":"        77","quality_controlled":"1","year":"2011","publication_status":"published","article_processing_charge":"No","date_published":"2011-06-01T00:00:00Z","fulldoi":"https://doi.org/10.1007/BF03651375","das_tickbox":"1"},{"publisher":"Wiley","month":"07","department":[{"_id":"CaHe"}],"oa":1,"corr_author":"1","day":"01","doi":"10.1111/j.1742-4658.2011.08136.x","volume":278,"intvolume":"       278","publication_status":"published","quality_controlled":"1","year":"2011","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1111/j.1742-4658.2011.08136.x"}],"fulldoi":"https://doi.org/10.1111/j.1742-4658.2011.08136.x","article_processing_charge":"No","conference":{"end_date":"2011-06-30","start_date":"2011-06-25","name":"FEBS Congress on Biochemistry for Tomorrow's Medicine","location":"Torino, Italy"},"date_published":"2011-07-01T00:00:00Z","issue":"S1","publication":"The FEBS Journal","language":[{"iso":"eng"}],"publist_id":"3224","OA_type":"free access","OA_place":"publisher","type":"conference_abstract","oa_version":"Published Version","date_created":"2018-12-11T12:03:01Z","status":"public","author":[{"id":"39427864-F248-11E8-B48F-1D18A9856A87","first_name":"Carl-Philipp J","last_name":"Heisenberg","orcid":"0000-0002-0912-4566","full_name":"Heisenberg, Carl-Philipp J"}],"title":"Invited Lectures ‐ Symposia Area","_id":"3383","date_updated":"2026-07-28T08:27:55Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"24 - 24","citation":{"ieee":"C.-P. J. Heisenberg, “Invited Lectures ‐ Symposia Area,” in <i>The FEBS Journal</i>, Torino, Italy, 2011, vol. 278, no. S1, pp. 24–24.","ista":"Heisenberg C-PJ. 2011. Invited Lectures ‐ Symposia Area. The FEBS Journal. FEBS Congress on Biochemistry for Tomorrow’s Medicine vol. 278, 24–24.","short":"C.-P.J. Heisenberg, in:, The FEBS Journal, Wiley, 2011, pp. 24–24.","ama":"Heisenberg C-PJ. Invited Lectures ‐ Symposia Area. In: <i>The FEBS Journal</i>. Vol 278. Wiley; 2011:24-24. doi:<a href=\"https://doi.org/10.1111/j.1742-4658.2011.08136.x\">10.1111/j.1742-4658.2011.08136.x</a>","mla":"Heisenberg, Carl-Philipp J. “Invited Lectures ‐ Symposia Area.” <i>The FEBS Journal</i>, vol. 278, no. S1, Wiley, 2011, pp. 24–24, doi:<a href=\"https://doi.org/10.1111/j.1742-4658.2011.08136.x\">10.1111/j.1742-4658.2011.08136.x</a>.","apa":"Heisenberg, C.-P. J. (2011). Invited Lectures ‐ Symposia Area. In <i>The FEBS Journal</i> (Vol. 278, pp. 24–24). Torino, Italy: Wiley. <a href=\"https://doi.org/10.1111/j.1742-4658.2011.08136.x\">https://doi.org/10.1111/j.1742-4658.2011.08136.x</a>","chicago":"Heisenberg, Carl-Philipp J. “Invited Lectures ‐ Symposia Area.” In <i>The FEBS Journal</i>, 278:24–24. Wiley, 2011. <a href=\"https://doi.org/10.1111/j.1742-4658.2011.08136.x\">https://doi.org/10.1111/j.1742-4658.2011.08136.x</a>."}},{"citation":{"apa":"Krens, G., Möllmert, S., &#38; Heisenberg, C.-P. J. (2011). Enveloping cell layer differentiation at the surface of zebrafish germ layer tissue explants. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1010767108\">https://doi.org/10.1073/pnas.1010767108</a>","chicago":"Krens, Gabriel, Stephanie Möllmert, and Carl-Philipp J Heisenberg. “Enveloping Cell Layer Differentiation at the Surface of Zebrafish Germ Layer Tissue Explants.” <i>PNAS</i>. National Academy of Sciences, 2011. <a href=\"https://doi.org/10.1073/pnas.1010767108\">https://doi.org/10.1073/pnas.1010767108</a>.","ieee":"G. Krens, S. Möllmert, and C.-P. J. Heisenberg, “Enveloping cell layer differentiation at the surface of zebrafish germ layer tissue explants,” <i>PNAS</i>, vol. 108, no. 3. National Academy of Sciences, pp. E9–E10, 2011.","short":"G. Krens, S. Möllmert, C.-P.J. Heisenberg, PNAS 108 (2011) E9–E10.","ista":"Krens G, Möllmert S, Heisenberg C-PJ. 2011. Enveloping cell layer differentiation at the surface of zebrafish germ layer tissue explants. PNAS. 108(3), E9–E10.","ama":"Krens G, Möllmert S, Heisenberg C-PJ. Enveloping cell layer differentiation at the surface of zebrafish germ layer tissue explants. <i>PNAS</i>. 2011;108(3):E9-E10. doi:<a href=\"https://doi.org/10.1073/pnas.1010767108\">10.1073/pnas.1010767108</a>","mla":"Krens, Gabriel, et al. “Enveloping Cell Layer Differentiation at the Surface of Zebrafish Germ Layer Tissue Explants.” <i>PNAS</i>, vol. 108, no. 3, National Academy of Sciences, 2011, pp. E9–10, doi:<a href=\"https://doi.org/10.1073/pnas.1010767108\">10.1073/pnas.1010767108</a>."},"page":"E9 - E10","date_updated":"2026-07-28T09:03:18Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Krens, Gabriel","orcid":"0000-0003-4761-5996","id":"2B819732-F248-11E8-B48F-1D18A9856A87","first_name":"Gabriel","last_name":"Krens"},{"id":"260FD49C-E911-11E9-B5EA-D9538404589B","last_name":"Möllmert","first_name":"Stephanie","full_name":"Möllmert, Stephanie"},{"last_name":"Heisenberg","first_name":"Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0912-4566","full_name":"Heisenberg, Carl-Philipp J"}],"status":"public","date_created":"2018-12-11T12:02:56Z","title":"Enveloping cell layer differentiation at the surface of zebrafish germ layer tissue explants","_id":"3368","abstract":[{"text":"Tissue surface tension (TST) is an important mechanical property influencing cell sorting and tissue envelopment. The study by Manning et al. (1) reported on a mathematical model describing TST on the basis of the balance between adhesive and tensile properties of the constituent cells. The model predicts that, in high-adhesion cell aggregates, surface cells will be stretched to maintain the same area of cell–cell contact as interior bulk cells, resulting in an elongated and flattened cell shape. The authors (1) observed flat and elongated cells at the surface of high-adhesion zebrafish germ-layer explants, which they argue are undifferentiated stretched germ-layer progenitor cells, and they use this observation as a validation of their model.","lang":"eng"}],"oa_version":"Submitted Version","type":"journal_article","article_type":"letter_note","publist_id":"3244","language":[{"iso":"eng"}],"scopus_import":"1","issue":"3","publication":"PNAS","article_processing_charge":"No","date_published":"2011-01-18T00:00:00Z","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3024655"}],"das_tickbox":"1","fulldoi":"https://doi.org/10.1073/pnas.1010767108","intvolume":"       108","publication_status":"published","pmid":1,"year":"2011","quality_controlled":"1","isi":1,"doi":"10.1073/pnas.1010767108","volume":108,"oa":1,"corr_author":"1","day":"18","publisher":"National Academy of Sciences","month":"01","department":[{"_id":"CaHe"}],"external_id":{"isi":["000286310300003"],"pmid":["21212360"]}},{"doi":"10.1364/OL.36.001260","volume":36,"isi":1,"month":"03","department":[{"_id":"CaHe"}],"publisher":"Optica Publishing Group","external_id":{"isi":["000289251000080"]},"oa":1,"day":"30","main_file_link":[{"url":"https://www.osapublishing.org/ol/abstract.cfm?uri=ol-36-7-1260","open_access":"1"}],"fulldoi":"https://doi.org/10.1364/OL.36.001260","article_processing_charge":"No","date_published":"2011-03-30T00:00:00Z","intvolume":"        36","quality_controlled":"1","year":"2011","publication_status":"published","ddc":["570"],"publist_id":"3234","language":[{"iso":"eng"}],"issue":"7","scopus_import":"1","publication":"Optics Letters","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-07-29T10:07:18Z","page":"1260 - 1262","citation":{"ama":"Jahnel M, Behrndt M, Jannasch A, Schaeffer E, Grill S. Measuring the complete force field of an optical trap. <i>Optics Letters</i>. 2011;36(7):1260-1262. doi:<a href=\"https://doi.org/10.1364/OL.36.001260\">10.1364/OL.36.001260</a>","mla":"Jahnel, Marcus, et al. “Measuring the Complete Force Field of an Optical Trap.” <i>Optics Letters</i>, vol. 36, no. 7, Optica Publishing Group, 2011, pp. 1260–62, doi:<a href=\"https://doi.org/10.1364/OL.36.001260\">10.1364/OL.36.001260</a>.","short":"M. Jahnel, M. Behrndt, A. Jannasch, E. Schaeffer, S. Grill, Optics Letters 36 (2011) 1260–1262.","ista":"Jahnel M, Behrndt M, Jannasch A, Schaeffer E, Grill S. 2011. Measuring the complete force field of an optical trap. Optics Letters. 36(7), 1260–1262.","ieee":"M. Jahnel, M. Behrndt, A. Jannasch, E. Schaeffer, and S. Grill, “Measuring the complete force field of an optical trap,” <i>Optics Letters</i>, vol. 36, no. 7. Optica Publishing Group, pp. 1260–1262, 2011.","chicago":"Jahnel, Marcus, Martin Behrndt, Anita Jannasch, Erik Schaeffer, and Stephan Grill. “Measuring the Complete Force Field of an Optical Trap.” <i>Optics Letters</i>. Optica Publishing Group, 2011. <a href=\"https://doi.org/10.1364/OL.36.001260\">https://doi.org/10.1364/OL.36.001260</a>.","apa":"Jahnel, M., Behrndt, M., Jannasch, A., Schaeffer, E., &#38; Grill, S. (2011). Measuring the complete force field of an optical trap. <i>Optics Letters</i>. Optica Publishing Group. <a href=\"https://doi.org/10.1364/OL.36.001260\">https://doi.org/10.1364/OL.36.001260</a>"},"related_material":{"record":[{"status":"public","id":"1403","relation":"dissertation_contains"}]},"abstract":[{"lang":"eng","text":"The use of optical traps to measure or apply forces on the molecular level requires a precise knowledge of the trapping force field. Close to the trap center, this field is typically approximated as linear in the displacement of the trapped microsphere. However, applications demanding high forces at low laser intensities can probe the light-microsphere interaction beyond the linear regime. Here, we measured the full nonlinear force and displacement response of an optical trap in two dimensions using a dual-beam optical trap setup with back-focal-plane photodetection. We observed a substantial stiffening of the trap beyond the linear regime that depends on microsphere size, in agreement with Mie theory calculations. Surprisingly, we found that the linear detection range for forces exceeds the one for displacement by far. Our approach allows for a complete calibration of an optical trap."}],"oa_version":"Published Version","type":"journal_article","date_created":"2018-12-11T12:02:58Z","status":"public","author":[{"full_name":"Jahnel, Marcus","last_name":"Jahnel","first_name":"Marcus"},{"first_name":"Martin","last_name":"Behrndt","id":"3ECECA3A-F248-11E8-B48F-1D18A9856A87","full_name":"Behrndt, Martin"},{"full_name":"Jannasch, Anita","last_name":"Jannasch","first_name":"Anita"},{"full_name":"Schaeffer, Erik","first_name":"Erik","last_name":"Schaeffer"},{"first_name":"Stephan","last_name":"Grill","full_name":"Grill, Stephan"}],"_id":"3373","title":"Measuring the complete force field of an optical trap"},{"article_type":"original","type":"journal_article","oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"Unlike unconditionally advantageous “Fisherian” variants that tend to spread throughout a species range once introduced anywhere, “bistable” variants, such as chromosome translocations, have two alternative stable frequencies, absence and (near) fixation. Analogous to populations with Allee effects, bistable variants tend to increase locally only once they become sufficiently common, and their spread depends on their rate of increase averaged over all frequencies. Several proposed manipulations of insect populations, such as using Wolbachia or “engineered underdominance” to suppress vector-borne diseases, produce bistable rather than Fisherian dynamics. We synthesize and extend theoretical analyses concerning three features of their spatial behavior: rate of spread, conditions to initiate spread from a localized introduction, and wave stopping caused by variation in population densities or dispersal rates. Unlike Fisherian variants, bistable variants tend to spread spatially only for particular parameter combinations and initial conditions. Wave initiation requires introduction over an extended region, while subsequent spatial spread is slower than for Fisherian waves and can easily be halted by local spatial inhomogeneities. We present several new results, including robust sufficient conditions to initiate (and stop) spread, using a one-parameter cubic approximation applicable to several models. The results have both basic and applied implications."}],"_id":"3393","title":"Spatial waves of advance with bistable dynamics: Cytoplasmic and genetic analogues of Allee effects","date_created":"2018-12-11T12:03:05Z","author":[{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton","first_name":"Nicholas H","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H"},{"full_name":"Turelli, Michael","first_name":"Michael","last_name":"Turelli"}],"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-08-04T09:17:38Z","citation":{"apa":"Barton, N. H., &#38; Turelli, M. (2011). Spatial waves of advance with bistable dynamics: Cytoplasmic and genetic analogues of Allee effects. <i>American Naturalist</i>. University of Chicago Press. <a href=\"https://doi.org/10.1086/661246\">https://doi.org/10.1086/661246</a>","chicago":"Barton, Nicholas H, and Michael Turelli. “Spatial Waves of Advance with Bistable Dynamics: Cytoplasmic and Genetic Analogues of Allee Effects.” <i>American Naturalist</i>. University of Chicago Press, 2011. <a href=\"https://doi.org/10.1086/661246\">https://doi.org/10.1086/661246</a>.","ista":"Barton NH, Turelli M. 2011. Spatial waves of advance with bistable dynamics: Cytoplasmic and genetic analogues of Allee effects. American Naturalist. 178(3), E48–E75.","ieee":"N. H. Barton and M. Turelli, “Spatial waves of advance with bistable dynamics: Cytoplasmic and genetic analogues of Allee effects,” <i>American Naturalist</i>, vol. 178, no. 3. University of Chicago Press, pp. E48–E75, 2011.","short":"N.H. Barton, M. Turelli, American Naturalist 178 (2011) E48–E75.","ama":"Barton NH, Turelli M. Spatial waves of advance with bistable dynamics: Cytoplasmic and genetic analogues of Allee effects. <i>American Naturalist</i>. 2011;178(3):E48-E75. doi:<a href=\"https://doi.org/10.1086/661246\">10.1086/661246</a>","mla":"Barton, Nicholas H., and Michael Turelli. “Spatial Waves of Advance with Bistable Dynamics: Cytoplasmic and Genetic Analogues of Allee Effects.” <i>American Naturalist</i>, vol. 178, no. 3, University of Chicago Press, 2011, pp. E48–75, doi:<a href=\"https://doi.org/10.1086/661246\">10.1086/661246</a>."},"page":"E48 - E75","publication_identifier":{"eissn":["1537-5323"],"issn":["0003-0147"]},"publication":"American Naturalist","issue":"3","scopus_import":"1","language":[{"iso":"eng"}],"publist_id":"3214","quality_controlled":"1","year":"2011","publication_status":"published","intvolume":"       178","ddc":["570"],"fulldoi":"https://doi.org/10.1086/661246","file_date_updated":"2020-07-14T12:46:11Z","date_published":"2011-09-01T00:00:00Z","has_accepted_license":"1","article_processing_charge":"No","external_id":{"isi":["000294256800001"]},"month":"09","department":[{"_id":"NiBa"}],"publisher":"University of Chicago Press","day":"01","pubrep_id":"554","oa":1,"volume":178,"file":[{"relation":"main_file","creator":"system","access_level":"open_access","checksum":"7fd22a2ef3321a6fca6a439b3be5d8f4","date_created":"2018-12-12T10:08:31Z","file_size":629130,"file_name":"IST-2016-554-v1+1_BartonTurelli2011_copy.pdf","date_updated":"2020-07-14T12:46:11Z","content_type":"application/pdf","file_id":"4692"}],"doi":"10.1086/661246","isi":1},{"publist_id":"3232","language":[{"iso":"eng"}],"publication":"Journal of the Royal Society Interface","scopus_import":"1","issue":"58","ec_funded":1,"citation":{"apa":"de Vladar, H., &#38; Barton, N. H. (2011). The statistical mechanics of a polygenic character under stabilizing selection mutation and drift. <i>Journal of the Royal Society Interface</i>. Royal Society. <a href=\"https://doi.org/10.1098/rsif.2010.0438\">https://doi.org/10.1098/rsif.2010.0438</a>","chicago":"Vladar, Harold de, and Nicholas H Barton. “The Statistical Mechanics of a Polygenic Character under Stabilizing Selection Mutation and Drift.” <i>Journal of the Royal Society Interface</i>. Royal Society, 2011. <a href=\"https://doi.org/10.1098/rsif.2010.0438\">https://doi.org/10.1098/rsif.2010.0438</a>.","short":"H. de Vladar, N.H. Barton, Journal of the Royal Society Interface 8 (2011) 720–739.","ista":"de Vladar H, Barton NH. 2011. The statistical mechanics of a polygenic character under stabilizing selection mutation and drift. Journal of the Royal Society Interface. 8(58), 720–739.","ieee":"H. de Vladar and N. H. Barton, “The statistical mechanics of a polygenic character under stabilizing selection mutation and drift,” <i>Journal of the Royal Society Interface</i>, vol. 8, no. 58. Royal Society, pp. 720–739, 2011.","ama":"de Vladar H, Barton NH. The statistical mechanics of a polygenic character under stabilizing selection mutation and drift. <i>Journal of the Royal Society Interface</i>. 2011;8(58):720-739. doi:<a href=\"https://doi.org/10.1098/rsif.2010.0438\">10.1098/rsif.2010.0438</a>","mla":"de Vladar, Harold, and Nicholas H. Barton. “The Statistical Mechanics of a Polygenic Character under Stabilizing Selection Mutation and Drift.” <i>Journal of the Royal Society Interface</i>, vol. 8, no. 58, Royal Society, 2011, pp. 720–39, doi:<a href=\"https://doi.org/10.1098/rsif.2010.0438\">10.1098/rsif.2010.0438</a>."},"page":"720 - 739","project":[{"grant_number":"250152","_id":"25B07788-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Limits to selection in biology and in evolutionary computation"}],"date_updated":"2026-08-12T14:07:44Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"The statistical mechanics of a polygenic character under stabilizing selection mutation and drift","_id":"3375","author":[{"orcid":"0000-0002-5985-7653","full_name":"de Vladar, Harold","first_name":"Harold","last_name":"de Vladar","id":"2A181218-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Nicholas H","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H"}],"date_created":"2018-12-11T12:02:58Z","status":"public","type":"journal_article","oa_version":"Submitted Version","article_type":"original","abstract":[{"lang":"eng","text":"By exploiting an analogy between population genetics and statistical mechanics, we study the evolution of a polygenic trait under stabilizing selection, mutation and genetic drift. This requires us to track only four macroscopic variables, instead of the distribution of all the allele frequencies that influence the trait. These macroscopic variables are the expectations of: the trait mean and its square, the genetic variance, and of a measure of heterozygosity, and are derived from a generating function that is in turn derived by maximizing an entropy measure. These four macroscopics are enough to accurately describe the dynamics of the trait mean and of its genetic variance (and in principle of any other quantity). Unlike previous approaches that were based on an infinite series of moments or cumulants, which had to be truncated arbitrarily, our calculations provide a well-defined approximation procedure. We apply the framework to abrupt and gradual changes in the optimum, as well as to changes in the strength of stabilizing selection. Our approximations are surprisingly accurate, even for systems with as few as five loci. We find that when the effects of drift are included, the expected genetic variance is hardly altered by directional selection, even though it fluctuates in any particular instance. We also find hysteresis, showing that even after averaging over the microscopic variables, the macroscopic trajectories retain a memory of the underlying genetic states."}],"isi":1,"volume":8,"doi":"10.1098/rsif.2010.0438","day":"01","corr_author":"1","oa":1,"external_id":{"isi":["000289671700011"],"pmid":["21084341"]},"publisher":"Royal Society","department":[{"_id":"NiBa"}],"month":"05","date_published":"2011-05-01T00:00:00Z","article_processing_charge":"No","fulldoi":"https://doi.org/10.1098/rsif.2010.0438","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3061091/","open_access":"1"}],"publication_status":"published","quality_controlled":"1","pmid":1,"year":"2011","intvolume":"         8"},{"language":[{"iso":"eng"}],"acknowledgement":"This work was supported in part by the Swiss NSF. The fourth author is supported by an FWF Hertha Firnberg Research grant (T425-N23).","publication_identifier":{"isbn":["9783642175107"],"eisbn":["9783642175114"],"issn":["0302-9743"],"eissn":["1611-3349"]},"publication":"Logic for Programming, Artificial Intelligence, and Reasoning","scopus_import":"1","date_updated":"2025-09-30T09:51:13Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","page":"103-118","citation":{"chicago":"Blanc, Régis, Thomas A Henzinger, Thibaud Hottelier, and Laura Kovács. “ABC: Algebraic Bound Computation for Loops.” In <i>Logic for Programming, Artificial Intelligence, and Reasoning</i>, edited by Edmund M Clarke and Andrei Voronkov, 6355:103–18. LNCS. Berlin, Heidelberg: Springer Nature, 2010. <a href=\"https://doi.org/10.1007/978-3-642-17511-4_7\">https://doi.org/10.1007/978-3-642-17511-4_7</a>.","apa":"Blanc, R., Henzinger, T. A., Hottelier, T., &#38; Kovács, L. (2010). ABC: Algebraic Bound Computation for loops. In E. M. Clarke &#38; A. Voronkov (Eds.), <i>Logic for Programming, Artificial Intelligence, and Reasoning</i> (Vol. 6355, pp. 103–118). Berlin, Heidelberg: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-17511-4_7\">https://doi.org/10.1007/978-3-642-17511-4_7</a>","mla":"Blanc, Régis, et al. “ABC: Algebraic Bound Computation for Loops.” <i>Logic for Programming, Artificial Intelligence, and Reasoning</i>, edited by Edmund M Clarke and Andrei Voronkov, vol. 6355, Springer Nature, 2010, pp. 103–18, doi:<a href=\"https://doi.org/10.1007/978-3-642-17511-4_7\">10.1007/978-3-642-17511-4_7</a>.","ama":"Blanc R, Henzinger TA, Hottelier T, Kovács L. ABC: Algebraic Bound Computation for loops. In: Clarke EM, Voronkov A, eds. <i>Logic for Programming, Artificial Intelligence, and Reasoning</i>. Vol 6355. LNCS. Berlin, Heidelberg: Springer Nature; 2010:103-118. doi:<a href=\"https://doi.org/10.1007/978-3-642-17511-4_7\">10.1007/978-3-642-17511-4_7</a>","short":"R. Blanc, T.A. Henzinger, T. Hottelier, L. Kovács, in:, E.M. Clarke, A. Voronkov (Eds.), Logic for Programming, Artificial Intelligence, and Reasoning, Springer Nature, Berlin, Heidelberg, 2010, pp. 103–118.","ieee":"R. Blanc, T. A. Henzinger, T. Hottelier, and L. Kovács, “ABC: Algebraic Bound Computation for loops,” in <i>Logic for Programming, Artificial Intelligence, and Reasoning</i>, Dakar, Senegal, 2010, vol. 6355, pp. 103–118.","ista":"Blanc R, Henzinger TA, Hottelier T, Kovács L. 2010. ABC: Algebraic Bound Computation for loops. Logic for Programming, Artificial Intelligence, and Reasoning. LPAR: Logic for Programming, Artificial Intelligence and ReasoningLNCS vol. 6355, 103–118."},"oa_version":"Submitted Version","type":"conference","abstract":[{"text":"We present ABC, a software tool for automatically computing symbolic upper bounds on the number of iterations of nested program loops. The system combines static analysis of programs with symbolic summation techniques to derive loop invariant relations between program variables. Iteration bounds are obtained from the inferred invariants, by replacing variables with bounds on their greatest values. We have successfully applied ABC to a large number of examples. The derived symbolic bounds express non-trivial polynomial relations over loop variables. We also report on results to automatically infer symbolic expressions over harmonic numbers as upper bounds on loop iteration counts.","lang":"eng"}],"title":"ABC: Algebraic Bound Computation for loops","_id":"10908","status":"public","author":[{"full_name":"Blanc, Régis","last_name":"Blanc","first_name":"Régis"},{"orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger"},{"full_name":"Hottelier, Thibaud","first_name":"Thibaud","last_name":"Hottelier"},{"full_name":"Kovács, Laura","first_name":"Laura","last_name":"Kovács"}],"date_created":"2022-03-21T08:14:35Z","volume":6355,"doi":"10.1007/978-3-642-17511-4_7","isi":1,"series_title":"LNCS","external_id":{"isi":["000309668000007"]},"publisher":"Springer Nature","month":"05","department":[{"_id":"ToHe"}],"day":"01","corr_author":"1","oa":1,"fulldoi":"https://doi.org/10.1007/978-3-642-17511-4_7","main_file_link":[{"open_access":"1","url":"https://infoscience.epfl.ch/record/186096"}],"conference":{"location":"Dakar, Senegal","name":"LPAR: Logic for Programming, Artificial Intelligence and Reasoning","start_date":"2010-04-25","end_date":"2010-05-01"},"date_published":"2010-05-01T00:00:00Z","article_processing_charge":"No","publication_status":"published","quality_controlled":"1","year":"2010","intvolume":"      6355","editor":[{"full_name":"Clarke, Edmund M","first_name":"Edmund M","last_name":"Clarke"},{"full_name":"Voronkov, Andrei","first_name":"Andrei","last_name":"Voronkov"}],"place":"Berlin, Heidelberg"},{"corr_author":"1","day":"01","department":[{"_id":"HeEd"}],"month":"02","publisher":"Society for Industrial and Applied Mathematics","doi":"10.1137/1.9781611973075.129","year":"2010","quality_controlled":"1","publication_status":"published","article_processing_charge":"No","date_published":"2010-02-01T00:00:00Z","conference":{"location":"Austin, TX, United States","start_date":"2010-01-17","end_date":"2010-01-19","name":"SODA: Symposium on Discrete Algorithms"},"fulldoi":"https://doi.org/10.1137/1.9781611973075.129","scopus_import":"1","publication":"Proceedings of the 2010 Annual ACM-SIAM Symposium on Discrete Algorithms","publication_identifier":{"eisbn":["9781611973075"]},"acknowledgement":"Partially supported by the Austrian Science Fund under grantFSP-S9103-N04 and P20134-N13.","language":[{"iso":"eng"}],"author":[{"id":"3E92416E-F248-11E8-B48F-1D18A9856A87","first_name":"Chao","last_name":"Chen","full_name":"Chen, Chao"},{"first_name":"Daniel","last_name":"Freedman","full_name":"Freedman, Daniel"}],"status":"public","date_created":"2022-03-21T08:24:07Z","_id":"10909","title":"Hardness results for homology localization","abstract":[{"lang":"eng","text":"We address the problem of localizing homology classes, namely, finding the cycle representing a given class with the most concise geometric measure. We focus on the volume measure, that is, the 1-norm of a cycle. Two main results are presented. First, we prove the problem is NP-hard to approximate within any constant factor. Second, we prove that for homology of dimension two or higher, the problem is NP-hard to approximate even when the Betti number is O(1). A side effect is the inapproximability of the problem of computing the nonbounding cycle with the smallest volume, and computing cycles representing a homology basis with the minimal total volume. We also discuss other geometric measures (diameter and radius) and show their disadvantages in homology localization. Our work is restricted to homology over the ℤ2 field."}],"oa_version":"None","type":"conference","page":"1594-1604","citation":{"short":"C. Chen, D. Freedman, in:, Proceedings of the 2010 Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2010, pp. 1594–1604.","ieee":"C. Chen and D. Freedman, “Hardness results for homology localization,” in <i>Proceedings of the 2010 Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Austin, TX, United States, 2010, pp. 1594–1604.","ista":"Chen C, Freedman D. 2010. Hardness results for homology localization. Proceedings of the 2010 Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1594–1604.","mla":"Chen, Chao, and Daniel Freedman. “Hardness Results for Homology Localization.” <i>Proceedings of the 2010 Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Society for Industrial and Applied Mathematics, 2010, pp. 1594–604, doi:<a href=\"https://doi.org/10.1137/1.9781611973075.129\">10.1137/1.9781611973075.129</a>.","ama":"Chen C, Freedman D. Hardness results for homology localization. In: <i>Proceedings of the 2010 Annual ACM-SIAM Symposium on Discrete Algorithms</i>. Society for Industrial and Applied Mathematics; 2010:1594-1604. doi:<a href=\"https://doi.org/10.1137/1.9781611973075.129\">10.1137/1.9781611973075.129</a>","apa":"Chen, C., &#38; Freedman, D. (2010). Hardness results for homology localization. In <i>Proceedings of the 2010 Annual ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 1594–1604). Austin, TX, United States: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611973075.129\">https://doi.org/10.1137/1.9781611973075.129</a>","chicago":"Chen, Chao, and Daniel Freedman. “Hardness Results for Homology Localization.” In <i>Proceedings of the 2010 Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 1594–1604. Society for Industrial and Applied Mathematics, 2010. <a href=\"https://doi.org/10.1137/1.9781611973075.129\">https://doi.org/10.1137/1.9781611973075.129</a>."},"related_material":{"record":[{"status":"public","id":"3267","relation":"later_version"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2025-09-30T09:22:32Z"},{"ddc":["576"],"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"publication_status":"published","quality_controlled":"1","year":"2010","intvolume":"         5","has_accepted_license":"1","file_date_updated":"2020-07-14T12:45:40Z","date_published":"2010-12-06T00:00:00Z","article_processing_charge":"No","fulldoi":"https://doi.org/10.1186/1748-7188-5-37","day":"06","oa":1,"pubrep_id":"939","external_id":{"isi":["000286183400001"]},"publisher":"BioMed Central","department":[{"_id":"JoBo"}],"month":"12","isi":1,"article_number":"37","volume":5,"doi":"10.1186/1748-7188-5-37","file":[{"relation":"main_file","creator":"system","access_level":"open_access","checksum":"e2497285388bc4da629bafb46662eb43","date_created":"2018-12-12T10:09:16Z","file_size":723929,"content_type":"application/pdf","date_updated":"2020-07-14T12:45:40Z","file_name":"IST-2018-939-v1+1_2010_Kupczok_Accuracy_of.pdf","file_id":"4739"}],"title":"Accuracy of phylogeny reconstruction methods combining overlapping gene data sets","_id":"2409","author":[{"full_name":"Kupczok, Anne","first_name":"Anne","last_name":"Kupczok","id":"2BB22BC2-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Schmidt","first_name":"Heiko","full_name":"Schmidt, Heiko"},{"full_name":"Von Haeseler, Arndt","first_name":"Arndt","last_name":"Von Haeseler"}],"status":"public","date_created":"2018-12-11T11:57:30Z","type":"journal_article","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Background: The availability of many gene alignments with overlapping taxon sets raises the question of which strategy is the best to infer species phylogenies from multiple gene information. Methods and programs abound that use the gene alignment in different ways to reconstruct the species tree. In particular, different methods combine the original data at different points along the way from the underlying sequences to the final tree. Accordingly, they are classified into superalignment, supertree and medium-level approaches. Here, we present a simulation study to compare different methods from each of these three approaches.\r\n\r\nResults: We observe that superalignment methods usually outperform the other approaches over a wide range of parameters including sparse data and gene-specific evolutionary parameters. In the presence of high incongruency among gene trees, however, other combination methods show better performance than the superalignment approach. Surprisingly, some supertree and medium-level methods exhibit, on average, worse results than a single gene phylogeny with complete taxon information.\r\n\r\nConclusions: For some methods, using the reconstructed gene tree as an estimation of the species tree is superior to the combination of incomplete information. Superalignment usually performs best since it is less susceptible to stochastic error. Supertree methods can outperform superalignment in the presence of gene-tree conflict."}],"license":"https://creativecommons.org/licenses/by/4.0/","citation":{"ama":"Kupczok A, Schmidt H, Von Haeseler A. Accuracy of phylogeny reconstruction methods combining overlapping gene data sets. <i>Algorithms for Molecular Biology</i>. 2010;5(1). doi:<a href=\"https://doi.org/10.1186/1748-7188-5-37\">10.1186/1748-7188-5-37</a>","mla":"Kupczok, Anne, et al. “Accuracy of Phylogeny Reconstruction Methods Combining Overlapping Gene Data Sets.” <i>Algorithms for Molecular Biology</i>, vol. 5, no. 1, 37, BioMed Central, 2010, doi:<a href=\"https://doi.org/10.1186/1748-7188-5-37\">10.1186/1748-7188-5-37</a>.","ieee":"A. Kupczok, H. Schmidt, and A. Von Haeseler, “Accuracy of phylogeny reconstruction methods combining overlapping gene data sets,” <i>Algorithms for Molecular Biology</i>, vol. 5, no. 1. BioMed Central, 2010.","short":"A. Kupczok, H. Schmidt, A. Von Haeseler, Algorithms for Molecular Biology 5 (2010).","ista":"Kupczok A, Schmidt H, Von Haeseler A. 2010. Accuracy of phylogeny reconstruction methods combining overlapping gene data sets. Algorithms for Molecular Biology. 5(1), 37.","chicago":"Kupczok, Anne, Heiko Schmidt, and Arndt Von Haeseler. “Accuracy of Phylogeny Reconstruction Methods Combining Overlapping Gene Data Sets.” <i>Algorithms for Molecular Biology</i>. BioMed Central, 2010. <a href=\"https://doi.org/10.1186/1748-7188-5-37\">https://doi.org/10.1186/1748-7188-5-37</a>.","apa":"Kupczok, A., Schmidt, H., &#38; Von Haeseler, A. (2010). Accuracy of phylogeny reconstruction methods combining overlapping gene data sets. <i>Algorithms for Molecular Biology</i>. BioMed Central. <a href=\"https://doi.org/10.1186/1748-7188-5-37\">https://doi.org/10.1186/1748-7188-5-37</a>"},"date_updated":"2025-09-30T09:48:29Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication":"Algorithms for Molecular Biology","scopus_import":"1","issue":"1","acknowledgement":"Financial support from the Wiener Wissenschafts-, Forschungs- and Technologiefonds (WWTF) is greatly appreciated. A.v.H. acknowledges support from the German Research Foundation (DFG, SPP-1174).","language":[{"iso":"eng"}],"publist_id":"4517"},{"date_updated":"2023-05-08T10:57:11Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"2409-2416","citation":{"short":"X. Feng, H.G. Dickinson, Development 137 (2010) 2409–2416.","ieee":"X. Feng and H. G. Dickinson, “Tapetal cell fate, lineage and proliferation in the Arabidopsis anther,” <i>Development</i>, vol. 137, no. 14. The Company of Biologists, pp. 2409–2416, 2010.","ista":"Feng X, Dickinson HG. 2010. Tapetal cell fate, lineage and proliferation in the Arabidopsis anther. Development. 137(14), 2409–2416.","ama":"Feng X, Dickinson HG. Tapetal cell fate, lineage and proliferation in the Arabidopsis anther. <i>Development</i>. 2010;137(14):2409-2416. doi:<a href=\"https://doi.org/10.1242/dev.049320\">10.1242/dev.049320</a>","mla":"Feng, Xiaoqi, and Hugh G. Dickinson. “Tapetal Cell Fate, Lineage and Proliferation in the Arabidopsis Anther.” <i>Development</i>, vol. 137, no. 14, The Company of Biologists, 2010, pp. 2409–16, doi:<a href=\"https://doi.org/10.1242/dev.049320\">10.1242/dev.049320</a>.","apa":"Feng, X., &#38; Dickinson, H. G. (2010). Tapetal cell fate, lineage and proliferation in the Arabidopsis anther. <i>Development</i>. The Company of Biologists. <a href=\"https://doi.org/10.1242/dev.049320\">https://doi.org/10.1242/dev.049320</a>","chicago":"Feng, Xiaoqi, and Hugh G. Dickinson. “Tapetal Cell Fate, Lineage and Proliferation in the Arabidopsis Anther.” <i>Development</i>. The Company of Biologists, 2010. <a href=\"https://doi.org/10.1242/dev.049320\">https://doi.org/10.1242/dev.049320</a>."},"type":"journal_article","oa_version":"None","article_type":"original","extern":"1","abstract":[{"text":"The four microsporangia of the flowering plant anther develop from archesporial cells in the L2 of the primordium. Within each microsporangium, developing microsporocytes are surrounded by concentric monolayers of tapetal, middle layer and endothecial cells. How this intricate array of tissues, each containing relatively few cells, is established in an organ possessing no formal meristems is poorly understood. We describe here the pivotal role of the LRR receptor kinase EXCESS MICROSPOROCYTES 1 (EMS1) in forming the monolayer of tapetal nurse cells in Arabidopsis. Unusually for plants, tapetal cells are specified very early in development, and are subsequently stimulated to proliferate by a receptor-like kinase (RLK) complex that includes EMS1. Mutations in members of this EMS1 signalling complex and its putative ligand result in male-sterile plants in which tapetal initials fail to proliferate. Surprisingly, these cells continue to develop, isolated at the locular periphery. Mutant and wild-type microsporangia expand at similar rates and the ‘tapetal’ space at the periphery of mutant locules becomes occupied by microsporocytes. However, induction of late expression of EMS1 in the few tapetal initials in ems1 plants results in their proliferation to generate a functional tapetum, and this proliferation suppresses microsporocyte number. Our experiments also show that integrity of the tapetal monolayer is crucial for the maintenance of the polarity of divisions within it. This unexpected autonomy of the tapetal ‘lineage’ is discussed in the context of tissue development in complex plant organs, where constancy in size, shape and cell number is crucial.","lang":"eng"}],"title":"Tapetal cell fate, lineage and proliferation in the Arabidopsis anther","_id":"12199","date_created":"2023-01-16T09:21:54Z","status":"public","author":[{"full_name":"Feng, Xiaoqi","orcid":"0000-0002-4008-1234","id":"e0164712-22ee-11ed-b12a-d80fcdf35958","first_name":"Xiaoqi","last_name":"Feng"},{"full_name":"Dickinson, Hugh G.","first_name":"Hugh G.","last_name":"Dickinson"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["1477-9129","0950-1991"]},"acknowledgement":"We thank the following for providing mutant lines and reagents: Hong Ma, De Ye, Sacco De Vries, and Rod Scott for providing the pA9::Barnase lines and information on A9 expression patterns. Carla Galinha and Paolo Piazza gave valuable help with in situ hybridisation and qRT-PCR, respectively, and we acknowledge Qing Zhang, Helen Prescott and Matthew Dicks for providing excellent technical assistance. We are indebted to Miltos Tsiantis and Angela Hay for helpful discussion, and the research was funded by Oxford University through a Clarendon Scholarship to X.F., with additional financial support from Magdalen College (Oxford).","publication":"Development","scopus_import":"1","issue":"14","fulldoi":"https://doi.org/10.1242/dev.049320","date_published":"2010-07-15T00:00:00Z","article_processing_charge":"No","keyword":["Developmental Biology","Molecular Biology","Anther Tapetum","Arabidopsis","Cell Fate Establishment","EMS1","Reproductive Cell Lineage"],"publication_status":"published","pmid":1,"quality_controlled":"1","year":"2010","intvolume":"       137","volume":137,"doi":"10.1242/dev.049320","external_id":{"pmid":["20570940"]},"publisher":"The Company of Biologists","department":[{"_id":"XiFe"}],"month":"07","day":"15"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-05-08T10:57:59Z","citation":{"mla":"Feng, Xiaoqi, and Hugh G. Dickinson. “Cell–Cell Interactions during Patterning of the <i>Arabidopsis</i> Anther.” <i>Biochemical Society Transactions</i>, vol. 38, no. 2, Portland Press Ltd., 2010, pp. 571–76, doi:<a href=\"https://doi.org/10.1042/bst0380571\">10.1042/bst0380571</a>.","ama":"Feng X, Dickinson HG. Cell–cell interactions during patterning of the <i>Arabidopsis</i> anther. <i>Biochemical Society Transactions</i>. 2010;38(2):571-576. doi:<a href=\"https://doi.org/10.1042/bst0380571\">10.1042/bst0380571</a>","ista":"Feng X, Dickinson HG. 2010. Cell–cell interactions during patterning of the <i>Arabidopsis</i> anther. Biochemical Society Transactions. 38(2), 571–576.","ieee":"X. Feng and H. G. Dickinson, “Cell–cell interactions during patterning of the <i>Arabidopsis</i> anther,” <i>Biochemical Society Transactions</i>, vol. 38, no. 2. Portland Press Ltd., pp. 571–576, 2010.","short":"X. Feng, H.G. Dickinson, Biochemical Society Transactions 38 (2010) 571–576.","chicago":"Feng, Xiaoqi, and Hugh G. Dickinson. “Cell–Cell Interactions during Patterning of the <i>Arabidopsis</i> Anther.” <i>Biochemical Society Transactions</i>. Portland Press Ltd., 2010. <a href=\"https://doi.org/10.1042/bst0380571\">https://doi.org/10.1042/bst0380571</a>.","apa":"Feng, X., &#38; Dickinson, H. G. (2010). Cell–cell interactions during patterning of the <i>Arabidopsis</i> anther. <i>Biochemical Society Transactions</i>. Portland Press Ltd. <a href=\"https://doi.org/10.1042/bst0380571\">https://doi.org/10.1042/bst0380571</a>"},"page":"571-576","abstract":[{"lang":"eng","text":"Key steps in the evolution of the angiosperm anther include the patterning of the concentrically organized microsporangium and the incorporation of four such microsporangia into a leaf-like structure. Mutant studies in the model plant Arabidopsis thaliana are leading to an increasingly accurate picture of (i) the cell lineages culminating in the different cell types present in the microsporangium (the microsporocytes, the tapetum, and the middle and endothecial layers), and (ii) some of the genes responsible for specifying their fates. However, the processes that confer polarity on the developing anther and position the microsporangia within it remain unclear. Certainly, data from a range of experimental strategies suggest that hormones play a central role in establishing polarity and the patterning of the anther initial, and may be responsible for locating the microsporangia. But the fact that microsporangia were originally positioned externally suggests that their development is likely to be autonomous, perhaps with the reproductive cells generating signals controlling the growth and division of the investing anther epidermis. These possibilities are discussed in the context of the expression of genes which initiate and maintain male and female reproductive development, and in the perspective of our current views of anther evolution."}],"extern":"1","article_type":"original","oa_version":"None","type":"journal_article","author":[{"orcid":"0000-0002-4008-1234","full_name":"Feng, Xiaoqi","last_name":"Feng","first_name":"Xiaoqi","id":"e0164712-22ee-11ed-b12a-d80fcdf35958"},{"full_name":"Dickinson, Hugh G.","last_name":"Dickinson","first_name":"Hugh G."}],"date_created":"2023-01-16T09:22:18Z","status":"public","_id":"12200","title":"Cell–cell interactions during patterning of the <i>Arabidopsis</i> anther","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0300-5127","1470-8752"]},"issue":"2","scopus_import":"1","publication":"Biochemical Society Transactions","fulldoi":"https://doi.org/10.1042/bst0380571","keyword":["Biochemistry","Anther Development","Arabidopsis","Cell Fate","Microsporangium","Polarity","Receptor Kinase"],"article_processing_charge":"No","date_published":"2010-03-22T00:00:00Z","intvolume":"        38","year":"2010","quality_controlled":"1","pmid":1,"publication_status":"published","doi":"10.1042/bst0380571","volume":38,"month":"03","department":[{"_id":"XiFe"}],"publisher":"Portland Press Ltd.","external_id":{"pmid":["20298223"]},"day":"22"},{"file":[{"file_id":"4677","file_size":240766,"file_name":"IST-2012-50-v1+1_Forward_analysis_of_depth-bounded_processes.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:46:27Z","checksum":"3e610de84937d821316362658239134a","date_created":"2018-12-12T10:08:17Z","creator":"system","relation":"main_file","access_level":"open_access"}],"doi":"10.1007/978-3-642-12032-9_8","volume":6014,"pubrep_id":"50","oa":1,"corr_author":"1","day":"01","department":[{"_id":"ToHe"}],"month":"03","publisher":"Springer","date_published":"2010-03-01T00:00:00Z","file_date_updated":"2020-07-14T12:46:27Z","alternative_title":["LNCS"],"has_accepted_license":"1","conference":{"location":"Paphos, Cyprus","end_date":"2010-03-28","start_date":"2010-03-20","name":"FoSSaCS: Foundations of Software Science and Computation Structures"},"fulldoi":"https://doi.org/10.1007/978-3-642-12032-9_8","ddc":["004"],"editor":[{"full_name":"Ong, Luke","first_name":"Luke","last_name":"Ong"}],"intvolume":"      6014","year":"2010","quality_controlled":"1","publication_status":"published","publist_id":"1099","language":[{"iso":"eng"}],"scopus_import":1,"citation":{"apa":"Wies, T., Zufferey, D., &#38; Henzinger, T. A. (2010). Forward analysis of depth-bounded processes. In L. Ong (Ed.) (Vol. 6014, pp. 94–108). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Paphos, Cyprus: Springer. <a href=\"https://doi.org/10.1007/978-3-642-12032-9_8\">https://doi.org/10.1007/978-3-642-12032-9_8</a>","chicago":"Wies, Thomas, Damien Zufferey, and Thomas A Henzinger. “Forward Analysis of Depth-Bounded Processes.” edited by Luke Ong, 6014:94–108. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-12032-9_8\">https://doi.org/10.1007/978-3-642-12032-9_8</a>.","ieee":"T. Wies, D. Zufferey, and T. A. Henzinger, “Forward analysis of depth-bounded processes,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Paphos, Cyprus, 2010, vol. 6014, pp. 94–108.","short":"T. Wies, D. Zufferey, T.A. Henzinger, in:, L. Ong (Ed.), Springer, 2010, pp. 94–108.","ista":"Wies T, Zufferey D, Henzinger TA. 2010. Forward analysis of depth-bounded processes. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 6014, 94–108.","ama":"Wies T, Zufferey D, Henzinger TA. Forward analysis of depth-bounded processes. In: Ong L, ed. Vol 6014. Springer; 2010:94-108. doi:<a href=\"https://doi.org/10.1007/978-3-642-12032-9_8\">10.1007/978-3-642-12032-9_8</a>","mla":"Wies, Thomas, et al. <i>Forward Analysis of Depth-Bounded Processes</i>. Edited by Luke Ong, vol. 6014, Springer, 2010, pp. 94–108, doi:<a href=\"https://doi.org/10.1007/978-3-642-12032-9_8\">10.1007/978-3-642-12032-9_8</a>."},"page":"94 - 108","related_material":{"record":[{"status":"public","id":"1405","relation":"dissertation_contains"}]},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-04-09T14:35:23Z","date_created":"2018-12-11T12:08:27Z","status":"public","author":[{"full_name":"Wies, Thomas","last_name":"Wies","first_name":"Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-3197-8736","full_name":"Zufferey, Damien","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","last_name":"Zufferey","first_name":"Damien"},{"last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"}],"_id":"4361","title":"Forward analysis of depth-bounded processes","abstract":[{"lang":"eng","text":"Depth-bounded processes form the most expressive known fragment of the π-calculus for which interesting verification problems are still decidable. In this paper we develop an adequate domain of limits for the well-structured transition systems that are induced by depth-bounded processes. An immediate consequence of our result is that there exists a forward algorithm that decides the covering problem for this class. Unlike backward algorithms, the forward algorithm terminates even if the depth of the process is not known a priori. More importantly, our result suggests a whole spectrum of forward algorithms that enable the effective verification of a large class of mobile systems."}],"oa_version":"Submitted Version","type":"conference"},{"scopus_import":1,"publist_id":"1096","language":[{"iso":"eng"}],"title":"Runtime verification for software transactional memories","_id":"4362","status":"public","date_created":"2018-12-11T12:08:28Z","author":[{"id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","last_name":"Singh","first_name":"Vasu","full_name":"Singh, Vasu"}],"type":"conference","oa_version":"None","abstract":[{"lang":"eng","text":"Software transactional memories (STMs) promise simple and efficient concurrent programming. Several correctness properties have been proposed for STMs. Based on a bounded conflict graph algorithm for verifying correctness of STMs, we develop TRACER, a tool for runtime verification of STM implementations. The novelty of TRACER lies in the way it combines coarse and precise runtime analyses to guarantee sound and complete verification in an efficient manner. We implement TRACER in the TL2 STM implementation. We evaluate the performance of TRACER on STAMP benchmarks. While a precise runtime verification technique based on conflict graphs results in an average slowdown of 60x, the two-level approach of TRACER performs complete verification with an average slowdown of around 25x across different benchmarks."}],"page":"421 - 435","citation":{"mla":"Singh, Vasu. <i>Runtime Verification for Software Transactional Memories</i>. Edited by Oleg Sokolsky et al., vol. 6418, Springer, 2010, pp. 421–35, doi:<a href=\"https://doi.org/10.1007/978-3-642-16612-9_32\">10.1007/978-3-642-16612-9_32</a>.","ama":"Singh V. Runtime verification for software transactional memories. In: Sokolsky O, Rosu G, Tilmann N, et al., eds. Vol 6418. Springer; 2010:421-435. doi:<a href=\"https://doi.org/10.1007/978-3-642-16612-9_32\">10.1007/978-3-642-16612-9_32</a>","ista":"Singh V. 2010. Runtime verification for software transactional memories. RV: International Conference on Runtime Verification, LNCS, vol. 6418, 421–435.","ieee":"V. Singh, “Runtime verification for software transactional memories,” presented at the RV: International Conference on Runtime Verification, St. Julians, Malta, 2010, vol. 6418, pp. 421–435.","short":"V. Singh, in:, O. Sokolsky, G. Rosu, N. Tilmann, H. Barringer, Y. Falcone, B. Finkbeiner, K. Havelund, I. Lee, G. Pace (Eds.), Springer, 2010, pp. 421–435.","chicago":"Singh, Vasu. “Runtime Verification for Software Transactional Memories.” edited by Oleg Sokolsky, Grigore Rosu, Nikolai Tilmann, Howard Barringer, Ylies Falcone, Bernd Finkbeiner, Klaus Havelund, Insup Lee, and Gordon Pace, 6418:421–35. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-16612-9_32\">https://doi.org/10.1007/978-3-642-16612-9_32</a>.","apa":"Singh, V. (2010). Runtime verification for software transactional memories. In O. Sokolsky, G. Rosu, N. Tilmann, H. Barringer, Y. Falcone, B. Finkbeiner, … G. Pace (Eds.) (Vol. 6418, pp. 421–435). Presented at the RV: International Conference on Runtime Verification, St. Julians, Malta: Springer. <a href=\"https://doi.org/10.1007/978-3-642-16612-9_32\">https://doi.org/10.1007/978-3-642-16612-9_32</a>"},"date_updated":"2024-10-09T20:54:01Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","day":"01","corr_author":"1","publisher":"Springer","department":[{"_id":"ToHe"}],"month":"01","volume":6418,"doi":"10.1007/978-3-642-16612-9_32","editor":[{"last_name":"Sokolsky","first_name":"Oleg","full_name":"Sokolsky, Oleg"},{"last_name":"Rosu","first_name":"Grigore","full_name":"Rosu, Grigore"},{"full_name":"Tilmann, Nikolai","last_name":"Tilmann","first_name":"Nikolai"},{"full_name":"Barringer, Howard","first_name":"Howard","last_name":"Barringer"},{"first_name":"Ylies","last_name":"Falcone","full_name":"Falcone, Ylies"},{"first_name":"Bernd","last_name":"Finkbeiner","full_name":"Finkbeiner, Bernd"},{"full_name":"Havelund, Klaus","first_name":"Klaus","last_name":"Havelund"},{"full_name":"Lee, Insup","first_name":"Insup","last_name":"Lee"},{"full_name":"Pace, Gordon","first_name":"Gordon","last_name":"Pace"}],"publication_status":"published","quality_controlled":"1","year":"2010","intvolume":"      6418","conference":{"location":"St. Julians, Malta","name":"RV: International Conference on Runtime Verification","end_date":"2010-11-04","start_date":"2010-11-01"},"date_published":"2010-01-01T00:00:00Z","alternative_title":["LNCS"],"fulldoi":"https://doi.org/10.1007/978-3-642-16612-9_32"},{"ddc":["004"],"editor":[{"last_name":"Henzinger","first_name":"Thomas A.","full_name":"Henzinger, Thomas A."},{"last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"}],"intvolume":"      6246","year":"2010","quality_controlled":"1","publication_status":"published","date_published":"2010-09-08T00:00:00Z","file_date_updated":"2020-07-14T12:46:27Z","alternative_title":["LNCS"],"conference":{"location":"Klosterneuburg, Austria","name":"FORMATS: Formal Modeling and Analysis of Timed Systems","start_date":"2010-09-08","end_date":"2010-09-10"},"has_accepted_license":"1","fulldoi":"https://doi.org/10.1007/978-3-642-15297-9_13","pubrep_id":"49","oa":1,"corr_author":"1","day":"08","month":"09","department":[{"_id":"ToHe"}],"publisher":"Springer","file":[{"file_id":"5028","content_type":"application/pdf","date_updated":"2020-07-14T12:46:27Z","file_name":"IST-2012-49-v1+1_From_MTL_to_deterministic_timed_automata.pdf","file_size":249789,"date_created":"2018-12-12T10:13:43Z","checksum":"b0ca5f5fbe8a3d20ccbc6f51a344a459","access_level":"open_access","relation":"main_file","creator":"system"}],"doi":"10.1007/978-3-642-15297-9_13","volume":6246,"author":[{"first_name":"Dejan","last_name":"Nickovic","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","full_name":"Nickovic, Dejan"},{"full_name":"Piterman, Nir","last_name":"Piterman","first_name":"Nir"}],"status":"public","date_created":"2018-12-11T12:08:30Z","_id":"4369","title":"From MTL to deterministic timed automata","abstract":[{"text":"In this paper we propose a novel technique for constructing timed automata from properties expressed in the logic mtl, under bounded-variability assumptions. We handle full mtl and include all future operators. Our construction is based on separation of the continuous time monitoring of the input sequence and discrete predictions regarding the future. The separation of the continuous from the discrete allows us to determinize our automata in an exponential construction that does not increase the number of clocks. This leads to a doubly exponential construction from mtl to deterministic timed automata, compared with triply exponential using existing approaches. We offer an alternative to the existing approach to linear real-time model checking, which has never been implemented. It further offers a unified framework for model checking, runtime monitoring, and synthesis, in an approach that can reuse tools, implementations, and insights from the discrete setting.","lang":"eng"}],"type":"conference","oa_version":"Submitted Version","project":[{"call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543"},{"grant_number":"214373","call_identifier":"FP7","name":"Design for Embedded Systems","_id":"25F1337C-B435-11E9-9278-68D0E5697425"}],"citation":{"ama":"Nickovic D, Piterman N. From MTL to deterministic timed automata. In: Henzinger TA, Chatterjee K, eds. Vol 6246. Springer; 2010:152-167. doi:<a href=\"https://doi.org/10.1007/978-3-642-15297-9_13\">10.1007/978-3-642-15297-9_13</a>","mla":"Nickovic, Dejan, and Nir Piterman. <i>From MTL to Deterministic Timed Automata</i>. Edited by Thomas A. Henzinger and Krishnendu Chatterjee, vol. 6246, Springer, 2010, pp. 152–67, doi:<a href=\"https://doi.org/10.1007/978-3-642-15297-9_13\">10.1007/978-3-642-15297-9_13</a>.","short":"D. Nickovic, N. Piterman, in:, T.A. Henzinger, K. Chatterjee (Eds.), Springer, 2010, pp. 152–167.","ista":"Nickovic D, Piterman N. 2010. From MTL to deterministic timed automata. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 6246, 152–167.","ieee":"D. Nickovic and N. Piterman, “From MTL to deterministic timed automata,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Klosterneuburg, Austria, 2010, vol. 6246, pp. 152–167.","chicago":"Nickovic, Dejan, and Nir Piterman. “From MTL to Deterministic Timed Automata.” edited by Thomas A. Henzinger and Krishnendu Chatterjee, 6246:152–67. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15297-9_13\">https://doi.org/10.1007/978-3-642-15297-9_13</a>.","apa":"Nickovic, D., &#38; Piterman, N. (2010). From MTL to deterministic timed automata. In T. A. Henzinger &#38; K. Chatterjee (Eds.) (Vol. 6246, pp. 152–167). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Klosterneuburg, Austria: Springer. <a href=\"https://doi.org/10.1007/978-3-642-15297-9_13\">https://doi.org/10.1007/978-3-642-15297-9_13</a>"},"page":"152 - 167","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_updated":"2024-10-09T20:54:01Z","scopus_import":1,"ec_funded":1,"language":[{"iso":"eng"}],"publist_id":"1090"},{"doi":"10.1007/978-3-642-11319-2_6","volume":5944,"month":"01","department":[{"_id":"ToHe"}],"publisher":"Springer","oa":1,"day":"01","main_file_link":[{"url":"https://infoscience.epfl.ch/record/161290/","open_access":"1"}],"fulldoi":"https://doi.org/10.1007/978-3-642-11319-2_6","alternative_title":["LNCS"],"date_published":"2010-01-01T00:00:00Z","conference":{"location":"Madrid, Spain","start_date":"2010-01-17","end_date":"2010-01-19","name":"VMCAI: Verification, Model Checking and Abstract Interpretation"},"intvolume":"      5944","quality_controlled":"1","year":"2010","publication_status":"published","editor":[{"first_name":"Gilles","last_name":"Barthe","full_name":"Barthe, Gilles"},{"full_name":"Hermenegildo, Manuel","first_name":"Manuel","last_name":"Hermenegildo"}],"publist_id":"1081","language":[{"iso":"eng"}],"scopus_import":1,"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:56:31Z","page":"26 - 44","citation":{"mla":"Kuncak, Viktor, et al. <i>Building a Calculus of Data Structures</i>. Edited by Gilles Barthe and Manuel Hermenegildo, vol. 5944, Springer, 2010, pp. 26–44, doi:<a href=\"https://doi.org/10.1007/978-3-642-11319-2_6\">10.1007/978-3-642-11319-2_6</a>.","ama":"Kuncak V, Piskac R, Suter P, Wies T. Building a calculus of data structures. In: Barthe G, Hermenegildo M, eds. Vol 5944. Springer; 2010:26-44. doi:<a href=\"https://doi.org/10.1007/978-3-642-11319-2_6\">10.1007/978-3-642-11319-2_6</a>","ista":"Kuncak V, Piskac R, Suter P, Wies T. 2010. Building a calculus of data structures. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 5944, 26–44.","short":"V. Kuncak, R. Piskac, P. Suter, T. Wies, in:, G. Barthe, M. Hermenegildo (Eds.), Springer, 2010, pp. 26–44.","ieee":"V. Kuncak, R. Piskac, P. Suter, and T. Wies, “Building a calculus of data structures,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Madrid, Spain, 2010, vol. 5944, pp. 26–44.","chicago":"Kuncak, Viktor, Ruzica Piskac, Philippe Suter, and Thomas Wies. “Building a Calculus of Data Structures.” edited by Gilles Barthe and Manuel Hermenegildo, 5944:26–44. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-11319-2_6\">https://doi.org/10.1007/978-3-642-11319-2_6</a>.","apa":"Kuncak, V., Piskac, R., Suter, P., &#38; Wies, T. (2010). Building a calculus of data structures. In G. Barthe &#38; M. Hermenegildo (Eds.) (Vol. 5944, pp. 26–44). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Madrid, Spain: Springer. <a href=\"https://doi.org/10.1007/978-3-642-11319-2_6\">https://doi.org/10.1007/978-3-642-11319-2_6</a>"},"abstract":[{"lang":"eng","text":"Techniques such as verification condition generation, predicate abstraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Programs and their specifications often make use of data structures such as sets, multisets, algebraic data types, or graphs. Consequently, formulas generated from verification also involve such data structures. To automate the proofs of such formulas we propose a logic (a “calculus”) of such data structures. We build the calculus by starting from decidable logics of individual data structures, and connecting them through functions and sets, in ways that go beyond the frameworks such as Nelson-Oppen. The result are new decidable logics that can simultaneously specify properties of different kinds of data structures and overcome the limitations of the individual logics. Several of our decidable logics include abstraction functions that map a data structure into its more abstract view (a tree into a multiset, a multiset into a set), into a numerical quantity (the size or the height), or into the truth value of a candidate data structure invariant (sortedness, or the heap property). For algebraic data types, we identify an asymptotic many-to-one condition on the abstraction function that guarantees the existence of a decision procedure. In addition to the combination based on abstraction functions, we can combine multiple data structure theories if they all reduce to the same data structure logic. As an instance of this approach, we describe a decidable logic whose formulas are propositional combinations of formulas in: weak monadic second-order logic of two successors, two-variable logic with counting, multiset algebra with Presburger arithmetic, the Bernays-Schönfinkel-Ramsey class of first-order logic, and the logic of algebraic data types with the set content function. The subformulas in this combination can share common variables that refer to sets of objects along with the common set algebra operations. Such sound and complete combination is possible because the relations on sets definable in the component logics are all expressible in Boolean Algebra with Presburger Arithmetic. Presburger arithmetic and its new extensions play an important role in our decidability results. In several cases, when we combine logics that belong to NP, we can prove the satisfiability for the combined logic is still in NP."}],"oa_version":"Submitted Version","type":"conference","author":[{"full_name":"Kuncak, Viktor","last_name":"Kuncak","first_name":"Viktor"},{"full_name":"Piskac, Ruzica","last_name":"Piskac","first_name":"Ruzica"},{"full_name":"Suter, Philippe","last_name":"Suter","first_name":"Philippe"},{"full_name":"Wies, Thomas","first_name":"Thomas","last_name":"Wies","id":"447BFB88-F248-11E8-B48F-1D18A9856A87"}],"status":"public","date_created":"2018-12-11T12:08:33Z","_id":"4378","title":"Building a calculus of data structures"}]