[{"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","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."}],"day":"15","extern":"1","title":"Tapetal cell fate, lineage and proliferation in the Arabidopsis anther","volume":137,"year":"2010","doi":"10.1242/dev.049320","publication_status":"published","scopus_import":"1","date_updated":"2023-05-08T10:57:11Z","type":"journal_article","publication":"Development","article_processing_charge":"No","article_type":"original","keyword":["Developmental Biology","Molecular Biology","Anther Tapetum","Arabidopsis","Cell Fate Establishment","EMS1","Reproductive Cell Lineage"],"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).","oa_version":"None","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","pmid":1,"author":[{"first_name":"Xiaoqi","last_name":"Feng","id":"e0164712-22ee-11ed-b12a-d80fcdf35958","full_name":"Feng, Xiaoqi","orcid":"0000-0002-4008-1234"},{"last_name":"Dickinson","first_name":"Hugh G.","full_name":"Dickinson, Hugh G."}],"external_id":{"pmid":["20570940"]},"issue":"14","publication_identifier":{"issn":["1477-9129","0950-1991"]},"intvolume":"       137","_id":"12199","quality_controlled":"1","date_published":"2010-07-15T00:00:00Z","status":"public","month":"07","page":"2409-2416","date_created":"2023-01-16T09:21:54Z","department":[{"_id":"XiFe"}],"publisher":"The Company of Biologists","citation":{"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>","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.","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>.","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>.","short":"X. Feng, H.G. Dickinson, Development 137 (2010) 2409–2416.","ista":"Feng X, Dickinson HG. 2010. Tapetal cell fate, lineage and proliferation in the Arabidopsis anther. Development. 137(14), 2409–2416."}},{"keyword":["Biochemistry","Anther Development","Arabidopsis","Cell Fate","Microsporangium","Polarity","Receptor Kinase"],"oa_version":"None","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Feng","first_name":"Xiaoqi","full_name":"Feng, Xiaoqi","id":"e0164712-22ee-11ed-b12a-d80fcdf35958","orcid":"0000-0002-4008-1234"},{"full_name":"Dickinson, Hugh G.","last_name":"Dickinson","first_name":"Hugh G."}],"pmid":1,"external_id":{"pmid":["20298223"]},"issue":"2","publication_identifier":{"issn":["0300-5127","1470-8752"]},"intvolume":"        38","_id":"12200","quality_controlled":"1","date_published":"2010-03-22T00:00:00Z","status":"public","month":"03","page":"571-576","date_created":"2023-01-16T09:22:18Z","department":[{"_id":"XiFe"}],"citation":{"ista":"Feng X, Dickinson HG. 2010. Cell–cell interactions during patterning of the <i>Arabidopsis</i> anther. Biochemical Society Transactions. 38(2), 571–576.","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>.","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>","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>","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."},"publisher":"Portland Press Ltd.","language":[{"iso":"eng"}],"abstract":[{"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.","lang":"eng"}],"day":"22","extern":"1","title":"Cell–cell interactions during patterning of the <i>Arabidopsis</i> anther","volume":38,"year":"2010","doi":"10.1042/bst0380571","publication_status":"published","scopus_import":"1","date_updated":"2023-05-08T10:57:59Z","publication":"Biochemical Society Transactions","type":"journal_article","article_processing_charge":"No","article_type":"original"},{"scopus_import":"1","date_updated":"2025-09-30T09:47:59Z","publication":"Genetics","type":"journal_article","article_processing_charge":"No","abstract":[{"text":"Biological traits result in part from interactions between different genetic loci. This can lead to sign epistasis, in which a beneficial adaptation involves a combination of individually deleterious or neutral mutations; in this case, a population must cross a “fitness valley” to adapt. Recombination can assist this process by combining mutations from different individuals or retard it by breaking up the adaptive combination. Here, we analyze the simplest fitness valley, in which an adaptation requires one mutation at each of two loci to provide a fitness benefit. We present a theoretical analysis of the effect of recombination on the valley-crossing process across the full spectrum of possible parameter regimes. We find that low recombination rates can speed up valley crossing relative to the asexual case, while higher recombination rates slow down valley crossing, with the transition between the two regimes occurring when the recombination rate between the loci is approximately equal to the selective advantage provided by the adaptation. In large populations, if the recombination rate is high and selection against single mutants is substantial, the time to cross the valley grows exponentially with population size, effectively meaning that the population cannot acquire the adaptation. Recombination at the optimal (low) rate can reduce the valley-crossing time by up to several orders of magnitude relative to that in an asexual population. ","lang":"eng"}],"corr_author":"1","language":[{"iso":"eng"}],"publist_id":"3337","title":"The rate of fitness-valley crossing in sexual populations","volume":186,"year":"2010","day":"01","oa":1,"publication_status":"published","doi":"10.1534/genetics.110.123240","ec_funded":1,"main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2998319/","open_access":"1"}],"intvolume":"       186","issue":"4","_id":"3303","date_published":"2010-12-01T00:00:00Z","project":[{"grant_number":"250152","_id":"25B07788-B435-11E9-9278-68D0E5697425","name":"Limits to selection in biology and in evolutionary computation","call_identifier":"FP7"}],"quality_controlled":"1","page":"1389 - 1410","status":"public","month":"12","publisher":"Genetics Society of America","citation":{"ama":"Weissman D, Feldman M, Fisher D. The rate of fitness-valley crossing in sexual populations. <i>Genetics</i>. 2010;186(4):1389-1410. doi:<a href=\"https://doi.org/10.1534/genetics.110.123240\">10.1534/genetics.110.123240</a>","ieee":"D. Weissman, M. Feldman, and D. Fisher, “The rate of fitness-valley crossing in sexual populations,” <i>Genetics</i>, vol. 186, no. 4. Genetics Society of America, pp. 1389–1410, 2010.","apa":"Weissman, D., Feldman, M., &#38; Fisher, D. (2010). The rate of fitness-valley crossing in sexual populations. <i>Genetics</i>. Genetics Society of America. <a href=\"https://doi.org/10.1534/genetics.110.123240\">https://doi.org/10.1534/genetics.110.123240</a>","chicago":"Weissman, Daniel, Marcus Feldman, and Daniel Fisher. “The Rate of Fitness-Valley Crossing in Sexual Populations.” <i>Genetics</i>. Genetics Society of America, 2010. <a href=\"https://doi.org/10.1534/genetics.110.123240\">https://doi.org/10.1534/genetics.110.123240</a>.","short":"D. Weissman, M. Feldman, D. Fisher, Genetics 186 (2010) 1389–1410.","mla":"Weissman, Daniel, et al. “The Rate of Fitness-Valley Crossing in Sexual Populations.” <i>Genetics</i>, vol. 186, no. 4, Genetics Society of America, 2010, pp. 1389–410, doi:<a href=\"https://doi.org/10.1534/genetics.110.123240\">10.1534/genetics.110.123240</a>.","ista":"Weissman D, Feldman M, Fisher D. 2010. The rate of fitness-valley crossing in sexual populations. Genetics. 186(4), 1389–1410."},"date_created":"2018-12-11T12:02:33Z","department":[{"_id":"NiBa"}],"acknowledgement":"This work was supported in part by a Robert N. Noyce Stanford Graduate Fellowship and European Research Council grant 250152 (to D.B.W.) and by National Institutes of Health grant GM 28016 (to M.W.F.).\r\nWe thank Michael Desai for many ideas and discussions and are grateful to Joanna Masel and an anonymous reviewer for their helpful suggestions. ","oa_version":"Submitted Version","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","author":[{"first_name":"Daniel","last_name":"Weissman","id":"2D0CE020-F248-11E8-B48F-1D18A9856A87","full_name":"Weissman, Daniel"},{"full_name":"Feldman, Marcus","first_name":"Marcus","last_name":"Feldman"},{"last_name":"Fisher","first_name":"Daniel","full_name":"Fisher, Daniel"}],"external_id":{"isi":["000285297000025"]},"isi":1},{"date_published":"2010-09-06T00:00:00Z","place":"Berlin, Heidelberg","quality_controlled":"1","_id":"14983","publication_identifier":{"isbn":["9783642020902"],"eisbn":["9783642020919"],"issn":["1612-3018"]},"citation":{"ieee":"A. Schlögl, C. Vidaurre, and K.-R. Müller, “Adaptive Methods in BCI Research - An Introductory Tutorial,” in <i>Brain-Computer Interfaces</i>, 1st ed., B. Graimann, G. Pfurtscheller, and B. Allison, Eds. Berlin, Heidelberg: Springer, 2010, pp. 331–355.","ama":"Schlögl A, Vidaurre C, Müller K-R. Adaptive Methods in BCI Research - An Introductory Tutorial. In: Graimann B, Pfurtscheller G, Allison B, eds. <i>Brain-Computer Interfaces</i>. 1st ed. FRONTCOLL. Berlin, Heidelberg: Springer; 2010:331-355. doi:<a href=\"https://doi.org/10.1007/978-3-642-02091-9_18\">10.1007/978-3-642-02091-9_18</a>","apa":"Schlögl, A., Vidaurre, C., &#38; Müller, K.-R. (2010). Adaptive Methods in BCI Research - An Introductory Tutorial. In B. Graimann, G. Pfurtscheller, &#38; B. Allison (Eds.), <i>Brain-Computer Interfaces</i> (1st ed., pp. 331–355). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-642-02091-9_18\">https://doi.org/10.1007/978-3-642-02091-9_18</a>","mla":"Schlögl, Alois, et al. “Adaptive Methods in BCI Research - An Introductory Tutorial.” <i>Brain-Computer Interfaces</i>, edited by Bernhard Graimann et al., 1st ed., Springer, 2010, pp. 331–55, doi:<a href=\"https://doi.org/10.1007/978-3-642-02091-9_18\">10.1007/978-3-642-02091-9_18</a>.","short":"A. Schlögl, C. Vidaurre, K.-R. Müller, in:, B. Graimann, G. Pfurtscheller, B. Allison (Eds.), Brain-Computer Interfaces, 1st ed., Springer, Berlin, Heidelberg, 2010, pp. 331–355.","ista":"Schlögl A, Vidaurre C, Müller K-R. 2010.Adaptive Methods in BCI Research - An Introductory Tutorial. In: Brain-Computer Interfaces. The Frontiers Collection, , 331–355.","chicago":"Schlögl, Alois, Carmen Vidaurre, and Klaus-Robert Müller. “Adaptive Methods in BCI Research - An Introductory Tutorial.” In <i>Brain-Computer Interfaces</i>, edited by Bernhard Graimann, Gert Pfurtscheller, and Brendan Allison, 1st ed., 331–55. FRONTCOLL. Berlin, Heidelberg: Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-02091-9_18\">https://doi.org/10.1007/978-3-642-02091-9_18</a>."},"publisher":"Springer","date_created":"2024-02-14T09:56:00Z","department":[{"_id":"ScienComp"}],"page":"331-355","month":"09","status":"public","acknowledgement":"This work was supported by the EU grants “BrainCom” (FP6-2004-Mobility-5 Grant No 024259) and “Multi-adaptive BCI” (MEIF-CT-2006 Grant No 040666). Furthermore, we thank Matthias Krauledat for fruitful discussions and tools for generating Fig. 5.","author":[{"full_name":"Schlögl, Alois","orcid":"0000-0002-5621-8100","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","first_name":"Alois","last_name":"Schlögl"},{"full_name":"Vidaurre, Carmen","first_name":"Carmen","last_name":"Vidaurre"},{"last_name":"Müller","first_name":"Klaus-Robert","full_name":"Müller, Klaus-Robert"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","publication":"Brain-Computer Interfaces","type":"book_chapter","date_updated":"2024-10-21T06:03:06Z","scopus_import":"1","series_title":"FRONTCOLL","article_processing_charge":"No","editor":[{"last_name":"Graimann","first_name":"Bernhard","full_name":"Graimann, Bernhard"},{"first_name":"Gert","last_name":"Pfurtscheller","full_name":"Pfurtscheller, Gert"},{"full_name":"Allison, Brendan","first_name":"Brendan","last_name":"Allison"}],"alternative_title":["The Frontiers Collection"],"year":"2010","title":"Adaptive Methods in BCI Research - An Introductory Tutorial","day":"06","abstract":[{"text":"This chapter tackles a difficult challenge: presenting signal processing material to non-experts. This chapter is meant to be comprehensible to people who have some math background, including a course in linear algebra and basic statistics, but do not specialize in mathematics, engineering, or related fields. Some formulas assume the reader is familiar with matrices and basic matrix operations, but not more advanced material. Furthermore, we tried to make the chapter readable even if you skip the formulas. Nevertheless, we include some simple methods to demonstrate the basics of adaptive data processing, then we proceed with some advanced methods that are fundamental in adaptive signal processing, and are likely to be useful in a variety of applications. The advanced algorithms are also online available [30]. In the second part, these techniques are applied to some real-world BCI data.","lang":"eng"}],"corr_author":"1","edition":"1","language":[{"iso":"eng"}],"publication_status":"published","doi":"10.1007/978-3-642-02091-9_18"},{"scopus_import":"1","type":"conference","publication":"Logic for Programming, Artificial Intelligence, and Reasoning","date_updated":"2025-09-30T09:51:13Z","article_processing_charge":"No","editor":[{"full_name":"Clarke, Edmund M","last_name":"Clarke","first_name":"Edmund M"},{"full_name":"Voronkov, Andrei","last_name":"Voronkov","first_name":"Andrei"}],"series_title":"LNCS","language":[{"iso":"eng"}],"corr_author":"1","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"}],"oa":1,"conference":{"name":"LPAR: Logic for Programming, Artificial Intelligence and Reasoning","location":"Dakar, Senegal","end_date":"2010-05-01","start_date":"2010-04-25"},"day":"01","year":"2010","volume":6355,"title":"ABC: Algebraic Bound Computation for loops","doi":"10.1007/978-3-642-17511-4_7","publication_status":"published","main_file_link":[{"open_access":"1","url":"https://infoscience.epfl.ch/record/186096"}],"_id":"10908","publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"eisbn":["9783642175114"],"isbn":["9783642175107"]},"intvolume":"      6355","quality_controlled":"1","date_published":"2010-05-01T00:00:00Z","place":"Berlin, Heidelberg","month":"05","status":"public","page":"103-118","date_created":"2022-03-21T08:14:35Z","department":[{"_id":"ToHe"}],"citation":{"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>","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>","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.","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>.","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.","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>."},"publisher":"Springer Nature","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).","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa_version":"Submitted Version","isi":1,"external_id":{"isi":["000309668000007"]},"author":[{"last_name":"Blanc","first_name":"Régis","full_name":"Blanc, Régis"},{"first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724"},{"last_name":"Hottelier","first_name":"Thibaud","full_name":"Hottelier, Thibaud"},{"full_name":"Kovács, Laura","last_name":"Kovács","first_name":"Laura"}]},{"_id":"10909","publication_identifier":{"eisbn":["9781611973075"]},"scopus_import":"1","publication":"Proceedings of the 2010 Annual ACM-SIAM Symposium on Discrete Algorithms","type":"conference","quality_controlled":"1","date_updated":"2025-09-30T09:22:32Z","date_published":"2010-02-01T00:00:00Z","month":"02","article_processing_charge":"No","status":"public","page":"1594-1604","date_created":"2022-03-21T08:24:07Z","department":[{"_id":"HeEd"}],"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.","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>.","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.","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>.","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.","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>"},"publisher":"Society for Industrial and Applied Mathematics","language":[{"iso":"eng"}],"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."}],"corr_author":"1","acknowledgement":"Partially supported by the Austrian Science Fund under grantFSP-S9103-N04 and P20134-N13.","conference":{"location":"Austin, TX, United States","name":"SODA: Symposium on Discrete Algorithms","end_date":"2010-01-19","start_date":"2010-01-17"},"day":"01","year":"2010","title":"Hardness results for homology localization","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1137/1.9781611973075.129","oa_version":"None","related_material":{"record":[{"relation":"later_version","id":"3267","status":"public"}]},"publication_status":"published","author":[{"full_name":"Chen, Chao","id":"3E92416E-F248-11E8-B48F-1D18A9856A87","first_name":"Chao","last_name":"Chen"},{"last_name":"Freedman","first_name":"Daniel","full_name":"Freedman, Daniel"}]},{"publication_status":"published","doi":"10.1186/1748-7188-5-37","file_date_updated":"2020-07-14T12:45:40Z","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."}],"publist_id":"4517","article_number":"37","language":[{"iso":"eng"}],"year":"2010","volume":5,"title":"Accuracy of phylogeny reconstruction methods combining overlapping gene data sets","oa":1,"day":"06","article_processing_charge":"No","scopus_import":"1","ddc":["576"],"pubrep_id":"939","type":"journal_article","publication":"Algorithms for Molecular Biology","date_updated":"2025-09-30T09:48:29Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa_version":"Published Version","external_id":{"isi":["000286183400001"]},"author":[{"id":"2BB22BC2-F248-11E8-B48F-1D18A9856A87","full_name":"Kupczok, Anne","last_name":"Kupczok","first_name":"Anne"},{"first_name":"Heiko","last_name":"Schmidt","full_name":"Schmidt, Heiko"},{"full_name":"Von Haeseler, Arndt","first_name":"Arndt","last_name":"Von Haeseler"}],"isi":1,"file":[{"content_type":"application/pdf","creator":"system","date_updated":"2020-07-14T12:45:40Z","file_id":"4739","file_name":"IST-2018-939-v1+1_2010_Kupczok_Accuracy_of.pdf","checksum":"e2497285388bc4da629bafb46662eb43","file_size":723929,"access_level":"open_access","relation":"main_file","date_created":"2018-12-12T10:09:16Z"}],"has_accepted_license":"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).","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"month":"12","status":"public","publisher":"BioMed Central","citation":{"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.","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>.","short":"A. Kupczok, H. Schmidt, A. Von Haeseler, Algorithms for Molecular Biology 5 (2010).","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>.","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.","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>","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>"},"department":[{"_id":"JoBo"}],"date_created":"2018-12-11T11:57:30Z","_id":"2409","intvolume":"         5","issue":"1","date_published":"2010-12-06T00:00:00Z","quality_controlled":"1"},{"scopus_import":"1","publication":"Science","type":"journal_article","date_updated":"2021-12-14T08:35:37Z","article_processing_charge":"No","article_type":"original","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Eukaryotic cytosine methylation represses transcription but also occurs in the bodies of active genes, and the extent of methylation biology conservation is unclear. We quantified DNA methylation in 17 eukaryotic genomes and found that gene body methylation is conserved between plants and animals, whereas selective methylation of transposons is not. We show that methylation of plant transposons in the CHG context extends to green algae and that exclusion of histone H2A.Z from methylated DNA is conserved between plants and animals, and we present evidence for RNA-directed DNA methylation of fungal genes. Our data demonstrate that extant DNA methylation systems are mosaics of conserved and derived features, and indicate that gene body methylation is an ancient property of eukaryotic genomes."}],"extern":"1","day":"14","year":"2010","title":"Genome-wide evolutionary analysis of eukaryotic DNA methylation","volume":328,"doi":"10.1126/science.1186366","publication_status":"published","_id":"9452","issue":"5980","intvolume":"       328","publication_identifier":{"issn":["0036-8075"],"eissn":["1095-9203"]},"quality_controlled":"1","date_published":"2010-05-14T00:00:00Z","month":"05","status":"public","page":"916-919","date_created":"2021-06-04T08:26:08Z","department":[{"_id":"DaZi"}],"citation":{"mla":"Zemach, Assaf, et al. “Genome-Wide Evolutionary Analysis of Eukaryotic DNA Methylation.” <i>Science</i>, vol. 328, no. 5980, American Association for the Advancement of Science, 2010, pp. 916–19, doi:<a href=\"https://doi.org/10.1126/science.1186366\">10.1126/science.1186366</a>.","short":"A. Zemach, I.E. McDaniel, P. Silva, D. Zilberman, Science 328 (2010) 916–919.","ista":"Zemach A, McDaniel IE, Silva P, Zilberman D. 2010. Genome-wide evolutionary analysis of eukaryotic DNA methylation. Science. 328(5980), 916–919.","chicago":"Zemach, Assaf , Ivy E. McDaniel, Pedro Silva, and Daniel Zilberman. “Genome-Wide Evolutionary Analysis of Eukaryotic DNA Methylation.” <i>Science</i>. American Association for the Advancement of Science, 2010. <a href=\"https://doi.org/10.1126/science.1186366\">https://doi.org/10.1126/science.1186366</a>.","ieee":"A. Zemach, I. E. McDaniel, P. Silva, and D. Zilberman, “Genome-wide evolutionary analysis of eukaryotic DNA methylation,” <i>Science</i>, vol. 328, no. 5980. American Association for the Advancement of Science, pp. 916–919, 2010.","apa":"Zemach, A., McDaniel, I. E., Silva, P., &#38; Zilberman, D. (2010). Genome-wide evolutionary analysis of eukaryotic DNA methylation. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.1186366\">https://doi.org/10.1126/science.1186366</a>","ama":"Zemach A, McDaniel IE, Silva P, Zilberman D. Genome-wide evolutionary analysis of eukaryotic DNA methylation. <i>Science</i>. 2010;328(5980):916-919. doi:<a href=\"https://doi.org/10.1126/science.1186366\">10.1126/science.1186366</a>"},"publisher":"American Association for the Advancement of Science","keyword":["Multidisciplinary"],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","oa_version":"None","external_id":{"pmid":["20395474 "]},"author":[{"full_name":"Zemach, Assaf ","first_name":"Assaf ","last_name":"Zemach"},{"first_name":"Ivy E.","last_name":"McDaniel","full_name":"McDaniel, Ivy E."},{"full_name":"Silva, Pedro","first_name":"Pedro","last_name":"Silva"},{"first_name":"Daniel","last_name":"Zilberman","orcid":"0000-0002-0123-8649","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","full_name":"Zilberman, Daniel"}],"pmid":1},{"external_id":{"pmid":["20937895"]},"author":[{"first_name":"Assaf","last_name":"Zemach","full_name":"Zemach, Assaf"},{"first_name":"M. Yvonne","last_name":"Kim","full_name":"Kim, M. Yvonne"},{"first_name":"Pedro","last_name":"Silva","full_name":"Silva, Pedro"},{"full_name":"Rodrigues, Jessica A.","first_name":"Jessica A.","last_name":"Rodrigues"},{"full_name":"Dotson, Bradley","last_name":"Dotson","first_name":"Bradley"},{"full_name":"Brooks, Matthew D.","last_name":"Brooks","first_name":"Matthew D."},{"orcid":"0000-0002-0123-8649","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","full_name":"Zilberman, Daniel","first_name":"Daniel","last_name":"Zilberman"}],"pmid":1,"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","oa_version":"Published Version","date_published":"2010-10-26T00:00:00Z","quality_controlled":"1","_id":"9485","intvolume":"       107","publication_identifier":{"eissn":["1091-6490"],"issn":["0027-8424"]},"issue":"43","publisher":"National Academy of Sciences","citation":{"chicago":"Zemach, Assaf, M. Yvonne Kim, Pedro Silva, Jessica A. Rodrigues, Bradley Dotson, Matthew D. Brooks, and Daniel Zilberman. “Local DNA Hypomethylation Activates Genes in Rice Endosperm.” <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences, 2010. <a href=\"https://doi.org/10.1073/pnas.1009695107\">https://doi.org/10.1073/pnas.1009695107</a>.","ista":"Zemach A, Kim MY, Silva P, Rodrigues JA, Dotson B, Brooks MD, Zilberman D. 2010. Local DNA hypomethylation activates genes in rice endosperm. Proceedings of the National Academy of Sciences. 107(43), 18729–18734.","short":"A. Zemach, M.Y. Kim, P. Silva, J.A. Rodrigues, B. Dotson, M.D. Brooks, D. Zilberman, Proceedings of the National Academy of Sciences 107 (2010) 18729–18734.","mla":"Zemach, Assaf, et al. “Local DNA Hypomethylation Activates Genes in Rice Endosperm.” <i>Proceedings of the National Academy of Sciences</i>, vol. 107, no. 43, National Academy of Sciences, 2010, pp. 18729–34, doi:<a href=\"https://doi.org/10.1073/pnas.1009695107\">10.1073/pnas.1009695107</a>.","ieee":"A. Zemach <i>et al.</i>, “Local DNA hypomethylation activates genes in rice endosperm,” <i>Proceedings of the National Academy of Sciences</i>, vol. 107, no. 43. National Academy of Sciences, pp. 18729–18734, 2010.","ama":"Zemach A, Kim MY, Silva P, et al. Local DNA hypomethylation activates genes in rice endosperm. <i>Proceedings of the National Academy of Sciences</i>. 2010;107(43):18729-18734. doi:<a href=\"https://doi.org/10.1073/pnas.1009695107\">10.1073/pnas.1009695107</a>","apa":"Zemach, A., Kim, M. Y., Silva, P., Rodrigues, J. A., Dotson, B., Brooks, M. D., &#38; Zilberman, D. (2010). Local DNA hypomethylation activates genes in rice endosperm. <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1009695107\">https://doi.org/10.1073/pnas.1009695107</a>"},"department":[{"_id":"DaZi"}],"date_created":"2021-06-07T09:31:01Z","page":"18729-18734","month":"10","status":"public","year":"2010","title":"Local DNA hypomethylation activates genes in rice endosperm","volume":107,"extern":"1","oa":1,"day":"26","abstract":[{"lang":"eng","text":"Cytosine methylation silences transposable elements in plants, vertebrates, and fungi but also regulates gene expression. Plant methylation is catalyzed by three families of enzymes, each with a preferred sequence context: CG, CHG (H = A, C, or T), and CHH, with CHH methylation targeted by the RNAi pathway. Arabidopsis thaliana endosperm, a placenta-like tissue that nourishes the embryo, is globally hypomethylated in the CG context while retaining high non-CG methylation. Global methylation dynamics in seeds of cereal crops that provide the bulk of human nutrition remain unknown. Here, we show that rice endosperm DNA is hypomethylated in all sequence contexts. Non-CG methylation is reduced evenly across the genome, whereas CG hypomethylation is localized. CHH methylation of small transposable elements is increased in embryos, suggesting that endosperm demethylation enhances transposon silencing. Genes preferentially expressed in endosperm, including those coding for major storage proteins and starch synthesizing enzymes, are frequently hypomethylated in endosperm, indicating that DNA methylation is a crucial regulator of rice endosperm biogenesis. Our data show that genome-wide reshaping of seed DNA methylation is conserved among angiosperms and has a profound effect on gene expression in cereal crops."}],"language":[{"iso":"eng"}],"main_file_link":[{"url":"https://doi.org/10.1073/pnas.1009695107","open_access":"1"}],"publication_status":"published","doi":"10.1073/pnas.1009695107","type":"journal_article","publication":"Proceedings of the National Academy of Sciences","date_updated":"2021-12-14T08:40:02Z","scopus_import":"1","article_type":"original","article_processing_charge":"No"},{"scopus_import":"1","date_updated":"2021-12-14T08:52:34Z","type":"journal_article","publication":"Current Biology","article_processing_charge":"No","article_type":"review","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Cytosine methylation is an ancient process with conserved enzymology but diverse biological functions that include defense against transposable elements and regulation of gene expression. Here we will discuss the evolution and biological significance of eukaryotic DNA methylation, the likely drivers of that evolution, and major remaining mysteries."}],"day":"14","oa":1,"extern":"1","title":"Evolution of eukaryotic DNA methylation and the pursuit of safer sex","volume":20,"year":"2010","doi":"10.1016/j.cub.2010.07.007","publication_status":"published","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.cub.2010.07.007"}],"publication_identifier":{"issn":["0960-9822"],"eissn":["1879-0445"]},"issue":"17","intvolume":"        20","_id":"9489","quality_controlled":"1","date_published":"2010-09-14T00:00:00Z","status":"public","month":"09","page":"R780-R785","department":[{"_id":"DaZi"}],"date_created":"2021-06-07T09:45:27Z","publisher":"Elsevier","citation":{"ista":"Zemach A, Zilberman D. 2010. Evolution of eukaryotic DNA methylation and the pursuit of safer sex. Current Biology. 20(17), R780–R785.","mla":"Zemach, Assaf, and Daniel Zilberman. “Evolution of Eukaryotic DNA Methylation and the Pursuit of Safer Sex.” <i>Current Biology</i>, vol. 20, no. 17, Elsevier, 2010, pp. R780–85, doi:<a href=\"https://doi.org/10.1016/j.cub.2010.07.007\">10.1016/j.cub.2010.07.007</a>.","short":"A. Zemach, D. Zilberman, Current Biology 20 (2010) R780–R785.","chicago":"Zemach, Assaf, and Daniel Zilberman. “Evolution of Eukaryotic DNA Methylation and the Pursuit of Safer Sex.” <i>Current Biology</i>. Elsevier, 2010. <a href=\"https://doi.org/10.1016/j.cub.2010.07.007\">https://doi.org/10.1016/j.cub.2010.07.007</a>.","ieee":"A. Zemach and D. Zilberman, “Evolution of eukaryotic DNA methylation and the pursuit of safer sex,” <i>Current Biology</i>, vol. 20, no. 17. Elsevier, pp. R780–R785, 2010.","ama":"Zemach A, Zilberman D. Evolution of eukaryotic DNA methylation and the pursuit of safer sex. <i>Current Biology</i>. 2010;20(17):R780-R785. doi:<a href=\"https://doi.org/10.1016/j.cub.2010.07.007\">10.1016/j.cub.2010.07.007</a>","apa":"Zemach, A., &#38; Zilberman, D. (2010). Evolution of eukaryotic DNA methylation and the pursuit of safer sex. <i>Current Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.cub.2010.07.007\">https://doi.org/10.1016/j.cub.2010.07.007</a>"},"oa_version":"Published Version","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","pmid":1,"author":[{"full_name":"Zemach, Assaf","last_name":"Zemach","first_name":"Assaf"},{"last_name":"Zilberman","first_name":"Daniel","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","orcid":"0000-0002-0123-8649","full_name":"Zilberman, Daniel"}],"external_id":{"pmid":["20833323"]}},{"date_published":"2010-07-20T00:00:00Z","date_updated":"2025-09-30T09:42:52Z","type":"research_data_reference","_id":"9764","publisher":"Public Library of Science","citation":{"chicago":"Rosas, Ulises, Nicholas H Barton, Lucy Copsey, Pierre Barbier De Reuille, and Enrico Coen. “Heterosis and the Drift Load.” Public Library of Science, 2010. <a href=\"https://doi.org/10.1371/journal.pbio.1000429.s003\">https://doi.org/10.1371/journal.pbio.1000429.s003</a>.","mla":"Rosas, Ulises, et al. <i>Heterosis and the Drift Load</i>. Public Library of Science, 2010, doi:<a href=\"https://doi.org/10.1371/journal.pbio.1000429.s003\">10.1371/journal.pbio.1000429.s003</a>.","short":"U. Rosas, N.H. Barton, L. Copsey, P. Barbier De Reuille, E. Coen, (2010).","ista":"Rosas U, Barton NH, Copsey L, Barbier De Reuille P, Coen E. 2010. Heterosis and the drift load, Public Library of Science, <a href=\"https://doi.org/10.1371/journal.pbio.1000429.s003\">10.1371/journal.pbio.1000429.s003</a>.","ieee":"U. Rosas, N. H. Barton, L. Copsey, P. Barbier De Reuille, and E. Coen, “Heterosis and the drift load.” Public Library of Science, 2010.","ama":"Rosas U, Barton NH, Copsey L, Barbier De Reuille P, Coen E. Heterosis and the drift load. 2010. doi:<a href=\"https://doi.org/10.1371/journal.pbio.1000429.s003\">10.1371/journal.pbio.1000429.s003</a>","apa":"Rosas, U., Barton, N. H., Copsey, L., Barbier De Reuille, P., &#38; Coen, E. (2010). Heterosis and the drift load. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pbio.1000429.s003\">https://doi.org/10.1371/journal.pbio.1000429.s003</a>"},"department":[{"_id":"NiBa"}],"date_created":"2021-08-02T09:45:39Z","status":"public","month":"07","article_processing_charge":"No","title":"Heterosis and the drift load","year":"2010","day":"20","author":[{"full_name":"Rosas, Ulises","first_name":"Ulises","last_name":"Rosas"},{"last_name":"Barton","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240"},{"full_name":"Copsey, Lucy","first_name":"Lucy","last_name":"Copsey"},{"full_name":"Barbier De Reuille, Pierre","last_name":"Barbier De Reuille","first_name":"Pierre"},{"last_name":"Coen","first_name":"Enrico","full_name":"Coen, Enrico"}],"oa_version":"Published Version","related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"3779"}]},"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","doi":"10.1371/journal.pbio.1000429.s003"},{"publication_status":"published","doi":"10.1111/j.1558-5646.2010.01019.x","year":"2010","volume":64,"title":"A new model for extinction and recolonization in two dimensions: Quantifying phylogeography","day":"01","corr_author":"1","abstract":[{"text":"Classical models of gene flow fail in three ways: they cannot explain large-scale patterns; they predict much more genetic diversity than is observed; and they assume that loosely linked genetic loci evolve independently. We propose a new model that deals with these problems. Extinction events kill some fraction of individuals in a region. These are replaced by offspring from a small number of parents, drawn from the preexisting population. This model of evolution forwards in time corresponds to a backwards model, in which ancestral lineages jump to a new location if they are hit by an event, and may coalesce with other lineages that are hit by the same event. We derive an expression for the identity in allelic state, and show that, over scales much larger than the largest event, this converges to the classical value derived by Wright and Malécot. However, rare events that cover large areas cause low genetic diversity, large-scale patterns, and correlations in ancestry between unlinked loci.","lang":"eng"}],"publist_id":"2780","language":[{"iso":"eng"}],"article_processing_charge":"No","type":"journal_article","publication":"Evolution","date_updated":"2025-09-30T09:50:22Z","scopus_import":"1","external_id":{"isi":["000281636400017"]},"author":[{"last_name":"Barton","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H"},{"first_name":"Jerome","last_name":"Kelleher","full_name":"Kelleher, Jerome"},{"first_name":"Alison","last_name":"Etheridge","full_name":"Etheridge, Alison"}],"isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa_version":"None","acknowledgement":"This work has made use of the resources provided by the Edinburgh Compute and Data Facility (ECDF). The ECDF is partially supported by the eDIKT initiative. NHB is supported in part by EPSRC Grant EP/E066070/1; JK is supported by EPSRC Grant EP/E066070/1; and AME is supported in part by EPSRC Grant EP/E065945/1.","citation":{"chicago":"Barton, Nicholas H, Jerome Kelleher, and Alison Etheridge. “A New Model for Extinction and Recolonization in Two Dimensions: Quantifying Phylogeography.” <i>Evolution</i>. Wiley-Blackwell, 2010. <a href=\"https://doi.org/10.1111/j.1558-5646.2010.01019.x\">https://doi.org/10.1111/j.1558-5646.2010.01019.x</a>.","mla":"Barton, Nicholas H., et al. “A New Model for Extinction and Recolonization in Two Dimensions: Quantifying Phylogeography.” <i>Evolution</i>, vol. 64, no. 9, Wiley-Blackwell, 2010, pp. 2701–15, doi:<a href=\"https://doi.org/10.1111/j.1558-5646.2010.01019.x\">10.1111/j.1558-5646.2010.01019.x</a>.","short":"N.H. Barton, J. Kelleher, A. Etheridge, Evolution 64 (2010) 2701–2715.","ista":"Barton NH, Kelleher J, Etheridge A. 2010. A new model for extinction and recolonization in two dimensions: Quantifying phylogeography. Evolution. 64(9), 2701–2715.","apa":"Barton, N. H., Kelleher, J., &#38; Etheridge, A. (2010). A new model for extinction and recolonization in two dimensions: Quantifying phylogeography. <i>Evolution</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1558-5646.2010.01019.x\">https://doi.org/10.1111/j.1558-5646.2010.01019.x</a>","ieee":"N. H. Barton, J. Kelleher, and A. Etheridge, “A new model for extinction and recolonization in two dimensions: Quantifying phylogeography,” <i>Evolution</i>, vol. 64, no. 9. Wiley-Blackwell, pp. 2701–2715, 2010.","ama":"Barton NH, Kelleher J, Etheridge A. A new model for extinction and recolonization in two dimensions: Quantifying phylogeography. <i>Evolution</i>. 2010;64(9):2701-2715. doi:<a href=\"https://doi.org/10.1111/j.1558-5646.2010.01019.x\">10.1111/j.1558-5646.2010.01019.x</a>"},"publisher":"Wiley-Blackwell","date_created":"2018-12-11T11:46:40Z","department":[{"_id":"NiBa"}],"page":"2701 - 2715","month":"09","status":"public","date_published":"2010-09-01T00:00:00Z","quality_controlled":"1","_id":"474","issue":"9","intvolume":"        64"},{"has_accepted_license":"1","file":[{"date_updated":"2020-07-14T12:46:35Z","file_id":"4690","content_type":"application/pdf","creator":"system","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T10:08:29Z","file_name":"IST-2018-948-v1+1_2011_Cerny_Expressiveness_of.pdf","checksum":"5845be5aa19791830f7407d8853f2df0","file_size":492344}],"oa_version":"Published Version","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","author":[{"full_name":"Alur, Rajeev","first_name":"Rajeev","last_name":"Alur"},{"first_name":"Pavol","last_name":"Cerny","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","full_name":"Cerny, Pavol"}],"external_id":{"isi":["000310361000001"]},"isi":1,"intvolume":"         8","_id":"488","date_published":"2010-01-01T00:00:00Z","quality_controlled":"1","page":"1 - 12","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)"},"status":"public","month":"01","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","citation":{"ama":"Alur R, Cerny P. Expressiveness of streaming string transducers. In: Vol 8. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2010:1-12. doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1\">10.4230/LIPIcs.FSTTCS.2010.1</a>","ieee":"R. Alur and P. Cerny, “Expressiveness of streaming string transducers,” presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India, 2010, vol. 8, pp. 1–12.","apa":"Alur, R., &#38; Cerny, P. (2010). Expressiveness of streaming string transducers (Vol. 8, pp. 1–12). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1\">https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1</a>","chicago":"Alur, Rajeev, and Pavol Cerny. “Expressiveness of Streaming String Transducers,” 8:1–12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1\">https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1</a>.","ista":"Alur R, Cerny P. 2010. Expressiveness of streaming string transducers. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 8, 1–12.","short":"R. Alur, P. Cerny, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 1–12.","mla":"Alur, Rajeev, and Pavol Cerny. <i>Expressiveness of Streaming String Transducers</i>. Vol. 8, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 1–12, doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1\">10.4230/LIPIcs.FSTTCS.2010.1</a>."},"department":[{"_id":"ToHe"}],"date_created":"2018-12-11T11:46:45Z","corr_author":"1","abstract":[{"text":"Streaming string transducers [1] define (partial) functions from input strings to output strings. A streaming string transducer makes a single pass through the input string and uses a finite set of variables that range over strings from the output alphabet. At every step, the transducer processes an input symbol, and updates all the variables in parallel using assignments whose right-hand-sides are concatenations of output symbols and variables with the restriction that a variable can be used at most once in a right-hand-side expression. It has been shown that streaming string transducers operating on strings over infinite data domains are of interest in algorithmic verification of list-processing programs, as they lead to PSPACE decision procedures for checking pre/post conditions and for checking semantic equivalence, for a well-defined class of heap-manipulating programs. In order to understand the theoretical expressiveness of streaming transducers, we focus on streaming transducers processing strings over finite alphabets, given the existence of a robust and well-studied class of &quot;regular&quot; transductions for this case. Such regular transductions can be defined either by two-way deterministic finite-state transducers, or using a logical MSO-based characterization. Our main result is that the expressiveness of streaming string transducers coincides exactly with this class of regular transductions. ","lang":"eng"}],"language":[{"iso":"eng"}],"publist_id":"7331","volume":8,"title":"Expressiveness of streaming string transducers","year":"2010","alternative_title":["LIPIcs"],"conference":{"start_date":"2010-12-15","name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science","end_date":"2010-12-18","location":"Chennai, India"},"day":"01","oa":1,"publication_status":"published","doi":"10.4230/LIPIcs.FSTTCS.2010.1","file_date_updated":"2020-07-14T12:46:35Z","ddc":["005"],"scopus_import":"1","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","pubrep_id":"948","date_updated":"2025-09-30T09:49:32Z","type":"conference","article_processing_charge":"No"},{"quality_controlled":"1","date_published":"2010-06-09T00:00:00Z","intvolume":"        25","_id":"489","department":[{"_id":"KrCh"}],"date_created":"2018-12-11T11:46:45Z","publisher":"Open Publishing Association","citation":{"chicago":"Cristau, Julien, Claire David, and Florian Horn. “How Do We Remember the Past in Randomised Strategies?” In <i>Proceedings of GandALF 2010</i>, 25:30–39. Open Publishing Association, 2010. <a href=\"https://doi.org/10.4204/EPTCS.25.7\">https://doi.org/10.4204/EPTCS.25.7</a>.","mla":"Cristau, Julien, et al. “How Do We Remember the Past in Randomised Strategies?” <i>Proceedings of GandALF 2010</i>, vol. 25, Open Publishing Association, 2010, pp. 30–39, doi:<a href=\"https://doi.org/10.4204/EPTCS.25.7\">10.4204/EPTCS.25.7</a>.","short":"J. Cristau, C. David, F. Horn, in:, Proceedings of GandALF 2010, Open Publishing Association, 2010, pp. 30–39.","ista":"Cristau J, David C, Horn F. 2010. How do we remember the past in randomised strategies? Proceedings of GandALF 2010. GandALF: Games, Automata, Logic, and Formal Verification, EPTCS, vol. 25, 30–39.","ama":"Cristau J, David C, Horn F. How do we remember the past in randomised strategies? In: <i>Proceedings of GandALF 2010</i>. Vol 25. Open Publishing Association; 2010:30-39. doi:<a href=\"https://doi.org/10.4204/EPTCS.25.7\">10.4204/EPTCS.25.7</a>","ieee":"J. Cristau, C. David, and F. Horn, “How do we remember the past in randomised strategies?,” in <i>Proceedings of GandALF 2010</i>, Minori, Amalfi Coast, Italy, 2010, vol. 25, pp. 30–39.","apa":"Cristau, J., David, C., &#38; Horn, F. (2010). How do we remember the past in randomised strategies? In <i>Proceedings of GandALF 2010</i> (Vol. 25, pp. 30–39). Minori, Amalfi Coast, Italy: Open Publishing Association. <a href=\"https://doi.org/10.4204/EPTCS.25.7\">https://doi.org/10.4204/EPTCS.25.7</a>"},"status":"public","month":"06","page":"30 - 39","author":[{"last_name":"Cristau","first_name":"Julien","full_name":"Cristau, Julien"},{"full_name":"David, Claire","first_name":"Claire","last_name":"David"},{"full_name":"Horn, Florian","id":"37327ACE-F248-11E8-B48F-1D18A9856A87","last_name":"Horn","first_name":"Florian"}],"arxiv":1,"external_id":{"arxiv":["1006.1404"]},"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2025-06-11T08:14:27Z","type":"conference","publication":"Proceedings of GandALF 2010","scopus_import":"1","article_processing_charge":"No","conference":{"location":"Minori, Amalfi Coast, Italy","end_date":"2010-06-18","name":"GandALF: Games, Automata, Logic, and Formal Verification","start_date":"2010-06-17"},"day":"09","oa":1,"title":"How do we remember the past in randomised strategies?","volume":25,"year":"2010","alternative_title":["EPTCS"],"language":[{"iso":"eng"}],"publist_id":"7332","corr_author":"1","abstract":[{"lang":"eng","text":"Graph games of infinite length are a natural model for open reactive processes: one player represents the controller, trying to ensure a given specification, and the other represents a hostile environment. The evolution of the system depends on the decisions of both players, supplemented by chance. In this work, we focus on the notion of randomised strategy. More specifically, we show that three natural definitions may lead to very different results: in the most general cases, an almost-surely winning situation may become almost-surely losing if the player is only allowed to use a weaker notion of strategy. In more reasonable settings, translations exist, but they require infinite memory, even in simple cases. Finally, some traditional problems becomes undecidable for the strongest type of strategies."}],"main_file_link":[{"url":"https://arxiv.org/abs/1006.1404","open_access":"1"}],"doi":"10.4204/EPTCS.25.7","publication_status":"published"},{"oa_version":"None","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","author":[{"first_name":"Jochen","last_name":"Hoenicke","full_name":"Hoenicke, Jochen"},{"first_name":"Kari","last_name":"Leino","full_name":"Leino, Kari"},{"full_name":"Podelski, Andreas","first_name":"Andreas","last_name":"Podelski"},{"first_name":"Martin","last_name":"Schäf","full_name":"Schäf, Martin"},{"last_name":"Wies","first_name":"Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87","full_name":"Wies, Thomas"}],"external_id":{"isi":["000286631700004"]},"isi":1,"issue":"2-3","intvolume":"        37","_id":"533","date_published":"2010-12-01T00:00:00Z","quality_controlled":"1","page":"171 - 199","status":"public","month":"12","citation":{"apa":"Hoenicke, J., Leino, K., Podelski, A., Schäf, M., &#38; Wies, T. (2010). Doomed program points. <i>Formal Methods in System Design</i>. Springer. <a href=\"https://doi.org/10.1007/s10703-010-0102-0\">https://doi.org/10.1007/s10703-010-0102-0</a>","ieee":"J. Hoenicke, K. Leino, A. Podelski, M. Schäf, and T. Wies, “Doomed program points,” <i>Formal Methods in System Design</i>, vol. 37, no. 2–3. Springer, pp. 171–199, 2010.","ama":"Hoenicke J, Leino K, Podelski A, Schäf M, Wies T. Doomed program points. <i>Formal Methods in System Design</i>. 2010;37(2-3):171-199. doi:<a href=\"https://doi.org/10.1007/s10703-010-0102-0\">10.1007/s10703-010-0102-0</a>","chicago":"Hoenicke, Jochen, Kari Leino, Andreas Podelski, Martin Schäf, and Thomas Wies. “Doomed Program Points.” <i>Formal Methods in System Design</i>. Springer, 2010. <a href=\"https://doi.org/10.1007/s10703-010-0102-0\">https://doi.org/10.1007/s10703-010-0102-0</a>.","ista":"Hoenicke J, Leino K, Podelski A, Schäf M, Wies T. 2010. Doomed program points. Formal Methods in System Design. 37(2–3), 171–199.","short":"J. Hoenicke, K. Leino, A. Podelski, M. Schäf, T. Wies, Formal Methods in System Design 37 (2010) 171–199.","mla":"Hoenicke, Jochen, et al. “Doomed Program Points.” <i>Formal Methods in System Design</i>, vol. 37, no. 2–3, Springer, 2010, pp. 171–99, doi:<a href=\"https://doi.org/10.1007/s10703-010-0102-0\">10.1007/s10703-010-0102-0</a>."},"publisher":"Springer","date_created":"2018-12-11T11:47:01Z","department":[{"_id":"ToHe"}],"abstract":[{"text":"Any programming error that can be revealed before compiling a program saves precious time for the programmer. While integrated development environments already do a good job by detecting, e.g., data-flow abnormalities, current static analysis tools suffer from false positives (&quot;noise&quot;) or require strong user interaction. We propose to avoid this deficiency by defining a new class of errors. A program fragment is doomed if its execution will inevitably fail, regardless of which state it is started in. We use a formal verification method to identify such errors fully automatically and, most significantly, without producing noise. We report on experiments with a prototype tool.","lang":"eng"}],"corr_author":"1","language":[{"iso":"eng"}],"publist_id":"7284","volume":37,"title":"Doomed program points","year":"2010","day":"01","publication_status":"published","doi":"10.1007/s10703-010-0102-0","scopus_import":"1","date_updated":"2025-09-30T09:48:58Z","type":"journal_article","publication":"Formal Methods in System Design","article_processing_charge":"No"},{"publication_status":"published","oa_version":"Published Version","related_material":{"record":[{"status":"public","id":"3366","relation":"later_version"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.15479/AT:IST-2010-0004","author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee"},{"id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","full_name":"Cerny, Pavol","last_name":"Cerny","first_name":"Pavol"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A"},{"first_name":"Arjun","last_name":"Radhakrishna","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","full_name":"Radhakrishna, Arjun"},{"first_name":"Rohit","last_name":"Singh","full_name":"Singh, Rohit"}],"file_date_updated":"2020-07-14T12:46:42Z","has_accepted_license":"1","file":[{"date_created":"2018-12-12T11:53:53Z","access_level":"open_access","relation":"main_file","file_name":"IST-2010-0004_IST-2010-0004.pdf","file_size":429101,"checksum":"da38782d2388a6fa32109d10bb9bad67","date_updated":"2020-07-14T12:46:42Z","file_id":"5515","creator":"system","content_type":"application/pdf"}],"abstract":[{"text":"We present an algorithmic method for the synthesis of concurrent programs that are optimal with respect to quantitative performance measures. The input consists of a sequential sketch, that is, a program that does not contain synchronization constructs, and of a parametric performance model that assigns costs to actions such as locking, context switching, and idling. The quantitative synthesis problem is to automatically introduce synchronization constructs into the sequential sketch so that both correctness is guaranteed and worst-case (or average-case) performance is optimized. Correctness is formalized as race freedom or linearizability.\r\n\r\nWe show that for worst-case performance, the problem can be modeled\r\nas a 2-player graph game with quantitative (limit-average) objectives, and\r\nfor average-case performance, as a 2 1/2 -player graph game (with probabilistic transitions). In both cases, the optimal correct program is derived from an optimal strategy in the corresponding quantitative game. We prove that the respective game problems are computationally expensive (NP-complete), and present several techniques that overcome the theoretical difficulty in cases of concurrent programs of practical interest.\r\n\r\nWe have implemented a prototype tool and used it for the automatic syn- thesis of programs that access a concurrent list. For certain parameter val- ues, our method automatically synthesizes various classical synchronization schemes for implementing a concurrent list, such as fine-grained locking or a lazy algorithm. For other parameter values, a new, hybrid synchronization style is synthesized, which uses both the lazy approach and coarse-grained locks (instead of standard fine-grained locks). The trade-off occurs because while fine-grained locking tends to decrease the cost that is due to waiting for locks, it increases cache size requirements.","lang":"eng"}],"language":[{"iso":"eng"}],"title":"Quantitative synthesis for concurrent programs","year":"2010","alternative_title":["IST Austria Technical Report"],"day":"07","oa":1,"page":"17","status":"public","month":"10","citation":{"chicago":"Chatterjee, Krishnendu, Pavol Cerny, Thomas A Henzinger, Arjun Radhakrishna, and Rohit Singh. <i>Quantitative Synthesis for Concurrent Programs</i>. IST Austria, 2010. <a href=\"https://doi.org/10.15479/AT:IST-2010-0004\">https://doi.org/10.15479/AT:IST-2010-0004</a>.","mla":"Chatterjee, Krishnendu, et al. <i>Quantitative Synthesis for Concurrent Programs</i>. IST Austria, 2010, doi:<a href=\"https://doi.org/10.15479/AT:IST-2010-0004\">10.15479/AT:IST-2010-0004</a>.","short":"K. Chatterjee, P. Cerny, T.A. Henzinger, A. Radhakrishna, R. Singh, Quantitative Synthesis for Concurrent Programs, IST Austria, 2010.","ista":"Chatterjee K, Cerny P, Henzinger TA, Radhakrishna A, Singh R. 2010. Quantitative synthesis for concurrent programs, IST Austria, 17p.","ama":"Chatterjee K, Cerny P, Henzinger TA, Radhakrishna A, Singh R. <i>Quantitative Synthesis for Concurrent Programs</i>. IST Austria; 2010. doi:<a href=\"https://doi.org/10.15479/AT:IST-2010-0004\">10.15479/AT:IST-2010-0004</a>","apa":"Chatterjee, K., Cerny, P., Henzinger, T. A., Radhakrishna, A., &#38; Singh, R. (2010). <i>Quantitative synthesis for concurrent programs</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2010-0004\">https://doi.org/10.15479/AT:IST-2010-0004</a>","ieee":"K. Chatterjee, P. Cerny, T. A. Henzinger, A. Radhakrishna, and R. Singh, <i>Quantitative synthesis for concurrent programs</i>. IST Austria, 2010."},"publisher":"IST Austria","date_created":"2018-12-12T11:39:03Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"ddc":["000","005"],"publication_identifier":{"issn":["2664-1690"]},"_id":"5388","pubrep_id":"24","date_published":"2010-10-07T00:00:00Z","date_updated":"2025-04-15T08:12:00Z","type":"technical_report"},{"related_material":{"record":[{"status":"public","id":"4393","relation":"later_version"},{"status":"public","id":"3249","relation":"later_version"}]},"oa_version":"Published Version","doi":"10.15479/AT:IST-2010-0003","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","file_date_updated":"2020-07-14T12:46:42Z","author":[{"full_name":"Cerny, Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","first_name":"Pavol","last_name":"Cerny"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger"},{"id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","full_name":"Radhakrishna, Arjun","first_name":"Arjun","last_name":"Radhakrishna"}],"language":[{"iso":"eng"}],"has_accepted_license":"1","file":[{"date_updated":"2020-07-14T12:46:42Z","file_id":"5547","creator":"system","content_type":"application/pdf","date_created":"2018-12-12T11:54:25Z","access_level":"open_access","relation":"main_file","file_name":"IST-2010-0003_IST-2010-0003.pdf","file_size":367246,"checksum":"284ded99764e32a583a8ea83fcea254b"}],"abstract":[{"lang":"eng","text":"Boolean notions of correctness are formalized by preorders on systems. Quantitative measures of correctness can be formalized by real-valued distance functions between systems, where the distance between implementation and specification provides a measure of “fit” or “desirability.” We extend the simulation preorder to the quantitative setting, by making each player of a simulation game pay a certain price for her choices. We use the resulting games with quantitative objectives to define three different simulation distances. The correctness distance measures how much the specification must be changed in order to be satisfied by the implementation. The coverage distance measures how much the im- plementation restricts the degrees of freedom offered by the specification. The robustness distance measures how much a system can deviate from the implementation description without violating the specification. We consider these distances for safety as well as liveness specifications. The distances can be computed in polynomial time for safety specifications, and for liveness specifications given by weak fairness constraints. We show that the distance functions satisfy the triangle inequality, that the distance between two systems does not increase under parallel composition with a third system, and that the distance between two systems can be bounded from above and below by distances between abstractions of the two systems. These properties suggest that our simulation distances provide an appropriate basis for a quantitative theory of discrete systems. We also demonstrate how the robustness distance can be used to measure how many transmission errors are tolerated by error correcting codes."}],"day":"04","oa":1,"title":"Simulation distances","alternative_title":["IST Austria Technical Report"],"year":"2010","status":"public","month":"06","page":"24","date_created":"2018-12-12T11:39:03Z","department":[{"_id":"ToHe"}],"citation":{"ieee":"P. Cerny, T. A. Henzinger, and A. Radhakrishna, <i>Simulation distances</i>. IST Austria, 2010.","apa":"Cerny, P., Henzinger, T. A., &#38; Radhakrishna, A. (2010). <i>Simulation distances</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2010-0003\">https://doi.org/10.15479/AT:IST-2010-0003</a>","ama":"Cerny P, Henzinger TA, Radhakrishna A. <i>Simulation Distances</i>. IST Austria; 2010. doi:<a href=\"https://doi.org/10.15479/AT:IST-2010-0003\">10.15479/AT:IST-2010-0003</a>","chicago":"Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. <i>Simulation Distances</i>. IST Austria, 2010. <a href=\"https://doi.org/10.15479/AT:IST-2010-0003\">https://doi.org/10.15479/AT:IST-2010-0003</a>.","ista":"Cerny P, Henzinger TA, Radhakrishna A. 2010. Simulation distances, IST Austria, 24p.","mla":"Cerny, Pavol, et al. <i>Simulation Distances</i>. IST Austria, 2010, doi:<a href=\"https://doi.org/10.15479/AT:IST-2010-0003\">10.15479/AT:IST-2010-0003</a>.","short":"P. Cerny, T.A. Henzinger, A. Radhakrishna, Simulation Distances, IST Austria, 2010."},"publisher":"IST Austria","publication_identifier":{"issn":["2664-1690"]},"_id":"5389","ddc":["005"],"date_updated":"2025-09-30T07:46:05Z","type":"technical_report","pubrep_id":"25","date_published":"2010-06-04T00:00:00Z"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.15479/AT:IST-2010-0002","oa_version":"Published Version","publication_status":"published","file_date_updated":"2020-07-14T12:46:43Z","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"last_name":"Fijalkow","first_name":"Nathanaël","full_name":"Fijalkow, Nathanaël"}],"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"The class of ω regular languages provide a robust specification language in verification. Every ω-regular condition can be decomposed into a safety part and a liveness part. The liveness part ensures that something good happens “eventually.” Two main strengths of the classical, infinite-limit formulation of liveness are robustness (independence from the granularity of transitions) and simplicity (abstraction of complicated time bounds). However, the classical liveness formulation suffers from the drawback that the time until something good happens may be unbounded. A stronger formulation of liveness, so-called finitary liveness, overcomes this drawback, while still retaining robustness and simplicity. Finitary liveness requires that there exists an unknown, fixed bound b such that something good happens within b transitions. In this work we consider the finitary parity and Streett (fairness) conditions. We present the topological, automata-theoretic and logical characterization of finitary languages defined by finitary parity and Streett conditions. We (a) show that the finitary parity and Streett languages are Σ2-complete; (b) present a complete characterization of the expressive power of various classes of automata with finitary and infinitary conditions (in particular we show that non-deterministic finitary parity and Streett automata cannot be determinized to deterministic finitary parity or Streett automata); and (c) show that the languages defined by non-deterministic finitary parity automata exactly characterize the star-free fragment of ωB-regular languages."}],"file":[{"file_name":"IST-2010-0002_IST-2010-0002.pdf","checksum":"283d3604d76dd4d5161585d4c8625fbe","file_size":395662,"date_created":"2018-12-12T11:54:10Z","access_level":"open_access","relation":"main_file","creator":"system","content_type":"application/pdf","file_id":"5532","date_updated":"2020-07-14T12:46:43Z"}],"has_accepted_license":"1","oa":1,"day":"04","year":"2010","alternative_title":["IST Austria Technical Report"],"title":"Topological, automata-theoretic and logical characterization of finitary languages","month":"06","status":"public","page":"21","department":[{"_id":"KrCh"}],"date_created":"2018-12-12T11:39:03Z","publisher":"IST Austria","citation":{"ieee":"K. Chatterjee and N. Fijalkow, <i>Topological, automata-theoretic and logical characterization of finitary languages</i>. IST Austria, 2010.","apa":"Chatterjee, K., &#38; Fijalkow, N. (2010). <i>Topological, automata-theoretic and logical characterization of finitary languages</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2010-0002\">https://doi.org/10.15479/AT:IST-2010-0002</a>","ama":"Chatterjee K, Fijalkow N. <i>Topological, Automata-Theoretic and Logical Characterization of Finitary Languages</i>. IST Austria; 2010. doi:<a href=\"https://doi.org/10.15479/AT:IST-2010-0002\">10.15479/AT:IST-2010-0002</a>","chicago":"Chatterjee, Krishnendu, and Nathanaël Fijalkow. <i>Topological, Automata-Theoretic and Logical Characterization of Finitary Languages</i>. IST Austria, 2010. <a href=\"https://doi.org/10.15479/AT:IST-2010-0002\">https://doi.org/10.15479/AT:IST-2010-0002</a>.","mla":"Chatterjee, Krishnendu, and Nathanaël Fijalkow. <i>Topological, Automata-Theoretic and Logical Characterization of Finitary Languages</i>. IST Austria, 2010, doi:<a href=\"https://doi.org/10.15479/AT:IST-2010-0002\">10.15479/AT:IST-2010-0002</a>.","short":"K. Chatterjee, N. Fijalkow, Topological, Automata-Theoretic and Logical Characterization of Finitary Languages, IST Austria, 2010.","ista":"Chatterjee K, Fijalkow N. 2010. Topological, automata-theoretic and logical characterization of finitary languages, IST Austria, 21p."},"_id":"5390","publication_identifier":{"issn":["2664-1690"]},"ddc":["000"],"type":"technical_report","date_updated":"2020-07-14T23:04:41Z","date_published":"2010-06-04T00:00:00Z","pubrep_id":"26"},{"citation":{"chicago":"Cerny, Pavol, Arjun Radhakrishna, Damien Zufferey, Swarat Chaudhuri, and Rajeev Alur. <i>Model Checking of Linearizability of Concurrent List Implementations</i>. IST Austria, 2010. <a href=\"https://doi.org/10.15479/AT:IST-2010-0001\">https://doi.org/10.15479/AT:IST-2010-0001</a>.","mla":"Cerny, Pavol, et al. <i>Model Checking of Linearizability of Concurrent List Implementations</i>. IST Austria, 2010, doi:<a href=\"https://doi.org/10.15479/AT:IST-2010-0001\">10.15479/AT:IST-2010-0001</a>.","short":"P. Cerny, A. Radhakrishna, D. Zufferey, S. Chaudhuri, R. Alur, Model Checking of Linearizability of Concurrent List Implementations, IST Austria, 2010.","ista":"Cerny P, Radhakrishna A, Zufferey D, Chaudhuri S, Alur R. 2010. Model checking of linearizability of concurrent list implementations, IST Austria, 27p.","ieee":"P. Cerny, A. Radhakrishna, D. Zufferey, S. Chaudhuri, and R. Alur, <i>Model checking of linearizability of concurrent list implementations</i>. IST Austria, 2010.","ama":"Cerny P, Radhakrishna A, Zufferey D, Chaudhuri S, Alur R. <i>Model Checking of Linearizability of Concurrent List Implementations</i>. IST Austria; 2010. doi:<a href=\"https://doi.org/10.15479/AT:IST-2010-0001\">10.15479/AT:IST-2010-0001</a>","apa":"Cerny, P., Radhakrishna, A., Zufferey, D., Chaudhuri, S., &#38; Alur, R. (2010). <i>Model checking of linearizability of concurrent list implementations</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2010-0001\">https://doi.org/10.15479/AT:IST-2010-0001</a>"},"publisher":"IST Austria","department":[{"_id":"ToHe"}],"date_created":"2018-12-12T11:39:04Z","page":"27","status":"public","month":"04","pubrep_id":"27","date_published":"2010-04-19T00:00:00Z","date_updated":"2024-10-21T06:03:05Z","type":"technical_report","ddc":["004"],"publication_identifier":{"issn":["2664-1690"]},"_id":"5391","author":[{"full_name":"Cerny, Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","last_name":"Cerny","first_name":"Pavol"},{"first_name":"Arjun","last_name":"Radhakrishna","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","full_name":"Radhakrishna, Arjun"},{"last_name":"Zufferey","first_name":"Damien","orcid":"0000-0002-3197-8736","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","full_name":"Zufferey, Damien"},{"first_name":"Swarat","last_name":"Chaudhuri","full_name":"Chaudhuri, Swarat"},{"full_name":"Alur, Rajeev","last_name":"Alur","first_name":"Rajeev"}],"file_date_updated":"2020-07-14T12:46:43Z","publication_status":"published","oa_version":"Published Version","related_material":{"record":[{"relation":"later_version","id":"4390","status":"public"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.15479/AT:IST-2010-0001","title":"Model checking of linearizability of concurrent list implementations","alternative_title":["IST Austria Technical Report"],"year":"2010","day":"19","oa":1,"has_accepted_license":"1","file":[{"date_created":"2018-12-12T11:53:44Z","relation":"main_file","access_level":"open_access","checksum":"986645caad7dd85a6a091488f6c646dc","file_size":372286,"file_name":"IST-2010-0001_IST-2010-0001.pdf","date_updated":"2020-07-14T12:46:43Z","file_id":"5505","creator":"system","content_type":"application/pdf"}],"abstract":[{"text":"Concurrent data structures with fine-grained synchronization are notoriously difficult to implement correctly. The difficulty of reasoning about these implementations does not stem from the number of variables or the program size, but rather from the large number of possible interleavings. These implementations are therefore prime candidates for model checking. We introduce an algorithm for verifying linearizability of singly-linked heap-based concurrent data structures. We consider a model consisting of an unbounded heap where each node consists an element from an unbounded data domain, with a restricted set of operations for testing and updating pointers and data elements. Our main result is that linearizability is decidable for programs that invoke a fixed number of methods, possibly in parallel. This decidable fragment covers many of the common implementation techniques — fine-grained locking, lazy synchronization, and lock-free synchronization. We also show how the technique can be used to verify optimistic implementations with the help of programmer annotations. We developed a verification tool CoLT and evaluated it on a representative sample of Java implementations of the concurrent set data structure. The tool verified linearizability of a number of implementations, found a known error in a lock-free imple- mentation and proved that the corrected version is linearizable.","lang":"eng"}],"language":[{"iso":"eng"}]},{"_id":"3604","issue":"5","intvolume":"        19","quality_controlled":"1","date_published":"2010-03-01T00:00:00Z","month":"03","status":"public","page":"910 - 924","department":[{"_id":"NiBa"}],"date_created":"2018-12-11T12:04:12Z","citation":{"apa":"Senn, H., Goodman, S., Swanson, G., Barton, N. H., &#38; Pemberton, J. (2010). Investigating temporal changes in hybridisation and introgression between invasive sika (Cervus nippon) and native red deer (Cervus elaphus) on the Kintyre Peninsula, Scotland. <i>Molecular Ecology</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1365-294X.2009.04497.x\">https://doi.org/10.1111/j.1365-294X.2009.04497.x</a>","ieee":"H. Senn, S. Goodman, G. Swanson, N. H. Barton, and J. Pemberton, “Investigating temporal changes in hybridisation and introgression between invasive sika (Cervus nippon) and native red deer (Cervus elaphus) on the Kintyre Peninsula, Scotland,” <i>Molecular Ecology</i>, vol. 19, no. 5. Wiley-Blackwell, pp. 910–924, 2010.","ama":"Senn H, Goodman S, Swanson G, Barton NH, Pemberton J. Investigating temporal changes in hybridisation and introgression between invasive sika (Cervus nippon) and native red deer (Cervus elaphus) on the Kintyre Peninsula, Scotland. <i>Molecular Ecology</i>. 2010;19(5):910-924. doi:<a href=\"https://doi.org/10.1111/j.1365-294X.2009.04497.x\">10.1111/j.1365-294X.2009.04497.x</a>","ista":"Senn H, Goodman S, Swanson G, Barton NH, Pemberton J. 2010. Investigating temporal changes in hybridisation and introgression between invasive sika (Cervus nippon) and native red deer (Cervus elaphus) on the Kintyre Peninsula, Scotland. Molecular Ecology. 19(5), 910–924.","mla":"Senn, Helen, et al. “Investigating Temporal Changes in Hybridisation and Introgression between Invasive Sika (Cervus Nippon) and Native Red Deer (Cervus Elaphus) on the Kintyre Peninsula, Scotland.” <i>Molecular Ecology</i>, vol. 19, no. 5, Wiley-Blackwell, 2010, pp. 910–24, doi:<a href=\"https://doi.org/10.1111/j.1365-294X.2009.04497.x\">10.1111/j.1365-294X.2009.04497.x</a>.","short":"H. Senn, S. Goodman, G. Swanson, N.H. Barton, J. Pemberton, Molecular Ecology 19 (2010) 910–924.","chicago":"Senn, Helen, Simon Goodman, Graeme Swanson, Nicholas H Barton, and Josephine Pemberton. “Investigating Temporal Changes in Hybridisation and Introgression between Invasive Sika (Cervus Nippon) and Native Red Deer (Cervus Elaphus) on the Kintyre Peninsula, Scotland.” <i>Molecular Ecology</i>. Wiley-Blackwell, 2010. <a href=\"https://doi.org/10.1111/j.1365-294X.2009.04497.x\">https://doi.org/10.1111/j.1365-294X.2009.04497.x</a>."},"publisher":"Wiley-Blackwell","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa_version":"None","isi":1,"external_id":{"isi":["000274550100008"]},"author":[{"full_name":"Senn, Helen","last_name":"Senn","first_name":"Helen"},{"full_name":"Goodman, Simon","last_name":"Goodman","first_name":"Simon"},{"full_name":"Swanson, Graeme","first_name":"Graeme","last_name":"Swanson"},{"full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","last_name":"Barton"},{"full_name":"Pemberton, Josephine","last_name":"Pemberton","first_name":"Josephine"}],"scopus_import":"1","publication":"Molecular Ecology","type":"journal_article","date_updated":"2025-09-30T09:47:00Z","article_processing_charge":"No","publist_id":"2779","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"We investigated temporal changes in hybridization and introgression between native red deer (Cervus elaphus) and invasive Japanese sika (Cervus nippon) on the Kintyre Peninsula, Scotland, over 15 years, through analysis of 1513 samples of deer at 20 microsatellite loci and a mtDNA marker. We found no evidence that either the proportion of recent hybrids, or the levels of introgression had changed over the study period. Nevertheless, in one population where the two species have been in contact since ∼1970, 44% of individuals sampled during the study were hybrids. This suggests that hybridization between these species can proceed fairly rapidly. By analysing the number of alleles that have introgressed from polymorphic red deer into the genetically homogenous sika population, we reconstructed the haplotypes of red deer alleles introduced by backcrossing. Five separate hybridization events could account for all the recently hybridized sika-like individuals found across a large section of the Peninsula. Although we demonstrate that low rates of F1 hybridization can lead to substantial introgression, the progress of hybridization and introgression appears to be unpredictable over the short timescales."}],"day":"01","year":"2010","volume":19,"title":"Investigating temporal changes in hybridisation and introgression between invasive sika (Cervus nippon) and native red deer (Cervus elaphus) on the Kintyre Peninsula, Scotland","doi":"10.1111/j.1365-294X.2009.04497.x","publication_status":"published"}]