[{"extern":1,"citation":{"ieee":"P. Dhonukshe <i>et al.</i>, “Clathrin-mediated constitutive endocytosis of PIN auxin efflux carriers in Arabidopsis,” <i>Current Biology</i>, vol. 17, no. 6. Cell Press, pp. 520–527, 2007.","short":"P. Dhonukshe, F. Aniento, I. Hwang, D. Robinson, J. Mravec, Y. Stierhof, J. Friml, Current Biology 17 (2007) 520–527.","apa":"Dhonukshe, P., Aniento, F., Hwang, I., Robinson, D., Mravec, J., Stierhof, Y., &#38; Friml, J. (2007). Clathrin-mediated constitutive endocytosis of PIN auxin efflux carriers in Arabidopsis. <i>Current Biology</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cub.2007.01.052\">https://doi.org/10.1016/j.cub.2007.01.052</a>","ama":"Dhonukshe P, Aniento F, Hwang I, et al. Clathrin-mediated constitutive endocytosis of PIN auxin efflux carriers in Arabidopsis. <i>Current Biology</i>. 2007;17(6):520-527. doi:<a href=\"https://doi.org/10.1016/j.cub.2007.01.052\">10.1016/j.cub.2007.01.052</a>","chicago":"Dhonukshe, Pankaj, Fernando Aniento, Inhwan Hwang, David Robinson, Jozef Mravec, York Stierhof, and Jiří Friml. “Clathrin-Mediated Constitutive Endocytosis of PIN Auxin Efflux Carriers in Arabidopsis.” <i>Current Biology</i>. Cell Press, 2007. <a href=\"https://doi.org/10.1016/j.cub.2007.01.052\">https://doi.org/10.1016/j.cub.2007.01.052</a>.","mla":"Dhonukshe, Pankaj, et al. “Clathrin-Mediated Constitutive Endocytosis of PIN Auxin Efflux Carriers in Arabidopsis.” <i>Current Biology</i>, vol. 17, no. 6, Cell Press, 2007, pp. 520–27, doi:<a href=\"https://doi.org/10.1016/j.cub.2007.01.052\">10.1016/j.cub.2007.01.052</a>.","ista":"Dhonukshe P, Aniento F, Hwang I, Robinson D, Mravec J, Stierhof Y, Friml J. 2007. Clathrin-mediated constitutive endocytosis of PIN auxin efflux carriers in Arabidopsis. Current Biology. 17(6), 520–527."},"date_created":"2018-12-11T12:00:55Z","publication_status":"published","type":"journal_article","intvolume":"        17","doi":"10.1016/j.cub.2007.01.052","status":"public","date_updated":"2021-01-12T07:40:31Z","volume":17,"date_published":"2007-03-24T00:00:00Z","page":"520 - 527","_id":"3022","quality_controlled":0,"abstract":[{"text":"Endocytosis is an essential process by which eukaryotic cells internalize exogenous material or regulate signaling at the cell surface [1]. Different endocytic pathways are well established in yeast and animals; prominent among them is clathrin-dependent endocytosis [2, 3]. In plants, endocytosis is poorly defined, and no molecular mechanism for cargo internalization has been demonstrated so far [4, 5], although the internalization of receptor-ligand complexes at the plant plasma membrane has recently been shown [6]. Here we demonstrate by means of a green-to-red photoconvertible fluorescent reporter, EosFP [7], the constitutive endocytosis of PIN auxin efflux carriers [8] and their recycling to the plasma membrane. Using a plant clathrin-specific antibody, we show the presence of clathrin at different stages of coated-vesicle formation at the plasma membrane in Arabidopsis. Genetic interference with clathrin function inhibits PIN internalization and endocytosis in general. Furthermore, pharmacological interference with cargo recruitment into the clathrin pathway blocks internalization of PINs and other plasma-membrane proteins. Our data demonstrate that clathrin-dependent endocytosis is operational in plants and constitutes the predominant pathway for the internalization of numerous plasma-membrane-resident proteins including PIN auxin efflux carriers.","lang":"eng"}],"year":"2007","author":[{"full_name":"Dhonukshe, Pankaj","last_name":"Dhonukshe","first_name":"Pankaj"},{"last_name":"Aniento","full_name":"Aniento, Fernando","first_name":"Fernando"},{"full_name":"Hwang, Inhwan","last_name":"Hwang","first_name":"Inhwan"},{"first_name":"David","last_name":"Robinson","full_name":"Robinson, David G"},{"last_name":"Mravec","full_name":"Mravec, Jozef","first_name":"Jozef"},{"full_name":"Stierhof, York-Dieter","last_name":"Stierhof","first_name":"York"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí","last_name":"Friml","full_name":"Jirí Friml","orcid":"0000-0002-8302-7596"}],"month":"03","publist_id":"3680","title":"Clathrin-mediated constitutive endocytosis of PIN auxin efflux carriers in Arabidopsis","issue":"6","day":"24","publication":"Current Biology","publisher":"Cell Press"},{"issue":"4","publisher":"Wiley-Blackwell","oa_version":"None","publication":"Bioessays : News and Reviews in Molecular, Cellular and Developmental Biology","day":"01","external_id":{"pmid":["    17373659"]},"title":"A unifying new model of cytokinesis for the dividing plant and animal cells","publist_id":"3678","month":"04","author":[{"first_name":"Pankaj","last_name":"Dhonukshe","full_name":"Dhonukshe, Pankaj"},{"full_name":"Šamaj, Jozef","last_name":"Šamaj","first_name":"Jozef"},{"last_name":"Baluška","full_name":"Baluška, František","first_name":"František"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí","full_name":"Friml, Jirí","last_name":"Friml","orcid":"0000-0002-8302-7596"}],"page":"371 - 381","volume":29,"date_published":"2007-04-01T00:00:00Z","date_updated":"2021-01-12T07:40:31Z","year":"2007","quality_controlled":"1","abstract":[{"lang":"eng","text":"Cytokinesis ensures proper partitioning of the nucleocytoplasmic contents into two daughter cells. It has generally been thought that cytokinesis is accomplished differently in animals and plants because of the differences in the preparatory phases, into the centrosomal or acentrosomal nature of the process, the presence or absence of rigid cell walls, and on the basis of ‘outside‐in’ or ‘inside‐out’ mechanism. However, this long‐standing paradigm needs further reevaluation based on new findings. Recent advances reveal that plant cells, similarly to animal cells, possess astral microtubules that regulate the cell division plane. Furthermore, endocytosis has been found to be important for cytokinesis in animal and plant cells: vesicles containing endocytosed cargo provide material for the cell plate formation in plants and for closure of the midbody channel in animals. Thus, although the preparatory phases of the cell division process differ between plant and animal cells, the later phases show similarities. We unify these findings in a model that suggests a conserved mode of cytokinesis."}],"_id":"3023","language":[{"iso":"eng"}],"doi":"10.1002/bies.20559","type":"journal_article","intvolume":"        29","citation":{"mla":"Dhonukshe, Pankaj, et al. “A Unifying New Model of Cytokinesis for the Dividing Plant and Animal Cells.” <i>Bioessays : News and Reviews in Molecular, Cellular and Developmental Biology</i>, vol. 29, no. 4, Wiley-Blackwell, 2007, pp. 371–81, doi:<a href=\"https://doi.org/10.1002/bies.20559\">10.1002/bies.20559</a>.","ista":"Dhonukshe P, Šamaj J, Baluška F, Friml J. 2007. A unifying new model of cytokinesis for the dividing plant and animal cells. Bioessays : News and Reviews in Molecular, Cellular and Developmental Biology. 29(4), 371–381.","short":"P. Dhonukshe, J. Šamaj, F. Baluška, J. Friml, Bioessays : News and Reviews in Molecular, Cellular and Developmental Biology 29 (2007) 371–381.","apa":"Dhonukshe, P., Šamaj, J., Baluška, F., &#38; Friml, J. (2007). A unifying new model of cytokinesis for the dividing plant and animal cells. <i>Bioessays : News and Reviews in Molecular, Cellular and Developmental Biology</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1002/bies.20559\">https://doi.org/10.1002/bies.20559</a>","chicago":"Dhonukshe, Pankaj, Jozef Šamaj, František Baluška, and Jiří Friml. “A Unifying New Model of Cytokinesis for the Dividing Plant and Animal Cells.” <i>Bioessays : News and Reviews in Molecular, Cellular and Developmental Biology</i>. Wiley-Blackwell, 2007. <a href=\"https://doi.org/10.1002/bies.20559\">https://doi.org/10.1002/bies.20559</a>.","ama":"Dhonukshe P, Šamaj J, Baluška F, Friml J. A unifying new model of cytokinesis for the dividing plant and animal cells. <i>Bioessays : News and Reviews in Molecular, Cellular and Developmental Biology</i>. 2007;29(4):371-381. doi:<a href=\"https://doi.org/10.1002/bies.20559\">10.1002/bies.20559</a>","ieee":"P. Dhonukshe, J. Šamaj, F. Baluška, and J. Friml, “A unifying new model of cytokinesis for the dividing plant and animal cells,” <i>Bioessays : News and Reviews in Molecular, Cellular and Developmental Biology</i>, vol. 29, no. 4. Wiley-Blackwell, pp. 371–381, 2007."},"date_created":"2018-12-11T12:00:55Z","publication_status":"published","extern":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","status":"public","pmid":1},{"pmid":1,"status":"public","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","extern":"1","publication_status":"published","date_created":"2018-12-11T12:00:55Z","citation":{"ieee":"A. Vieten, M. Sauer, P. Brewer, and J. Friml, “Molecular and cellular aspects of auxin-transport-mediated development,” <i>Trends in Plant Science</i>, vol. 12, no. 4. Cell Press, pp. 160–168, 2007.","ista":"Vieten A, Sauer M, Brewer P, Friml J. 2007. Molecular and cellular aspects of auxin-transport-mediated development. Trends in Plant Science. 12(4), 160–168.","mla":"Vieten, Anne, et al. “Molecular and Cellular Aspects of Auxin-Transport-Mediated Development.” <i>Trends in Plant Science</i>, vol. 12, no. 4, Cell Press, 2007, pp. 160–68, doi:<a href=\"https://doi.org/10.1016/j.tplants.2007.03.006\">10.1016/j.tplants.2007.03.006</a>.","apa":"Vieten, A., Sauer, M., Brewer, P., &#38; Friml, J. (2007). Molecular and cellular aspects of auxin-transport-mediated development. <i>Trends in Plant Science</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.tplants.2007.03.006\">https://doi.org/10.1016/j.tplants.2007.03.006</a>","short":"A. Vieten, M. Sauer, P. Brewer, J. Friml, Trends in Plant Science 12 (2007) 160–168.","chicago":"Vieten, Anne, Michael Sauer, Philip Brewer, and Jiří Friml. “Molecular and Cellular Aspects of Auxin-Transport-Mediated Development.” <i>Trends in Plant Science</i>. Cell Press, 2007. <a href=\"https://doi.org/10.1016/j.tplants.2007.03.006\">https://doi.org/10.1016/j.tplants.2007.03.006</a>.","ama":"Vieten A, Sauer M, Brewer P, Friml J. Molecular and cellular aspects of auxin-transport-mediated development. <i>Trends in Plant Science</i>. 2007;12(4):160-168. doi:<a href=\"https://doi.org/10.1016/j.tplants.2007.03.006\">10.1016/j.tplants.2007.03.006</a>"},"type":"journal_article","intvolume":"        12","doi":"10.1016/j.tplants.2007.03.006","language":[{"iso":"eng"}],"_id":"3024","quality_controlled":"1","abstract":[{"lang":"eng","text":"The plant hormone auxin is frequently observed to be asymmetrically distributed across adjacent cells during crucial stages of growth and development. These auxin gradients depend on polar transport and regulate a wide variety of processes, including embryogenesis, organogenesis, vascular tissue differentiation, root meristem maintenance and tropic growth. Auxin can mediate such a perplexing array of developmental processes by acting as a general trigger for the change in developmental program in cells where it accumulates and by providing vectorial information to the tissues by its polar intercellular flow. In recent years, a wealth of molecular data on the mechanism of auxin transport and its regulation has been generated, providing significant insights into the action of this versatile coordinative signal."}],"year":"2007","date_updated":"2021-01-12T07:40:31Z","date_published":"2007-04-01T00:00:00Z","volume":12,"page":"160 - 168","author":[{"first_name":"Anne","last_name":"Vieten","full_name":"Vieten, Anne"},{"full_name":"Sauer, Michael","last_name":"Sauer","first_name":"Michael"},{"last_name":"Brewer","full_name":"Brewer, Philip","first_name":"Philip"},{"orcid":"0000-0002-8302-7596","last_name":"Friml","full_name":"Friml, Jirí","first_name":"Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87"}],"month":"04","title":"Molecular and cellular aspects of auxin-transport-mediated development","publist_id":"3679","external_id":{"pmid":["    17369077"]},"day":"01","oa_version":"None","publication":"Trends in Plant Science","publisher":"Cell Press","issue":"4"},{"year":"2007","quality_controlled":0,"abstract":[{"text":"In plants, each developmental process integrates a network of signaling events that are regulated by different phytohormones, and interactions among hormonal pathways are essential to modulate their effect. Continuous growth of roots results from the postembryonic activity of cells within the root meristem that is controlled by the coordinated action of several phytohormones, including auxin and ethylene. Although their interaction has been studied intensively, the molecular and cellular mechanisms underlying this interplay are unknown. We show that the effect of ethylene on root growth is largely mediated by the regulation of the auxin biosynthesis and transport-dependent local auxin distribution. Ethylene stimulates auxin biosynthesis and basipetal auxin transport toward the elongation zone, where it activates a local auxin response leading to inhibition of cell elongation. Consistently, in mutants affected in auxin perception or basipetal auxin transport, ethylene cannot activate the auxin response nor regulate the root growth. In addition, ethylene modulates the transcription of several components of the auxin transport machinery. Thus, ethylene achieves a local activation of the auxin signaling pathway and regulates root growth by both stimulating the auxin biosynthesis and by modulating the auxin transport machinery.","lang":"eng"}],"_id":"3026","page":"2197 - 2212","volume":19,"date_published":"2007-07-01T00:00:00Z","date_updated":"2021-01-12T07:40:32Z","status":"public","doi":"10.1105/tpc.107.052126","intvolume":"        19","type":"journal_article","citation":{"ieee":"K. Růžička <i>et al.</i>, “Ethylene regulates root growth through effects on auxin biosynthesis and transport dependent auxin distribution,” <i>Plant Cell</i>, vol. 19, no. 7. American Society of Plant Biologists, pp. 2197–2212, 2007.","ama":"Růžička K, Ljung K, Vanneste S, et al. Ethylene regulates root growth through effects on auxin biosynthesis and transport dependent auxin distribution. <i>Plant Cell</i>. 2007;19(7):2197-2212. doi:<a href=\"https://doi.org/10.1105/tpc.107.052126\">10.1105/tpc.107.052126</a>","chicago":"Růžička, Kamil, Karin Ljung, Steffen Vanneste, Radka Podhorská, Tom Beeckman, Jiří Friml, and Eva Benková. “Ethylene Regulates Root Growth through Effects on Auxin Biosynthesis and Transport Dependent Auxin Distribution.” <i>Plant Cell</i>. American Society of Plant Biologists, 2007. <a href=\"https://doi.org/10.1105/tpc.107.052126\">https://doi.org/10.1105/tpc.107.052126</a>.","apa":"Růžička, K., Ljung, K., Vanneste, S., Podhorská, R., Beeckman, T., Friml, J., &#38; Benková, E. (2007). Ethylene regulates root growth through effects on auxin biosynthesis and transport dependent auxin distribution. <i>Plant Cell</i>. American Society of Plant Biologists. <a href=\"https://doi.org/10.1105/tpc.107.052126\">https://doi.org/10.1105/tpc.107.052126</a>","short":"K. Růžička, K. Ljung, S. Vanneste, R. Podhorská, T. Beeckman, J. Friml, E. Benková, Plant Cell 19 (2007) 2197–2212.","mla":"Růžička, Kamil, et al. “Ethylene Regulates Root Growth through Effects on Auxin Biosynthesis and Transport Dependent Auxin Distribution.” <i>Plant Cell</i>, vol. 19, no. 7, American Society of Plant Biologists, 2007, pp. 2197–212, doi:<a href=\"https://doi.org/10.1105/tpc.107.052126\">10.1105/tpc.107.052126</a>.","ista":"Růžička K, Ljung K, Vanneste S, Podhorská R, Beeckman T, Friml J, Benková E. 2007. Ethylene regulates root growth through effects on auxin biosynthesis and transport dependent auxin distribution. Plant Cell. 19(7), 2197–2212."},"date_created":"2018-12-11T12:00:56Z","publication_status":"published","extern":1,"publisher":"American Society of Plant Biologists","publication":"Plant Cell","day":"01","issue":"7","title":"Ethylene regulates root growth through effects on auxin biosynthesis and transport dependent auxin distribution","publist_id":"3676","month":"07","author":[{"full_name":"Růžička, Kamil","last_name":"Růžička","first_name":"Kamil"},{"last_name":"Ljung","full_name":"Ljung, Karin","first_name":"Karin"},{"first_name":"Steffen","full_name":"Vanneste, Steffen","last_name":"Vanneste"},{"last_name":"Podhorská","full_name":"Podhorská, Radka","first_name":"Radka"},{"last_name":"Beeckman","full_name":"Beeckman, Tom","first_name":"Tom"},{"full_name":"Jirí Friml","last_name":"Friml","orcid":"0000-0002-8302-7596","first_name":"Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-8510-9739","last_name":"Benková","full_name":"Eva Benková","first_name":"Eva","id":"38F4F166-F248-11E8-B48F-1D18A9856A87"}]},{"author":[{"last_name":"Malenica","full_name":"Malenica, Nenad","first_name":"Nenad"},{"first_name":"Lindy","last_name":"Abas","full_name":"Abas, Lindy"},{"last_name":"Benjamins","full_name":"Benjamins, René","first_name":"René"},{"full_name":"Kitakura, Saeko","last_name":"Kitakura","first_name":"Saeko"},{"first_name":"Harald","full_name":"Sigmund, Harald F","last_name":"Sigmund"},{"full_name":"Jun, Kim S","last_name":"Jun","first_name":"Kim"},{"last_name":"Hauser","full_name":"Hauser, Marie-Theres","first_name":"Marie"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí","orcid":"0000-0002-8302-7596","last_name":"Friml","full_name":"Jirí Friml"},{"first_name":"Christian","full_name":"Luschnig, Christian","last_name":"Luschnig"}],"month":"08","publist_id":"3675","title":"MODULATOR of PIN genes control steady state levels of Arabidopsis PIN proteins","day":"01","publication":"Plant Journal","publisher":"Wiley-Blackwell","issue":"4","status":"public","extern":1,"publication_status":"published","date_created":"2018-12-11T12:00:56Z","citation":{"ieee":"N. Malenica <i>et al.</i>, “MODULATOR of PIN genes control steady state levels of Arabidopsis PIN proteins,” <i>Plant Journal</i>, vol. 51, no. 4. Wiley-Blackwell, pp. 537–550, 2007.","ista":"Malenica N, Abas L, Benjamins R, Kitakura S, Sigmund H, Jun K, Hauser M, Friml J, Luschnig C. 2007. MODULATOR of PIN genes control steady state levels of Arabidopsis PIN proteins. Plant Journal. 51(4), 537–550.","mla":"Malenica, Nenad, et al. “MODULATOR of PIN Genes Control Steady State Levels of Arabidopsis PIN Proteins.” <i>Plant Journal</i>, vol. 51, no. 4, Wiley-Blackwell, 2007, pp. 537–50, doi:<a href=\"https://doi.org/10.1111/j.1365-313X.2007.03158.x\">10.1111/j.1365-313X.2007.03158.x</a>.","short":"N. Malenica, L. Abas, R. Benjamins, S. Kitakura, H. Sigmund, K. Jun, M. Hauser, J. Friml, C. Luschnig, Plant Journal 51 (2007) 537–550.","apa":"Malenica, N., Abas, L., Benjamins, R., Kitakura, S., Sigmund, H., Jun, K., … Luschnig, C. (2007). MODULATOR of PIN genes control steady state levels of Arabidopsis PIN proteins. <i>Plant Journal</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1365-313X.2007.03158.x\">https://doi.org/10.1111/j.1365-313X.2007.03158.x</a>","chicago":"Malenica, Nenad, Lindy Abas, René Benjamins, Saeko Kitakura, Harald Sigmund, Kim Jun, Marie Hauser, Jiří Friml, and Christian Luschnig. “MODULATOR of PIN Genes Control Steady State Levels of Arabidopsis PIN Proteins.” <i>Plant Journal</i>. Wiley-Blackwell, 2007. <a href=\"https://doi.org/10.1111/j.1365-313X.2007.03158.x\">https://doi.org/10.1111/j.1365-313X.2007.03158.x</a>.","ama":"Malenica N, Abas L, Benjamins R, et al. MODULATOR of PIN genes control steady state levels of Arabidopsis PIN proteins. <i>Plant Journal</i>. 2007;51(4):537-550. doi:<a href=\"https://doi.org/10.1111/j.1365-313X.2007.03158.x\">10.1111/j.1365-313X.2007.03158.x</a>"},"type":"journal_article","intvolume":"        51","doi":"10.1111/j.1365-313X.2007.03158.x","_id":"3027","quality_controlled":0,"abstract":[{"lang":"eng","text":"Polar transport of the phytohormone auxin controls numerous growth responses in plants. Molecular characterization of auxin transport in Arabidopsis thaliana has provided important insights into the mechanisms underlying the regulation of auxin distribution. In particular, the control of subcellular localization and expression of PIN-type auxin efflux components appears to be fundamental for orchestrated distribution of the growth regulator throughout the entire plant body. Here we describe the identification of two Arabidopsis loci, MOP2 and MOP3 (for MODULATOR OF PIN), that are involved in control of the steady-state levels of PIN protein. Mutations in both loci result in defects in auxin distribution and polar auxin transport, and cause phenotypes consistent with a reduction of PIN protein levels. Genetic interaction between PIN2 and both MOP loci is suggestive of functional cross-talk, which is further substantiated by findings demonstrating that ectopic PIN up-regulation is compensated in the mop background. Thus, in addition to pathways that control PIN localization and transcription, MOP2 and MOP3 appear to be involved in fine-tuning of auxin distribution via post-transcriptional regulation of PIN expression."}],"year":"2007","date_updated":"2021-01-12T07:40:32Z","date_published":"2007-08-01T00:00:00Z","volume":51,"page":"537 - 550"},{"publisher":"Cell Press","publication":"Cell","day":"21","issue":"6","publist_id":"3674","title":"Antagonistic regulation of PIN phosphorylation by PP2A and PINOID directs auxin flux","month":"09","author":[{"first_name":"Marta","last_name":"Michniewicz","full_name":"Michniewicz, Marta"},{"last_name":"Zago","full_name":"Zago, Marcelo K","first_name":"Marcelo"},{"first_name":"Lindy","full_name":"Abas, Lindy","last_name":"Abas"},{"last_name":"Weijers","full_name":"Weijers, Dolf","first_name":"Dolf"},{"first_name":"Alois","last_name":"Schweighofer","full_name":"Schweighofer, Alois"},{"last_name":"Meskiene","full_name":"Meskiene, Irute","first_name":"Irute"},{"last_name":"Heisler","full_name":"Heisler, Marcus G","first_name":"Marcus"},{"full_name":"Ohno, Carolyn","last_name":"Ohno","first_name":"Carolyn"},{"last_name":"Zhang","full_name":"Zhang, Jing","first_name":"Jing"},{"first_name":"Fang","last_name":"Huang","full_name":"Huang, Fang"},{"full_name":"Schwab, Rebecca","last_name":"Schwab","first_name":"Rebecca"},{"first_name":"Detlef","full_name":"Weigel, Detlef","last_name":"Weigel"},{"full_name":"Meyerowitz, Elliot M","last_name":"Meyerowitz","first_name":"Elliot"},{"last_name":"Luschnig","full_name":"Luschnig, Christian","first_name":"Christian"},{"full_name":"Offringa, Remko","last_name":"Offringa","first_name":"Remko"},{"orcid":"0000-0002-8302-7596","full_name":"Jirí Friml","last_name":"Friml","first_name":"Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87"}],"year":"2007","abstract":[{"lang":"eng","text":"In plants, cell polarity and tissue patterning are connected by intercellular flow of the phytohormone auxin, whose directional signaling depends on polar subcellular localization of PIN auxin transport proteins. The mechanism of polar targeting of PINs or other cargos in plants is largely unidentified, with the PINOID kinase being the only known molecular component. Here, we identify PP2A phosphatase as an important regulator of PIN apical-basal targeting and auxin distribution. Genetic analysis, localization, and phosphorylation studies demonstrate that PP2A and PINOID both partially colocalize with PINs and act antagonistically on the phosphorylation state of their central hydrophilic loop, hence mediating PIN apical-basal polar targeting. Thus, in plants, polar sorting by the reversible phosphorylation of cargos allows for their conditional delivery to specific intracellular destinations. In the case of PIN proteins, this mechanism enables switches in the direction of intercellular auxin fluxes, which mediate differential growth, tissue patterning, and organogenesis."}],"quality_controlled":0,"_id":"3028","page":"1044 - 1056","volume":130,"date_published":"2007-09-21T00:00:00Z","date_updated":"2021-01-12T07:40:33Z","status":"public","doi":"10.1016/j.cell.2007.07.033","intvolume":"       130","type":"journal_article","date_created":"2018-12-11T12:00:57Z","citation":{"ieee":"M. Michniewicz <i>et al.</i>, “Antagonistic regulation of PIN phosphorylation by PP2A and PINOID directs auxin flux,” <i>Cell</i>, vol. 130, no. 6. Cell Press, pp. 1044–1056, 2007.","ista":"Michniewicz M, Zago M, Abas L, Weijers D, Schweighofer A, Meskiene I, Heisler M, Ohno C, Zhang J, Huang F, Schwab R, Weigel D, Meyerowitz E, Luschnig C, Offringa R, Friml J. 2007. Antagonistic regulation of PIN phosphorylation by PP2A and PINOID directs auxin flux. Cell. 130(6), 1044–1056.","mla":"Michniewicz, Marta, et al. “Antagonistic Regulation of PIN Phosphorylation by PP2A and PINOID Directs Auxin Flux.” <i>Cell</i>, vol. 130, no. 6, Cell Press, 2007, pp. 1044–56, doi:<a href=\"https://doi.org/10.1016/j.cell.2007.07.033\">10.1016/j.cell.2007.07.033</a>.","apa":"Michniewicz, M., Zago, M., Abas, L., Weijers, D., Schweighofer, A., Meskiene, I., … Friml, J. (2007). Antagonistic regulation of PIN phosphorylation by PP2A and PINOID directs auxin flux. <i>Cell</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cell.2007.07.033\">https://doi.org/10.1016/j.cell.2007.07.033</a>","short":"M. Michniewicz, M. Zago, L. Abas, D. Weijers, A. Schweighofer, I. Meskiene, M. Heisler, C. Ohno, J. Zhang, F. Huang, R. Schwab, D. Weigel, E. Meyerowitz, C. Luschnig, R. Offringa, J. Friml, Cell 130 (2007) 1044–1056.","chicago":"Michniewicz, Marta, Marcelo Zago, Lindy Abas, Dolf Weijers, Alois Schweighofer, Irute Meskiene, Marcus Heisler, et al. “Antagonistic Regulation of PIN Phosphorylation by PP2A and PINOID Directs Auxin Flux.” <i>Cell</i>. Cell Press, 2007. <a href=\"https://doi.org/10.1016/j.cell.2007.07.033\">https://doi.org/10.1016/j.cell.2007.07.033</a>.","ama":"Michniewicz M, Zago M, Abas L, et al. Antagonistic regulation of PIN phosphorylation by PP2A and PINOID directs auxin flux. <i>Cell</i>. 2007;130(6):1044-1056. doi:<a href=\"https://doi.org/10.1016/j.cell.2007.07.033\">10.1016/j.cell.2007.07.033</a>"},"publication_status":"published","extern":1},{"_id":"3029","year":"2007","abstract":[{"text":"In Arabidopsis thaliana, lateral roots are formed from root pericycle cells adjacent to the xylem poles. Lateral root development is regulated antagonistically by the plant hormones auxin and cytokinin. While a great deal is known about how auxin promotes lateral root development, the mechanism of cytokinin repression is still unclear. Elevating cytokinin levels was observed to disrupt lateral root initiation and the regular pattern of divisions that characterizes lateral root development in Arabidopsis. To identify the stage of lateral root development that is sensitive to cytokinins, we targeted the expression of the Agrobacterium tumefaciens cytokinin biosynthesis enzyme isopentenyltransferase to either xylem-pole pericycle cells or young lateral root primordia using GAL4-GFP enhancer trap lines. Transactivation experiments revealed that xylem-pole pericycle cells are sensitive to cytokinins, whereas young lateral root primordia are not. This effect is physiologically significant because transactivation of the Arabidopsis cytokinin degrading enzyme cytokinin oxidase 1 in lateral root founder cells results in increased lateral root formation. We observed that cytokinins perturb the expression of PIN genes in lateral root founder cells and prevent the formation of an auxin gradient that is required to pattern lateral root primordia.","lang":"eng"}],"quality_controlled":0,"date_updated":"2021-01-12T07:40:33Z","page":"3889 - 3900","date_published":"2007-12-01T00:00:00Z","volume":19,"status":"public","publication_status":"published","date_created":"2018-12-11T12:00:57Z","citation":{"ista":"Laplaze L, Benková E, Casimiro I, Maes L, Vanneste S, Swarup R, Weijers D, Calvo V, Parizot B, Herrera Rodriguez M, Offringa R, Graham N, Doumas P, Friml J, Bogusz D, Beeckman T, Bennett M. 2007. Cytokinins act directly on lateral root founder cells to inhibit root initiation. Plant Cell. 19(12), 3889–3900.","mla":"Laplaze, Laurent, et al. “Cytokinins Act Directly on Lateral Root Founder Cells to Inhibit Root Initiation.” <i>Plant Cell</i>, vol. 19, no. 12, American Society of Plant Biologists, 2007, pp. 3889–900, doi:<a href=\"https://doi.org/10.1105/tpc.107.055863\">10.1105/tpc.107.055863</a>.","apa":"Laplaze, L., Benková, E., Casimiro, I., Maes, L., Vanneste, S., Swarup, R., … Bennett, M. (2007). Cytokinins act directly on lateral root founder cells to inhibit root initiation. <i>Plant Cell</i>. American Society of Plant Biologists. <a href=\"https://doi.org/10.1105/tpc.107.055863\">https://doi.org/10.1105/tpc.107.055863</a>","short":"L. Laplaze, E. Benková, I. Casimiro, L. Maes, S. Vanneste, R. Swarup, D. Weijers, V. Calvo, B. Parizot, M. Herrera Rodriguez, R. Offringa, N. Graham, P. Doumas, J. Friml, D. Bogusz, T. Beeckman, M. Bennett, Plant Cell 19 (2007) 3889–3900.","ama":"Laplaze L, Benková E, Casimiro I, et al. Cytokinins act directly on lateral root founder cells to inhibit root initiation. <i>Plant Cell</i>. 2007;19(12):3889-3900. doi:<a href=\"https://doi.org/10.1105/tpc.107.055863\">10.1105/tpc.107.055863</a>","chicago":"Laplaze, Laurent, Eva Benková, Ilda Casimiro, Lies Maes, Steffen Vanneste, Ranjan Swarup, Dolf Weijers, et al. “Cytokinins Act Directly on Lateral Root Founder Cells to Inhibit Root Initiation.” <i>Plant Cell</i>. American Society of Plant Biologists, 2007. <a href=\"https://doi.org/10.1105/tpc.107.055863\">https://doi.org/10.1105/tpc.107.055863</a>.","ieee":"L. Laplaze <i>et al.</i>, “Cytokinins act directly on lateral root founder cells to inhibit root initiation,” <i>Plant Cell</i>, vol. 19, no. 12. American Society of Plant Biologists, pp. 3889–3900, 2007."},"extern":1,"doi":"10.1105/tpc.107.055863","intvolume":"        19","type":"journal_article","day":"01","publisher":"American Society of Plant Biologists","publication":"Plant Cell","issue":"12","author":[{"first_name":"Laurent","full_name":"Laplaze, Laurent","last_name":"Laplaze"},{"last_name":"Benková","full_name":"Eva Benková","orcid":"0000-0002-8510-9739","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","first_name":"Eva"},{"last_name":"Casimiro","full_name":"Casimiro, Ilda","first_name":"Ilda"},{"first_name":"Lies","full_name":"Maes, Lies","last_name":"Maes"},{"last_name":"Vanneste","full_name":"Vanneste, Steffen","first_name":"Steffen"},{"first_name":"Ranjan","full_name":"Swarup, Ranjan","last_name":"Swarup"},{"full_name":"Weijers, Dolf","last_name":"Weijers","first_name":"Dolf"},{"first_name":"Vanessa","full_name":"Calvo, Vanessa","last_name":"Calvo"},{"first_name":"Boris","last_name":"Parizot","full_name":"Parizot, Boris"},{"first_name":"Maria","full_name":"Herrera-Rodriguez, Maria Begoña","last_name":"Herrera Rodriguez"},{"full_name":"Offringa, Remko","last_name":"Offringa","first_name":"Remko"},{"first_name":"Neil","full_name":"Graham, Neil","last_name":"Graham"},{"full_name":"Doumas, Patrick","last_name":"Doumas","first_name":"Patrick"},{"last_name":"Friml","full_name":"Jirí Friml","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí"},{"first_name":"Didier","last_name":"Bogusz","full_name":"Bogusz, Didier"},{"full_name":"Beeckman, Tom","last_name":"Beeckman","first_name":"Tom"},{"first_name":"Malcolm","last_name":"Bennett","full_name":"Bennett, Malcolm"}],"publist_id":"3673","title":"Cytokinins act directly on lateral root founder cells to inhibit root initiation","month":"12"},{"month":"09","title":"ETS transcription factor Erm controls subsynaptic gene expression in skeletal muscles","publist_id":"3551","author":[{"first_name":"Simon","id":"37B36620-F248-11E8-B48F-1D18A9856A87","full_name":"Simon Hippenmeyer","last_name":"Hippenmeyer","orcid":"0000-0003-2279-1061"},{"first_name":"Roland","full_name":"Huber, Roland M","last_name":"Huber"},{"full_name":"Ladle, David R","last_name":"Ladle","first_name":"David"},{"first_name":"Kenneth","last_name":"Murphy","full_name":"Murphy, Kenneth"},{"first_name":"Silvia","full_name":"Arber, Silvia","last_name":"Arber"}],"issue":"5","publication":"Neuron","publisher":"Elsevier","day":"06","intvolume":"        55","type":"journal_article","doi":"10.1016/j.neuron.2007.07.028","extern":1,"publication_status":"published","date_created":"2018-12-11T12:01:39Z","citation":{"mla":"Hippenmeyer, Simon, et al. “ETS Transcription Factor Erm Controls Subsynaptic Gene Expression in Skeletal Muscles.” <i>Neuron</i>, vol. 55, no. 5, Elsevier, 2007, pp. 726–40, doi:<a href=\"https://doi.org/10.1016/j.neuron.2007.07.028\">10.1016/j.neuron.2007.07.028</a>.","ista":"Hippenmeyer S, Huber R, Ladle D, Murphy K, Arber S. 2007. ETS transcription factor Erm controls subsynaptic gene expression in skeletal muscles. Neuron. 55(5), 726–740.","chicago":"Hippenmeyer, Simon, Roland Huber, David Ladle, Kenneth Murphy, and Silvia Arber. “ETS Transcription Factor Erm Controls Subsynaptic Gene Expression in Skeletal Muscles.” <i>Neuron</i>. Elsevier, 2007. <a href=\"https://doi.org/10.1016/j.neuron.2007.07.028\">https://doi.org/10.1016/j.neuron.2007.07.028</a>.","ama":"Hippenmeyer S, Huber R, Ladle D, Murphy K, Arber S. ETS transcription factor Erm controls subsynaptic gene expression in skeletal muscles. <i>Neuron</i>. 2007;55(5):726-740. doi:<a href=\"https://doi.org/10.1016/j.neuron.2007.07.028\">10.1016/j.neuron.2007.07.028</a>","apa":"Hippenmeyer, S., Huber, R., Ladle, D., Murphy, K., &#38; Arber, S. (2007). ETS transcription factor Erm controls subsynaptic gene expression in skeletal muscles. <i>Neuron</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.neuron.2007.07.028\">https://doi.org/10.1016/j.neuron.2007.07.028</a>","short":"S. Hippenmeyer, R. Huber, D. Ladle, K. Murphy, S. Arber, Neuron 55 (2007) 726–740.","ieee":"S. Hippenmeyer, R. Huber, D. Ladle, K. Murphy, and S. Arber, “ETS transcription factor Erm controls subsynaptic gene expression in skeletal muscles,” <i>Neuron</i>, vol. 55, no. 5. Elsevier, pp. 726–740, 2007."},"status":"public","date_published":"2007-09-06T00:00:00Z","volume":55,"page":"726 - 740","date_updated":"2021-01-12T07:41:22Z","quality_controlled":0,"abstract":[{"lang":"eng","text":"Accumulation of specific proteins at synaptic structures is essential for synapse assembly and function, but mechanisms regulating local protein enrichment remain poorly understood. At the neuromuscular junction (NMJ), subsynaptic nuclei underlie motor axon terminals within extrafusal muscle fibers and are transcriptionally distinct from neighboring nuclei. In this study, we show that expression of the ETS transcription factor Erm is highly concentrated at subsynaptic nuclei, and its mutation in mice leads to severe downregulation of many genes with normally enriched subsynaptic expression. Erm mutant mice display an expansion of the muscle central domain in which acetylcholine receptor (AChR) clusters accumulate, show gradual fragmentation of AChR clusters, and exhibit symptoms of muscle weakness mimicking congenital myasthenic syndrome (CMS). Together, our findings define Erm as an upstream regulator of a transcriptional program selective to subsynaptic nuclei at the NMJ and underscore the importance of transcriptional control of local synaptic protein accumulation."}],"year":"2007","_id":"3144"},{"day":"05","publication":"Springer Tracts in Advanced Robotics","publisher":"Springer","author":[{"first_name":"Andrew","last_name":"Blake","full_name":"Blake, Andrew"},{"last_name":"Criminisi","full_name":"Criminisi, Antonio","first_name":"Antonio"},{"last_name":"Cross","full_name":"Cross, Geoffrey","first_name":"Geoffrey"},{"first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov","full_name":"Vladimir Kolmogorov"},{"last_name":"Rother","full_name":"Rother, Carsten","first_name":"Carsten"}],"month":"02","title":"Fusion of stereo colour and contrast","publist_id":"3492","date_updated":"2021-01-12T07:41:40Z","volume":28,"date_published":"2007-02-05T00:00:00Z","page":"295 - 304","_id":"3187","quality_controlled":0,"abstract":[{"lang":"eng","text":"Stereo vision has numerous applications in robotics, graphics, inspection and other areas. A prime application, one which has driven work on stereo in our laboratory, is teleconferencing in which the use of a stereo webcam already makes possible various transformations of the video stream. These include digital camera control, insertion of virtual objects, background substitution, and eye-gaze correction [9, 8]."}],"year":"2007","main_file_link":[{"open_access":"0","url":"http://research.microsoft.com/pubs/67417/criminisi_isrr2005.pdf"}],"extern":1,"citation":{"ista":"Blake A, Criminisi A, Cross G, Kolmogorov V, Rother C. 2007. Fusion of stereo colour and contrast. Springer Tracts in Advanced Robotics. 28, 295–304.","mla":"Blake, Andrew, et al. “Fusion of Stereo Colour and Contrast.” <i>Springer Tracts in Advanced Robotics</i>, vol. 28, Springer, 2007, pp. 295–304, doi:<a href=\"https://doi.org/10.1007/978-3-540-48113-3_27\">10.1007/978-3-540-48113-3_27</a>.","short":"A. Blake, A. Criminisi, G. Cross, V. Kolmogorov, C. Rother, Springer Tracts in Advanced Robotics 28 (2007) 295–304.","apa":"Blake, A., Criminisi, A., Cross, G., Kolmogorov, V., &#38; Rother, C. (2007). Fusion of stereo colour and contrast. <i>Springer Tracts in Advanced Robotics</i>. Springer. <a href=\"https://doi.org/10.1007/978-3-540-48113-3_27\">https://doi.org/10.1007/978-3-540-48113-3_27</a>","chicago":"Blake, Andrew, Antonio Criminisi, Geoffrey Cross, Vladimir Kolmogorov, and Carsten Rother. “Fusion of Stereo Colour and Contrast.” <i>Springer Tracts in Advanced Robotics</i>. Springer, 2007. <a href=\"https://doi.org/10.1007/978-3-540-48113-3_27\">https://doi.org/10.1007/978-3-540-48113-3_27</a>.","ama":"Blake A, Criminisi A, Cross G, Kolmogorov V, Rother C. Fusion of stereo colour and contrast. <i>Springer Tracts in Advanced Robotics</i>. 2007;28:295-304. doi:<a href=\"https://doi.org/10.1007/978-3-540-48113-3_27\">10.1007/978-3-540-48113-3_27</a>","ieee":"A. Blake, A. Criminisi, G. Cross, V. Kolmogorov, and C. Rother, “Fusion of stereo colour and contrast,” <i>Springer Tracts in Advanced Robotics</i>, vol. 28. Springer, pp. 295–304, 2007."},"publication_status":"published","date_created":"2018-12-11T12:01:54Z","intvolume":"        28","type":"journal_article","doi":"10.1007/978-3-540-48113-3_27","status":"public"},{"title":"Applications of parametric maxflow in computer vision","publist_id":"3489","month":"12","author":[{"full_name":"Vladimir Kolmogorov","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir"},{"first_name":"Yuri","full_name":"Boykov, Yuri","last_name":"Boykov"},{"first_name":"Carsten","last_name":"Rother","full_name":"Rother, Carsten"}],"publisher":"IEEE","day":"26","doi":"10.1109/ICCV.2007.4408910","type":"conference","date_created":"2018-12-11T12:01:55Z","citation":{"chicago":"Kolmogorov, Vladimir, Yuri Boykov, and Carsten Rother. “Applications of Parametric Maxflow in Computer Vision.” IEEE, 2007. <a href=\"https://doi.org/10.1109/ICCV.2007.4408910\">https://doi.org/10.1109/ICCV.2007.4408910</a>.","ama":"Kolmogorov V, Boykov Y, Rother C. Applications of parametric maxflow in computer vision. In: IEEE; 2007. doi:<a href=\"https://doi.org/10.1109/ICCV.2007.4408910\">10.1109/ICCV.2007.4408910</a>","apa":"Kolmogorov, V., Boykov, Y., &#38; Rother, C. (2007). Applications of parametric maxflow in computer vision. Presented at the ICCV: International Conference on Computer Vision, IEEE. <a href=\"https://doi.org/10.1109/ICCV.2007.4408910\">https://doi.org/10.1109/ICCV.2007.4408910</a>","short":"V. Kolmogorov, Y. Boykov, C. Rother, in:, IEEE, 2007.","mla":"Kolmogorov, Vladimir, et al. <i>Applications of Parametric Maxflow in Computer Vision</i>. IEEE, 2007, doi:<a href=\"https://doi.org/10.1109/ICCV.2007.4408910\">10.1109/ICCV.2007.4408910</a>.","ista":"Kolmogorov V, Boykov Y, Rother C. 2007. Applications of parametric maxflow in computer vision. ICCV: International Conference on Computer Vision.","ieee":"V. Kolmogorov, Y. Boykov, and C. Rother, “Applications of parametric maxflow in computer vision,” presented at the ICCV: International Conference on Computer Vision, 2007."},"publication_status":"published","conference":{"name":"ICCV: International Conference on Computer Vision"},"extern":1,"main_file_link":[{"url":"http://research.microsoft.com/pubs/70474/iccv07-paramaxflow.pdf","open_access":"0"}],"status":"public","date_published":"2007-12-26T00:00:00Z","date_updated":"2021-01-12T07:41:41Z","year":"2007","quality_controlled":0,"abstract":[{"text":"The maximum flow algorithm for minimizing energy functions of binary variables has become a standard tool in computer vision. In many cases, unary costs of the energy depend linearly on parameter lambda. In this paper we study vision applications for which it is important to solve the maxflow problem for different lambda's. An example is a weighting between data and regularization terms in image segmentation or stereo: it is desirable to vary it both during training (to learn lambda from ground truth data) and testing (to select best lambda using high-knowledge constraints, e.g. user input). We review algorithmic aspects of this parametric maximum flow problem previously unknown in vision, such as the ability to compute all breakpoints of lambda and corresponding optimal configurations infinite time. These results allow, in particular, to minimize the ratio of some geometric functional, such as flux of a vector field over length (or area). Previously, such functional were tackled with shortest path techniques applicable only in 2D. We give theoretical improvements for &quot;PDE cuts&quot; [5]. We present experimental results for image segmentation, 3D reconstruction, and the cosegmentation problem.","lang":"eng"}],"_id":"3191"},{"date_published":"2007-07-16T00:00:00Z","date_updated":"2021-01-12T07:41:42Z","year":"2007","abstract":[{"lang":"eng","text":"Many computer vision applications rely on the efficient optimization of challenging, so-called non-submodular, binary pairwise MRFs. A promising graph cut based approach for optimizing such MRFs known as &quot;roof duality&quot; was recently introduced into computer vision. We study two methods which extend this approach. First, we discuss an efficient implementation of the &quot;probing&quot; technique introduced recently by Boros et al. [5]. It simplifies the MRF while preserving the global optimum. Our code is 400-700 faster on some graphs than the implementation of [5]. Second, we present a new technique which takes an arbitrary input labeling and tries to improve its energy. We give theoretical characterizations of local minima of this procedure. We applied both techniques to many applications, including image segmentation, new view synthesis, superresolution, diagram recognition, parameter learning, texture restoration, and image deconvolution. For several applications we see that we are able to find the global minimum very efficiently, and considerably outperform the original roof duality approach. In comparison to existing techniques, such as graph cut, TRW, BP, ICM, and simulated annealing, we nearly always find a lower energy."}],"quality_controlled":0,"_id":"3192","doi":"10.1109/CVPR.2007.383203","type":"conference","citation":{"ieee":"C. Rother, V. Kolmogorov, V. Lempitsky, and M. Szummer, “Optimizing binary MRFs via extended roof duality,” presented at the CVPR: Computer Vision and Pattern Recognition, 2007.","ista":"Rother C, Kolmogorov V, Lempitsky V, Szummer M. 2007. Optimizing binary MRFs via extended roof duality. CVPR: Computer Vision and Pattern Recognition.","mla":"Rother, Carsten, et al. <i>Optimizing Binary MRFs via Extended Roof Duality</i>. IEEE, 2007, doi:<a href=\"https://doi.org/10.1109/CVPR.2007.383203\">10.1109/CVPR.2007.383203</a>.","apa":"Rother, C., Kolmogorov, V., Lempitsky, V., &#38; Szummer, M. (2007). Optimizing binary MRFs via extended roof duality. Presented at the CVPR: Computer Vision and Pattern Recognition, IEEE. <a href=\"https://doi.org/10.1109/CVPR.2007.383203\">https://doi.org/10.1109/CVPR.2007.383203</a>","short":"C. Rother, V. Kolmogorov, V. Lempitsky, M. Szummer, in:, IEEE, 2007.","ama":"Rother C, Kolmogorov V, Lempitsky V, Szummer M. Optimizing binary MRFs via extended roof duality. In: IEEE; 2007. doi:<a href=\"https://doi.org/10.1109/CVPR.2007.383203\">10.1109/CVPR.2007.383203</a>","chicago":"Rother, Carsten, Vladimir Kolmogorov, Victor Lempitsky, and Martin Szummer. “Optimizing Binary MRFs via Extended Roof Duality.” IEEE, 2007. <a href=\"https://doi.org/10.1109/CVPR.2007.383203\">https://doi.org/10.1109/CVPR.2007.383203</a>."},"date_created":"2018-12-11T12:01:55Z","publication_status":"published","conference":{"name":"CVPR: Computer Vision and Pattern Recognition"},"main_file_link":[{"url":"http://www.robots.ox.ac.uk/~vilem/QPBOPI.pdf","open_access":"0"}],"extern":1,"status":"public","publisher":"IEEE","day":"16","title":"Optimizing binary MRFs via extended roof duality","publist_id":"3490","month":"07","author":[{"first_name":"Carsten","last_name":"Rother","full_name":"Rother, Carsten"},{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","last_name":"Kolmogorov","full_name":"Vladimir Kolmogorov"},{"last_name":"Lempitsky","full_name":"Lempitsky, Victor","first_name":"Victor"},{"first_name":"Martin","last_name":"Szummer","full_name":"Szummer, Martin"}]},{"doi":"10.1109/TPAMI.2007.1031","intvolume":"        29","type":"journal_article","publication_status":"published","citation":{"ista":"Kolmogorov V, Rother C. 2007. Minimizing nonsubmodular functions with graph cuts - A review. IEEE Transactions on Pattern Analysis and Machine Intelligence. 29(7), 1274–1279.","mla":"Kolmogorov, Vladimir, and Carsten Rother. “Minimizing Nonsubmodular Functions with Graph Cuts - A Review.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 29, no. 7, IEEE, 2007, pp. 1274–79, doi:<a href=\"https://doi.org/10.1109/TPAMI.2007.1031\">10.1109/TPAMI.2007.1031</a>.","ama":"Kolmogorov V, Rother C. Minimizing nonsubmodular functions with graph cuts - A review. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. 2007;29(7):1274-1279. doi:<a href=\"https://doi.org/10.1109/TPAMI.2007.1031\">10.1109/TPAMI.2007.1031</a>","chicago":"Kolmogorov, Vladimir, and Carsten Rother. “Minimizing Nonsubmodular Functions with Graph Cuts - A Review.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE, 2007. <a href=\"https://doi.org/10.1109/TPAMI.2007.1031\">https://doi.org/10.1109/TPAMI.2007.1031</a>.","short":"V. Kolmogorov, C. Rother, IEEE Transactions on Pattern Analysis and Machine Intelligence 29 (2007) 1274–1279.","apa":"Kolmogorov, V., &#38; Rother, C. (2007). Minimizing nonsubmodular functions with graph cuts - A review. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE. <a href=\"https://doi.org/10.1109/TPAMI.2007.1031\">https://doi.org/10.1109/TPAMI.2007.1031</a>","ieee":"V. Kolmogorov and C. Rother, “Minimizing nonsubmodular functions with graph cuts - A review,” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 29, no. 7. IEEE, pp. 1274–1279, 2007."},"date_created":"2018-12-11T12:01:56Z","extern":1,"status":"public","page":"1274 - 1279","date_published":"2007-07-01T00:00:00Z","volume":29,"date_updated":"2021-01-12T07:41:42Z","year":"2007","quality_controlled":0,"abstract":[{"text":"Optimization techniques based on graph cuts have become a standard tool for many vision applications. These techniques allow to minimize efficiently certain energy functions corresponding to pairwise Markov Random Fields (MRFs). Currently, there is an accepted view within the computer vision community that graph cuts can only be used for optimizing a limited class of MRF energies (e.g., submodular functions). In this survey, we review some results that show that graph cuts can be applied to a much larger class of energy functions (in particular, nonsubmodular functions). While these results are well-known in the optimization community, to our knowledge they were not used in the context of computer vision and MRF optimization. We demonstrate the relevance of these results to vision on the problem of binary texture restoration. ","lang":"eng"}],"_id":"3193","title":"Minimizing nonsubmodular functions with graph cuts - A review","publist_id":"3491","month":"07","author":[{"last_name":"Kolmogorov","full_name":"Vladimir Kolmogorov","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Rother","full_name":"Rother, Carsten","first_name":"Carsten"}],"issue":"7","publisher":"IEEE","publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","day":"01"},{"citation":{"ista":"Pietrzak KZ. 2007. Non-trivial black-box combiners for collision-resistant hash-functions don’t exist. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 4515, 23–33.","mla":"Pietrzak, Krzysztof Z. <i>Non-Trivial Black-Box Combiners for Collision-Resistant Hash-Functions Don’t Exist</i>. Vol. 4515, Springer, 2007, pp. 23–33, doi:<a href=\"https://doi.org/10.1007/978-3-540-72540-4_2\">10.1007/978-3-540-72540-4_2</a>.","short":"K.Z. Pietrzak, in:, Springer, 2007, pp. 23–33.","apa":"Pietrzak, K. Z. (2007). Non-trivial black-box combiners for collision-resistant hash-functions don’t exist (Vol. 4515, pp. 23–33). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Springer. <a href=\"https://doi.org/10.1007/978-3-540-72540-4_2\">https://doi.org/10.1007/978-3-540-72540-4_2</a>","chicago":"Pietrzak, Krzysztof Z. “Non-Trivial Black-Box Combiners for Collision-Resistant Hash-Functions Don’t Exist,” 4515:23–33. Springer, 2007. <a href=\"https://doi.org/10.1007/978-3-540-72540-4_2\">https://doi.org/10.1007/978-3-540-72540-4_2</a>.","ama":"Pietrzak KZ. Non-trivial black-box combiners for collision-resistant hash-functions don’t exist. In: Vol 4515. Springer; 2007:23-33. doi:<a href=\"https://doi.org/10.1007/978-3-540-72540-4_2\">10.1007/978-3-540-72540-4_2</a>","ieee":"K. Z. Pietrzak, “Non-trivial black-box combiners for collision-resistant hash-functions don’t exist,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, 2007, vol. 4515, pp. 23–33."},"conference":{"name":"EUROCRYPT: Theory and Applications of Cryptographic Techniques"},"date_created":"2018-12-11T12:02:05Z","publication_status":"published","extern":1,"doi":"10.1007/978-3-540-72540-4_2","type":"conference","intvolume":"      4515","status":"public","date_updated":"2021-01-12T07:41:52Z","page":"23 - 33","date_published":"2007-06-12T00:00:00Z","volume":4515,"_id":"3218","year":"2007","quality_controlled":0,"abstract":[{"lang":"eng","text":"A (k, ℓ)-robust combiner for collision-resistant hash-functions is a construction which from ℓ hash-functions constructs a hash-function which is collision-resistant if at least k of the components are collision-resistant. One trivially gets a (k, ℓ)-robust combiner by concatenating the output of any ℓ - k + 1 of the components, unfortunately this is not very practical as the length of the output of the combiner is quite large. We show that this is unavoidable as no black-box (k, ℓ)-robust combiner whose output is significantly shorter than what can be achieved by concatenation exists. This answers a question of Boneh and Boyen (Crypto'06). "}],"alternative_title":["LNCS"],"author":[{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","full_name":"Krzysztof Pietrzak","last_name":"Pietrzak"}],"title":"Non-trivial black-box combiners for collision-resistant hash-functions don't exist","publist_id":"3461","month":"06","acknowledgement":"Supported by DIAMANT, the Dutch national mathematics cluster for discrete interactive and algorithmic algebra and number theory.","day":"12","publisher":"Springer"},{"page":"130 - 149","date_published":"2007-10-03T00:00:00Z","volume":4622,"date_updated":"2021-01-12T07:41:53Z","year":"2007","abstract":[{"lang":"eng","text":"Many aspects of cryptographic security proofs can be seen as the proof that a certain system (e.g. a block cipher) is indistinguishable from an ideal system (e.g. a random permutation), for different types of distinguishers. This paper presents a new generic approach to proving upper bounds on the information-theoretic distinguishing advantage (from an ideal system) for a combined system, assuming upper bounds of certain types for the component systems. For a general type of combination operation of systems, including the XOR of functions or the cascade of permutations, we prove two amplification theorems. The first is a product theorem, in the spirit of XOR-lemmas: The distinguishing advantage of the combination of two systems is at most twice the product of the individual distinguishing advantages. This bound is optimal. The second theorem states that the combination of systems is secure against some strong class of distinguishers, assuming only that the components are secure against some weaker class of distinguishers. A key technical tool of the paper is the proof of a tight two-way correspondence, previously only known to hold in one direction, between the distinguishing advantage of two systems and the probability of winning an appropriately defined game. © International Association for Cryptologic Research 2007."}],"quality_controlled":0,"_id":"3219","doi":"10.1007/978-3-540-74143-5_8","intvolume":"      4622","type":"conference","date_created":"2018-12-11T12:02:05Z","publication_status":"published","citation":{"mla":"Maurer, Ueli, et al. <i>Indistinguishability Amplification</i>. Vol. 4622, Springer, 2007, pp. 130–49, doi:<a href=\"https://doi.org/10.1007/978-3-540-74143-5_8\">10.1007/978-3-540-74143-5_8</a>.","ista":"Maurer U, Pietrzak KZ, Renner R. 2007. Indistinguishability amplification. CRYPTO: International Cryptology Conference, LNCS, vol. 4622, 130–149.","apa":"Maurer, U., Pietrzak, K. Z., &#38; Renner, R. (2007). Indistinguishability amplification (Vol. 4622, pp. 130–149). Presented at the CRYPTO: International Cryptology Conference, Springer. <a href=\"https://doi.org/10.1007/978-3-540-74143-5_8\">https://doi.org/10.1007/978-3-540-74143-5_8</a>","short":"U. Maurer, K.Z. Pietrzak, R. Renner, in:, Springer, 2007, pp. 130–149.","ama":"Maurer U, Pietrzak KZ, Renner R. Indistinguishability amplification. In: Vol 4622. Springer; 2007:130-149. doi:<a href=\"https://doi.org/10.1007/978-3-540-74143-5_8\">10.1007/978-3-540-74143-5_8</a>","chicago":"Maurer, Ueli, Krzysztof Z Pietrzak, and Renato Renner. “Indistinguishability Amplification,” 4622:130–49. Springer, 2007. <a href=\"https://doi.org/10.1007/978-3-540-74143-5_8\">https://doi.org/10.1007/978-3-540-74143-5_8</a>.","ieee":"U. Maurer, K. Z. Pietrzak, and R. Renner, “Indistinguishability amplification,” presented at the CRYPTO: International Cryptology Conference, 2007, vol. 4622, pp. 130–149."},"conference":{"name":"CRYPTO: International Cryptology Conference"},"extern":1,"status":"public","publisher":"Springer","day":"03","alternative_title":["LNCS"],"publist_id":"3462","title":"Indistinguishability amplification","month":"10","author":[{"full_name":"Maurer, Ueli M","last_name":"Maurer","first_name":"Ueli"},{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","last_name":"Pietrzak","full_name":"Krzysztof Pietrzak"},{"last_name":"Renner","full_name":"Renner, Renato","first_name":"Renato"}]},{"date_published":"2007-10-23T00:00:00Z","page":"227 - 237","date_updated":"2021-01-12T07:41:54Z","abstract":[{"lang":"eng","text":"We introduce a new primitive called intrusion-resilient secret sharing (IRSS), whose security proof exploits the fact that there exist functions which can be efficiently computed interactively using low communication complexity in k, but not in k-1 rounds. IRSS is a means of sharing a secret message amongst a set of players which comes with a very strong security guarantee. The shares in an IRSS are made artificially large so that it is hard to retrieve them completely, and the reconstruction procedure is interactive requiring the players to exchange k short messages. The adversaries considered can attack the scheme in rounds, where in each round the adversary chooses some player to corrupt and some function, and retrieves the output of that function applied to the share of the corrupted player. This model captures for example computers connected to a network which can occasionally he infected by malicious software like viruses, which can compute any function on the infected machine, but cannot sent out a huge amount of data. Using methods from the bounded-retrieval model, we construct an IRSS scheme which is secure against any computationally unbounded adversary as long as the total amount of information retrieved by the adversary is somewhat less than the length of the shares, and the adversary makes at most k-1 corruption rounds (as described above, where k rounds are necessary for reconstruction). We extend our basic scheme in several ways in order to allow the shares sent by the dealer to be short (the players then blow them up locally) and to handle even stronger adversaries who can learn some of the shares completely. As mentioned, there is an obvious connection between IRSS schemes and the fact that there exist functions with an exponential gap in their communication complexity for k and k-1 rounds. Our scheme implies such a separation which is in several aspects stronger than the previously known ones."}],"quality_controlled":0,"year":"2007","_id":"3220","type":"conference","doi":"10.1109/FOCS.2007.63","extern":1,"citation":{"chicago":"Dziembowski, Stefan, and Krzysztof Z Pietrzak. “Intrusion Resilient Secret Sharing,” 227–37. IEEE, 2007. <a href=\"https://doi.org/10.1109/FOCS.2007.63\">https://doi.org/10.1109/FOCS.2007.63</a>.","ama":"Dziembowski S, Pietrzak KZ. Intrusion resilient secret sharing. In: IEEE; 2007:227-237. doi:<a href=\"https://doi.org/10.1109/FOCS.2007.63\">10.1109/FOCS.2007.63</a>","apa":"Dziembowski, S., &#38; Pietrzak, K. Z. (2007). Intrusion resilient secret sharing (pp. 227–237). Presented at the FOCS: Foundations of Computer Science, IEEE. <a href=\"https://doi.org/10.1109/FOCS.2007.63\">https://doi.org/10.1109/FOCS.2007.63</a>","short":"S. Dziembowski, K.Z. Pietrzak, in:, IEEE, 2007, pp. 227–237.","mla":"Dziembowski, Stefan, and Krzysztof Z. Pietrzak. <i>Intrusion Resilient Secret Sharing</i>. IEEE, 2007, pp. 227–37, doi:<a href=\"https://doi.org/10.1109/FOCS.2007.63\">10.1109/FOCS.2007.63</a>.","ista":"Dziembowski S, Pietrzak KZ. 2007. Intrusion resilient secret sharing. FOCS: Foundations of Computer Science, 227–237.","ieee":"S. Dziembowski and K. Z. Pietrzak, “Intrusion resilient secret sharing,” presented at the FOCS: Foundations of Computer Science, 2007, pp. 227–237."},"publication_status":"published","conference":{"name":"FOCS: Foundations of Computer Science"},"date_created":"2018-12-11T12:02:05Z","status":"public","publisher":"IEEE","day":"23","month":"10","title":"Intrusion resilient secret sharing","publist_id":"3459","author":[{"first_name":"Stefan","full_name":"Dziembowski, Stefan","last_name":"Dziembowski"},{"first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","full_name":"Krzysztof Pietrzak","last_name":"Pietrzak"}]},{"_id":"3221","quality_controlled":0,"abstract":[{"text":"We investigate a general class of (black-box) constructions for range extension of weak pseudorandom functions: a construction based on m independent functions F 1,...,F m is given by a set of strings over {1,...,m}*, where for example {〈2〉, 〈1,2〉} corresponds to the function X ↦[F 2(X),F 2(F 1(X))]. All efficient constructions for range expansion of weak pseudorandom functions that we are aware of are of this form.\nWe completely classify such constructions as good, bad or ugly, where the good constructions are those whose security can be proven via a black-box reduction, the bad constructions are those whose insecurity can be proven via a black-box reduction, and the ugly constructions are those which are neither good nor bad.\nOur classification shows that the range expansion from [10] is optimal, in the sense that it achieves the best possible expansion (2 m  − 1 when using m keys).\nAlong the way we show that for weak quasirandom functions (i.e. in the information theoretic setting), all constructions which are not bad – in particular all the ugly ones – are secure.","lang":"eng"}],"year":"2007","date_updated":"2021-01-12T07:41:54Z","volume":4515,"date_published":"2007-06-12T00:00:00Z","page":"517 - 533","status":"public","extern":1,"date_created":"2018-12-11T12:02:06Z","publication_status":"published","citation":{"ama":"Pietrzak KZ, Sjödin J. Range extension for weak PRFs the good the bad and the ugly. In: Vol 4515. Springer; 2007:517-533. doi:<a href=\"https://doi.org/10.1007/978-3-540-72540-4_30\">10.1007/978-3-540-72540-4_30</a>","chicago":"Pietrzak, Krzysztof Z, and Johan Sjödin. “Range Extension for Weak PRFs the Good the Bad and the Ugly,” 4515:517–33. Springer, 2007. <a href=\"https://doi.org/10.1007/978-3-540-72540-4_30\">https://doi.org/10.1007/978-3-540-72540-4_30</a>.","apa":"Pietrzak, K. Z., &#38; Sjödin, J. (2007). Range extension for weak PRFs the good the bad and the ugly (Vol. 4515, pp. 517–533). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Springer. <a href=\"https://doi.org/10.1007/978-3-540-72540-4_30\">https://doi.org/10.1007/978-3-540-72540-4_30</a>","short":"K.Z. Pietrzak, J. Sjödin, in:, Springer, 2007, pp. 517–533.","ista":"Pietrzak KZ, Sjödin J. 2007. Range extension for weak PRFs the good the bad and the ugly. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 4515, 517–533.","mla":"Pietrzak, Krzysztof Z., and Johan Sjödin. <i>Range Extension for Weak PRFs the Good the Bad and the Ugly</i>. Vol. 4515, Springer, 2007, pp. 517–33, doi:<a href=\"https://doi.org/10.1007/978-3-540-72540-4_30\">10.1007/978-3-540-72540-4_30</a>.","ieee":"K. Z. Pietrzak and J. Sjödin, “Range extension for weak PRFs the good the bad and the ugly,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, 2007, vol. 4515, pp. 517–533."},"conference":{"name":"EUROCRYPT: Theory and Applications of Cryptographic Techniques"},"intvolume":"      4515","type":"conference","doi":"10.1007/978-3-540-72540-4_30","day":"12","publisher":"Springer","acknowledgement":"This work was partially supported by the Zurich Information Security Center. It represents the views of the authors.","author":[{"first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","full_name":"Krzysztof Pietrzak","last_name":"Pietrzak"},{"first_name":"Johan","last_name":"Sjödin","full_name":"Sjödin,  Johan"}],"month":"06","title":"Range extension for weak PRFs the good the bad and the ugly","publist_id":"3460","alternative_title":["LNCS"]},{"type":"conference","intvolume":"      4392","doi":"10.1007/978-3-540-70936-7_5","extern":1,"citation":{"mla":"Pietrzak, Krzysztof Z., and Douglas Wikström. <i>Parallel Repetition of Computationally Sound Protocols Revisited</i>. Vol. 4392, Springer, 2007, pp. 86–102, doi:<a href=\"https://doi.org/10.1007/978-3-540-70936-7_5\">10.1007/978-3-540-70936-7_5</a>.","ista":"Pietrzak KZ, Wikström D. 2007. Parallel repetition of computationally sound protocols revisited. TCC: Theory of Cryptography Conference, LNCS, vol. 4392, 86–102.","ama":"Pietrzak KZ, Wikström D. Parallel repetition of computationally sound protocols revisited. In: Vol 4392. Springer; 2007:86-102. doi:<a href=\"https://doi.org/10.1007/978-3-540-70936-7_5\">10.1007/978-3-540-70936-7_5</a>","chicago":"Pietrzak, Krzysztof Z, and Douglas Wikström. “Parallel Repetition of Computationally Sound Protocols Revisited,” 4392:86–102. Springer, 2007. <a href=\"https://doi.org/10.1007/978-3-540-70936-7_5\">https://doi.org/10.1007/978-3-540-70936-7_5</a>.","apa":"Pietrzak, K. Z., &#38; Wikström, D. (2007). Parallel repetition of computationally sound protocols revisited (Vol. 4392, pp. 86–102). Presented at the TCC: Theory of Cryptography Conference, Springer. <a href=\"https://doi.org/10.1007/978-3-540-70936-7_5\">https://doi.org/10.1007/978-3-540-70936-7_5</a>","short":"K.Z. Pietrzak, D. Wikström, in:, Springer, 2007, pp. 86–102.","ieee":"K. Z. Pietrzak and D. Wikström, “Parallel repetition of computationally sound protocols revisited,” presented at the TCC: Theory of Cryptography Conference, 2007, vol. 4392, pp. 86–102."},"publication_status":"published","date_created":"2018-12-11T12:02:06Z","conference":{"name":"TCC: Theory of Cryptography Conference"},"status":"public","date_published":"2007-03-22T00:00:00Z","volume":4392,"page":"86 - 102","date_updated":"2021-01-12T07:41:54Z","quality_controlled":0,"abstract":[{"lang":"eng","text":"Parallel repetition is well known to reduce the error probability at an exponential rate for single- and multi-prover interactive proofs.\nBellare, Impagliazzo and Naor (1997) show that this is also true for protocols where the soundness only holds against computationally bounded provers (e.g. interactive arguments) if the protocol has at most three rounds.\nOn the other hand, for four rounds they give a protocol where this is no longer the case: the error probability does not decrease below some constant even if the protocol is repeated a polynomial number of times. Unfortunately, this protocol is not very convincing as the communication complexity of each instance of the protocol grows linearly with the number of repetitions, and for such protocols the error does not even decrease for some types of interactive proofs. Noticing this, Bellare et al. construct (a quite artificial) oracle relative to which a four round protocol exists whose communication complexity does not depend on the number of parallel repetitions. This shows that there is no “black-box” error reduction theorem for four round protocols.\nIn this paper we give the first computationally sound protocol where k-fold parallel repetition does not decrease the error probability below some constant for any polynomial k (and where the communication complexity does not depend on k). The protocol has eight rounds and uses the universal arguments of Barak and Goldreich (2001). We also give another four round protocol relative to an oracle, unlike the artificial oracle of Bellare et al., we just need a generic group. This group can then potentially be instantiated with some real group satisfying some well defined hardness assumptions (we do not know of any candidate for such a group at the moment)."}],"year":"2007","_id":"3222","alternative_title":["LNCS"],"month":"03","title":"Parallel repetition of computationally sound protocols revisited","publist_id":"3457","author":[{"orcid":"0000-0002-9139-1654","last_name":"Pietrzak","full_name":"Krzysztof Pietrzak","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Douglas","last_name":"Wikström","full_name":"Wikström, Douglas"}],"publisher":"Springer","day":"22"},{"author":[{"first_name":"Yevgeniy","full_name":"Dodis, Yevgeniy","last_name":"Dodis"},{"orcid":"0000-0002-9139-1654","last_name":"Pietrzak","full_name":"Krzysztof Pietrzak","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"}],"title":"Improving the security of MACs via randomized message preprocessing","publist_id":"3458","month":"10","alternative_title":["LNCS"],"day":"11","publisher":"Springer","status":"public","date_created":"2018-12-11T12:02:06Z","conference":{"name":"FSE: Fast Software Encryption"},"citation":{"ista":"Dodis Y, Pietrzak KZ. 2007. Improving the security of MACs via randomized message preprocessing. FSE: Fast Software Encryption, LNCS, vol. 4593, 414–433.","mla":"Dodis, Yevgeniy, and Krzysztof Z. Pietrzak. <i>Improving the Security of MACs via Randomized Message Preprocessing</i>. Vol. 4593, Springer, 2007, pp. 414–33, doi:<a href=\"https://doi.org/10.1007/978-3-540-74619-5_26\">10.1007/978-3-540-74619-5_26</a>.","apa":"Dodis, Y., &#38; Pietrzak, K. Z. (2007). Improving the security of MACs via randomized message preprocessing (Vol. 4593, pp. 414–433). Presented at the FSE: Fast Software Encryption, Springer. <a href=\"https://doi.org/10.1007/978-3-540-74619-5_26\">https://doi.org/10.1007/978-3-540-74619-5_26</a>","short":"Y. Dodis, K.Z. Pietrzak, in:, Springer, 2007, pp. 414–433.","chicago":"Dodis, Yevgeniy, and Krzysztof Z Pietrzak. “Improving the Security of MACs via Randomized Message Preprocessing,” 4593:414–33. Springer, 2007. <a href=\"https://doi.org/10.1007/978-3-540-74619-5_26\">https://doi.org/10.1007/978-3-540-74619-5_26</a>.","ama":"Dodis Y, Pietrzak KZ. Improving the security of MACs via randomized message preprocessing. In: Vol 4593. Springer; 2007:414-433. doi:<a href=\"https://doi.org/10.1007/978-3-540-74619-5_26\">10.1007/978-3-540-74619-5_26</a>","ieee":"Y. Dodis and K. Z. Pietrzak, “Improving the security of MACs via randomized message preprocessing,” presented at the FSE: Fast Software Encryption, 2007, vol. 4593, pp. 414–433."},"publication_status":"published","extern":1,"doi":"10.1007/978-3-540-74619-5_26","type":"conference","intvolume":"      4593","_id":"3223","year":"2007","quality_controlled":0,"abstract":[{"lang":"eng","text":"“Hash then encrypt” is an approach to message authentication, where first the message is hashed down using an ε-universal hash function, and then the resulting k-bit value is encrypted, say with a block-cipher. The security of this scheme is proportional to εq2, where q is the number of MACs the adversary can request. As ε is at least 2−k, the best one can hope for is O(q2/2k) security. Unfortunately, such small ε is not achieved by simple hash functions used in practice, such as the polynomial evaluation or the Merkle-Damg ̊ard construction, where ε grows with the message length L.\nThe main insight of this work comes from the fact that, by using ran- domized message preprocessing via a short random salt p (which must then be sent as part of the authentication tag), we can use the “hash then encrypt” paradigm with suboptimal “practical” ε-universal hash func- tions, and still improve its exact security to optimal O(q2/2k). Specif- ically, by using at most an O(logL)-bit salt p, one can always regain the optimal exact security O(q2/2k), even in situations where ε grows polynomially with L. We also give very simple preprocessing maps for popular “suboptimal” hash functions, namely polynomial evaluation and the Merkle-Damg ̊ard construction.\nOur results come from a general extension of the classical Carter- Wegman paradigm, which we believe is of independent interest. On a high level, it shows that public randomization allows one to use the potentially much smaller “average-case” collision probability in place of the “worst-case” collision probability ε."}],"date_updated":"2021-01-12T07:41:55Z","page":"414 - 433","volume":4593,"date_published":"2007-10-11T00:00:00Z"},{"year":"2007","abstract":[{"lang":"eng","text":"The accumulation of deleterious mutations plays a major role in evolution, and key to this are the interactions between their fitness effects, known as epistasis. Whether mutations tend to interact synergistically (with multiple mutations being more deleterious than would be expected from their individual fitness effects) or antagonistically is important for a variety of evolutionary questions, particularly the evolution of sex. Unfortunately, the experimental evidence on the prevalence and strength of epistasis is mixed and inconclusive. Here we study theoretically whether synergistic or antagonistic epistasis is likely to be favored by evolution and by how much. We find that in the presence of recombination, evolution favors less synergistic or more antagonistic epistasis whenever mutations that change the epistasis in this direction are possible. This is because evolution favors increased buffering against the effects of deleterious mutations. This suggests that we should not expect synergistic epistasis to be widespread in nature and hence that the mutational deterministic hypothesis for the advantage of sex may not apply widely."}],"quality_controlled":0,"_id":"3305","page":"1001 - 10","volume":177,"date_published":"2007-01-01T00:00:00Z","date_updated":"2021-01-12T07:42:32Z","status":"public","doi":"10.1534/genetics.107.075812","intvolume":"       177","type":"journal_article","date_created":"2018-12-11T12:02:34Z","publication_status":"published","citation":{"ieee":"M. Desai, D. Weissman, and M. Feldman, “Evolution can favor antagonistic epistasis,” <i>Genetics</i>, vol. 177, no. 2. Genetics Society of America, pp. 1001–10, 2007.","chicago":"Desai, Michael, Daniel Weissman, and Marcus Feldman. “Evolution Can Favor Antagonistic Epistasis.” <i>Genetics</i>. Genetics Society of America, 2007. <a href=\"https://doi.org/10.1534/genetics.107.075812\">https://doi.org/10.1534/genetics.107.075812</a>.","ama":"Desai M, Weissman D, Feldman M. Evolution can favor antagonistic epistasis. <i>Genetics</i>. 2007;177(2):1001-1010. doi:<a href=\"https://doi.org/10.1534/genetics.107.075812\">10.1534/genetics.107.075812</a>","short":"M. Desai, D. Weissman, M. Feldman, Genetics 177 (2007) 1001–10.","apa":"Desai, M., Weissman, D., &#38; Feldman, M. (2007). Evolution can favor antagonistic epistasis. <i>Genetics</i>. Genetics Society of America. <a href=\"https://doi.org/10.1534/genetics.107.075812\">https://doi.org/10.1534/genetics.107.075812</a>","mla":"Desai, Michael, et al. “Evolution Can Favor Antagonistic Epistasis.” <i>Genetics</i>, vol. 177, no. 2, Genetics Society of America, 2007, pp. 1001–10, doi:<a href=\"https://doi.org/10.1534/genetics.107.075812\">10.1534/genetics.107.075812</a>.","ista":"Desai M, Weissman D, Feldman M. 2007. Evolution can favor antagonistic epistasis. Genetics. 177(2), 1001–10."},"extern":1,"publisher":"Genetics Society of America","publication":"Genetics","day":"01","issue":"2","publist_id":"3335","title":"Evolution can favor antagonistic epistasis","month":"01","author":[{"last_name":"Desai","full_name":"Desai, Michael M","first_name":"Michael"},{"id":"2D0CE020-F248-11E8-B48F-1D18A9856A87","first_name":"Daniel","full_name":"Daniel Weissman","last_name":"Weissman"},{"first_name":"Marcus","full_name":"Feldman, Marcus W","last_name":"Feldman"}]},{"status":"public","doi":"10.1529/biophysj.106.096982","type":"journal_article","intvolume":"        93","publication_status":"published","citation":{"ieee":"J. Preiner <i>et al.</i>, “Free energy of membrane protein unfolding derived from single-molecule force measurements,” <i>Biophysical Journal</i>, vol. 93, no. 3. Biophysical Society, pp. 930–937, 2007.","ista":"Preiner J, Janovjak HL, Rankl C, Knaus H, Cisneros D, Kedrov A, Kienberger F, Mueller D, Hinterdorfer P. 2007. Free energy of membrane protein unfolding derived from single-molecule force measurements. Biophysical Journal. 93(3), 930–937.","mla":"Preiner, Johannes, et al. “Free Energy of Membrane Protein Unfolding Derived from Single-Molecule Force Measurements.” <i>Biophysical Journal</i>, vol. 93, no. 3, Biophysical Society, 2007, pp. 930–37, doi:<a href=\"https://doi.org/10.1529/biophysj.106.096982\">10.1529/biophysj.106.096982</a>.","ama":"Preiner J, Janovjak HL, Rankl C, et al. Free energy of membrane protein unfolding derived from single-molecule force measurements. <i>Biophysical Journal</i>. 2007;93(3):930-937. doi:<a href=\"https://doi.org/10.1529/biophysj.106.096982\">10.1529/biophysj.106.096982</a>","chicago":"Preiner, Johannes, Harald L Janovjak, Christian Rankl, Helene Knaus, David Cisneros, Alexej Kedrov, Ferry Kienberger, Daniel Mueller, and Peter Hinterdorfer. “Free Energy of Membrane Protein Unfolding Derived from Single-Molecule Force Measurements.” <i>Biophysical Journal</i>. Biophysical Society, 2007. <a href=\"https://doi.org/10.1529/biophysj.106.096982\">https://doi.org/10.1529/biophysj.106.096982</a>.","short":"J. Preiner, H.L. Janovjak, C. Rankl, H. Knaus, D. Cisneros, A. Kedrov, F. Kienberger, D. Mueller, P. Hinterdorfer, Biophysical Journal 93 (2007) 930–937.","apa":"Preiner, J., Janovjak, H. L., Rankl, C., Knaus, H., Cisneros, D., Kedrov, A., … Hinterdorfer, P. (2007). Free energy of membrane protein unfolding derived from single-molecule force measurements. <i>Biophysical Journal</i>. Biophysical Society. <a href=\"https://doi.org/10.1529/biophysj.106.096982\">https://doi.org/10.1529/biophysj.106.096982</a>"},"date_created":"2018-12-11T12:03:11Z","extern":1,"main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC1913163/","open_access":"1"}],"year":"2007","abstract":[{"lang":"eng","text":"Mechanical single-molecule techniques offer exciting possibilities to investigate protein folding and stability in native environments at submolecular resolution. By applying a free-energy reconstruction procedure developed by Hummer and Szabo, which is based on a statistical theorem introduced by Jarzynski, we determined the unfolding free energy of the membrane proteins bacteriorhodopsin (BR), halorhodopsin, and the sodium-proton antiporter NhaA. The calculated energies ranged from 290.5kcal/mol for BR to 485.5kcal/mol for NhaA. For the remarkably stable BR, the equilibrium unfolding free energy was independent of pulling rate and temperature ranging between 18 and 42°C. Our experiments also revealed heterogeneous energetic properties in individual transmembrane helices. In halorhodopsin, the stabilization of a short helical segment yielded a characteristic signature in the energy profile. In NhaA, a pronounced peak was observed at a functionally important site in the protein. Since a large variety of single- and multispan membrane proteins can be tackled in mechanical unfolding experiments, our approach provides a basis for systematically elucidating energetic properties of membrane proteins with the resolution of individual secondary-structure elements."}],"quality_controlled":0,"_id":"3411","page":"930 - 937","date_published":"2007-08-01T00:00:00Z","volume":93,"date_updated":"2021-01-12T07:43:18Z","publist_id":"2990","title":"Free energy of membrane protein unfolding derived from single-molecule force measurements","month":"08","author":[{"first_name":"Johannes","full_name":"Preiner, Johannes","last_name":"Preiner"},{"first_name":"Harald L","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","last_name":"Janovjak","full_name":"Harald Janovjak","orcid":"0000-0002-8023-9315"},{"first_name":"Christian","last_name":"Rankl","full_name":"Rankl, Christian"},{"last_name":"Knaus","full_name":"Knaus, Helene","first_name":"Helene"},{"last_name":"Cisneros","full_name":"Cisneros, David A","first_name":"David"},{"full_name":"Kedrov, Alexej","last_name":"Kedrov","first_name":"Alexej"},{"last_name":"Kienberger","full_name":"Kienberger, Ferry","first_name":"Ferry"},{"last_name":"Mueller","full_name":"Mueller, Daniel J","first_name":"Daniel"},{"last_name":"Hinterdorfer","full_name":"Hinterdorfer, Peter","first_name":"Peter"}],"publisher":"Biophysical Society","publication":"Biophysical Journal","day":"01","oa":1,"issue":"3"}]