[{"day":"07","publisher":"National Academy of Sciences","oa_version":"Published Version","doi":"10.1073/pnas.1306164110","author":[{"last_name":"Rodrigues","full_name":"Rodrigues, Jessica A.","first_name":"Jessica A."},{"first_name":"Randy","full_name":"Ruan, Randy","last_name":"Ruan"},{"first_name":"Toshiro","last_name":"Nishimura","full_name":"Nishimura, Toshiro"},{"full_name":"Sharma, Manoj K.","last_name":"Sharma","first_name":"Manoj K."},{"first_name":"Rita","full_name":"Sharma, Rita","last_name":"Sharma"},{"last_name":"Ronald","full_name":"Ronald, Pamela C","first_name":"Pamela C"},{"first_name":"Robert L.","last_name":"Fischer","full_name":"Fischer, Robert L."},{"id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","first_name":"Daniel","last_name":"Zilberman","full_name":"Zilberman, Daniel","orcid":"0000-0002-0123-8649"}],"year":"2013","department":[{"_id":"DaZi"}],"publication_identifier":{"issn":["0027-8424"],"eissn":["1091-6490"]},"article_type":"original","citation":{"ista":"Rodrigues JA, Ruan R, Nishimura T, Sharma MK, Sharma R, Ronald PC, Fischer RL, Zilberman D. 2013. Imprinted expression of genes and small RNA is associated with localized hypomethylation of the maternal genome in rice endosperm. Proceedings of the National Academy of Sciences. 110(19), 7934–7939.","mla":"Rodrigues, Jessica A., et al. “Imprinted Expression of Genes and Small RNA Is Associated with Localized Hypomethylation of the Maternal Genome in Rice Endosperm.” <i>Proceedings of the National Academy of Sciences</i>, vol. 110, no. 19, National Academy of Sciences, 2013, pp. 7934–39, doi:<a href=\"https://doi.org/10.1073/pnas.1306164110\">10.1073/pnas.1306164110</a>.","chicago":"Rodrigues, Jessica A., Randy Ruan, Toshiro Nishimura, Manoj K. Sharma, Rita Sharma, Pamela C Ronald, Robert L. Fischer, and Daniel Zilberman. “Imprinted Expression of Genes and Small RNA Is Associated with Localized Hypomethylation of the Maternal Genome in Rice Endosperm.” <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences, 2013. <a href=\"https://doi.org/10.1073/pnas.1306164110\">https://doi.org/10.1073/pnas.1306164110</a>.","ama":"Rodrigues JA, Ruan R, Nishimura T, et al. Imprinted expression of genes and small RNA is associated with localized hypomethylation of the maternal genome in rice endosperm. <i>Proceedings of the National Academy of Sciences</i>. 2013;110(19):7934-7939. doi:<a href=\"https://doi.org/10.1073/pnas.1306164110\">10.1073/pnas.1306164110</a>","ieee":"J. A. Rodrigues <i>et al.</i>, “Imprinted expression of genes and small RNA is associated with localized hypomethylation of the maternal genome in rice endosperm,” <i>Proceedings of the National Academy of Sciences</i>, vol. 110, no. 19. National Academy of Sciences, pp. 7934–7939, 2013.","apa":"Rodrigues, J. A., Ruan, R., Nishimura, T., Sharma, M. K., Sharma, R., Ronald, P. C., … Zilberman, D. (2013). Imprinted expression of genes and small RNA is associated with localized hypomethylation of the maternal genome in rice endosperm. <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1306164110\">https://doi.org/10.1073/pnas.1306164110</a>","short":"J.A. Rodrigues, R. Ruan, T. Nishimura, M.K. Sharma, R. Sharma, P.C. Ronald, R.L. Fischer, D. Zilberman, Proceedings of the National Academy of Sciences 110 (2013) 7934–7939."},"type":"journal_article","quality_controlled":"1","language":[{"iso":"eng"}],"pmid":1,"status":"public","abstract":[{"lang":"eng","text":"Arabidopsis thaliana endosperm, a transient tissue that nourishes the embryo, exhibits extensive localized DNA demethylation on maternally inherited chromosomes. Demethylation mediates parent-of-origin–specific (imprinted) gene expression but is apparently unnecessary for the extensive accumulation of maternally biased small RNA (sRNA) molecules detected in seeds. Endosperm DNA in the distantly related monocots rice and maize is likewise locally hypomethylated, but whether this hypomethylation is generally parent-of-origin specific is unknown. Imprinted expression of sRNA also remains uninvestigated in monocot seeds. Here, we report high-coverage sequencing of the Kitaake rice cultivar that enabled us to show that localized hypomethylation in rice endosperm occurs solely on the maternal genome, preferring regions of high DNA accessibility. Maternally expressed imprinted genes are enriched for hypomethylation at putative promoter regions and transcriptional termini and paternally expressed genes at promoters and gene bodies, mirroring our recent results in A. thaliana. However, unlike in A. thaliana, rice endosperm sRNA populations are dominated by specific strong sRNA-producing loci, and imprinted 24-nt sRNAs are expressed from both parental genomes and correlate with hypomethylation. Overlaps between imprinted sRNA loci and imprinted genes expressed from opposite alleles suggest that sRNAs may regulate genomic imprinting. Whereas sRNAs in seedling tissues primarily originate from small class II (cut-and-paste) transposable elements, those in endosperm are more uniformly derived, including sequences from other transposon classes, as well as genic and intergenic regions. Our data indicate that the endosperm exhibits a unique pattern of sRNA expression and suggest that localized hypomethylation of maternal endosperm DNA is conserved in flowering plants."}],"publication_status":"published","date_created":"2021-06-07T07:31:02Z","external_id":{"pmid":["23613580"]},"_id":"9481","page":"7934-7939","publication":"Proceedings of the National Academy of Sciences","date_published":"2013-05-07T00:00:00Z","article_processing_charge":"No","keyword":["Multidisciplinary"],"month":"05","title":"Imprinted expression of genes and small RNA is associated with localized hypomethylation of the maternal genome in rice endosperm","date_updated":"2021-12-14T08:26:44Z","scopus_import":"1","extern":"1","issue":"19","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","oa":1,"intvolume":"       110","volume":110,"main_file_link":[{"url":"https://doi.org/10.1073/pnas.1306164110","open_access":"1"}]},{"citation":{"ieee":"X. Feng, D. Zilberman, and H. Dickinson, “A conversation across generations: Soma-germ cell crosstalk in plants,” <i>Developmental Cell</i>, vol. 24, no. 3. Elsevier, pp. 215–225, 2013.","apa":"Feng, X., Zilberman, D., &#38; Dickinson, H. (2013). A conversation across generations: Soma-germ cell crosstalk in plants. <i>Developmental Cell</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.devcel.2013.01.014\">https://doi.org/10.1016/j.devcel.2013.01.014</a>","short":"X. Feng, D. Zilberman, H. Dickinson, Developmental Cell 24 (2013) 215–225.","mla":"Feng, Xiaoqi, et al. “A Conversation across Generations: Soma-Germ Cell Crosstalk in Plants.” <i>Developmental Cell</i>, vol. 24, no. 3, Elsevier, 2013, pp. 215–25, doi:<a href=\"https://doi.org/10.1016/j.devcel.2013.01.014\">10.1016/j.devcel.2013.01.014</a>.","ista":"Feng X, Zilberman D, Dickinson H. 2013. A conversation across generations: Soma-germ cell crosstalk in plants. Developmental Cell. 24(3), 215–225.","chicago":"Feng, Xiaoqi, Daniel Zilberman, and Hugh Dickinson. “A Conversation across Generations: Soma-Germ Cell Crosstalk in Plants.” <i>Developmental Cell</i>. Elsevier, 2013. <a href=\"https://doi.org/10.1016/j.devcel.2013.01.014\">https://doi.org/10.1016/j.devcel.2013.01.014</a>.","ama":"Feng X, Zilberman D, Dickinson H. A conversation across generations: Soma-germ cell crosstalk in plants. <i>Developmental Cell</i>. 2013;24(3):215-225. doi:<a href=\"https://doi.org/10.1016/j.devcel.2013.01.014\">10.1016/j.devcel.2013.01.014</a>"},"type":"journal_article","article_type":"review","language":[{"iso":"eng"}],"pmid":1,"status":"public","abstract":[{"lang":"eng","text":"Plants undergo alternation of generation in which reproductive cells develop in the plant body (\"sporophytic generation\") and then differentiate into a multicellular gamete-forming \"gametophytic generation.\" Different populations of helper cells assist in this transgenerational journey, with somatic tissues supporting early development and single nurse cells supporting gametogenesis. New data reveal a two-way relationship between early reproductive cells and their helpers involving complex epigenetic and signaling networks determining cell number and fate. Later, the egg cell plays a central role in specifying accessory cells, whereas in both gametophytes, companion cells contribute non-cell-autonomously to the epigenetic landscape of the gamete genomes."}],"publication_status":"published","quality_controlled":"1","oa_version":"Published Version","doi":"10.1016/j.devcel.2013.01.014","day":"11","publisher":"Elsevier","department":[{"_id":"DaZi"},{"_id":"XiFe"}],"publication_identifier":{"eissn":["1878-1551"],"issn":["1534-5807"]},"author":[{"first_name":"Xiaoqi","id":"e0164712-22ee-11ed-b12a-d80fcdf35958","orcid":"0000-0002-4008-1234","full_name":"Feng, Xiaoqi","last_name":"Feng"},{"last_name":"Zilberman","orcid":"0000-0002-0123-8649","full_name":"Zilberman, Daniel","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","first_name":"Daniel"},{"first_name":"Hugh","full_name":"Dickinson, Hugh","last_name":"Dickinson"}],"year":"2013","scopus_import":"1","extern":"1","volume":24,"main_file_link":[{"url":"https://doi.org/10.1016/j.devcel.2013.01.014","open_access":"1"}],"issue":"3","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"intvolume":"        24","page":"215-225","publication":"Developmental Cell","date_created":"2021-06-08T06:14:50Z","external_id":{"pmid":["23410937"]},"_id":"9520","month":"02","date_updated":"2023-05-08T11:00:59Z","title":"A conversation across generations: Soma-germ cell crosstalk in plants","date_published":"2013-02-11T00:00:00Z","article_processing_charge":"No"},{"citation":{"chicago":"Zagorsky, Benjamin, Johannes Reiter, Krishnendu Chatterjee, and Martin Nowak. “Forgiver Triumphs in Alternating Prisoner’s Dilemma .” Public Library of Science, 2013. <a href=\"https://doi.org/10.1371/journal.pone.0080814.s001\">https://doi.org/10.1371/journal.pone.0080814.s001</a>.","ama":"Zagorsky B, Reiter J, Chatterjee K, Nowak M. Forgiver triumphs in alternating prisoner’s dilemma . 2013. doi:<a href=\"https://doi.org/10.1371/journal.pone.0080814.s001\">10.1371/journal.pone.0080814.s001</a>","mla":"Zagorsky, Benjamin, et al. <i>Forgiver Triumphs in Alternating Prisoner’s Dilemma </i>. Public Library of Science, 2013, doi:<a href=\"https://doi.org/10.1371/journal.pone.0080814.s001\">10.1371/journal.pone.0080814.s001</a>.","ista":"Zagorsky B, Reiter J, Chatterjee K, Nowak M. 2013. Forgiver triumphs in alternating prisoner’s dilemma , Public Library of Science, <a href=\"https://doi.org/10.1371/journal.pone.0080814.s001\">10.1371/journal.pone.0080814.s001</a>.","short":"B. Zagorsky, J. Reiter, K. Chatterjee, M. Nowak, (2013).","apa":"Zagorsky, B., Reiter, J., Chatterjee, K., &#38; Nowak, M. (2013). Forgiver triumphs in alternating prisoner’s dilemma . Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pone.0080814.s001\">https://doi.org/10.1371/journal.pone.0080814.s001</a>","ieee":"B. Zagorsky, J. Reiter, K. Chatterjee, and M. Nowak, “Forgiver triumphs in alternating prisoner’s dilemma .” Public Library of Science, 2013."},"type":"research_data_reference","status":"public","related_material":{"record":[{"id":"2247","relation":"used_in_publication","status":"public"}]},"abstract":[{"text":"Cooperative behavior, where one individual incurs a cost to help another, is a wide spread phenomenon. Here we study direct reciprocity in the context of the alternating Prisoner's Dilemma. We consider all strategies that can be implemented by one and two-state automata. We calculate the payoff matrix of all pairwise encounters in the presence of noise. We explore deterministic selection dynamics with and without mutation. Using different error rates and payoff values, we observe convergence to a small number of distinct equilibria. Two of them are uncooperative strict Nash equilibria representing always-defect (ALLD) and Grim. The third equilibrium is mixed and represents a cooperative alliance of several strategies, dominated by a strategy which we call Forgiver. Forgiver cooperates whenever the opponent has cooperated; it defects once when the opponent has defected, but subsequently Forgiver attempts to re-establish cooperation even if the opponent has defected again. Forgiver is not an evolutionarily stable strategy, but the alliance, which it rules, is asymptotically stable. For a wide range of parameter values the most commonly observed outcome is convergence to the mixed equilibrium, dominated by Forgiver. Our results show that although forgiving might incur a short-term loss it can lead to a long-term gain. Forgiveness facilitates stable cooperation in the presence of exploitation and noise.","lang":"eng"}],"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","oa_version":"Published Version","doi":"10.1371/journal.pone.0080814.s001","day":"12","date_created":"2021-07-28T15:45:07Z","_id":"9749","publisher":"Public Library of Science","month":"12","department":[{"_id":"KrCh"}],"date_updated":"2023-02-23T10:34:39Z","title":"Forgiver triumphs in alternating prisoner's dilemma ","year":"2013","article_processing_charge":"No","author":[{"first_name":"Benjamin","full_name":"Zagorsky, Benjamin","last_name":"Zagorsky"},{"last_name":"Reiter","orcid":"0000-0002-0170-7353","full_name":"Reiter, Johannes","first_name":"Johannes","id":"4A918E98-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Martin","full_name":"Nowak, Martin","last_name":"Nowak"}],"date_published":"2013-12-12T00:00:00Z"},{"type":"research_data_reference","citation":{"short":"D. Refardt, T. Bergmiller, R. Kümmerli, (2013).","apa":"Refardt, D., Bergmiller, T., &#38; Kümmerli, R. (2013). Data from: Altruism can evolve when relatedness is low: evidence from bacteria committing suicide upon phage infection. Dryad. <a href=\"https://doi.org/10.5061/dryad.b1q2n\">https://doi.org/10.5061/dryad.b1q2n</a>","ieee":"D. Refardt, T. Bergmiller, and R. Kümmerli, “Data from: Altruism can evolve when relatedness is low: evidence from bacteria committing suicide upon phage infection.” Dryad, 2013.","chicago":"Refardt, Dominik, Tobias Bergmiller, and Rolf Kümmerli. “Data from: Altruism Can Evolve When Relatedness Is Low: Evidence from Bacteria Committing Suicide upon Phage Infection.” Dryad, 2013. <a href=\"https://doi.org/10.5061/dryad.b1q2n\">https://doi.org/10.5061/dryad.b1q2n</a>.","ama":"Refardt D, Bergmiller T, Kümmerli R. Data from: Altruism can evolve when relatedness is low: evidence from bacteria committing suicide upon phage infection. 2013. doi:<a href=\"https://doi.org/10.5061/dryad.b1q2n\">10.5061/dryad.b1q2n</a>","ista":"Refardt D, Bergmiller T, Kümmerli R. 2013. Data from: Altruism can evolve when relatedness is low: evidence from bacteria committing suicide upon phage infection, Dryad, <a href=\"https://doi.org/10.5061/dryad.b1q2n\">10.5061/dryad.b1q2n</a>.","mla":"Refardt, Dominik, et al. <i>Data from: Altruism Can Evolve When Relatedness Is Low: Evidence from Bacteria Committing Suicide upon Phage Infection</i>. Dryad, 2013, doi:<a href=\"https://doi.org/10.5061/dryad.b1q2n\">10.5061/dryad.b1q2n</a>."},"abstract":[{"lang":"eng","text":"High relatedness among interacting individuals has generally been considered a precondition for the evolution of altruism. However, kin-selection theory also predicts the evolution of altruism when relatedness is low, as long as the cost of the altruistic act is minor compared to its benefit. Here, we demonstrate evidence for a low-cost altruistic act in bacteria. We investigated Escherichia coli responding to the attack of an obligately lytic phage by committing suicide in order to prevent parasite transmission to nearby relatives. We found that bacterial suicide provides large benefits to survivors at marginal costs to committers. The cost of suicide was low because infected cells are moribund, rapidly dying upon phage infection, such that no more opportunity for reproduction remains. As a consequence of its marginal cost, host suicide was selectively favoured even when relatedness between committers and survivors approached zero. Altogether, our findings demonstrate that low-cost suicide can evolve with ease, represents an effective host-defence strategy, and seems to be widespread among microbes. Moreover, low-cost suicide might also occur in higher organisms as exemplified by infected social insect workers leaving the colony to die in isolation."}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.5061/dryad.b1q2n"}],"related_material":{"record":[{"id":"2853","relation":"used_in_publication","status":"public"}]},"status":"public","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","oa":1,"doi":"10.5061/dryad.b1q2n","oa_version":"Published Version","publisher":"Dryad","_id":"9751","date_created":"2021-07-30T08:08:09Z","day":"21","date_updated":"2023-10-18T06:43:22Z","title":"Data from: Altruism can evolve when relatedness is low: evidence from bacteria committing suicide upon phage infection","department":[{"_id":"CaGu"}],"month":"03","date_published":"2013-03-21T00:00:00Z","author":[{"full_name":"Refardt, Dominik","last_name":"Refardt","first_name":"Dominik"},{"id":"2C471CFA-F248-11E8-B48F-1D18A9856A87","first_name":"Tobias","last_name":"Bergmiller","full_name":"Bergmiller, Tobias","orcid":"0000-0001-5396-4346"},{"first_name":"Rolf","last_name":"Kümmerli","full_name":"Kümmerli, Rolf"}],"article_processing_charge":"No","year":"2013"},{"type":"research_data_reference","citation":{"ama":"Hearn J, Stone G, Barton NH, Lohse K, Bunnefeld L. Data from: Likelihood-based inference of population history from low coverage de novo genome assemblies. 2013. doi:<a href=\"https://doi.org/10.5061/dryad.r3r60\">10.5061/dryad.r3r60</a>","chicago":"Hearn, Jack, Graham Stone, Nicholas H Barton, Konrad Lohse, and Lynsey Bunnefeld. “Data from: Likelihood-Based Inference of Population History from Low Coverage de Novo Genome Assemblies.” Dryad, 2013. <a href=\"https://doi.org/10.5061/dryad.r3r60\">https://doi.org/10.5061/dryad.r3r60</a>.","mla":"Hearn, Jack, et al. <i>Data from: Likelihood-Based Inference of Population History from Low Coverage de Novo Genome Assemblies</i>. Dryad, 2013, doi:<a href=\"https://doi.org/10.5061/dryad.r3r60\">10.5061/dryad.r3r60</a>.","ista":"Hearn J, Stone G, Barton NH, Lohse K, Bunnefeld L. 2013. Data from: Likelihood-based inference of population history from low coverage de novo genome assemblies, Dryad, <a href=\"https://doi.org/10.5061/dryad.r3r60\">10.5061/dryad.r3r60</a>.","short":"J. Hearn, G. Stone, N.H. Barton, K. Lohse, L. Bunnefeld, (2013).","apa":"Hearn, J., Stone, G., Barton, N. H., Lohse, K., &#38; Bunnefeld, L. (2013). Data from: Likelihood-based inference of population history from low coverage de novo genome assemblies. Dryad. <a href=\"https://doi.org/10.5061/dryad.r3r60\">https://doi.org/10.5061/dryad.r3r60</a>","ieee":"J. Hearn, G. Stone, N. H. Barton, K. Lohse, and L. Bunnefeld, “Data from: Likelihood-based inference of population history from low coverage de novo genome assemblies.” Dryad, 2013."},"related_material":{"record":[{"id":"2170","status":"public","relation":"used_in_publication"}]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.5061/dryad.r3r60"}],"abstract":[{"lang":"eng","text":"Short-read sequencing technologies have in principle made it feasible to draw detailed inferences about the recent history of any organism. In practice, however, this remains challenging due to the difficulty of genome assembly in most organisms and the lack of statistical methods powerful enough to discriminate among recent, non-equilibrium histories. We address both the assembly and inference challenges. We develop a bioinformatic pipeline for generating outgroup-rooted alignments of orthologous sequence blocks from de novo low-coverage short-read data for a small number of genomes, and show how such sequence blocks can be used to fit explicit models of population divergence and admixture in a likelihood framework. To illustrate our approach, we reconstruct the Pleistocene history of an oak-feeding insect (the oak gallwasp Biorhiza pallida) which, in common with many other taxa, was restricted during Pleistocene ice ages to a longitudinal series of southern refugia spanning theWestern Palaearctic. Our analysis of sequence blocks sampled from a single genome from each of three major glacial refugia reveals support for an unexpected history dominated by recent admixture. Despite the fact that 80% of the genome is affected by admixture during the last glacial cycle, we are able to infer the deeper divergence history of these populations. These inferences are robust to variation in block length, mutation model, and the sampling location of individual genomes within refugia. This combination of de novo assembly and numerical likelihood calculation provides a powerful framework for estimating recent population history that can be applied to any organism without the need for prior genetic resources."}],"status":"public","oa":1,"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","doi":"10.5061/dryad.r3r60","oa_version":"Published Version","publisher":"Dryad","_id":"9754","day":"01","date_created":"2021-07-30T08:31:22Z","department":[{"_id":"NiBa"}],"title":"Data from: Likelihood-based inference of population history from low coverage de novo genome assemblies","date_updated":"2023-02-23T10:31:17Z","month":"10","article_processing_charge":"No","year":"2013","date_published":"2013-10-01T00:00:00Z","author":[{"full_name":"Hearn, Jack","last_name":"Hearn","first_name":"Jack"},{"first_name":"Graham","full_name":"Stone, Graham","last_name":"Stone"},{"last_name":"Barton","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H"},{"first_name":"Konrad","full_name":"Lohse, Konrad","last_name":"Lohse"},{"first_name":"Lynsey","last_name":"Bunnefeld","full_name":"Bunnefeld, Lynsey"}]},{"year":"2013","author":[{"last_name":"Simon","full_name":"Simon, Sibu","orcid":"0000-0002-1998-6741","first_name":"Sibu","id":"4542EF9A-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kubeš","full_name":"Kubeš, Martin","first_name":"Martin"},{"last_name":"Baster","full_name":"Baster, Pawel","first_name":"Pawel","id":"3028BD74-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Stéphanie","last_name":"Robert","full_name":"Robert, Stéphanie"},{"last_name":"Dobrev","full_name":"Dobrev, Petre","first_name":"Petre"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí","last_name":"Friml","full_name":"Friml, Jirí","orcid":"0000-0002-8302-7596"},{"first_name":"Jan","last_name":"Petrášek","full_name":"Petrášek, Jan"},{"last_name":"Zažímalová","full_name":"Zažímalová, Eva","first_name":"Eva"}],"department":[{"_id":"JiFr"}],"publisher":"Wiley","day":"01","doi":"10.1111/nph.12437","oa_version":"Published Version","quality_controlled":"1","publist_id":"4460","abstract":[{"text":"The mode of action of auxin is based on its non-uniform distribution within tissues and organs. Despite the wide use of several auxin analogues in research and agriculture, little is known about the specificity of different auxin-related transport and signalling processes towards these compounds. Using seedlings of Arabidopsis thaliana and suspension-cultured cells of Nicotiana tabacum (BY-2), the physiological activity of several auxin analogues was investigated, together with their capacity to induce auxin-dependent gene expression, to inhibit endocytosis and to be transported across the plasma membrane. This study shows that the specificity criteria for different auxin-related processes vary widely. Notably, the special behaviour of some synthetic auxin analogues suggests that they might be useful tools in investigations of the molecular mechanism of auxin action. Thus, due to their differential stimulatory effects on DR5 expression, indole-3-propionic (IPA) and 2,4,5-trichlorophenoxy acetic (2,4,5-T) acids can serve in studies of TRANSPORT INHIBITOR RESPONSE 1/AUXIN SIGNALLING F-BOX (TIR1/AFB)-mediated auxin signalling, and 5-fluoroindole-3-acetic acid (5-F-IAA) can help to discriminate between transcriptional and non-transcriptional pathways of auxin signalling. The results demonstrate that the major determinants for the auxin-like physiological potential of a particular compound are very complex and involve its chemical and metabolic stability, its ability to distribute in tissues in a polar manner and its activity towards auxin signalling machinery.","lang":"eng"}],"publication_status":"published","das_tickbox":"1","status":"public","language":[{"iso":"eng"}],"ddc":["580"],"article_type":"original","type":"journal_article","citation":{"ieee":"S. Simon <i>et al.</i>, “Defining the selectivity of processes along the auxin response chain: A study using auxin analogues,” <i>New Phytologist</i>, vol. 200, no. 4. Wiley, pp. 1034–1048, 2013.","apa":"Simon, S., Kubeš, M., Baster, P., Robert, S., Dobrev, P., Friml, J., … Zažímalová, E. (2013). Defining the selectivity of processes along the auxin response chain: A study using auxin analogues. <i>New Phytologist</i>. Wiley. <a href=\"https://doi.org/10.1111/nph.12437\">https://doi.org/10.1111/nph.12437</a>","short":"S. Simon, M. Kubeš, P. Baster, S. Robert, P. Dobrev, J. Friml, J. Petrášek, E. Zažímalová, New Phytologist 200 (2013) 1034–1048.","ista":"Simon S, Kubeš M, Baster P, Robert S, Dobrev P, Friml J, Petrášek J, Zažímalová E. 2013. Defining the selectivity of processes along the auxin response chain: A study using auxin analogues. New Phytologist. 200(4), 1034–1048.","mla":"Simon, Sibu, et al. “Defining the Selectivity of Processes along the Auxin Response Chain: A Study Using Auxin Analogues.” <i>New Phytologist</i>, vol. 200, no. 4, Wiley, 2013, pp. 1034–48, doi:<a href=\"https://doi.org/10.1111/nph.12437\">10.1111/nph.12437</a>.","chicago":"Simon, Sibu, Martin Kubeš, Pawel Baster, Stéphanie Robert, Petre Dobrev, Jiří Friml, Jan Petrášek, and Eva Zažímalová. “Defining the Selectivity of Processes along the Auxin Response Chain: A Study Using Auxin Analogues.” <i>New Phytologist</i>. Wiley, 2013. <a href=\"https://doi.org/10.1111/nph.12437\">https://doi.org/10.1111/nph.12437</a>.","ama":"Simon S, Kubeš M, Baster P, et al. Defining the selectivity of processes along the auxin response chain: A study using auxin analogues. <i>New Phytologist</i>. 2013;200(4):1034-1048. doi:<a href=\"https://doi.org/10.1111/nph.12437\">10.1111/nph.12437</a>"},"article_processing_charge":"No","date_published":"2013-12-01T00:00:00Z","ec_funded":1,"title":"Defining the selectivity of processes along the auxin response chain: A study using auxin analogues","date_updated":"2026-06-18T07:49:41Z","month":"12","_id":"2443","project":[{"call_identifier":"FP7","grant_number":"282300","_id":"25716A02-B435-11E9-9278-68D0E5697425","name":"Polarity and subcellular dynamics in plants"}],"date_created":"2018-12-11T11:57:41Z","publication":"New Phytologist","page":"1034 - 1048","oa":1,"intvolume":"       200","issue":"4","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"The authors thank Dr Christian Luschnig (University of Natural Resources and Life Sciences (BOKU), Vienna, Austria) for the anti-PIN2 antibody, Professor Mark Estelle (University of California, San Diego, CA, USA) for tir1-1 mutant seeds and, last but not least, to Dr David Morris for critical reading of the manuscript. We also thank Markéta Pařezová and Jana Stýblová for excellent technical assistance. This work was supported by the Grant Agency of the Czech Republic (P305/11/0797 to E.Z. and 13-40637S to J.F.), the Central European Institute of Technology project CZ.1.05/1.1.00/02.0068 from the European Regional Development Fund and by a European Research Council starting independent research grant ERC-2011-StG-20101109-PSDP (to J.F.).","main_file_link":[{"url":"https://doi.org/10.1111/nph.12437","open_access":"1"}],"volume":200,"scopus_import":"1"},{"author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"last_name":"Ła̧Cki","full_name":"Ła̧Cki, Jakub","first_name":"Jakub"}],"conference":{"location":"St. Petersburg, Russia","start_date":"2013-07-13","end_date":"2013-07-19","name":"CAV: Computer Aided Verification"},"year":"2013","department":[{"_id":"KrCh"}],"publisher":"Springer","series_title":"Lecture Notes in Computer Science","day":"01","doi":"10.1007/978-3-642-39799-8_36","arxiv":1,"oa_version":"Preprint","quality_controlled":"1","publication_status":"published","abstract":[{"lang":"eng","text":"We consider two core algorithmic problems for probabilistic verification: the maximal end-component decomposition and the almost-sure reachability set computation for Markov decision processes (MDPs). For MDPs with treewidth k, we present two improved static algorithms for both the problems that run in time O(n·k 2.38·2k ) and O(m·logn· k), respectively, where n is the number of states and m is the number of edges, significantly improving the previous known O(n·k·√n· k) bound for low treewidth. We also present decremental algorithms for both problems for MDPs with constant treewidth that run in amortized logarithmic time, which is a huge improvement over the previously known algorithms that require amortized linear time."}],"das_tickbox":"1","publist_id":"4459","language":[{"iso":"eng"}],"status":"public","ddc":["000"],"type":"conference","citation":{"mla":"Chatterjee, Krishnendu, and Jakub Ła̧Cki. <i>Faster Algorithms for Markov Decision Processes with Low Treewidth</i>. Vol. 8044, Springer, 2013, pp. 543–58, doi:<a href=\"https://doi.org/10.1007/978-3-642-39799-8_36\">10.1007/978-3-642-39799-8_36</a>.","ista":"Chatterjee K, Ła̧Cki J. 2013. Faster algorithms for Markov decision processes with low treewidth. 8044, 543–558.","ama":"Chatterjee K, Ła̧Cki J. Faster algorithms for Markov decision processes with low treewidth. 2013;8044:543-558. doi:<a href=\"https://doi.org/10.1007/978-3-642-39799-8_36\">10.1007/978-3-642-39799-8_36</a>","chicago":"Chatterjee, Krishnendu, and Jakub Ła̧Cki. “Faster Algorithms for Markov Decision Processes with Low Treewidth.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-39799-8_36\">https://doi.org/10.1007/978-3-642-39799-8_36</a>.","ieee":"K. Chatterjee and J. Ła̧Cki, “Faster algorithms for Markov decision processes with low treewidth,” vol. 8044. Springer, pp. 543–558, 2013.","apa":"Chatterjee, K., &#38; Ła̧Cki, J. (2013). Faster algorithms for Markov decision processes with low treewidth. Presented at the CAV: Computer Aided Verification, St. Petersburg, Russia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-39799-8_36\">https://doi.org/10.1007/978-3-642-39799-8_36</a>","short":"K. Chatterjee, J. Ła̧Cki, 8044 (2013) 543–558."},"date_published":"2013-07-01T00:00:00Z","article_processing_charge":"No","ec_funded":1,"title":"Faster algorithms for Markov decision processes with low treewidth","date_updated":"2026-06-18T07:50:03Z","month":"07","_id":"2444","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","call_identifier":"FWF"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"date_created":"2018-12-11T11:57:42Z","external_id":{"arxiv":["1304.0084"]},"page":"543 - 558","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"intvolume":"      8044","alternative_title":["LNCS"],"volume":8044,"main_file_link":[{"url":"http://arxiv.org/abs/1304.0084","open_access":"1"}],"scopus_import":"1"},{"quality_controlled":"1","has_accepted_license":"1","pmid":1,"status":"public","language":[{"iso":"eng"}],"publication_status":"published","abstract":[{"lang":"eng","text":"Due to their sessile lifestyles, plants need to deal with the limitations and stresses imposed by the changing environment. Plants cope with these by a remarkable developmental flexibility, which is embedded in their strategy to survive. Plants can adjust their size, shape and number of organs, bend according to gravity and light, and regenerate tissues that were damaged, utilizing a coordinating, intercellular signal, the plant hormone, auxin. Another versatile signal is the cation, Ca2+, which is a crucial second messenger for many rapid cellular processes during responses to a wide range of endogenous and environmental signals, such as hormones, light, drought stress and others. Auxin is a good candidate for one of these Ca2+-activating signals. However, the role of auxin-induced Ca2+ signaling is poorly understood. Here, we will provide an overview of possible developmental and physiological roles, as well as mechanisms underlying the interconnection of Ca2+ and auxin signaling. "}],"article_type":"original","ddc":["580"],"citation":{"apa":"Vanneste, S., &#38; Friml, J. (2013). Calcium: The missing link in auxin action. <i>Plants</i>. MDPI. <a href=\"https://doi.org/10.3390/plants2040650\">https://doi.org/10.3390/plants2040650</a>","short":"S. Vanneste, J. Friml, Plants 2 (2013) 650–675.","ieee":"S. Vanneste and J. Friml, “Calcium: The missing link in auxin action,” <i>Plants</i>, vol. 2, no. 4. MDPI, pp. 650–675, 2013.","chicago":"Vanneste, Steffen, and Jiří Friml. “Calcium: The Missing Link in Auxin Action.” <i>Plants</i>. MDPI, 2013. <a href=\"https://doi.org/10.3390/plants2040650\">https://doi.org/10.3390/plants2040650</a>.","ama":"Vanneste S, Friml J. Calcium: The missing link in auxin action. <i>Plants</i>. 2013;2(4):650-675. doi:<a href=\"https://doi.org/10.3390/plants2040650\">10.3390/plants2040650</a>","mla":"Vanneste, Steffen, and Jiří Friml. “Calcium: The Missing Link in Auxin Action.” <i>Plants</i>, vol. 2, no. 4, MDPI, 2013, pp. 650–75, doi:<a href=\"https://doi.org/10.3390/plants2040650\">10.3390/plants2040650</a>.","ista":"Vanneste S, Friml J. 2013. Calcium: The missing link in auxin action. Plants. 2(4), 650–675."},"type":"journal_article","file":[{"date_created":"2022-03-21T12:12:56Z","creator":"dernst","file_id":"10916","access_level":"open_access","success":1,"file_name":"2013_Plants_Vanneste.pdf","file_size":670188,"date_updated":"2022-03-21T12:12:56Z","content_type":"application/pdf","checksum":"fb4ff2e820e344e253c9197544610be6","relation":"main_file"}],"year":"2013","author":[{"first_name":"Steffen","last_name":"Vanneste","full_name":"Vanneste, Steffen"},{"last_name":"Friml","orcid":"0000-0002-8302-7596","full_name":"Friml, Jiří","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jiří"}],"tmp":{"short":"CC BY (3.0)","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","image":"/images/cc_by.png"},"department":[{"_id":"JiFr"}],"publication_identifier":{"issn":["2223-7747"]},"day":"21","publisher":"MDPI","oa_version":"Published Version","doi":"10.3390/plants2040650","intvolume":"         2","oa":1,"issue":"4","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":2,"license":"https://creativecommons.org/licenses/by/3.0/","scopus_import":"1","keyword":["Plant Science","Ecology","Ecology","Evolution","Behavior and Systematics"],"article_processing_charge":"No","date_published":"2013-10-21T00:00:00Z","month":"10","title":"Calcium: The missing link in auxin action","date_updated":"2022-03-21T12:15:29Z","external_id":{"pmid":["27137397"]},"date_created":"2022-03-21T07:13:49Z","_id":"10895","page":"650-675","publication":"Plants","file_date_updated":"2022-03-21T12:12:56Z"},{"scopus_import":"1","acknowledgement":"This research is partially supported by the European Science Foundation (ESF) under the Research Network Programme, the European Union under the Toposys Project FP7-ICT-318493-STREP, the Russian Government under the Mega Project 11.G34.31.0053.","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","intvolume":"      7877","place":"Berlin, Heidelberg","volume":7877,"date_created":"2022-03-21T07:30:33Z","_id":"10897","project":[{"name":"Topological Complex Systems","grant_number":"318493","_id":"255D761E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"page":"182-183","publication":"Graph-Based Representations in Pattern Recognition","ec_funded":1,"date_published":"2013-06-01T00:00:00Z","article_processing_charge":"No","month":"06","title":"Persistent homology in image processing","date_updated":"2023-09-05T15:10:20Z","citation":{"apa":"Edelsbrunner, H. (2013). Persistent homology in image processing. In <i>Graph-Based Representations in Pattern Recognition</i> (Vol. 7877, pp. 182–183). Berlin, Heidelberg: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-38221-5_19\">https://doi.org/10.1007/978-3-642-38221-5_19</a>","short":"H. Edelsbrunner, in:, Graph-Based Representations in Pattern Recognition, Springer Nature, Berlin, Heidelberg, 2013, pp. 182–183.","ieee":"H. Edelsbrunner, “Persistent homology in image processing,” in <i>Graph-Based Representations in Pattern Recognition</i>, Vienna, Austria, 2013, vol. 7877, pp. 182–183.","ama":"Edelsbrunner H. Persistent homology in image processing. In: <i>Graph-Based Representations in Pattern Recognition</i>. Vol 7877. LNCS. Berlin, Heidelberg: Springer Nature; 2013:182-183. doi:<a href=\"https://doi.org/10.1007/978-3-642-38221-5_19\">10.1007/978-3-642-38221-5_19</a>","chicago":"Edelsbrunner, Herbert. “Persistent Homology in Image Processing.” In <i>Graph-Based Representations in Pattern Recognition</i>, 7877:182–83. LNCS. Berlin, Heidelberg: Springer Nature, 2013. <a href=\"https://doi.org/10.1007/978-3-642-38221-5_19\">https://doi.org/10.1007/978-3-642-38221-5_19</a>.","mla":"Edelsbrunner, Herbert. “Persistent Homology in Image Processing.” <i>Graph-Based Representations in Pattern Recognition</i>, vol. 7877, Springer Nature, 2013, pp. 182–83, doi:<a href=\"https://doi.org/10.1007/978-3-642-38221-5_19\">10.1007/978-3-642-38221-5_19</a>.","ista":"Edelsbrunner H. 2013. Persistent homology in image processing. Graph-Based Representations in Pattern Recognition. GbRPR: Graph-based Representations in Pattern RecognitionLNCS vol. 7877, 182–183."},"type":"conference","quality_controlled":"1","language":[{"iso":"eng"}],"status":"public","publication_status":"published","abstract":[{"lang":"eng","text":"Taking images is an efficient way to collect data about the physical world. It can be done fast and in exquisite detail. By definition, image processing is the field that concerns itself with the computation aimed at harnessing the information contained in images [10]. This talk is concerned with topological information. Our main thesis is that persistent homology [5] is a useful method to quantify and summarize topological information, building a bridge that connects algebraic topology with applications. We provide supporting evidence for this thesis by touching upon four technical developments in the overlap between persistent homology and image processing."}],"day":"01","publisher":"Springer Nature","series_title":"LNCS","oa_version":"None","doi":"10.1007/978-3-642-38221-5_19","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner"}],"conference":{"name":"GbRPR: Graph-based Representations in Pattern Recognition","end_date":"2013-05-17","location":"Vienna, Austria","start_date":"2013-05-15"},"year":"2013","department":[{"_id":"HeEd"}],"publication_identifier":{"isbn":["9783642382208"],"eissn":["1611-3349"],"issn":["0302-9743"],"eisbn":["9783642382215"]}},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"5","quality_controlled":"1","article_number":"17","status":"public","language":[{"iso":"eng"}],"publication_status":"published","abstract":[{"text":"A prominent remedy to multicore scalability issues in concurrent data structure implementations is to relax the sequential specification of the data structure. We present distributed queues (DQ), a new family of relaxed concurrent queue implementations. DQs implement relaxed queues with linearizable emptiness check and either configurable or bounded out-of-order behavior or pool behavior. Our experiments show that DQs outperform and outscale in micro- and macrobenchmarks all strict and relaxed queue as well as pool implementations that we considered.","lang":"eng"}],"citation":{"mla":"Haas, Andreas, et al. “Distributed Queues in Shared Memory: Multicore Performance and Scalability through Quantitative Relaxation.” <i>Proceedings of the ACM International Conference on Computing Frontiers - CF ’13</i>, no. 5, 17, ACM Press, 2013, doi:<a href=\"https://doi.org/10.1145/2482767.2482789\">10.1145/2482767.2482789</a>.","ista":"Haas A, Lippautz M, Henzinger TA, Payer H, Sokolova A, Kirsch CM, Sezgin A. 2013. Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation. Proceedings of the ACM International Conference on Computing Frontiers - CF ’13. CF: Conference on Computing Frontiers, 17.","chicago":"Haas, Andreas, Michael Lippautz, Thomas A Henzinger, Hannes Payer, Ana Sokolova, Christoph M. Kirsch, and Ali Sezgin. “Distributed Queues in Shared Memory: Multicore Performance and Scalability through Quantitative Relaxation.” In <i>Proceedings of the ACM International Conference on Computing Frontiers - CF ’13</i>. ACM Press, 2013. <a href=\"https://doi.org/10.1145/2482767.2482789\">https://doi.org/10.1145/2482767.2482789</a>.","ama":"Haas A, Lippautz M, Henzinger TA, et al. Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation. In: <i>Proceedings of the ACM International Conference on Computing Frontiers - CF ’13</i>. ACM Press; 2013. doi:<a href=\"https://doi.org/10.1145/2482767.2482789\">10.1145/2482767.2482789</a>","ieee":"A. Haas <i>et al.</i>, “Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation,” in <i>Proceedings of the ACM International Conference on Computing Frontiers - CF ’13</i>, Ischia, Italy, 2013, no. 5.","apa":"Haas, A., Lippautz, M., Henzinger, T. A., Payer, H., Sokolova, A., Kirsch, C. M., &#38; Sezgin, A. (2013). Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation. In <i>Proceedings of the ACM International Conference on Computing Frontiers - CF ’13</i>. Ischia, Italy: ACM Press. <a href=\"https://doi.org/10.1145/2482767.2482789\">https://doi.org/10.1145/2482767.2482789</a>","short":"A. Haas, M. Lippautz, T.A. Henzinger, H. Payer, A. Sokolova, C.M. Kirsch, A. Sezgin, in:, Proceedings of the ACM International Conference on Computing Frontiers - CF ’13, ACM Press, 2013."},"scopus_import":"1","type":"conference","article_processing_charge":"No","conference":{"end_date":"2013-05-16","location":"Ischia, Italy","start_date":"2013-05-14","name":"CF: Conference on Computing Frontiers"},"year":"2013","author":[{"first_name":"Andreas","last_name":"Haas","full_name":"Haas, Andreas"},{"first_name":"Michael","full_name":"Lippautz, Michael","last_name":"Lippautz"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724"},{"full_name":"Payer, Hannes","last_name":"Payer","first_name":"Hannes"},{"first_name":"Ana","full_name":"Sokolova, Ana","last_name":"Sokolova"},{"full_name":"Kirsch, Christoph M.","last_name":"Kirsch","first_name":"Christoph M."},{"full_name":"Sezgin, Ali","last_name":"Sezgin","first_name":"Ali","id":"4C7638DA-F248-11E8-B48F-1D18A9856A87"}],"date_published":"2013-05-01T00:00:00Z","month":"05","department":[{"_id":"ToHe"}],"publication_identifier":{"isbn":["978-145032053-5"]},"date_updated":"2022-06-21T08:01:19Z","title":"Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation","day":"01","date_created":"2022-03-21T07:33:22Z","_id":"10898","publisher":"ACM Press","oa_version":"None","publication":"Proceedings of the ACM International Conference on Computing Frontiers - CF '13","doi":"10.1145/2482767.2482789"},{"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","status":"public","language":[{"iso":"eng"}],"type":"book_chapter","citation":{"ieee":"N. H. Barton, “Differentiation,” in <i>Encyclopedia of Biodiversity</i>, 2nd ed., Elsevier, 2013, pp. 508–515.","apa":"Barton, N. H. (2013). Differentiation. In <i>Encyclopedia of Biodiversity</i> (2nd ed., pp. 508–515). Elsevier. <a href=\"https://doi.org/10.1016/b978-0-12-384719-5.00031-9\">https://doi.org/10.1016/b978-0-12-384719-5.00031-9</a>","short":"N.H. Barton, in:, Encyclopedia of Biodiversity, 2nd ed., Elsevier, 2013, pp. 508–515.","mla":"Barton, Nicholas H. “Differentiation.” <i>Encyclopedia of Biodiversity</i>, 2nd ed., Elsevier, 2013, pp. 508–15, doi:<a href=\"https://doi.org/10.1016/b978-0-12-384719-5.00031-9\">10.1016/b978-0-12-384719-5.00031-9</a>.","ista":"Barton NH. 2013.Differentiation. In: Encyclopedia of Biodiversity. , 508–515.","chicago":"Barton, Nicholas H. “Differentiation.” In <i>Encyclopedia of Biodiversity</i>, 2nd ed., 508–15. Elsevier, 2013. <a href=\"https://doi.org/10.1016/b978-0-12-384719-5.00031-9\">https://doi.org/10.1016/b978-0-12-384719-5.00031-9</a>.","ama":"Barton NH. Differentiation. In: <i>Encyclopedia of Biodiversity</i>. 2nd ed. Elsevier; 2013:508-515. doi:<a href=\"https://doi.org/10.1016/b978-0-12-384719-5.00031-9\">10.1016/b978-0-12-384719-5.00031-9</a>"},"scopus_import":"1","article_processing_charge":"No","keyword":["Adaptive landscape","Cline","Coalescent process","Gene flow","Hybrid zone","Local adaptation","Natural selection","Neutral theory","Population structure","Speciation"],"year":"2013","edition":"2","author":[{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","last_name":"Barton","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H"}],"date_published":"2013-01-01T00:00:00Z","publication_identifier":{"isbn":["978-0-12-384720-1"]},"department":[{"_id":"NiBa"}],"date_updated":"2022-06-20T09:18:06Z","title":"Differentiation","month":"01","publisher":"Elsevier","_id":"10899","day":"01","date_created":"2022-03-21T07:46:22Z","publication":"Encyclopedia of Biodiversity","doi":"10.1016/b978-0-12-384719-5.00031-9","page":"508-515","oa_version":"None"},{"scopus_import":"1","place":"Totowa, NJ","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","acknowledgement":"We would like to thank Alexander Eichner and Ingrid de Vries for discussion and critical reading of the manuscript, and Mary Frank for assistance with the recording of videos and images in Fig. 1. M.S. is supported through funding from the German Research Foundation (DFG). M.W. acknowledges the Alexander von Humboldt Foundation for funding.","intvolume":"      1013","volume":1013,"alternative_title":["Methods in Molecular Biology"],"_id":"10900","date_created":"2022-03-21T07:47:41Z","external_id":{"pmid":["23625502"]},"publication":"Chemokines","page":"215-226","date_published":"2013-04-03T00:00:00Z","article_processing_charge":"No","date_updated":"2023-09-05T13:15:33Z","title":"Live Cell Imaging of Chemotactic Dendritic Cell Migration in Explanted Mouse Ear Preparations","month":"04","citation":{"ista":"Weber M, Sixt MK. 2013.Live Cell Imaging of Chemotactic Dendritic Cell Migration in Explanted Mouse Ear Preparations. In: Chemokines. Methods in Molecular Biology, vol. 1013, 215–226.","mla":"Weber, Michele, and Michael K. Sixt. “Live Cell Imaging of Chemotactic Dendritic Cell Migration in Explanted Mouse Ear Preparations.” <i>Chemokines</i>, edited by Astrid Cardona and Eroboghene Ubogu, vol. 1013, Humana Press, 2013, pp. 215–26, doi:<a href=\"https://doi.org/10.1007/978-1-62703-426-5_14\">10.1007/978-1-62703-426-5_14</a>.","chicago":"Weber, Michele, and Michael K Sixt. “Live Cell Imaging of Chemotactic Dendritic Cell Migration in Explanted Mouse Ear Preparations.” In <i>Chemokines</i>, edited by Astrid Cardona and Eroboghene Ubogu, 1013:215–26. MIMB. Totowa, NJ: Humana Press, 2013. <a href=\"https://doi.org/10.1007/978-1-62703-426-5_14\">https://doi.org/10.1007/978-1-62703-426-5_14</a>.","ama":"Weber M, Sixt MK. Live Cell Imaging of Chemotactic Dendritic Cell Migration in Explanted Mouse Ear Preparations. In: Cardona A, Ubogu E, eds. <i>Chemokines</i>. Vol 1013. MIMB. Totowa, NJ: Humana Press; 2013:215-226. doi:<a href=\"https://doi.org/10.1007/978-1-62703-426-5_14\">10.1007/978-1-62703-426-5_14</a>","ieee":"M. Weber and M. K. Sixt, “Live Cell Imaging of Chemotactic Dendritic Cell Migration in Explanted Mouse Ear Preparations,” in <i>Chemokines</i>, vol. 1013, A. Cardona and E. Ubogu, Eds. Totowa, NJ: Humana Press, 2013, pp. 215–226.","short":"M. Weber, M.K. Sixt, in:, A. Cardona, E. Ubogu (Eds.), Chemokines, Humana Press, Totowa, NJ, 2013, pp. 215–226.","apa":"Weber, M., &#38; Sixt, M. K. (2013). Live Cell Imaging of Chemotactic Dendritic Cell Migration in Explanted Mouse Ear Preparations. In A. Cardona &#38; E. Ubogu (Eds.), <i>Chemokines</i> (Vol. 1013, pp. 215–226). Totowa, NJ: Humana Press. <a href=\"https://doi.org/10.1007/978-1-62703-426-5_14\">https://doi.org/10.1007/978-1-62703-426-5_14</a>"},"type":"book_chapter","quality_controlled":"1","publication_status":"published","abstract":[{"lang":"eng","text":"Leukocyte migration through the interstitial space is crucial for the maintenance of tolerance and immunity. The main cues for leukocyte trafficking are chemokines thought to directionally guide these cells towards their targets. However, model systems that facilitate quantification of chemokine-guided leukocyte migration in vivo are uncommon. Here we describe an ex vivo crawl-in assay using explanted mouse ears that allows the visualization of chemokine-dependent dendritic cell (DC) motility in the dermal interstitium in real time. We present methods for the preparation of mouse ear sheets and their use in multidimensional confocal imaging experiments to monitor and analyze the directional migration of fluorescently labelled DCs through the dermis and into afferent lymphatic vessels. The assay provides a more physiological approach to study leukocyte migration than in vitro three-dimensional (3D) or 2-dimensional (2D) migration assays such as collagen gels and transwell assays."}],"language":[{"iso":"eng"}],"pmid":1,"status":"public","publisher":"Humana Press","series_title":"MIMB","day":"03","doi":"10.1007/978-1-62703-426-5_14","oa_version":"None","author":[{"last_name":"Weber","full_name":"Weber, Michele","first_name":"Michele","id":"3A3FC708-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K","last_name":"Sixt","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","first_name":"Michael K"}],"year":"2013","editor":[{"first_name":"Astrid","full_name":"Cardona, Astrid","last_name":"Cardona"},{"last_name":"Ubogu","full_name":"Ubogu, Eroboghene","first_name":"Eroboghene"}],"publication_identifier":{"eisbn":["9781627034265"],"issn":["1064-3745"],"eissn":["1940-6029"],"isbn":["9781627034258"]},"department":[{"_id":"MiSi"}]},{"quality_controlled":"1","language":[{"iso":"eng"}],"status":"public","abstract":[{"text":"We consider how to edit strings from a source language so that the edited strings belong to a target language, where the languages are given as deterministic finite automata. Non-streaming (or offline) transducers perform edits given the whole source string. We show that the class of deterministic one-pass transducers with registers along with increment and min operation suffices for computing optimal edit distance, whereas the same class of transducers without the min operation is not sufficient. Streaming (or online) transducers perform edits as the letters of the source string are received. We present a polynomial time algorithm for the partial-repair problem that given a bound α asks for the construction of a deterministic streaming transducer (if one exists) that ensures that the ‘maximum fraction’ η of the strings of the source language are edited, within cost α, to the target language.","lang":"eng"}],"publication_status":"published","type":"conference","citation":{"short":"K. Chatterjee, S. Chaubal, S. Rubin, in:, 7th International Conference on Language and Automata Theory and Applications, Springer Nature, Berlin, Heidelberg, 2013, pp. 214–225.","apa":"Chatterjee, K., Chaubal, S., &#38; Rubin, S. (2013). How to travel between languages. In <i>7th International Conference on Language and Automata Theory and Applications</i> (Vol. 7810, pp. 214–225). Berlin, Heidelberg: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-37064-9_20\">https://doi.org/10.1007/978-3-642-37064-9_20</a>","ieee":"K. Chatterjee, S. Chaubal, and S. Rubin, “How to travel between languages,” in <i>7th International Conference on Language and Automata Theory and Applications</i>, Bilbao, Spain, 2013, vol. 7810, pp. 214–225.","chicago":"Chatterjee, Krishnendu, Siddhesh Chaubal, and Sasha Rubin. “How to Travel between Languages.” In <i>7th International Conference on Language and Automata Theory and Applications</i>, 7810:214–25. LNCS. Berlin, Heidelberg: Springer Nature, 2013. <a href=\"https://doi.org/10.1007/978-3-642-37064-9_20\">https://doi.org/10.1007/978-3-642-37064-9_20</a>.","ama":"Chatterjee K, Chaubal S, Rubin S. How to travel between languages. In: <i>7th International Conference on Language and Automata Theory and Applications</i>. Vol 7810. LNCS. Berlin, Heidelberg: Springer Nature; 2013:214-225. doi:<a href=\"https://doi.org/10.1007/978-3-642-37064-9_20\">10.1007/978-3-642-37064-9_20</a>","mla":"Chatterjee, Krishnendu, et al. “How to Travel between Languages.” <i>7th International Conference on Language and Automata Theory and Applications</i>, vol. 7810, Springer Nature, 2013, pp. 214–25, doi:<a href=\"https://doi.org/10.1007/978-3-642-37064-9_20\">10.1007/978-3-642-37064-9_20</a>.","ista":"Chatterjee K, Chaubal S, Rubin S. 2013. How to travel between languages. 7th International Conference on Language and Automata Theory and Applications. LATA: Conference on Language and Automata Theory and ApplicationsLNCS, LNCS, vol. 7810, 214–225."},"author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Siddhesh","full_name":"Chaubal, Siddhesh","last_name":"Chaubal"},{"full_name":"Rubin, Sasha","last_name":"Rubin","first_name":"Sasha","id":"2EC51194-F248-11E8-B48F-1D18A9856A87"}],"conference":{"name":"LATA: Conference on Language and Automata Theory and Applications","start_date":"2013-04-02","location":"Bilbao, Spain","end_date":"2013-04-05"},"year":"2013","department":[{"_id":"KrCh"}],"publication_identifier":{"isbn":["9783642370632"],"issn":["0302-9743"],"eisbn":["9783642370649"],"eissn":["1611-3349"]},"day":"15","publisher":"Springer Nature","series_title":"LNCS","oa_version":"None","doi":"10.1007/978-3-642-37064-9_20","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","acknowledgement":"The research was supported by Austrian Science Fund (FWF) Grant No P 23499-N23, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award. Thanks to Gabriele Puppis for suggesting the problem of identifying a deterministic transducer to compute the optimal cost, and to Martin Chmelik for his comments on the introduction.","intvolume":"      7810","place":"Berlin, Heidelberg","volume":7810,"alternative_title":["LNCS"],"scopus_import":"1","ec_funded":1,"date_published":"2013-04-15T00:00:00Z","article_processing_charge":"No","month":"04","date_updated":"2023-09-05T15:10:38Z","title":"How to travel between languages","date_created":"2022-03-21T07:56:21Z","_id":"10902","project":[{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","call_identifier":"FWF"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"page":"214-225","publication":"7th International Conference on Language and Automata Theory and Applications"},{"date_published":"2013-01-01T00:00:00Z","ec_funded":1,"date_updated":"2023-02-21T16:06:49Z","title":"Quantitative relaxation of concurrent data structures","month":"01","project":[{"call_identifier":"FP7","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling"},{"name":"Moderne Concurrency Paradigms","call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23"}],"_id":"2181","date_created":"2018-12-11T11:56:11Z","publication":"Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language","file_date_updated":"2020-07-14T12:45:31Z","pubrep_id":"198","page":"317 - 328","oa":1,"acknowledgement":" and an Elise Richter Fellowship (Austrian Science Fund V00125). ","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"relation":"later_version","status":"deleted","id":"10901"}]},"scopus_import":1,"conference":{"location":"Rome, Italy","start_date":"2013-01-23","end_date":"2013-01-25","name":"POPL: Principles of Programming Languages"},"year":"2013","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"full_name":"Kirsch, Christoph","last_name":"Kirsch","first_name":"Christoph"},{"full_name":"Payer, Hannes","last_name":"Payer","first_name":"Hannes"},{"id":"4C7638DA-F248-11E8-B48F-1D18A9856A87","first_name":"Ali","full_name":"Sezgin, Ali","last_name":"Sezgin"},{"full_name":"Sokolova, Ana","last_name":"Sokolova","first_name":"Ana"}],"department":[{"_id":"ToHe"}],"publication_identifier":{"isbn":["978-1-4503-1832-7"]},"publisher":"ACM","day":"01","doi":"10.1145/2429069.2429109","oa_version":"Submitted Version","quality_controlled":"1","publist_id":"4801","abstract":[{"text":"There is a trade-off between performance and correctness in implementing concurrent data structures. Better performance may be achieved at the expense of relaxing correctness, by redefining the semantics of data structures. We address such a redefinition of data structure semantics and present a systematic and formal framework for obtaining new data structures by quantitatively relaxing existing ones. We view a data structure as a sequential specification S containing all &quot;legal&quot; sequences over an alphabet of method calls. Relaxing the data structure corresponds to defining a distance from any sequence over the alphabet to the sequential specification: the k-relaxed sequential specification contains all sequences over the alphabet within distance k from the original specification. In contrast to other existing work, our relaxations are semantic (distance in terms of data structure states). As an instantiation of our framework, we present two simple yet generic relaxation schemes, called out-of-order and stuttering relaxation, along with several ways of computing distances. We show that the out-of-order relaxation, when further instantiated to stacks, queues, and priority queues, amounts to tolerating bounded out-of-order behavior, which cannot be captured by a purely syntactic relaxation (distance in terms of sequence manipulation, e.g. edit distance). We give concurrent implementations of relaxed data structures and demonstrate that bounded relaxations provide the means for trading correctness for performance in a controlled way. The relaxations are monotonic which further highlights the trade-off: increasing k increases the number of permitted sequences, which as we demonstrate can lead to better performance. Finally, since a relaxed stack or queue also implements a pool, we actually have new concurrent pool implementations that outperform the state-of-the-art ones.","lang":"eng"}],"publication_status":"published","has_accepted_license":"1","status":"public","language":[{"iso":"eng"}],"ddc":["000","004"],"file":[{"file_id":"5086","date_created":"2018-12-12T10:14:33Z","creator":"system","content_type":"application/pdf","date_updated":"2020-07-14T12:45:31Z","file_size":294689,"relation":"main_file","checksum":"adf465e70948f4e80e48057524516456","access_level":"open_access","file_name":"IST-2014-198-v1+1_popl128-henzinger-clean.pdf"}],"type":"conference","citation":{"ieee":"T. A. Henzinger, C. Kirsch, H. Payer, A. Sezgin, and A. Sokolova, “Quantitative relaxation of concurrent data structures,” in <i>Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language</i>, Rome, Italy, 2013, pp. 317–328.","apa":"Henzinger, T. A., Kirsch, C., Payer, H., Sezgin, A., &#38; Sokolova, A. (2013). Quantitative relaxation of concurrent data structures. In <i>Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language</i> (pp. 317–328). Rome, Italy: ACM. <a href=\"https://doi.org/10.1145/2429069.2429109\">https://doi.org/10.1145/2429069.2429109</a>","short":"T.A. Henzinger, C. Kirsch, H. Payer, A. Sezgin, A. Sokolova, in:, Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, ACM, 2013, pp. 317–328.","ista":"Henzinger TA, Kirsch C, Payer H, Sezgin A, Sokolova A. 2013. Quantitative relaxation of concurrent data structures. Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language. POPL: Principles of Programming Languages, 317–328.","mla":"Henzinger, Thomas A., et al. “Quantitative Relaxation of Concurrent Data Structures.” <i>Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language</i>, ACM, 2013, pp. 317–28, doi:<a href=\"https://doi.org/10.1145/2429069.2429109\">10.1145/2429069.2429109</a>.","ama":"Henzinger TA, Kirsch C, Payer H, Sezgin A, Sokolova A. Quantitative relaxation of concurrent data structures. In: <i>Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language</i>. ACM; 2013:317-328. doi:<a href=\"https://doi.org/10.1145/2429069.2429109\">10.1145/2429069.2429109</a>","chicago":"Henzinger, Thomas A, Christoph Kirsch, Hannes Payer, Ali Sezgin, and Ana Sokolova. “Quantitative Relaxation of Concurrent Data Structures.” In <i>Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language</i>, 317–28. ACM, 2013. <a href=\"https://doi.org/10.1145/2429069.2429109\">https://doi.org/10.1145/2429069.2429109</a>."}},{"date_updated":"2021-01-12T06:55:50Z","title":"Quantitative abstraction refinement","department":[{"_id":"ToHe"}],"month":"01","author":[{"last_name":"Cerny","full_name":"Cerny, Pavol","first_name":"Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","last_name":"Radhakrishna","full_name":"Radhakrishna, Arjun"}],"date_published":"2013-01-01T00:00:00Z","conference":{"name":"POPL: Principles of Programming Languages","end_date":"2013-01-25","location":"Rome, Italy","start_date":"2013-07-23"},"year":"2013","ec_funded":1,"publication":"Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language","doi":"10.1145/2429069.2429085","oa_version":"None","page":"115 - 128","publisher":"ACM","_id":"2182","project":[{"name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","call_identifier":"FP7"},{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","call_identifier":"FWF","name":"Moderne Concurrency Paradigms"}],"date_created":"2018-12-11T11:56:11Z","day":"01","abstract":[{"text":"We propose a general framework for abstraction with respect to quantitative properties, such as worst-case execution time, or power consumption. Our framework provides a systematic way for counter-example guided abstraction refinement for quantitative properties. The salient aspect of the framework is that it allows anytime verification, that is, verification algorithms that can be stopped at any time (for example, due to exhaustion of memory), and report approximations that improve monotonically when the algorithms are given more time. We instantiate the framework with a number of quantitative abstractions and refinement schemes, which differ in terms of how much quantitative information they keep from the original system. We introduce both state-based and trace-based quantitative abstractions, and we describe conditions that define classes of quantitative properties for which the abstractions provide over-approximations. We give algorithms for evaluating the quantitative properties on the abstract systems. We present algorithms for counter-example based refinements for quantitative properties for both state-based and segment-based abstractions. We perform a case study on worst-case execution time of executables to evaluate the anytime verification aspect and the quantitative abstractions we proposed.","lang":"eng"}],"publication_status":"published","publist_id":"4800","language":[{"iso":"eng"}],"status":"public","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Quantitative abstraction refinement,” in <i>Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language</i>, Rome, Italy, 2013, pp. 115–128.","apa":"Cerny, P., Henzinger, T. A., &#38; Radhakrishna, A. (2013). Quantitative abstraction refinement. In <i>Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language</i> (pp. 115–128). Rome, Italy: ACM. <a href=\"https://doi.org/10.1145/2429069.2429085\">https://doi.org/10.1145/2429069.2429085</a>","short":"P. Cerny, T.A. Henzinger, A. Radhakrishna, in:, Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, ACM, 2013, pp. 115–128.","mla":"Cerny, Pavol, et al. “Quantitative Abstraction Refinement.” <i>Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language</i>, ACM, 2013, pp. 115–28, doi:<a href=\"https://doi.org/10.1145/2429069.2429085\">10.1145/2429069.2429085</a>.","ista":"Cerny P, Henzinger TA, Radhakrishna A. 2013. Quantitative abstraction refinement. Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language. POPL: Principles of Programming Languages, 115–128.","ama":"Cerny P, Henzinger TA, Radhakrishna A. Quantitative abstraction refinement. In: <i>Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language</i>. ACM; 2013:115-128. doi:<a href=\"https://doi.org/10.1145/2429069.2429085\">10.1145/2429069.2429085</a>","chicago":"Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Quantitative Abstraction Refinement.” In <i>Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language</i>, 115–28. ACM, 2013. <a href=\"https://doi.org/10.1145/2429069.2429085\">https://doi.org/10.1145/2429069.2429085</a>."},"scopus_import":1,"type":"conference"},{"publist_id":"4763","abstract":[{"lang":"eng","text":"A straight skeleton is a well-known geometric structure, and several algorithms exist to construct the straight skeleton for a given polygon or planar straight-line graph. In this paper, we ask the reverse question: Given the straight skeleton (in form of a planar straight-line graph, with some rays to infinity), can we reconstruct a planar straight-line graph for which this was the straight skeleton? We show how to reduce this problem to the problem of finding a line that intersects a set of convex polygons. We can find these convex polygons and all such lines in $O(nlog n)$ time in the Real RAM computer model, where $n$ denotes the number of edges of the input graph. We also explain how our approach can be used for recognizing Voronoi diagrams of points, thereby completing a partial solution provided by Ash and Bolker in 1985.\r\n"}],"publication_status":"published","alternative_title":["2013 10th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2013) "],"status":"public","language":[{"iso":"eng"}],"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"citation":{"ieee":"T. Biedl, M. Held, and S. Huber, “Recognizing straight skeletons and Voronoi diagrams and reconstructing their input,” presented at the ISVD: Voronoi Diagrams in Science and Engineering, St. Petersburg, Russia, 2013, pp. 37–46.","short":"T. Biedl, M. Held, S. Huber, in:, IEEE, 2013, pp. 37–46.","apa":"Biedl, T., Held, M., &#38; Huber, S. (2013). Recognizing straight skeletons and Voronoi diagrams and reconstructing their input (pp. 37–46). Presented at the ISVD: Voronoi Diagrams in Science and Engineering, St. Petersburg, Russia: IEEE. <a href=\"https://doi.org/10.1109/ISVD.2013.11\">https://doi.org/10.1109/ISVD.2013.11</a>","mla":"Biedl, Therese, et al. <i>Recognizing Straight Skeletons and Voronoi Diagrams and Reconstructing Their Input</i>. IEEE, 2013, pp. 37–46, doi:<a href=\"https://doi.org/10.1109/ISVD.2013.11\">10.1109/ISVD.2013.11</a>.","ista":"Biedl T, Held M, Huber S. 2013. Recognizing straight skeletons and Voronoi diagrams and reconstructing their input. ISVD: Voronoi Diagrams in Science and Engineering, 2013 10th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2013) , , 37–46.","ama":"Biedl T, Held M, Huber S. Recognizing straight skeletons and Voronoi diagrams and reconstructing their input. In: IEEE; 2013:37-46. doi:<a href=\"https://doi.org/10.1109/ISVD.2013.11\">10.1109/ISVD.2013.11</a>","chicago":"Biedl, Therese, Martin Held, and Stefan Huber. “Recognizing Straight Skeletons and Voronoi Diagrams and Reconstructing Their Input,” 37–46. IEEE, 2013. <a href=\"https://doi.org/10.1109/ISVD.2013.11\">https://doi.org/10.1109/ISVD.2013.11</a>."},"type":"conference","department":[{"_id":"HeEd"}],"publication_identifier":{"eisbn":["978-0-7695-5037-4 "]},"date_updated":"2021-01-12T06:56:00Z","title":"Recognizing straight skeletons and Voronoi diagrams and reconstructing their input","month":"12","conference":{"end_date":"2013-07-10","start_date":"2013-07-08","location":"St. Petersburg, Russia","name":"ISVD: Voronoi Diagrams in Science and Engineering"},"year":"2013","date_published":"2013-12-01T00:00:00Z","author":[{"last_name":"Biedl","full_name":"Biedl, Therese","first_name":"Therese"},{"first_name":"Martin","last_name":"Held","full_name":"Held, Martin"},{"first_name":"Stefan","id":"4700A070-F248-11E8-B48F-1D18A9856A87","last_name":"Huber","full_name":"Huber, Stefan","orcid":"0000-0002-8871-5814"}],"doi":"10.1109/ISVD.2013.11","oa_version":"None","page":"37 - 46","publisher":"IEEE","_id":"2209","day":"01","date_created":"2018-12-11T11:56:20Z"},{"type":"conference","citation":{"short":"T. Biedl, M. Held, S. Huber, in:, 29th European Workshop on Computational Geometry, TU Braunschweig, 2013, pp. 95–98.","apa":"Biedl, T., Held, M., &#38; Huber, S. (2013). Reconstructing polygons from embedded straight skeletons. In <i>29th European Workshop on Computational Geometry</i> (pp. 95–98). Braunschweig, Germany: TU Braunschweig.","ieee":"T. Biedl, M. Held, and S. Huber, “Reconstructing polygons from embedded straight skeletons,” in <i>29th European Workshop on Computational Geometry</i>, Braunschweig, Germany, 2013, pp. 95–98.","ama":"Biedl T, Held M, Huber S. Reconstructing polygons from embedded straight skeletons. In: <i>29th European Workshop on Computational Geometry</i>. TU Braunschweig; 2013:95-98.","chicago":"Biedl, Therese, Martin Held, and Stefan Huber. “Reconstructing Polygons from Embedded Straight Skeletons.” In <i>29th European Workshop on Computational Geometry</i>, 95–98. TU Braunschweig, 2013.","ista":"Biedl T, Held M, Huber S. 2013. Reconstructing polygons from embedded straight skeletons. 29th European Workshop on Computational Geometry. EuroCG: European Workshop on Computational Geometry, 95–98.","mla":"Biedl, Therese, et al. “Reconstructing Polygons from Embedded Straight Skeletons.” <i>29th European Workshop on Computational Geometry</i>, TU Braunschweig, 2013, pp. 95–98."},"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"4762","main_file_link":[{"open_access":"1","url":"http://www.ibr.cs.tu-bs.de/alg/eurocg13/booklet_eurocg13.pdf"}],"publication_status":"published","abstract":[{"text":"A straight skeleton is a well-known geometric structure, and several algorithms exist to construct the straight skeleton for a given polygon. In this paper, we ask the reverse question: Given the straight skeleton (in form of a tree with a drawing in the plane, but with the exact position of the leaves unspecified), can we reconstruct the polygon? We show that in most cases there exists at most one polygon; in the remaining case there is an infinite number of polygons determined by one angle that can range in an interval. We can find this (set of) polygon(s) in linear time in the Real RAM computer model.","lang":"eng"}],"status":"public","language":[{"iso":"eng"}],"publisher":"TU Braunschweig","_id":"2210","day":"01","date_created":"2018-12-11T11:56:21Z","publication":"29th European Workshop on Computational Geometry","oa_version":"Submitted Version","page":"95 - 98","year":"2013","conference":{"name":"EuroCG: European Workshop on Computational Geometry","start_date":"2013-03-17","location":"Braunschweig, Germany","end_date":"2013-03-20"},"author":[{"last_name":"Biedl","full_name":"Biedl, Therese","first_name":"Therese"},{"last_name":"Held","full_name":"Held, Martin","first_name":"Martin"},{"id":"4700A070-F248-11E8-B48F-1D18A9856A87","first_name":"Stefan","last_name":"Huber","full_name":"Huber, Stefan","orcid":"0000-0002-8871-5814"}],"date_published":"2013-03-01T00:00:00Z","department":[{"_id":"HeEd"}],"title":"Reconstructing polygons from embedded straight skeletons","date_updated":"2021-01-12T06:56:00Z","month":"03"},{"scopus_import":1,"oa":1,"intvolume":"      8312","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":8312,"alternative_title":["LNCS"],"date_created":"2018-12-11T11:56:29Z","_id":"2237","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"}],"page":"173 - 181","file_date_updated":"2020-07-14T12:45:34Z","article_processing_charge":"No","date_published":"2013-01-14T00:00:00Z","month":"01","date_updated":"2020-08-11T10:09:42Z","title":"Tree interpolation in Vampire","ddc":["000"],"type":"conference","citation":{"ama":"Blanc R, Gupta A, Kovács L, Kragl B. Tree interpolation in Vampire. 2013;8312:173-181. doi:<a href=\"https://doi.org/10.1007/978-3-642-45221-5_13\">10.1007/978-3-642-45221-5_13</a>","chicago":"Blanc, Régis, Ashutosh Gupta, Laura Kovács, and Bernhard Kragl. “Tree Interpolation in Vampire.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-45221-5_13\">https://doi.org/10.1007/978-3-642-45221-5_13</a>.","mla":"Blanc, Régis, et al. <i>Tree Interpolation in Vampire</i>. Vol. 8312, Springer, 2013, pp. 173–81, doi:<a href=\"https://doi.org/10.1007/978-3-642-45221-5_13\">10.1007/978-3-642-45221-5_13</a>.","ista":"Blanc R, Gupta A, Kovács L, Kragl B. 2013. Tree interpolation in Vampire. 8312, 173–181.","apa":"Blanc, R., Gupta, A., Kovács, L., &#38; Kragl, B. (2013). Tree interpolation in Vampire. Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Stellenbosch, South Africa: Springer. <a href=\"https://doi.org/10.1007/978-3-642-45221-5_13\">https://doi.org/10.1007/978-3-642-45221-5_13</a>","short":"R. Blanc, A. Gupta, L. Kovács, B. Kragl, 8312 (2013) 173–181.","ieee":"R. Blanc, A. Gupta, L. Kovács, and B. Kragl, “Tree interpolation in Vampire,” vol. 8312. Springer, pp. 173–181, 2013."},"file":[{"file_id":"7858","creator":"dernst","date_created":"2020-05-15T11:10:40Z","content_type":"application/pdf","date_updated":"2020-07-14T12:45:34Z","file_size":279206,"checksum":"9cebaafca032e6769d273f393305c705","relation":"main_file","access_level":"open_access","file_name":"2013_LPAR_Blanc.pdf"}],"quality_controlled":"1","status":"public","has_accepted_license":"1","language":[{"iso":"eng"}],"publist_id":"4724","publication_status":"published","abstract":[{"text":"We describe new extensions of the Vampire theorem prover for computing tree interpolants. These extensions generalize Craig interpolation in Vampire, and can also be used to derive sequence interpolants. We evaluated our implementation on a large number of examples over the theory of linear integer arithmetic and integer-indexed arrays, with and without quantifiers. When compared to other methods, our experiments show that some examples could only be solved by our implementation.","lang":"eng"}],"day":"14","publisher":"Springer","series_title":"Lecture Notes in Computer Science","oa_version":"Submitted Version","doi":"10.1007/978-3-642-45221-5_13","year":"2013","conference":{"end_date":"2013-12-19","start_date":"2013-12-14","location":"Stellenbosch, South Africa","name":"LPAR: Logic for Programming, Artificial Intelligence, and Reasoning"},"author":[{"first_name":"Régis","full_name":"Blanc, Régis","last_name":"Blanc"},{"last_name":"Gupta","full_name":"Gupta, Ashutosh","id":"335E5684-F248-11E8-B48F-1D18A9856A87","first_name":"Ashutosh"},{"full_name":"Kovács, Laura","last_name":"Kovács","first_name":"Laura"},{"first_name":"Bernhard","id":"320FC952-F248-11E8-B48F-1D18A9856A87","last_name":"Kragl","full_name":"Kragl, Bernhard","orcid":"0000-0001-7745-9117"}],"department":[{"_id":"ToHe"}]},{"quality_controlled":"1","publication_status":"published","abstract":[{"lang":"eng","text":"We study the problem of achieving a given value in Markov decision processes (MDPs) with several independent discounted reward objectives. We consider a generalised version of discounted reward objectives, in which the amount of discounting depends on the states visited and on the objective. This definition extends the usual definition of discounted reward, and allows to capture the systems in which the value of different commodities diminish at different and variable rates.\r\n\r\nWe establish results for two prominent subclasses of the problem, namely state-discount models where the discount factors are only dependent on the state of the MDP (and independent of the objective), and reward-discount models where they are only dependent on the objective (but not on the state of the MDP). For the state-discount models we use a straightforward reduction to expected total reward and show that the problem whether a value is achievable can be solved in polynomial time. For the reward-discount model we show that memory and randomisation of the strategies are required, but nevertheless that the problem is decidable and it is sufficient to consider strategies which after a certain number of steps behave in a memoryless way.\r\n\r\nFor the general case, we show that when restricted to graphs (i.e. MDPs with no randomisation), pure strategies and discount factors of the form 1/n where n is an integer, the problem is in PSPACE and finite memory suffices for achieving a given value. We also show that when the discount factors are not of the form 1/n, the memory required by a strategy can be infinite.\r\n"}],"publist_id":"4723","language":[{"iso":"eng"}],"status":"public","citation":{"ieee":"K. Chatterjee, V. Forejt, and D. Wojtczak, “Multi-objective discounted reward verification in graphs and MDPs,” vol. 8312. Springer, pp. 228–242, 2013.","short":"K. Chatterjee, V. Forejt, D. Wojtczak, 8312 (2013) 228–242.","apa":"Chatterjee, K., Forejt, V., &#38; Wojtczak, D. (2013). Multi-objective discounted reward verification in graphs and MDPs. Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Stellenbosch, South Africa: Springer. <a href=\"https://doi.org/10.1007/978-3-642-45221-5_17\">https://doi.org/10.1007/978-3-642-45221-5_17</a>","ista":"Chatterjee K, Forejt V, Wojtczak D. 2013. Multi-objective discounted reward verification in graphs and MDPs. 8312, 228–242.","mla":"Chatterjee, Krishnendu, et al. <i>Multi-Objective Discounted Reward Verification in Graphs and MDPs</i>. Vol. 8312, Springer, 2013, pp. 228–42, doi:<a href=\"https://doi.org/10.1007/978-3-642-45221-5_17\">10.1007/978-3-642-45221-5_17</a>.","chicago":"Chatterjee, Krishnendu, Vojtěch Forejt, and Dominik Wojtczak. “Multi-Objective Discounted Reward Verification in Graphs and MDPs.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-45221-5_17\">https://doi.org/10.1007/978-3-642-45221-5_17</a>.","ama":"Chatterjee K, Forejt V, Wojtczak D. Multi-objective discounted reward verification in graphs and MDPs. 2013;8312:228-242. doi:<a href=\"https://doi.org/10.1007/978-3-642-45221-5_17\">10.1007/978-3-642-45221-5_17</a>"},"type":"conference","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Forejt","full_name":"Forejt, Vojtěch","first_name":"Vojtěch"},{"first_name":"Dominik","full_name":"Wojtczak, Dominik","last_name":"Wojtczak"}],"conference":{"name":"LPAR: Logic for Programming, Artificial Intelligence, and Reasoning","end_date":"2013-12-19","start_date":"2013-12-14","location":"Stellenbosch, South Africa"},"year":"2013","department":[{"_id":"KrCh"}],"publisher":"Springer","series_title":"Lecture Notes in Computer Science","day":"01","doi":"10.1007/978-3-642-45221-5_17","oa_version":"None","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":"      8312","alternative_title":["LNCS"],"volume":8312,"scopus_import":1,"date_published":"2013-12-01T00:00:00Z","ec_funded":1,"date_updated":"2020-08-11T10:09:42Z","title":"Multi-objective discounted reward verification in graphs and MDPs","month":"12","_id":"2238","project":[{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7"}],"date_created":"2018-12-11T11:56:30Z","page":"228 - 242"},{"oa_version":"Published Version","doi":"10.4230/LIPIcs.CSL.2013.563","day":"01","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","series_title":"Leibniz International Proceedings in Informatics","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"department":[{"_id":"ToHe"}],"author":[{"last_name":"Michaliszyn","full_name":"Michaliszyn, Jakub","first_name":"Jakub"},{"id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","last_name":"Otop","full_name":"Otop, Jan"}],"year":"2013","conference":{"end_date":"2013-09-05","location":"Torino, Italy","start_date":"2013-09-02","name":"CSL: Computer Science Logic"},"type":"conference","citation":{"apa":"Michaliszyn, J., &#38; Otop, J. (2013). Elementary modal logics over transitive structures. Presented at the CSL: Computer Science Logic, Torino, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.563\">https://doi.org/10.4230/LIPIcs.CSL.2013.563</a>","short":"J. Michaliszyn, J. Otop, 23 (2013) 563–577.","ieee":"J. Michaliszyn and J. Otop, “Elementary modal logics over transitive structures,” vol. 23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 563–577, 2013.","chicago":"Michaliszyn, Jakub, and Jan Otop. “Elementary Modal Logics over Transitive Structures.” Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.563\">https://doi.org/10.4230/LIPIcs.CSL.2013.563</a>.","ama":"Michaliszyn J, Otop J. Elementary modal logics over transitive structures. 2013;23:563-577. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.563\">10.4230/LIPIcs.CSL.2013.563</a>","mla":"Michaliszyn, Jakub, and Jan Otop. <i>Elementary Modal Logics over Transitive Structures</i>. Vol. 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 563–77, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.563\">10.4230/LIPIcs.CSL.2013.563</a>.","ista":"Michaliszyn J, Otop J. 2013. Elementary modal logics over transitive structures. 23, 563–577."},"file":[{"date_updated":"2020-07-14T12:45:34Z","content_type":"application/pdf","file_size":454915,"relation":"main_file","checksum":"e0732e73a8b1e39483df7717d53e3e35","access_level":"open_access","file_name":"IST-2016-136-v1+2_39.pdf","file_id":"4929","creator":"system","date_created":"2018-12-12T10:12:11Z"}],"ddc":["000","004"],"language":[{"iso":"eng"}],"has_accepted_license":"1","status":"public","publication_status":"published","abstract":[{"lang":"eng","text":"We show that modal logic over universally first-order definable classes of transitive frames is decidable. More precisely, let K be an arbitrary class of transitive Kripke frames definable by a universal first-order sentence. We show that the global and finite global satisfiability problems of modal logic over K are decidable in NP, regardless of choice of K. We also show that the local satisfiability and the finite local satisfiability problems of modal logic over K are decidable in NEXPTIME."}],"publist_id":"4708","quality_controlled":"1","page":"563 - 577","pubrep_id":"136","file_date_updated":"2020-07-14T12:45:34Z","date_created":"2018-12-11T11:56:32Z","_id":"2243","project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","call_identifier":"FP7"}],"month":"09","title":"Elementary modal logics over transitive structures","date_updated":"2020-08-11T10:09:42Z","ec_funded":1,"date_published":"2013-09-01T00:00:00Z","scopus_import":1,"volume":23,"alternative_title":["LIPIcs"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"intvolume":"        23"}]