[{"citation":{"chicago":"Erdös, László, and Antti Knowles. “Quantum Diffusion and Delocalization for Band Matrices with General Distribution.” <i>Annales Henri Poincare</i>. Birkhäuser, 2011. <a href=\"https://doi.org/10.1007/s00023-011-0104-5\">https://doi.org/10.1007/s00023-011-0104-5</a>.","ista":"Erdös L, Knowles A. 2011. Quantum diffusion and delocalization for band matrices with general distribution. Annales Henri Poincare. 12(7), 1227–1319.","mla":"Erdös, László, and Antti Knowles. “Quantum Diffusion and Delocalization for Band Matrices with General Distribution.” <i>Annales Henri Poincare</i>, vol. 12, no. 7, Birkhäuser, 2011, pp. 1227–319, doi:<a href=\"https://doi.org/10.1007/s00023-011-0104-5\">10.1007/s00023-011-0104-5</a>.","ieee":"L. Erdös and A. Knowles, “Quantum diffusion and delocalization for band matrices with general distribution,” <i>Annales Henri Poincare</i>, vol. 12, no. 7. Birkhäuser, pp. 1227–1319, 2011.","short":"L. Erdös, A. Knowles, Annales Henri Poincare 12 (2011) 1227–1319.","ama":"Erdös L, Knowles A. Quantum diffusion and delocalization for band matrices with general distribution. <i>Annales Henri Poincare</i>. 2011;12(7):1227-1319. doi:<a href=\"https://doi.org/10.1007/s00023-011-0104-5\">10.1007/s00023-011-0104-5</a>","apa":"Erdös, L., &#38; Knowles, A. (2011). Quantum diffusion and delocalization for band matrices with general distribution. <i>Annales Henri Poincare</i>. Birkhäuser. <a href=\"https://doi.org/10.1007/s00023-011-0104-5\">https://doi.org/10.1007/s00023-011-0104-5</a>"},"month":"11","type":"journal_article","volume":12,"year":"2011","page":"1227 - 1319","publication":"Annales Henri Poincare","title":"Quantum diffusion and delocalization for band matrices with general distribution","abstract":[{"lang":"eng","text":"We consider Hermitian and symmetric random band matrices H in d ≥ dimensions. The matrix elements Hxy, indexed by x,y ∈ Λ ⊂ ℤd are independent and their variances satisfy σ2xy:= E{pipe}Hxy{pipe}2 = W-d f((x-y)/W for some probability density f. We assume that the law of each matrix element Hxy is symmetric and exhibits subexponential decay. We prove that the time evolution of a quantum particle subject to the Hamiltonian H is diffusive on time scales ≪ Wd/3. We also show that the localization length of the eigenvectors of H is larger than a factor Wd/6 times the band width W. All results are uniform in the size {pipe}Λ{pipe} of the matrix. This extends our recent result (Erdo{double acute}s and Knowles in Commun. Math. Phys., 2011) to general band matrices. As another consequence of our proof we show that, for a larger class of random matrices satisfying Σx σ2xy for all y, the largest eigenvalue of H is bounded with high probability by 2+M-2/3+e{open} for any e{open} &gt; 0, where M:= 1/(maxx,y σ2xy)."}],"day":"01","date_created":"2018-12-11T11:59:29Z","issue":"7","date_published":"2011-11-01T00:00:00Z","status":"public","date_updated":"2021-01-12T06:59:33Z","_id":"2766","quality_controlled":0,"extern":1,"intvolume":"        12","publisher":"Birkhäuser","publist_id":"4124","doi":"10.1007/s00023-011-0104-5","author":[{"last_name":"Erdös","first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","full_name":"László Erdös","orcid":"0000-0001-5366-9603"},{"first_name":"Antti","last_name":"Knowles","full_name":"Knowles, Antti"}],"publication_status":"published"},{"quality_controlled":0,"_id":"2799","extern":1,"intvolume":"       333","publisher":"American Association for the Advancement of Science","publist_id":"4090","doi":"10.1126/science.1203223","publication_status":"published","author":[{"full_name":"Avila, Kerstin","first_name":"Kerstin","last_name":"Avila"},{"full_name":"Moxey, David","last_name":"Moxey","first_name":"David"},{"full_name":"de Lózar, Alberto","last_name":"De Lózar","first_name":"Alberto"},{"first_name":"Marc","last_name":"Avila","full_name":"Avila, Marc"},{"full_name":"Barkley, Dwight","first_name":"Dwight","last_name":"Barkley"},{"full_name":"Björn Hof","orcid":"0000-0003-2057-2754","id":"3A374330-F248-11E8-B48F-1D18A9856A87","first_name":"Björn","last_name":"Hof"}],"citation":{"short":"K. Avila, D. Moxey, A. De Lózar, M. Avila, D. Barkley, B. Hof, Science 333 (2011) 192–196.","ieee":"K. Avila, D. Moxey, A. De Lózar, M. Avila, D. Barkley, and B. Hof, “The onset of turbulence in pipe flow,” <i>Science</i>, vol. 333, no. 6039. American Association for the Advancement of Science, pp. 192–196, 2011.","mla":"Avila, Kerstin, et al. “The Onset of Turbulence in Pipe Flow.” <i>Science</i>, vol. 333, no. 6039, American Association for the Advancement of Science, 2011, pp. 192–96, doi:<a href=\"https://doi.org/10.1126/science.1203223\">10.1126/science.1203223</a>.","ama":"Avila K, Moxey D, De Lózar A, Avila M, Barkley D, Hof B. The onset of turbulence in pipe flow. <i>Science</i>. 2011;333(6039):192-196. doi:<a href=\"https://doi.org/10.1126/science.1203223\">10.1126/science.1203223</a>","apa":"Avila, K., Moxey, D., De Lózar, A., Avila, M., Barkley, D., &#38; Hof, B. (2011). The onset of turbulence in pipe flow. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.1203223\">https://doi.org/10.1126/science.1203223</a>","chicago":"Avila, Kerstin, David Moxey, Alberto De Lózar, Marc Avila, Dwight Barkley, and Björn Hof. “The Onset of Turbulence in Pipe Flow.” <i>Science</i>. American Association for the Advancement of Science, 2011. <a href=\"https://doi.org/10.1126/science.1203223\">https://doi.org/10.1126/science.1203223</a>.","ista":"Avila K, Moxey D, De Lózar A, Avila M, Barkley D, Hof B. 2011. The onset of turbulence in pipe flow. Science. 333(6039), 192–196."},"month":"07","type":"journal_article","year":"2011","volume":333,"page":"192 - 196","title":"The onset of turbulence in pipe flow","publication":"Science","abstract":[{"text":"Shear flows undergo a sudden transition from laminar to turbulent motion as the velocity increases, and the onset of turbulence radically changes transport efficiency and mixing properties. Even for the well-studied case of pipe flow, it has not been possible to determine at what Reynolds number the motion will be either persistently turbulent or ultimately laminar. We show that in pipes, turbulence that is transient at low Reynolds numbers becomes sustained at a distinct critical point. Through extensive experiments and computer simulations, we were able to identify and characterize the processes ultimately responsible for sustaining turbulence. In contrast to the classical Landau-Ruelle-Takens view that turbulence arises from an increase in the temporal complexity of fluid motion, here, spatial proliferation of chaotic domains is the decisive process and intrinsic to the nature of fluid turbulence.","lang":"eng"}],"day":"08","issue":"6039","date_created":"2018-12-11T11:59:39Z","date_published":"2011-07-08T00:00:00Z","status":"public","date_updated":"2021-01-12T06:59:47Z"},{"citation":{"chicago":"Samanta, Devranjan, Alberto De Lózar, and Björn Hof. “Experimental Investigation of Laminar Turbulent Intermittency in Pipe Flow.” <i>Journal of Fluid Mechanics</i>. Cambridge University Press, 2011. <a href=\"https://doi.org/10.1017/jfm.2011.189\">https://doi.org/10.1017/jfm.2011.189</a>.","ista":"Samanta D, De Lózar A, Hof B. 2011. Experimental investigation of laminar turbulent intermittency in pipe flow. Journal of Fluid Mechanics. 681, 193–204.","short":"D. Samanta, A. De Lózar, B. Hof, Journal of Fluid Mechanics 681 (2011) 193–204.","mla":"Samanta, Devranjan, et al. “Experimental Investigation of Laminar Turbulent Intermittency in Pipe Flow.” <i>Journal of Fluid Mechanics</i>, vol. 681, Cambridge University Press, 2011, pp. 193–204, doi:<a href=\"https://doi.org/10.1017/jfm.2011.189\">10.1017/jfm.2011.189</a>.","ieee":"D. Samanta, A. De Lózar, and B. Hof, “Experimental investigation of laminar turbulent intermittency in pipe flow,” <i>Journal of Fluid Mechanics</i>, vol. 681. Cambridge University Press, pp. 193–204, 2011.","apa":"Samanta, D., De Lózar, A., &#38; Hof, B. (2011). Experimental investigation of laminar turbulent intermittency in pipe flow. <i>Journal of Fluid Mechanics</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/jfm.2011.189\">https://doi.org/10.1017/jfm.2011.189</a>","ama":"Samanta D, De Lózar A, Hof B. Experimental investigation of laminar turbulent intermittency in pipe flow. <i>Journal of Fluid Mechanics</i>. 2011;681:193-204. doi:<a href=\"https://doi.org/10.1017/jfm.2011.189\">10.1017/jfm.2011.189</a>"},"year":"2011","volume":681,"type":"journal_article","month":"08","day":"25","abstract":[{"lang":"eng","text":"In shear flows, turbulence first occurs in the form of localized structures (puffs/spots) surrounded by laminar fluid. We here investigate such spatially intermittent flows in a pipe experiment showing that turbulent puffs have a well-defined interaction distance, which sets their minimum spacing as well as the maximum observable turbulent fraction. Two methodologies are employed. Starting from a laminar flow, puffs are first created by locally injecting a jet of fluid through the pipe wall. When the perturbation is applied periodically at low frequencies, as expected, a regular sequence of puffs is observed where the puff spacing is given by the ratio of the mean flow speed to the perturbation frequency. At large frequencies however puffs are found to interact and annihilate each other. Varying the perturbation frequency, an interaction distance is determined which sets the highest possible turbulence fraction. This enables us to establish an upper bound for the friction factor in the transitional regime, which provides a well-defined link between the Blasius and the Hagen-Poiseuille friction laws. In the second set of experiments, the Reynolds number is reduced suddenly from fully turbulent to the intermittent regime. The resulting flow reorganizes itself to a sequence of constant size puffs which, unlike in Couette and Taylor–Couette flow are randomly spaced. The minimum distance between the turbulent patches is identical to the puff interaction length. The puff interaction length is found to be in agreement with the wavelength of regular stripe and spiral patterns in plane Couette and Taylor–Couette flow."}],"publication":"Journal of Fluid Mechanics","title":"Experimental investigation of laminar turbulent intermittency in pipe flow","page":"193 - 204","status":"public","date_updated":"2021-01-12T06:59:48Z","date_published":"2011-08-25T00:00:00Z","date_created":"2018-12-11T11:59:40Z","intvolume":"       681","extern":1,"quality_controlled":0,"_id":"2800","doi":"10.1017/jfm.2011.189","publist_id":"4089","publisher":"Cambridge University Press","publication_status":"published","author":[{"full_name":"Samanta, Devranjan","last_name":"Samanta","first_name":"Devranjan"},{"last_name":"De Lózar","first_name":"Alberto","full_name":"de Lózar, Alberto"},{"id":"3A374330-F248-11E8-B48F-1D18A9856A87","full_name":"Björn Hof","orcid":"0000-0003-2057-2754","last_name":"Hof","first_name":"Björn"}]},{"abstract":[{"text":"Turbulent puffs in pipe flow are characterized by a sharp laminar-turbulent interface at the trailing edge and a more diffused leading interface. It is known that these laminar-turbulent interfaces propagate at a speed that is approximately equal to the flow rate. Our results from direct numerical simulation show that, locally, the interface velocity relative to the fluid (i) counteracts the advection due to the laminar velocity profile so that the puff can preserve its characteristic overall shape, (ii) is very small in magnitude, but involves a large interface area so that the global propagation velocity relative to the mean flow can be large and (iii) is determined by both inertial and viscous effects. The analysis provides some new insights into the mechanisms that sustain or expand localized turbulence and might be relevant for the design of new control strategies.","lang":"eng"}],"day":"01","title":"A Lagrangian approach to the interface velocity of turbulent puffs in pipe flow","conference":{"name":"ETC13: European Turbulence Conference"},"status":"public","date_updated":"2019-04-26T07:22:20Z","issue":"5","date_created":"2018-12-11T11:59:40Z","date_published":"2011-09-01T00:00:00Z","citation":{"short":"M. Holzner, M. Avila, A. De Lózar, B. Hof, in:, IOP Publishing Ltd., 2011.","mla":"Holzner, Markus, et al. <i>A Lagrangian Approach to the Interface Velocity of Turbulent Puffs in Pipe Flow</i>. Vol. 318, no. 5, IOP Publishing Ltd., 2011, doi:<a href=\"https://doi.org/10.1088/1742-6596/318/5/052031\">10.1088/1742-6596/318/5/052031</a>.","ieee":"M. Holzner, M. Avila, A. De Lózar, and B. Hof, “A Lagrangian approach to the interface velocity of turbulent puffs in pipe flow,” presented at the ETC13: European Turbulence Conference, 2011, vol. 318, no. 5.","ama":"Holzner M, Avila M, De Lózar A, Hof B. A Lagrangian approach to the interface velocity of turbulent puffs in pipe flow. In: Vol 318. IOP Publishing Ltd.; 2011. doi:<a href=\"https://doi.org/10.1088/1742-6596/318/5/052031\">10.1088/1742-6596/318/5/052031</a>","apa":"Holzner, M., Avila, M., De Lózar, A., &#38; Hof, B. (2011). A Lagrangian approach to the interface velocity of turbulent puffs in pipe flow (Vol. 318). Presented at the ETC13: European Turbulence Conference, IOP Publishing Ltd. <a href=\"https://doi.org/10.1088/1742-6596/318/5/052031\">https://doi.org/10.1088/1742-6596/318/5/052031</a>","chicago":"Holzner, Markus, Marc Avila, Alberto De Lózar, and Björn Hof. “A Lagrangian Approach to the Interface Velocity of Turbulent Puffs in Pipe Flow,” Vol. 318. IOP Publishing Ltd., 2011. <a href=\"https://doi.org/10.1088/1742-6596/318/5/052031\">https://doi.org/10.1088/1742-6596/318/5/052031</a>.","ista":"Holzner M, Avila M, De Lózar A, Hof B. 2011. A Lagrangian approach to the interface velocity of turbulent puffs in pipe flow. ETC13: European Turbulence Conference, Journal of Physics: Conference Series, vol. 318."},"volume":318,"year":"2011","month":"09","type":"conference","publist_id":"4088","doi":"10.1088/1742-6596/318/5/052031","publisher":"IOP Publishing Ltd.","alternative_title":["Journal of Physics: Conference Series"],"author":[{"full_name":"Holzner, Markus","last_name":"Holzner","first_name":"Markus"},{"last_name":"Avila","first_name":"Marc","full_name":"Avila, Marc"},{"first_name":"Alberto","last_name":"De Lózar","full_name":"de Lózar, Alberto"},{"last_name":"Hof","first_name":"Björn","id":"3A374330-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2057-2754","full_name":"Björn Hof"}],"publication_status":"published","extern":1,"intvolume":"       318","_id":"2801","quality_controlled":0},{"citation":{"ieee":"A. Bishopp, E. Benková, and Y. Helariutta, “Sending mixed messages: Auxin-cytokinin crosstalk in roots,” <i>Current Opinion in Plant Biology</i>, vol. 14, no. 1. Elsevier, pp. 10–16, 2011.","mla":"Bishopp, Anthony, et al. “Sending Mixed Messages: Auxin-Cytokinin Crosstalk in Roots.” <i>Current Opinion in Plant Biology</i>, vol. 14, no. 1, Elsevier, 2011, pp. 10–16, doi:<a href=\"https://doi.org/10.1016/j.pbi.2010.08.014\">10.1016/j.pbi.2010.08.014</a>.","short":"A. Bishopp, E. Benková, Y. Helariutta, Current Opinion in Plant Biology 14 (2011) 10–16.","apa":"Bishopp, A., Benková, E., &#38; Helariutta, Y. (2011). Sending mixed messages: Auxin-cytokinin crosstalk in roots. <i>Current Opinion in Plant Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.pbi.2010.08.014\">https://doi.org/10.1016/j.pbi.2010.08.014</a>","ama":"Bishopp A, Benková E, Helariutta Y. Sending mixed messages: Auxin-cytokinin crosstalk in roots. <i>Current Opinion in Plant Biology</i>. 2011;14(1):10-16. doi:<a href=\"https://doi.org/10.1016/j.pbi.2010.08.014\">10.1016/j.pbi.2010.08.014</a>","chicago":"Bishopp, Anthony, Eva Benková, and Ykä Helariutta. “Sending Mixed Messages: Auxin-Cytokinin Crosstalk in Roots.” <i>Current Opinion in Plant Biology</i>. Elsevier, 2011. <a href=\"https://doi.org/10.1016/j.pbi.2010.08.014\">https://doi.org/10.1016/j.pbi.2010.08.014</a>.","ista":"Bishopp A, Benková E, Helariutta Y. 2011. Sending mixed messages: Auxin-cytokinin crosstalk in roots. Current Opinion in Plant Biology. 14(1), 10–16."},"volume":14,"year":"2011","month":"02","type":"journal_article","abstract":[{"text":"Despite their relatively simple appearance, roots are incredibly complex organs that are highly adapted to differing environments. Many aspects of root development are co-ordinated by subtle spatial differences in the concentrations of the phytohormones auxin and cytokinin. Events from the formation of a root during embryogenesis to the determination of the network of lateral roots are controlled by interactions between these hormones. Recently, interactions have been defined where auxin signaling promotes the expression of cytokinin signaling inhibitors, cytokinin signaling promotes the expression of auxin signaling inhibitors and finally where cytokinin signaling regulates the complex network of auxin transport proteins to position zones of high auxin signaling. We are witnessing a period of discovery in which we are beginning to understand how these hormonal pathways communicate to regulate root formation.","lang":"eng"}],"day":"01","page":"10 - 16","title":"Sending mixed messages: Auxin-cytokinin crosstalk in roots","publication":"Current Opinion in Plant Biology","date_updated":"2021-01-12T07:00:23Z","status":"public","issue":"1","date_created":"2018-12-11T12:00:03Z","date_published":"2011-02-01T00:00:00Z","extern":1,"intvolume":"        14","_id":"2871","quality_controlled":0,"publist_id":"3894","doi":"10.1016/j.pbi.2010.08.014","publisher":"Elsevier","publication_status":"published","author":[{"first_name":"Anthony","last_name":"Bishopp","full_name":"Bishopp, Anthony"},{"id":"38F4F166-F248-11E8-B48F-1D18A9856A87","full_name":"Eva Benková","orcid":"0000-0002-8510-9739","last_name":"Benková","first_name":"Eva"},{"last_name":"Helariutta","first_name":"Ykä","full_name":"Helariutta, Ykä"}]},{"day":"01","abstract":[{"text":"The apical hook develops in the upper part of the hypocotyl when seeds buried in the soil germinate, and serves to protect cotyledons and the shoot apical meristem from possible damage caused by pushing through the soil. The curvature is formed through differential cell growth that occurs at the two opposite sides of the hypocotyl, and it is established by a gradient of auxin activity and refined by the coordinated action of auxin and ethylene. Here we show that gibberellins (GAs) promote hook development through the transcriptional regulation of several genes of the ethylene and auxin pathways in Arabidopsis. The level of GA activity determines the speed of hook formation and the extent of the curvature during the formation phase independently of ethylene, probably by modulating auxin transport and response through HLS1, PIN3, and PIN7. Moreover, GAs cooperate with ethylene in preventing hook opening, in part through the induction of ethylene production mediated by ACS5/ETO2 and ACS8.","lang":"eng"}],"publication":"Plant Journal","title":"Hierarchy of hormone action controlling apical hook development in Arabidopsis","page":"622 - 634","date_updated":"2021-01-12T07:00:24Z","status":"public","date_published":"2011-08-01T00:00:00Z","date_created":"2018-12-11T12:00:04Z","issue":"4","citation":{"ista":"Gallego Bartolomé J, Arana M, Vandenbussche F, Žádníková P, Minguet E, Guardiola V, Van Der Straeten D, Benková E, Alabadí D, Blázquez M. 2011. Hierarchy of hormone action controlling apical hook development in Arabidopsis. Plant Journal. 67(4), 622–634.","chicago":"Gallego Bartolomé, Javier, María Arana, Filip Vandenbussche, Petra Žádníková, Eugenio Minguet, Vicente Guardiola, Dominique Van Der Straeten, Eva Benková, David Alabadí, and Miguel Blázquez. “Hierarchy of Hormone Action Controlling Apical Hook Development in Arabidopsis.” <i>Plant Journal</i>. Wiley-Blackwell, 2011. <a href=\"https://doi.org/10.1111/j.1365-313X.2011.04621.x\">https://doi.org/10.1111/j.1365-313X.2011.04621.x</a>.","ama":"Gallego Bartolomé J, Arana M, Vandenbussche F, et al. Hierarchy of hormone action controlling apical hook development in Arabidopsis. <i>Plant Journal</i>. 2011;67(4):622-634. doi:<a href=\"https://doi.org/10.1111/j.1365-313X.2011.04621.x\">10.1111/j.1365-313X.2011.04621.x</a>","apa":"Gallego Bartolomé, J., Arana, M., Vandenbussche, F., Žádníková, P., Minguet, E., Guardiola, V., … Blázquez, M. (2011). Hierarchy of hormone action controlling apical hook development in Arabidopsis. <i>Plant Journal</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1365-313X.2011.04621.x\">https://doi.org/10.1111/j.1365-313X.2011.04621.x</a>","short":"J. Gallego Bartolomé, M. Arana, F. Vandenbussche, P. Žádníková, E. Minguet, V. Guardiola, D. Van Der Straeten, E. Benková, D. Alabadí, M. Blázquez, Plant Journal 67 (2011) 622–634.","ieee":"J. Gallego Bartolomé <i>et al.</i>, “Hierarchy of hormone action controlling apical hook development in Arabidopsis,” <i>Plant Journal</i>, vol. 67, no. 4. Wiley-Blackwell, pp. 622–634, 2011.","mla":"Gallego Bartolomé, Javier, et al. “Hierarchy of Hormone Action Controlling Apical Hook Development in Arabidopsis.” <i>Plant Journal</i>, vol. 67, no. 4, Wiley-Blackwell, 2011, pp. 622–34, doi:<a href=\"https://doi.org/10.1111/j.1365-313X.2011.04621.x\">10.1111/j.1365-313X.2011.04621.x</a>."},"volume":67,"year":"2011","type":"journal_article","month":"08","doi":"10.1111/j.1365-313X.2011.04621.x","publist_id":"3891","publisher":"Wiley-Blackwell","publication_status":"published","author":[{"full_name":"Gallego-Bartolomé, Javier","last_name":"Gallego Bartolomé","first_name":"Javier"},{"last_name":"Arana","first_name":"María","full_name":"Arana, María V"},{"full_name":"Vandenbussche, Filip","first_name":"Filip","last_name":"Vandenbussche"},{"full_name":"Žádníková, Petra","first_name":"Petra","last_name":"Žádníková"},{"last_name":"Minguet","first_name":"Eugenio","full_name":"Minguet, Eugenio G"},{"full_name":"Guardiola, Vicente","first_name":"Vicente","last_name":"Guardiola"},{"full_name":"Van Der Straeten, Dominique","last_name":"Van Der Straeten","first_name":"Dominique"},{"id":"38F4F166-F248-11E8-B48F-1D18A9856A87","full_name":"Eva Benková","orcid":"0000-0002-8510-9739","last_name":"Benková","first_name":"Eva"},{"first_name":"David","last_name":"Alabadí","full_name":"Alabadí, David"},{"last_name":"Blázquez","first_name":"Miguel","full_name":"Blázquez, Miguel A"}],"intvolume":"        67","extern":1,"quality_controlled":0,"_id":"2874"},{"status":"public","date_updated":"2021-01-12T07:00:33Z","date_published":"2011-01-01T00:00:00Z","issue":"7","date_created":"2018-12-11T12:00:13Z","day":"01","title":"Redundancy and the Evolution of Cis Regulatory Element Multiplicity","publication":"PLoS Computational Biology","year":"2011","volume":6,"type":"journal_article","month":"01","citation":{"apa":"Paixao, T., &#38; Azevedo, R. (2011). Redundancy and the Evolution of Cis Regulatory Element Multiplicity. <i>PLoS Computational Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pcbi.1000848\">https://doi.org/10.1371/journal.pcbi.1000848</a>","ama":"Paixao T, Azevedo R. Redundancy and the Evolution of Cis Regulatory Element Multiplicity. <i>PLoS Computational Biology</i>. 2011;6(7). doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1000848\">10.1371/journal.pcbi.1000848</a>","mla":"Paixao, Tiago, and Ricardo Azevedo. “Redundancy and the Evolution of Cis Regulatory Element Multiplicity.” <i>PLoS Computational Biology</i>, vol. 6, no. 7, Public Library of Science, 2011, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1000848\">10.1371/journal.pcbi.1000848</a>.","ieee":"T. Paixao and R. Azevedo, “Redundancy and the Evolution of Cis Regulatory Element Multiplicity,” <i>PLoS Computational Biology</i>, vol. 6, no. 7. Public Library of Science, 2011.","short":"T. Paixao, R. Azevedo, PLoS Computational Biology 6 (2011).","ista":"Paixao T, Azevedo R. 2011. Redundancy and the Evolution of Cis Regulatory Element Multiplicity. PLoS Computational Biology. 6(7).","chicago":"Paixao, Tiago, and Ricardo Azevedo. “Redundancy and the Evolution of Cis Regulatory Element Multiplicity.” <i>PLoS Computational Biology</i>. Public Library of Science, 2011. <a href=\"https://doi.org/10.1371/journal.pcbi.1000848\">https://doi.org/10.1371/journal.pcbi.1000848</a>."},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"author":[{"orcid":"0000-0003-2361-3953","full_name":"Tiago Paixao","id":"2C5658E6-F248-11E8-B48F-1D18A9856A87","first_name":"Tiago","last_name":"Paixao"},{"full_name":"Azevedo, Ricardo B","first_name":"Ricardo","last_name":"Azevedo"}],"publication_status":"published","doi":"10.1371/journal.pcbi.1000848","publist_id":"3861","publisher":"Public Library of Science","intvolume":"         6","extern":1,"acknowledgement":"TFs regulate gene expression by binding to specific sequences in the promoter regions of their target genes. Promoters often contain multiple copies of the same TF binding sites. How does this multiplicity evolve? One possibility is that individuals with multiple, redundant binding sites have higher fitness. However, nonadaptive processes are also likely to be important. Here, we develop a mathematical model of the evolution of TF binding sites to help us disentangle how different evolutionary mechanisms contribute to the evolution of binding site redundancy and multiplicity. We show that recombination is expected to promote the evolution of multiple binding sites. This prediction is corroborated by genome-wide data from yeast. Another important factor in the evolution of multiplicity predicted in our analysis is TF promiscuity, that is, the ability of a TF to bind to multiple sequences. In addition, our analysis indicated that direct selection can have large effects on the evolution of redundancy and multiplicity. Data from yeast identified selection for changes in expression level as a candidate mechanism for the evolution of multiple binding sites. We conclude that, although selection may play a major role in the evolution of multiplicity in regulatory regions, nonadaptive forces can also lead to high levels of multiplicity.","quality_controlled":0,"_id":"2897"},{"abstract":[{"lang":"eng","text":"Sex allocation theory has been remarkably successful at explaining the prevalence of even sex ratios in natural populations and at identifying specific conditions that can result in biased sex ratios. Much of this theory focuses on parental sex determination (SD) strategies. Here, we consider instead the evolutionary causes and consequences of mixed offspring SD strategies, in which the genotype of an individual determines not its sex, but the probability of developing one of multiple sexes. We find that alleles specifying mixed offspring SD strategies can generally outcompete alleles that specify pure strategies, but generate constraints that may prevent a population from reaching an even sex ratio. We use our model to analyze sex ratios in natural populations of Tetrahymena thermophila, a ciliate with seven sexes determined by mixed SD alleles. We show that probabilistic SD is sufficient to account for the occurrence of skewed sex ratios in natural populations of T. thermophila, provided that their effective population sizes are small. Our results highlight the importance of genetic drift in sex ratio evolution and suggest that mixed offspring SD strategies should be more common than currently thought."}],"day":"01","page":"2050 - 2060","publication":"Evolution; International Journal of Organic Evolution","title":"Sex ratio evolution under probabilistic sex determination","date_updated":"2021-01-12T07:00:33Z","status":"public","date_created":"2018-12-11T12:00:13Z","issue":"7","date_published":"2011-03-01T00:00:00Z","citation":{"chicago":"Paixao, Tiago, Sujal Phadke, Ricardo Azevedo, and Rebecca Zufall. “Sex Ratio Evolution under Probabilistic Sex Determination.” <i>Evolution; International Journal of Organic Evolution</i>. Wiley-Blackwell, 2011. <a href=\"https://doi.org/10.1111/j.1558-5646.2011.01266.x\">https://doi.org/10.1111/j.1558-5646.2011.01266.x</a>.","ista":"Paixao T, Phadke S, Azevedo R, Zufall R. 2011. Sex ratio evolution under probabilistic sex determination. Evolution; International Journal of Organic Evolution. 65(7), 2050–2060.","ieee":"T. Paixao, S. Phadke, R. Azevedo, and R. Zufall, “Sex ratio evolution under probabilistic sex determination,” <i>Evolution; International Journal of Organic Evolution</i>, vol. 65, no. 7. Wiley-Blackwell, pp. 2050–2060, 2011.","mla":"Paixao, Tiago, et al. “Sex Ratio Evolution under Probabilistic Sex Determination.” <i>Evolution; International Journal of Organic Evolution</i>, vol. 65, no. 7, Wiley-Blackwell, 2011, pp. 2050–60, doi:<a href=\"https://doi.org/10.1111/j.1558-5646.2011.01266.x\">10.1111/j.1558-5646.2011.01266.x</a>.","short":"T. Paixao, S. Phadke, R. Azevedo, R. Zufall, Evolution; International Journal of Organic Evolution 65 (2011) 2050–2060.","ama":"Paixao T, Phadke S, Azevedo R, Zufall R. Sex ratio evolution under probabilistic sex determination. <i>Evolution; International Journal of Organic Evolution</i>. 2011;65(7):2050-2060. doi:<a href=\"https://doi.org/10.1111/j.1558-5646.2011.01266.x\">10.1111/j.1558-5646.2011.01266.x</a>","apa":"Paixao, T., Phadke, S., Azevedo, R., &#38; Zufall, R. (2011). Sex ratio evolution under probabilistic sex determination. <i>Evolution; International Journal of Organic Evolution</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1558-5646.2011.01266.x\">https://doi.org/10.1111/j.1558-5646.2011.01266.x</a>"},"volume":65,"year":"2011","month":"03","type":"journal_article","publist_id":"3860","doi":"10.1111/j.1558-5646.2011.01266.x","publisher":"Wiley-Blackwell","publication_status":"published","author":[{"orcid":"0000-0003-2361-3953","full_name":"Tiago Paixao","id":"2C5658E6-F248-11E8-B48F-1D18A9856A87","first_name":"Tiago","last_name":"Paixao"},{"full_name":"Phadke, Sujal S","first_name":"Sujal","last_name":"Phadke"},{"full_name":"Azevedo, Ricardo B","first_name":"Ricardo","last_name":"Azevedo"},{"full_name":"Zufall, Rebecca A","last_name":"Zufall","first_name":"Rebecca"}],"extern":1,"intvolume":"        65","_id":"2898","quality_controlled":0},{"citation":{"ama":"Vicente S, Kolmogorov V, Rother C. Graph-cut Based Image Segmentation with Connectivity Priors. In: Blake A, Kohli P, Rother C, eds. <i>Markov Random Fields for Vision and Image Processing</i>. Massachusetts Institute of Technology Press; 2011.","apa":"Vicente, S., Kolmogorov, V., &#38; Rother, C. (2011). Graph-cut Based Image Segmentation with Connectivity Priors. In A. Blake, P. Kohli, &#38; C. Rother (Eds.), <i>Markov Random Fields for Vision and Image Processing</i>. Massachusetts Institute of Technology Press.","ieee":"S. Vicente, V. Kolmogorov, and C. Rother, “Graph-cut Based Image Segmentation with Connectivity Priors,” in <i>Markov Random Fields for Vision and Image Processing</i>, A. Blake, P. Kohli, and C. Rother, Eds. Massachusetts Institute of Technology Press, 2011.","mla":"Vicente, Sara, et al. “Graph-Cut Based Image Segmentation with Connectivity Priors.” <i>Markov Random Fields for Vision and Image Processing</i>, edited by Andrew Blake et al., Massachusetts Institute of Technology Press, 2011.","short":"S. Vicente, V. Kolmogorov, C. Rother, in:, A. Blake, P. Kohli, C. Rother (Eds.), Markov Random Fields for Vision and Image Processing, Massachusetts Institute of Technology Press, 2011.","ista":"Vicente S, Kolmogorov V, Rother C. 2011.Graph-cut Based Image Segmentation with Connectivity Priors. In: Markov Random Fields for Vision and Image Processing. .","chicago":"Vicente, Sara, Vladimir Kolmogorov, and Carsten Rother. “Graph-Cut Based Image Segmentation with Connectivity Priors.” In <i>Markov Random Fields for Vision and Image Processing</i>, edited by Andrew Blake, Pushmeet Kohli, and Carsten Rother. Massachusetts Institute of Technology Press, 2011."},"type":"book_chapter","month":"01","year":"2011","publication":"Markov Random Fields for Vision and Image Processing","title":"Graph-cut Based Image Segmentation with Connectivity Priors","day":"01","editor":[{"last_name":"Blake","first_name":"Andrew","full_name":"Blake, Andrew"},{"full_name":"Kohli, Pushmeet","first_name":"Pushmeet","last_name":"Kohli"},{"full_name":"Rother, Carsten","last_name":"Rother","first_name":"Carsten"}],"date_published":"2011-01-01T00:00:00Z","date_created":"2018-12-11T12:00:21Z","date_updated":"2021-01-12T07:00:43Z","status":"public","quality_controlled":0,"_id":"2922","extern":1,"publisher":"Massachusetts Institute of Technology Press","publist_id":"3815","author":[{"full_name":"Vicente, Sara","first_name":"Sara","last_name":"Vicente"},{"first_name":"Vladimir","last_name":"Kolmogorov","full_name":"Vladimir Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Rother, Carsten","first_name":"Carsten","last_name":"Rother"}],"publication_status":"published"},{"day":"01","publication":"Markov Random Fields for Vision and Image Processing","title":"Analyzing Convex Relaxations for MAP Estimation","status":"public","date_updated":"2021-01-12T07:00:43Z","editor":[{"first_name":"Andrew","last_name":"Blake","full_name":"Blake, Andrew"},{"full_name":"Kohli, Pushmeet","first_name":"Pushmeet","last_name":"Kohli"},{"full_name":"Rother, Carsten","last_name":"Rother","first_name":"Carsten"}],"date_published":"2011-01-01T00:00:00Z","date_created":"2018-12-11T12:00:21Z","citation":{"apa":"Kumar, M. P., Kolmogorov, V., &#38; Torr, P. (2011). Analyzing Convex Relaxations for MAP Estimation. In A. Blake, P. Kohli, &#38; C. Rother (Eds.), <i>Markov Random Fields for Vision and Image Processing</i>. Massachusetts Institute of Technology Press.","ama":"Kumar MP, Kolmogorov V, Torr P. Analyzing Convex Relaxations for MAP Estimation. In: Blake A, Kohli P, Rother C, eds. <i>Markov Random Fields for Vision and Image Processing</i>. Massachusetts Institute of Technology Press; 2011.","mla":"Kumar, M. Pawan, et al. “Analyzing Convex Relaxations for MAP Estimation.” <i>Markov Random Fields for Vision and Image Processing</i>, edited by Andrew Blake et al., Massachusetts Institute of Technology Press, 2011.","ieee":"M. P. Kumar, V. Kolmogorov, and P. Torr, “Analyzing Convex Relaxations for MAP Estimation,” in <i>Markov Random Fields for Vision and Image Processing</i>, A. Blake, P. Kohli, and C. Rother, Eds. Massachusetts Institute of Technology Press, 2011.","short":"M.P. Kumar, V. Kolmogorov, P. Torr, in:, A. Blake, P. Kohli, C. Rother (Eds.), Markov Random Fields for Vision and Image Processing, Massachusetts Institute of Technology Press, 2011.","ista":"Kumar MP, Kolmogorov V, Torr P. 2011.Analyzing Convex Relaxations for MAP Estimation. In: Markov Random Fields for Vision and Image Processing. .","chicago":"Kumar, M Pawan, Vladimir Kolmogorov, and Philip Torr. “Analyzing Convex Relaxations for MAP Estimation.” In <i>Markov Random Fields for Vision and Image Processing</i>, edited by Andrew Blake, Pushmeet Kohli, and Carsten Rother. Massachusetts Institute of Technology Press, 2011."},"year":"2011","type":"book_chapter","month":"01","publist_id":"3814","publisher":"Massachusetts Institute of Technology Press","publication_status":"published","author":[{"full_name":"Kumar, M Pawan","first_name":"M Pawan","last_name":"Kumar"},{"first_name":"Vladimir","last_name":"Kolmogorov","full_name":"Vladimir Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Torr, Philip H","first_name":"Philip","last_name":"Torr"}],"extern":1,"quality_controlled":0,"_id":"2923"},{"year":"2011","type":"book_chapter","month":"01","citation":{"ista":"Criminisi A, Cross G, Blake A, Kolmogorov V. 2011.Bilayer Segmentation of Video. In: Markov Random Fields for Vision and Image Processing. .","chicago":"Criminisi, Antonio, Geoffrey Cross, Andrew Blake, and Vladimir Kolmogorov. “Bilayer Segmentation of Video.” In <i>Markov Random Fields for Vision and Image Processing</i>, edited by Andrew Blake, Pushmeet Kohli, and Carsten Rother. Massachusetts Institute of Technology Press, 2011.","apa":"Criminisi, A., Cross, G., Blake, A., &#38; Kolmogorov, V. (2011). Bilayer Segmentation of Video. In A. Blake, P. Kohli, &#38; C. Rother (Eds.), <i>Markov Random Fields for Vision and Image Processing</i>. Massachusetts Institute of Technology Press.","ama":"Criminisi A, Cross G, Blake A, Kolmogorov V. Bilayer Segmentation of Video. In: Blake A, Kohli P, Rother C, eds. <i>Markov Random Fields for Vision and Image Processing</i>. Massachusetts Institute of Technology Press; 2011.","short":"A. Criminisi, G. Cross, A. Blake, V. Kolmogorov, in:, A. Blake, P. Kohli, C. Rother (Eds.), Markov Random Fields for Vision and Image Processing, Massachusetts Institute of Technology Press, 2011.","mla":"Criminisi, Antonio, et al. “Bilayer Segmentation of Video.” <i>Markov Random Fields for Vision and Image Processing</i>, edited by Andrew Blake et al., Massachusetts Institute of Technology Press, 2011.","ieee":"A. Criminisi, G. Cross, A. Blake, and V. Kolmogorov, “Bilayer Segmentation of Video,” in <i>Markov Random Fields for Vision and Image Processing</i>, A. Blake, P. Kohli, and C. Rother, Eds. Massachusetts Institute of Technology Press, 2011."},"date_updated":"2021-01-12T07:00:43Z","status":"public","date_published":"2011-01-01T00:00:00Z","editor":[{"first_name":"Andrew","last_name":"Blake","full_name":"Blake, Andrew"},{"first_name":"Pushmeet","last_name":"Kohli","full_name":"Kohli, Pushmeet"},{"full_name":"Rother, Carsten","last_name":"Rother","first_name":"Carsten"}],"date_created":"2018-12-11T12:00:22Z","day":"01","publication":"Markov Random Fields for Vision and Image Processing","title":"Bilayer Segmentation of Video","extern":1,"_id":"2924","quality_controlled":0,"author":[{"full_name":"Criminisi, Antonio","first_name":"Antonio","last_name":"Criminisi"},{"last_name":"Cross","first_name":"Geoffrey","full_name":"Cross, Geoffrey"},{"first_name":"Andrew","last_name":"Blake","full_name":"Blake, Andrew"},{"last_name":"Kolmogorov","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Vladimir Kolmogorov"}],"publication_status":"published","publist_id":"3813","publisher":"Massachusetts Institute of Technology Press"},{"author":[{"last_name":"Rother","first_name":"Carsten","full_name":"Rother, Carsten"},{"first_name":"Vladimir","last_name":"Kolmogorov","full_name":"Vladimir Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Boykov","first_name":"Yuri","full_name":"Boykov, Yuri"},{"full_name":"Blake, Andrew","first_name":"Andrew","last_name":"Blake"}],"publication_status":"published","publist_id":"3812","publisher":"Massachusetts Institute of Technology Press","extern":1,"quality_controlled":0,"_id":"2925","status":"public","date_updated":"2021-01-12T07:00:44Z","date_created":"2018-12-11T12:00:22Z","editor":[{"first_name":"Andrew","last_name":"Blake","full_name":"Blake, Andrew"},{"full_name":"Kohli, Pushmeet","first_name":"Pushmeet","last_name":"Kohli"},{"full_name":"Rother, Carsten","first_name":"Carsten","last_name":"Rother"}],"date_published":"2011-01-01T00:00:00Z","day":"01","title":"Interactive Foreground Extraction using graph cut","publication":"Markov Random Fields for Vision and Image Processing","year":"2011","month":"01","type":"book_chapter","citation":{"mla":"Rother, Carsten, et al. “Interactive Foreground Extraction Using Graph Cut.” <i>Markov Random Fields for Vision and Image Processing</i>, edited by Andrew Blake et al., Massachusetts Institute of Technology Press, 2011.","ieee":"C. Rother, V. Kolmogorov, Y. Boykov, and A. Blake, “Interactive Foreground Extraction using graph cut,” in <i>Markov Random Fields for Vision and Image Processing</i>, A. Blake, P. Kohli, and C. Rother, Eds. Massachusetts Institute of Technology Press, 2011.","short":"C. Rother, V. Kolmogorov, Y. Boykov, A. Blake, in:, A. Blake, P. Kohli, C. Rother (Eds.), Markov Random Fields for Vision and Image Processing, Massachusetts Institute of Technology Press, 2011.","apa":"Rother, C., Kolmogorov, V., Boykov, Y., &#38; Blake, A. (2011). Interactive Foreground Extraction using graph cut. In A. Blake, P. Kohli, &#38; C. Rother (Eds.), <i>Markov Random Fields for Vision and Image Processing</i>. Massachusetts Institute of Technology Press.","ama":"Rother C, Kolmogorov V, Boykov Y, Blake A. Interactive Foreground Extraction using graph cut. In: Blake A, Kohli P, Rother C, eds. <i>Markov Random Fields for Vision and Image Processing</i>. Massachusetts Institute of Technology Press; 2011.","chicago":"Rother, Carsten, Vladimir Kolmogorov, Yuri Boykov, and Andrew Blake. “Interactive Foreground Extraction Using Graph Cut.” In <i>Markov Random Fields for Vision and Image Processing</i>, edited by Andrew Blake, Pushmeet Kohli, and Carsten Rother. Massachusetts Institute of Technology Press, 2011.","ista":"Rother C, Kolmogorov V, Boykov Y, Blake A. 2011.Interactive Foreground Extraction using graph cut. In: Markov Random Fields for Vision and Image Processing. ."}},{"citation":{"short":"Y. Boykov, V. Kolmogorov, in:, A. Blake, P. Kohli, C. Rother (Eds.), Markov Random Fields for Vision and Image Processing, Massachusetts Institute of Technology Press, 2011, pp. 31–50.","mla":"Boykov, Yuri, and Vladimir Kolmogorov. “Basic Graph Cut Algorithms.” <i>Markov Random Fields for Vision and Image Processing</i>, edited by Andrew Blake et al., Massachusetts Institute of Technology Press, 2011, pp. 31–50.","ieee":"Y. Boykov and V. Kolmogorov, “Basic graph cut algorithms,” in <i>Markov Random Fields for Vision and Image Processing</i>, A. Blake, P. Kohli, and C. Rother, Eds. Massachusetts Institute of Technology Press, 2011, pp. 31–50.","ama":"Boykov Y, Kolmogorov V. Basic graph cut algorithms. In: Blake A, Kohli P, Rother C, eds. <i>Markov Random Fields for Vision and Image Processing</i>. Massachusetts Institute of Technology Press; 2011:31-50.","apa":"Boykov, Y., &#38; Kolmogorov, V. (2011). Basic graph cut algorithms. In A. Blake, P. Kohli, &#38; C. Rother (Eds.), <i>Markov Random Fields for Vision and Image Processing</i> (pp. 31–50). Massachusetts Institute of Technology Press.","chicago":"Boykov, Yuri, and Vladimir Kolmogorov. “Basic Graph Cut Algorithms.” In <i>Markov Random Fields for Vision and Image Processing</i>, edited by Andrew Blake, Pushmeet Kohli, and Carsten Rother, 31–50. Massachusetts Institute of Technology Press, 2011.","ista":"Boykov Y, Kolmogorov V. 2011.Basic graph cut algorithms. In: Markov Random Fields for Vision and Image Processing. , 31–50."},"month":"07","type":"book_chapter","year":"2011","page":"31 - 50","title":"Basic graph cut algorithms","publication":"Markov Random Fields for Vision and Image Processing","day":"22","date_created":"2018-12-11T12:00:26Z","date_published":"2011-07-22T00:00:00Z","editor":[{"first_name":"Andrew","last_name":"Blake","full_name":"Blake, Andrew"},{"full_name":"Kohli, Pushmeet","last_name":"Kohli","first_name":"Pushmeet"},{"full_name":"Rother, Carsten","last_name":"Rother","first_name":"Carsten"}],"date_updated":"2021-01-12T07:39:53Z","status":"public","quality_controlled":0,"_id":"2935","extern":1,"publisher":"Massachusetts Institute of Technology Press","publist_id":"3801","author":[{"last_name":"Boykov","first_name":"Yuri","full_name":"Boykov, Yuri"},{"full_name":"Vladimir Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","last_name":"Kolmogorov"}],"publication_status":"published"},{"month":"01","type":"conference","year":"2011","citation":{"chicago":"Fienberg, Stephen, Aleksandra Slavkovic, and Caroline Uhler. “Privacy Preserving GWAS Data Sharing.” IEEE, 2011. <a href=\"https://doi.org/10.1109/ICDMW.2011.140\">https://doi.org/10.1109/ICDMW.2011.140</a>.","ista":"Fienberg S, Slavkovic A, Uhler C. 2011. Privacy Preserving GWAS Data Sharing. Proceedings of the 11th IEEE International Conference on Data Mining.","mla":"Fienberg, Stephen, et al. <i>Privacy Preserving GWAS Data Sharing</i>. IEEE, 2011, doi:<a href=\"https://doi.org/10.1109/ICDMW.2011.140\">10.1109/ICDMW.2011.140</a>.","ieee":"S. Fienberg, A. Slavkovic, and C. Uhler, “Privacy Preserving GWAS Data Sharing,” presented at the Proceedings of the 11th IEEE International Conference on Data Mining, 2011.","short":"S. Fienberg, A. Slavkovic, C. Uhler, in:, IEEE, 2011.","apa":"Fienberg, S., Slavkovic, A., &#38; Uhler, C. (2011). Privacy Preserving GWAS Data Sharing. Presented at the Proceedings of the 11th IEEE International Conference on Data Mining, IEEE. <a href=\"https://doi.org/10.1109/ICDMW.2011.140\">https://doi.org/10.1109/ICDMW.2011.140</a>","ama":"Fienberg S, Slavkovic A, Uhler C. Privacy Preserving GWAS Data Sharing. In: IEEE; 2011. doi:<a href=\"https://doi.org/10.1109/ICDMW.2011.140\">10.1109/ICDMW.2011.140</a>"},"date_created":"2018-12-11T12:00:34Z","date_published":"2011-01-01T00:00:00Z","status":"public","date_updated":"2021-01-12T07:40:05Z","title":"Privacy Preserving GWAS Data Sharing","conference":{"name":"Proceedings of the 11th IEEE International Conference on Data Mining"},"abstract":[{"text":"Traditional statistical methods for the confidentiality protection for statistical databases do not scale well to deal with GWAS (genome-wide association studies) databases and external information on them. The more recent concept of differential privacy, introduced by the cryptographic community, is an approach which provides a rigorous definition of privacy with meaningful privacy guarantees in the presence of arbitrary external information. Building on such notions, we propose new methods to release aggregate GWAS data without compromising an individual's privacy. We present methods for releasing differentially private minor allele frequencies, chi-square statistics and p-values. We compare these approaches on simulated data and on a GWAS study of canine hair length involving 685 dogs. We also propose a privacy-preserving method for finding genome-wide associations based on a differentially private approach to penalized logistic regression.","lang":"eng"}],"day":"01","quality_controlled":0,"_id":"2960","extern":1,"author":[{"first_name":"Stephen","last_name":"Fienberg","full_name":"Fienberg, Stephen E"},{"full_name":"Slavkovic, Aleksandra","first_name":"Aleksandra","last_name":"Slavkovic"},{"id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","full_name":"Caroline Uhler","orcid":"0000-0002-7008-0216","last_name":"Uhler","first_name":"Caroline"}],"publication_status":"published","publisher":"IEEE","publist_id":"3766","doi":"10.1109/ICDMW.2011.140"},{"publisher":"Public Knowledge Project","publist_id":"3764","doi":"http://dx.doi.org/10.18409/jas.v2i1.27","publication_status":"published","oa":1,"author":[{"last_name":"Malaspinas","first_name":"Anna","full_name":"Malaspinas, Anna-Sapfo "},{"last_name":"Uhler","first_name":"Caroline","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","full_name":"Caroline Uhler","orcid":"0000-0002-7008-0216"}],"quality_controlled":0,"_id":"2961","acknowledgement":"Anna-Sapfo Malaspinas is supported by a Janggen-Poehn Fellowship. Caroline Uhler is supported by an International Fulbright Science and Technology Fellowship.","extern":1,"intvolume":"         2","page":"36 - 53","publication":"Journal of Algebraic Statistics","title":"Detecting epistasis via Markov bases","abstract":[{"lang":"eng","text":"Rapid research progress in genotyping techniques have allowed large genome-wide association studies. Existing methods often focus on determining associations between single loci and a specic phenotype. However, a particular phenotype is usually the result of complex relationships between multiple loci and the environment. In this paper, we describe a two-stage method for detecting epistasis by combining the traditionally used single-locus search with a search for multiway interactions. Our method is based on an extended version of Fisher's exact test. To\nperform this test, a Markov chain is constructed on the space of multidimensional contingency tables using the elements of a Markov basis as moves. We test our method on simulated data and compare it to a two-stage logistic regression method and to a fully Bayesian method, showing that we are able to detect the interacting loci when other methods fail to do so. Finally, we apply our method to a genome-wide data set consisting of 685 dogs and identify epistasis associated with canine hair length for four pairs of single nucleotide polymorphisms (SNPs)."}],"day":"01","date_created":"2018-12-11T12:00:34Z","issue":"1","main_file_link":[{"url":"http://arxiv.org/abs/1006.4929","open_access":"1"}],"date_published":"2011-01-01T00:00:00Z","status":"public","date_updated":"2021-01-12T07:40:05Z","citation":{"chicago":"Malaspinas, Anna, and Caroline Uhler. “Detecting Epistasis via Markov Bases.” <i>Journal of Algebraic Statistics</i>. Public Knowledge Project, 2011. <a href=\"http://dx.doi.org/10.18409/jas.v2i1.27\">http://dx.doi.org/10.18409/jas.v2i1.27</a>.","ista":"Malaspinas A, Uhler C. 2011. Detecting epistasis via Markov bases. Journal of Algebraic Statistics. 2(1), 36–53.","short":"A. Malaspinas, C. Uhler, Journal of Algebraic Statistics 2 (2011) 36–53.","ieee":"A. Malaspinas and C. Uhler, “Detecting epistasis via Markov bases,” <i>Journal of Algebraic Statistics</i>, vol. 2, no. 1. Public Knowledge Project, pp. 36–53, 2011.","mla":"Malaspinas, Anna, and Caroline Uhler. “Detecting Epistasis via Markov Bases.” <i>Journal of Algebraic Statistics</i>, vol. 2, no. 1, Public Knowledge Project, 2011, pp. 36–53, doi:<a href=\"http://dx.doi.org/10.18409/jas.v2i1.27\">http://dx.doi.org/10.18409/jas.v2i1.27</a>.","apa":"Malaspinas, A., &#38; Uhler, C. (2011). Detecting epistasis via Markov bases. <i>Journal of Algebraic Statistics</i>. Public Knowledge Project. <a href=\"http://dx.doi.org/10.18409/jas.v2i1.27\">http://dx.doi.org/10.18409/jas.v2i1.27</a>","ama":"Malaspinas A, Uhler C. Detecting epistasis via Markov bases. <i>Journal of Algebraic Statistics</i>. 2011;2(1):36-53. doi:<a href=\"http://dx.doi.org/10.18409/jas.v2i1.27\">http://dx.doi.org/10.18409/jas.v2i1.27</a>"},"month":"01","type":"journal_article","year":"2011","volume":2},{"_id":"2975","quality_controlled":0,"acknowledgement":"This work was in part funded by the Swiss Hasler Foundation, and the EU FP7 grants 216483 and 216499, as well as by the NSF grant CNS-0716690.","extern":1,"intvolume":"      7073","author":[{"full_name":"Camenisch, Jan","first_name":"Jan","last_name":"Camenisch"},{"first_name":"Stephan","last_name":"Krenn","orcid":"0000-0003-2835-9093","full_name":"Stephan Krenn","id":"329FCCF0-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Shoup","first_name":"Victor","full_name":"Shoup, Victor"}],"publication_status":"published","publisher":"Springer","alternative_title":["LNCS"],"publist_id":"3728","doi":"10.1007/978-3-642-25385-0","month":"11","type":"conference","volume":7073,"year":"2011","citation":{"ama":"Camenisch J, Krenn S, Shoup V. A Framework for Practical Universally Composable Zero-Knowledge Protocols. In: Lee D, Wang X, eds. Vol 7073. Springer; 2011:449-467. doi:<a href=\"https://doi.org/10.1007/978-3-642-25385-0\">10.1007/978-3-642-25385-0</a>","apa":"Camenisch, J., Krenn, S., &#38; Shoup, V. (2011). A Framework for Practical Universally Composable Zero-Knowledge Protocols. In D. Lee &#38; X. Wang (Eds.) (Vol. 7073, pp. 449–467). Presented at the ASIACRYPT: Theory and Application of Cryptology and Information Security, Springer. <a href=\"https://doi.org/10.1007/978-3-642-25385-0\">https://doi.org/10.1007/978-3-642-25385-0</a>","ieee":"J. Camenisch, S. Krenn, and V. Shoup, “A Framework for Practical Universally Composable Zero-Knowledge Protocols,” presented at the ASIACRYPT: Theory and Application of Cryptology and Information Security, 2011, vol. 7073, pp. 449–467.","mla":"Camenisch, Jan, et al. <i>A Framework for Practical Universally Composable Zero-Knowledge Protocols</i>. Edited by Dong Lee and Xiaoyun Wang, vol. 7073, Springer, 2011, pp. 449–67, doi:<a href=\"https://doi.org/10.1007/978-3-642-25385-0\">10.1007/978-3-642-25385-0</a>.","short":"J. Camenisch, S. Krenn, V. Shoup, in:, D. Lee, X. Wang (Eds.), Springer, 2011, pp. 449–467.","ista":"Camenisch J, Krenn S, Shoup V. 2011. A Framework for Practical Universally Composable Zero-Knowledge Protocols. ASIACRYPT: Theory and Application of Cryptology and Information Security, LNCS, vol. 7073, 449–467.","chicago":"Camenisch, Jan, Stephan Krenn, and Victor Shoup. “A Framework for Practical Universally Composable Zero-Knowledge Protocols.” edited by Dong Lee and Xiaoyun Wang, 7073:449–67. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-25385-0\">https://doi.org/10.1007/978-3-642-25385-0</a>."},"date_created":"2018-12-11T12:00:39Z","date_published":"2011-11-21T00:00:00Z","main_file_link":[{"open_access":"0","url":"http://eprint.iacr.org/2011/228.pdf"}],"editor":[{"first_name":"Dong","last_name":"Lee","full_name":"Lee, Dong Hoon"},{"first_name":"Xiaoyun","last_name":"Wang","full_name":"Wang, Xiaoyun"}],"date_updated":"2021-01-12T07:40:11Z","status":"public","page":"449 - 467","conference":{"name":"ASIACRYPT: Theory and Application of Cryptology and Information Security"},"title":"A Framework for Practical Universally Composable Zero-Knowledge Protocols","abstract":[{"text":"Zero-knowledge proofs of knowledge (ZK-PoK) for discrete logarithms and related problems are indispensable for practical cryptographic protocols. Recently, Camenisch, Kiayias, and Yung provided a specification language (the CKY-language) for such protocols which allows for a modular design and protocol analysis: for every zero-knowledge proof specified in this language, protocol designers are ensured that there exists an efficient protocol which indeed proves the specified statement.\n\nHowever, the protocols resulting from their compilation techniques only satisfy the classical notion of ZK-PoK, which is not retained are when they used as building blocks for higher-level applications or composed with other protocols.\nThis problem can be tackled by moving to the Universal Composability (UC) framework, which guarantees retention of security when composing protocols in arbitrary ways.  \nWhile there exist generic transformations from $\\Sigma$-protocols to UC-secure protocols, these transformation are often too inefficient for practice.\n \nIn this paper we introduce a specification language akin to the CKY-language and a compiler such that the resulting protocols are UC-secure and efficient. \nTo this end, we propose an extension of the UC-framework addressing the \nissue that UC-secure zero-knowledge proofs are by definition proofs of knowledge, and state a special composition theorem which allows one to use the weaker -- but more efficient and often sufficient -- notion of proofs of membership in the UC-framework.  \nWe believe that our contributions enable the design of practically efficient protocols that are UC-secure and thus themselves can be used as building blocks.","lang":"eng"}],"day":"21"},{"extern":1,"acknowledgement":"This work was in part funded by the European Community’s Seventh Framework Programme (FP7) under grant agreement no. 216499 and the Swiss Hasler Foundation.\nAn extended abstract was also accepted for COSADE 2011.","_id":"2976","quality_controlled":0,"doi":"10.1109/SP.2011.22","publist_id":"3727","publisher":"IEEE","publication_status":"published","author":[{"full_name":"Gullasch, David","first_name":"David","last_name":"Gullasch"},{"first_name":"Endre","last_name":"Bangerter","full_name":"Bangerter, Endre"},{"first_name":"Stephan","last_name":"Krenn","full_name":"Stephan Krenn","orcid":"0000-0003-2835-9093","id":"329FCCF0-F248-11E8-B48F-1D18A9856A87"}],"citation":{"chicago":"Gullasch, David, Endre Bangerter, and Stephan Krenn. “Cache Games - Bringing Access-Based Cache Attacks on AES to Practice,” 490–505. IEEE, 2011. <a href=\"https://doi.org/10.1109/SP.2011.22\">https://doi.org/10.1109/SP.2011.22</a>.","ista":"Gullasch D, Bangerter E, Krenn S. 2011. Cache Games - Bringing Access-Based Cache Attacks on AES to Practice. S&#38;P: IEEE Symposium on Security and Privacy, 490–505.","mla":"Gullasch, David, et al. <i>Cache Games - Bringing Access-Based Cache Attacks on AES to Practice</i>. IEEE, 2011, pp. 490–505, doi:<a href=\"https://doi.org/10.1109/SP.2011.22\">10.1109/SP.2011.22</a>.","ieee":"D. Gullasch, E. Bangerter, and S. Krenn, “Cache Games - Bringing Access-Based Cache Attacks on AES to Practice,” presented at the S&#38;P: IEEE Symposium on Security and Privacy, 2011, pp. 490–505.","short":"D. Gullasch, E. Bangerter, S. Krenn, in:, IEEE, 2011, pp. 490–505.","ama":"Gullasch D, Bangerter E, Krenn S. Cache Games - Bringing Access-Based Cache Attacks on AES to Practice. In: IEEE; 2011:490-505. doi:<a href=\"https://doi.org/10.1109/SP.2011.22\">10.1109/SP.2011.22</a>","apa":"Gullasch, D., Bangerter, E., &#38; Krenn, S. (2011). Cache Games - Bringing Access-Based Cache Attacks on AES to Practice (pp. 490–505). Presented at the S&#38;P: IEEE Symposium on Security and Privacy, IEEE. <a href=\"https://doi.org/10.1109/SP.2011.22\">https://doi.org/10.1109/SP.2011.22</a>"},"year":"2011","type":"conference","month":"01","day":"01","abstract":[{"text":"Side channel attacks on cryptographic systems exploit information\ngained from physical implementations rather than theoretical\nweaknesses of a scheme. In recent years, major achievements were made\nfor the class of so called access-driven cache attacks. Such attacks\nexploit the leakage of the memory locations accessed by a victim\nprocess.\n\nIn this paper we consider the AES block cipher and present an attack\nwhich is capable of recovering the full secret key in almost realtime\nfor AES-128, requiring only a very limited number of observed\nencryptions. Unlike previous attacks, we do not require any\ninformation about the plaintext (such as its distribution, etc.).\nMoreover, for the first time, we also show how the plaintext can be\nrecovered without having access to the ciphertext at all.  It is the\nfirst working attack on AES implementations using compressed\ntables. There, no efficient techniques to identify the beginning\nof AES rounds is known, which is the fundamental assumption underlying previous\nattacks.\n\nWe have a fully working implementation of our attack which is able to\nrecover AES keys after observing as little as 100 encryptions. It\nworks against the OpenSSL 0.9.8n implementation of AES on Linux\nsystems.  Our spy process does not require any special privileges\nbeyond those of a standard Linux user. A contribution of probably\nindependent interest is a denial of service attack on the task scheduler of\ncurrent Linux systems (CFS), which allows one to observe (on average)\nevery single memory access of a victim process.","lang":"eng"}],"conference":{"name":"S&P: IEEE Symposium on Security and Privacy"},"title":"Cache Games - Bringing Access-Based Cache Attacks on AES to Practice","page":"490 - 505","date_updated":"2021-01-12T07:40:11Z","status":"public","main_file_link":[{"open_access":"0","url":"http://eprint.iacr.org/2010/594.pdf"}],"date_published":"2011-01-01T00:00:00Z","date_created":"2018-12-11T12:00:39Z"},{"citation":{"apa":"Bangerter, E., Krenn, S., Seifriz, M., &#38; Ultes Nitsche, U. (2011). cPLC - A Cryptographic Programming Language and Compiler. In H. Venter, M. Coetzee, &#38; M. Loock (Eds.). Presented at the ISSA: Information Security South Africa, IEEE. <a href=\"https://doi.org/10.1109/ISSA.2011.6027533\">https://doi.org/10.1109/ISSA.2011.6027533</a>","ama":"Bangerter E, Krenn S, Seifriz M, Ultes Nitsche U. cPLC - A Cryptographic Programming Language and Compiler. In: Venter H, Coetzee M, Loock M, eds. IEEE; 2011. doi:<a href=\"https://doi.org/10.1109/ISSA.2011.6027533\">10.1109/ISSA.2011.6027533</a>","mla":"Bangerter, Endre, et al. <i>CPLC - A Cryptographic Programming Language and Compiler</i>. Edited by Hein Venter et al., IEEE, 2011, doi:<a href=\"https://doi.org/10.1109/ISSA.2011.6027533\">10.1109/ISSA.2011.6027533</a>.","ieee":"E. Bangerter, S. Krenn, M. Seifriz, and U. Ultes Nitsche, “cPLC - A Cryptographic Programming Language and Compiler,” presented at the ISSA: Information Security South Africa, 2011.","short":"E. Bangerter, S. Krenn, M. Seifriz, U. Ultes Nitsche, in:, H. Venter, M. Coetzee, M. Loock (Eds.), IEEE, 2011.","ista":"Bangerter E, Krenn S, Seifriz M, Ultes Nitsche U. 2011. cPLC - A Cryptographic Programming Language and Compiler. ISSA: Information Security South Africa.","chicago":"Bangerter, Endre, Stephan Krenn, Martial Seifriz, and Ulrich Ultes Nitsche. “CPLC - A Cryptographic Programming Language and Compiler.” edited by Hein Venter, Marijke Coetzee, and Marianne Loock. IEEE, 2011. <a href=\"https://doi.org/10.1109/ISSA.2011.6027533\">https://doi.org/10.1109/ISSA.2011.6027533</a>."},"year":"2011","month":"08","type":"conference","abstract":[{"text":"Cryptographic two-party protocols are used ubiquitously in\n    everyday life. While some of these protocols are easy to\n    understand and implement (e.g., key exchange or transmission of\n    encrypted data), many of them are much more complex (e.g.,\n    e-banking and e-voting applications, or anonymous authentication\n    and credential systems).\n\n    For a software engineer without appropriate cryptographic skills\n    the implementation of such protocols is often difficult, time\n    consuming and error-prone. For this reason, a number of compilers\n    supporting programmers have been published in recent\n    years. However, they are either designed for very specific\n    cryptographic primitives (e.g., zero-knowledge proofs of\n    knowledge), or they only offer a very low level of abstraction and\n    thus again demand substantial mathematical and cryptographic\n    skills from the programmer. Finally, some of the existing\n    compilers do not produce executable code, but only metacode which\n    has to be instantiated with mathematical libraries, encryption\n    routines, etc. before it can actually be used.\n  \n    In this paper we present a cryptographically aware compiler which\n    is equally useful to cryptographers who want to benchmark\n    protocols designed on paper, and to programmers who want to\n    implement complex security sensitive protocols without having to\n    understand all subtleties. Our tool offers a high level of\n    abstraction and outputs well-structured and documented Java\n    code. We believe that our compiler can contribute to shortening\n    the development cycles of cryptographic applications and to\n    reducing their error-proneness.","lang":"eng"}],"day":"01","title":"cPLC - A Cryptographic Programming Language and Compiler","conference":{"name":"ISSA: Information Security South Africa"},"status":"public","date_updated":"2021-01-12T07:40:12Z","date_created":"2018-12-11T12:00:39Z","editor":[{"full_name":"Venter, Hein S.","first_name":"Hein","last_name":"Venter"},{"first_name":"Marijke","last_name":"Coetzee","full_name":"Coetzee, Marijke"},{"first_name":"Marianne","last_name":"Loock","full_name":"Loock, Marianne"}],"date_published":"2011-08-01T00:00:00Z","extern":1,"_id":"2977","quality_controlled":0,"acknowledgement":"This work was in part funded by the European Community’s Seventh Framework Programme (FP7) under grant agreement no. 216499 and the Swiss Hasler Foundation under projects no. 09037 and 10069.","publist_id":"3726","doi":"10.1109/ISSA.2011.6027533","publisher":"IEEE","publication_status":"published","author":[{"full_name":"Bangerter, Endre","first_name":"Endre","last_name":"Bangerter"},{"orcid":"0000-0003-2835-9093","full_name":"Stephan Krenn","id":"329FCCF0-F248-11E8-B48F-1D18A9856A87","first_name":"Stephan","last_name":"Krenn"},{"full_name":"Seifriz, Martial","first_name":"Martial","last_name":"Seifriz"},{"first_name":"Ulrich","last_name":"Ultes Nitsche","full_name":"Ultes-Nitsche, Ulrich"}]},{"publisher":"Wiley-Blackwell","publist_id":"3619","doi":"10.1111/j.1365-313X.2010.04443.x","author":[{"last_name":"Balla","first_name":"Jozef","full_name":"Balla, Jozef"},{"full_name":"Kalousek, Petr","first_name":"Petr","last_name":"Kalousek"},{"first_name":"Vilém","last_name":"Reinöhl","full_name":"Reinöhl, Vilém"},{"full_name":"Jirí Friml","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí","last_name":"Friml"},{"first_name":"Stanislav","last_name":"Procházka","full_name":"Procházka, Stanislav"}],"publication_status":"published","_id":"3082","quality_controlled":0,"extern":1,"intvolume":"        65","page":"571 - 577","title":"Competitive canalization of PIN dependent auxin flow from axillary buds controls pea bud outgrowth","publication":"Plant Journal","abstract":[{"lang":"eng","text":"Shoot branching is one of the major determinants of plant architecture. Polar auxin transport in stems is necessary for the control of bud outgrowth by a dominant apex. Here, we show that following decapitation in pea (Pisum sativum L.), the axillary buds establish directional auxin export by subcellular polarization of PIN auxin transporters. Apical auxin application on the decapitated stem prevents this PIN polarization and canalization of laterally applied auxin. These results support a model in which the apical and lateral auxin sources compete for primary channels of auxin transport in the stem to control the outgrowth of axillary buds."}],"day":"01","issue":"4","date_created":"2018-12-11T12:01:16Z","date_published":"2011-02-01T00:00:00Z","status":"public","date_updated":"2021-01-12T07:40:56Z","citation":{"chicago":"Balla, Jozef, Petr Kalousek, Vilém Reinöhl, Jiří Friml, and Stanislav Procházka. “Competitive Canalization of PIN Dependent Auxin Flow from Axillary Buds Controls Pea Bud Outgrowth.” <i>Plant Journal</i>. Wiley-Blackwell, 2011. <a href=\"https://doi.org/10.1111/j.1365-313X.2010.04443.x\">https://doi.org/10.1111/j.1365-313X.2010.04443.x</a>.","ista":"Balla J, Kalousek P, Reinöhl V, Friml J, Procházka S. 2011. Competitive canalization of PIN dependent auxin flow from axillary buds controls pea bud outgrowth. Plant Journal. 65(4), 571–577.","short":"J. Balla, P. Kalousek, V. Reinöhl, J. Friml, S. Procházka, Plant Journal 65 (2011) 571–577.","mla":"Balla, Jozef, et al. “Competitive Canalization of PIN Dependent Auxin Flow from Axillary Buds Controls Pea Bud Outgrowth.” <i>Plant Journal</i>, vol. 65, no. 4, Wiley-Blackwell, 2011, pp. 571–77, doi:<a href=\"https://doi.org/10.1111/j.1365-313X.2010.04443.x\">10.1111/j.1365-313X.2010.04443.x</a>.","ieee":"J. Balla, P. Kalousek, V. Reinöhl, J. Friml, and S. Procházka, “Competitive canalization of PIN dependent auxin flow from axillary buds controls pea bud outgrowth,” <i>Plant Journal</i>, vol. 65, no. 4. Wiley-Blackwell, pp. 571–577, 2011.","ama":"Balla J, Kalousek P, Reinöhl V, Friml J, Procházka S. Competitive canalization of PIN dependent auxin flow from axillary buds controls pea bud outgrowth. <i>Plant Journal</i>. 2011;65(4):571-577. doi:<a href=\"https://doi.org/10.1111/j.1365-313X.2010.04443.x\">10.1111/j.1365-313X.2010.04443.x</a>","apa":"Balla, J., Kalousek, P., Reinöhl, V., Friml, J., &#38; Procházka, S. (2011). Competitive canalization of PIN dependent auxin flow from axillary buds controls pea bud outgrowth. <i>Plant Journal</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1365-313X.2010.04443.x\">https://doi.org/10.1111/j.1365-313X.2010.04443.x</a>"},"month":"02","type":"journal_article","year":"2011","volume":65},{"publication_status":"published","author":[{"last_name":"Robinson","first_name":"David","full_name":"Robinson, David G"},{"last_name":"Scheuring","first_name":"David","full_name":"Scheuring, David"},{"last_name":"Naramoto","first_name":"Satoshi","full_name":"Naramoto, Satoshi"},{"first_name":"Jirí","last_name":"Friml","full_name":"Jirí Friml","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"3617","doi":"10.1105/tpc.110.082099","publisher":"American Society of Plant Biologists","extern":1,"intvolume":"        23","quality_controlled":0,"_id":"3083","date_updated":"2021-01-12T07:40:56Z","status":"public","date_created":"2018-12-11T12:01:16Z","issue":"3","date_published":"2011-03-01T00:00:00Z","day":"01","page":"846 - 849","publication":"Plant Cell","title":"ARF1 localizes to the golgi and the trans Golgi network","volume":23,"year":"2011","month":"03","type":"journal_article","citation":{"ama":"Robinson D, Scheuring D, Naramoto S, Friml J. ARF1 localizes to the golgi and the trans Golgi network. <i>Plant Cell</i>. 2011;23(3):846-849. doi:<a href=\"https://doi.org/10.1105/tpc.110.082099\">10.1105/tpc.110.082099</a>","apa":"Robinson, D., Scheuring, D., Naramoto, S., &#38; Friml, J. (2011). ARF1 localizes to the golgi and the trans Golgi network. <i>Plant Cell</i>. American Society of Plant Biologists. <a href=\"https://doi.org/10.1105/tpc.110.082099\">https://doi.org/10.1105/tpc.110.082099</a>","ieee":"D. Robinson, D. Scheuring, S. Naramoto, and J. Friml, “ARF1 localizes to the golgi and the trans Golgi network,” <i>Plant Cell</i>, vol. 23, no. 3. American Society of Plant Biologists, pp. 846–849, 2011.","mla":"Robinson, David, et al. “ARF1 Localizes to the Golgi and the Trans Golgi Network.” <i>Plant Cell</i>, vol. 23, no. 3, American Society of Plant Biologists, 2011, pp. 846–49, doi:<a href=\"https://doi.org/10.1105/tpc.110.082099\">10.1105/tpc.110.082099</a>.","short":"D. Robinson, D. Scheuring, S. Naramoto, J. Friml, Plant Cell 23 (2011) 846–849.","ista":"Robinson D, Scheuring D, Naramoto S, Friml J. 2011. ARF1 localizes to the golgi and the trans Golgi network. Plant Cell. 23(3), 846–849.","chicago":"Robinson, David, David Scheuring, Satoshi Naramoto, and Jiří Friml. “ARF1 Localizes to the Golgi and the Trans Golgi Network.” <i>Plant Cell</i>. American Society of Plant Biologists, 2011. <a href=\"https://doi.org/10.1105/tpc.110.082099\">https://doi.org/10.1105/tpc.110.082099</a>."}}]