@article{1222,
abstract = {We consider packings of congruent circles on a square flat torus, i.e., periodic (w.r.t. a square lattice) planar circle packings, with the maximal circle radius. This problem is interesting due to a practical reason—the problem of “super resolution of images.” We have found optimal arrangements for N=6, 7 and 8 circles. Surprisingly, for the case N=7 there are three different optimal arrangements. Our proof is based on a computer enumeration of toroidal irreducible contact graphs.},
author = {Musin, Oleg and Nikitenko, Anton},
journal = {Discrete & Computational Geometry},
number = {1},
pages = {1 -- 20},
publisher = {Springer},
title = {{Optimal packings of congruent circles on a square flat torus}},
doi = {10.1007/s00454-015-9742-6},
volume = {55},
year = {2016},
}
@article{1223,
abstract = {We consider a random Schrödinger operator on the binary tree with a random potential which is the sum of a random radially symmetric potential, Qr, and a random transversally periodic potential, κQt, with coupling constant κ. Using a new one-dimensional dynamical systems approach combined with Jensen's inequality in hyperbolic space (our key estimate) we obtain a fractional moment estimate proving localization for small and large κ. Together with a previous result we therefore obtain a model with two Anderson transitions, from localization to delocalization and back to localization, when increasing κ. As a by-product we also have a partially new proof of one-dimensional Anderson localization at any disorder.},
author = {Froese, Richard and Lee, Darrick and Sadel, Christian and Spitzer, Wolfgang and Stolz, Günter},
journal = {Journal of Spectral Theory},
number = {3},
pages = {557 -- 600},
publisher = {European Mathematical Society},
title = {{Localization for transversally periodic random potentials on binary trees}},
doi = {10.4171/JST/132},
volume = {6},
year = {2016},
}
@inproceedings{1225,
abstract = {At Crypto 2015 Fuchsbauer, Hanser and Slamanig (FHS) presented the first standard-model construction of efficient roundoptimal blind signatures that does not require complexity leveraging. It is conceptually simple and builds on the primitive of structure-preserving signatures on equivalence classes (SPS-EQ). FHS prove the unforgeability of their scheme assuming EUF-CMA security of the SPS-EQ scheme and hardness of a version of the DH inversion problem. Blindness under adversarially chosen keys is proven under an interactive variant of the DDH assumption. We propose a variant of their scheme whose blindness can be proven under a non-interactive assumption, namely a variant of the bilinear DDH assumption. We moreover prove its unforgeability assuming only unforgeability of the underlying SPS-EQ but no additional assumptions as needed for the FHS scheme.},
author = {Fuchsbauer, Georg and Hanser, Christian and Kamath Hosdurg, Chethan and Slamanig, Daniel},
location = {Amalfi, Italy},
pages = {391 -- 408},
publisher = {Springer},
title = {{Practical round-optimal blind signatures in the standard model from weaker assumptions}},
doi = {10.1007/978-3-319-44618-9_21},
volume = {9841},
year = {2016},
}
@article{1226,
abstract = {Mitochondrial complex I (also known as NADH:ubiquinone oxidoreductase) contributes to cellular energy production by transferring electrons from NADH to ubiquinone coupled to proton translocation across the membrane. It is the largest protein assembly of the respiratory chain with a total mass of 970 kilodaltons. Here we present a nearly complete atomic structure of ovine (Ovis aries) mitochondrial complex I at 3.9 Å resolution, solved by cryo-electron microscopy with cross-linking and mass-spectrometry mapping experiments. All 14 conserved core subunits and 31 mitochondria-specific supernumerary subunits are resolved within the L-shaped molecule. The hydrophilic matrix arm comprises flavin mononucleotide and 8 iron-sulfur clusters involved in electron transfer, and the membrane arm contains 78 transmembrane helices, mostly contributed by antiporter-like subunits involved in proton translocation. Supernumerary subunits form an interlinked, stabilizing shell around the conserved core. Tightly bound lipids (including cardiolipins) further stabilize interactions between the hydrophobic subunits. Subunits with possible regulatory roles contain additional cofactors, NADPH and two phosphopantetheine molecules, which are shown to be involved in inter-subunit interactions. We observe two different conformations of the complex, which may be related to the conformationally driven coupling mechanism and to the active-deactive transition of the enzyme. Our structure provides insight into the mechanism, assembly, maturation and dysfunction of mitochondrial complex I, and allows detailed molecular analysis of disease-causing mutations.},
author = {Fiedorczuk, Karol and Letts, James A and Degliesposti, Gianluca and Kaszuba, Karol and Skehel, Mark and Sazanov, Leonid A},
journal = {Nature},
number = {7625},
pages = {406 -- 410},
publisher = {Nature Publishing Group},
title = {{Atomic structure of the entire mammalian mitochondrial complex i}},
doi = {10.1038/nature19794},
volume = {538},
year = {2016},
}
@inproceedings{1227,
abstract = {Many biological systems can be modeled as multiaffine hybrid systems. Due to the nonlinearity of multiaffine systems, it is difficult to verify their properties of interest directly. A common strategy to tackle this problem is to construct and analyze a discrete overapproximation of the original system. However, the conservativeness of a discrete abstraction significantly determines the level of confidence we can have in the properties of the original system. In this paper, in order to reduce the conservativeness of a discrete abstraction, we propose a new method based on a sufficient and necessary decision condition for computing discrete transitions between states in the abstract system. We assume the state space partition of a multiaffine system to be based on a set of multivariate polynomials. Hence, a rectangular partition defined in terms of polynomials of the form (xi − c) is just a simple case of multivariate polynomial partition, and the new decision condition applies naturally. We analyze and demonstrate the improvement of our method over the existing methods using some examples.},
author = {Kong, Hui and Bartocci, Ezio and Bogomolov, Sergiy and Grosu, Radu and Henzinger, Thomas A and Jiang, Yu and Schilling, Christian},
location = {Grenoble, France},
pages = {128 -- 144},
publisher = {Springer},
title = {{Discrete abstraction of multiaffine systems}},
doi = {10.1007/978-3-319-47151-8_9},
volume = {9957},
year = {2016},
}
@inproceedings{1229,
abstract = {Witness encryption (WE) was introduced by Garg et al. [GGSW13]. A WE scheme is defined for some NP language L and lets a sender encrypt messages relative to instances x. A ciphertext for x can be decrypted using w witnessing x ∈ L, but hides the message if x ∈ L. Garg et al. construct WE from multilinear maps and give another construction [GGH+13b] using indistinguishability obfuscation (iO) for circuits. Due to the reliance on such heavy tools, WE can cur- rently hardly be implemented on powerful hardware and will unlikely be realizable on constrained devices like smart cards any time soon. We construct a WE scheme where encryption is done by simply computing a Naor-Yung ciphertext (two CPA encryptions and a NIZK proof). To achieve this, our scheme has a setup phase, which outputs public parameters containing an obfuscated circuit (only required for decryption), two encryption keys and a common reference string (used for encryption). This setup need only be run once, and the parame- ters can be used for arbitrary many encryptions. Our scheme can also be turned into a functional WE scheme, where a message is encrypted w.r.t. a statement and a function f, and decryption with a witness w yields f (m, w). Our construction is inspired by the functional encryption scheme by Garg et al. and we prove (selective) security assuming iO and statistically simulation-sound NIZK. We give a construction of the latter in bilinear groups and combining it with ElGamal encryption, our ciphertexts are of size 1.3 kB at a 128-bit security level and can be computed on a smart card.},
author = {Abusalah, Hamza M and Fuchsbauer, Georg and Pietrzak, Krzysztof Z},
location = {Guildford, UK},
pages = {285 -- 303},
publisher = {Springer},
title = {{Offline witness encryption}},
doi = {10.1007/978-3-319-39555-5_16},
volume = {9696},
year = {2016},
}
@inproceedings{1230,
abstract = {Concolic testing is a promising method for generating test suites for large programs. However, it suffers from the path-explosion problem and often fails to find tests that cover difficult-to-reach parts of programs. In contrast, model checkers based on counterexample-guided abstraction refinement explore programs exhaustively, while failing to scale on large programs with precision. In this paper, we present a novel method that iteratively combines concolic testing and model checking to find a test suite for a given coverage criterion. If concolic testing fails to cover some test goals, then the model checker refines its program abstraction to prove more paths infeasible, which reduces the search space for concolic testing. We have implemented our method on top of the concolictesting tool Crest and the model checker CpaChecker. We evaluated our tool on a collection of programs and a category of SvComp benchmarks. In our experiments, we observed an improvement in branch coverage compared to Crest from 48% to 63% in the best case, and from 66% to 71% on average.},
author = {Daca, Przemyslaw and Gupta, Ashutosh and Henzinger, Thomas A},
location = {St. Petersburg, FL, USA},
pages = {328 -- 347},
publisher = {Springer},
title = {{Abstraction-driven concolic testing}},
doi = {10.1007/978-3-662-49122-5_16},
volume = {9583},
year = {2016},
}
@inproceedings{1231,
abstract = {We study the time-and memory-complexities of the problem of computing labels of (multiple) randomly selected challenge-nodes in a directed acyclic graph. The w-bit label of a node is the hash of the labels of its parents, and the hash function is modeled as a random oracle. Specific instances of this problem underlie both proofs of space [Dziembowski et al. CRYPTO’15] as well as popular memory-hard functions like scrypt. As our main tool, we introduce the new notion of a probabilistic parallel entangled pebbling game, a new type of combinatorial pebbling game on a graph, which is closely related to the labeling game on the same graph. As a first application of our framework, we prove that for scrypt, when the underlying hash function is invoked n times, the cumulative memory complexity (CMC) (a notion recently introduced by Alwen and Serbinenko (STOC’15) to capture amortized memory-hardness for parallel adversaries) is at least Ω(w · (n/ log(n))2). This bound holds for adversaries that can store many natural functions of the labels (e.g., linear combinations), but still not arbitrary functions thereof. We then introduce and study a combinatorial quantity, and show how a sufficiently small upper bound on it (which we conjecture) extends our CMC bound for scrypt to hold against arbitrary adversaries. We also show that such an upper bound solves the main open problem for proofs-of-space protocols: namely, establishing that the time complexity of computing the label of a random node in a graph on n nodes (given an initial kw-bit state) reduces tightly to the time complexity for black pebbling on the same graph (given an initial k-node pebbling).},
author = {Alwen, Joel F and Chen, Binyi and Kamath Hosdurg, Chethan and Kolmogorov, Vladimir and Pietrzak, Krzysztof Z and Tessaro, Stefano},
location = {Vienna, Austria},
pages = {358 -- 387},
publisher = {Springer},
title = {{On the complexity of scrypt and proofs of space in the parallel random oracle model}},
doi = {10.1007/978-3-662-49896-5_13},
volume = {9666},
year = {2016},
}
@inproceedings{1233,
abstract = {About three decades ago it was realized that implementing private channels between parties which can be adaptively corrupted requires an encryption scheme that is secure against selective opening attacks. Whether standard (IND-CPA) security implies security against selective opening attacks has been a major open question since. The only known reduction from selective opening to IND-CPA security loses an exponential factor. A polynomial reduction is only known for the very special case where the distribution considered in the selective opening security experiment is a product distribution, i.e., the messages are sampled independently from each other. In this paper we give a reduction whose loss is quantified via the dependence graph (where message dependencies correspond to edges) of the underlying message distribution. In particular, for some concrete distributions including Markov distributions, our reduction is polynomial.},
author = {Fuchsbauer, Georg and Heuer, Felix and Kiltz, Eike and Pietrzak, Krzysztof Z},
location = {Tel Aviv, Israel},
pages = {282 -- 305},
publisher = {Springer},
title = {{Standard security does imply security against selective opening for markov distributions}},
doi = {10.1007/978-3-662-49096-9_12},
volume = {9562},
year = {2016},
}
@inproceedings{1234,
abstract = {We present a new algorithm for the statistical model checking of Markov chains with respect to unbounded temporal properties, including full linear temporal logic. The main idea is that we monitor each simulation run on the fly, in order to detect quickly if a bottom strongly connected component is entered with high probability, in which case the simulation run can be terminated early. As a result, our simulation runs are often much shorter than required by termination bounds that are computed a priori for a desired level of confidence on a large state space. In comparison to previous algorithms for statistical model checking our method is not only faster in many cases but also requires less information about the system, namely, only the minimum transition probability that occurs in the Markov chain. In addition, our method can be generalised to unbounded quantitative properties such as mean-payoff bounds.},
author = {Daca, Przemyslaw and Henzinger, Thomas A and Kretinsky, Jan and Petrov, Tatjana},
location = {Eindhoven, The Netherlands},
pages = {112 -- 129},
publisher = {Springer},
title = {{Faster statistical model checking for unbounded temporal properties}},
doi = {10.1007/978-3-662-49674-9_7},
volume = {9636},
year = {2016},
}
@inproceedings{1235,
abstract = {A constrained pseudorandom function (CPRF) F: K×X → Y for a family T of subsets of χ is a function where for any key k ∈ K and set S ∈ T one can efficiently compute a short constrained key kS, which allows to evaluate F(k, ·) on all inputs x ∈ S, while the outputs on all inputs x /∈ S look random even given kS. Abusalah et al. recently constructed the first constrained PRF for inputs of arbitrary length whose sets S are decided by Turing machines. They use their CPRF to build broadcast encryption and the first ID-based non-interactive key exchange for an unbounded number of users. Their constrained keys are obfuscated circuits and are therefore large. In this work we drastically reduce the key size and define a constrained key for a Turing machine M as a short signature on M. For this, we introduce a new signature primitive with constrained signing keys that let one only sign certain messages, while forging a signature on others is hard even when knowing the coins for key generation.},
author = {Abusalah, Hamza M and Fuchsbauer, Georg},
location = {Guildford, UK},
pages = {445 -- 463},
publisher = {Springer},
title = {{Constrained PRFs for unbounded inputs with short keys}},
doi = {10.1007/978-3-319-39555-5_24},
volume = {9696},
year = {2016},
}
@inproceedings{1236,
abstract = {A constrained pseudorandom function F: K × X → Y for a family T ⊆ 2X of subsets of X is a function where for any key k ∈ K and set S ∈ T one can efficiently compute a constrained key kS which allows to evaluate F (k, ·) on all inputs x ∈ S, while even given this key, the outputs on all inputs x ∉ S look random. At Asiacrypt’13 Boneh and Waters gave a construction which supports the most general set family so far. Its keys kc are defined for sets decided by boolean circuits C and enable evaluation of the PRF on any x ∈ X where C(x) = 1. In their construction the PRF input length and the size of the circuits C for which constrained keys can be computed must be fixed beforehand during key generation. We construct a constrained PRF that has an unbounded input length and whose constrained keys can be defined for any set recognized by a Turing machine. The only a priori bound we make is on the description size of the machines. We prove our construction secure assuming publiccoin differing-input obfuscation. As applications of our constrained PRF we build a broadcast encryption scheme where the number of potential receivers need not be fixed at setup (in particular, the length of the keys is independent of the number of parties) and the first identity-based non-interactive key exchange protocol with no bound on the number of parties that can agree on a shared key.},
author = {Abusalah, Hamza M and Fuchsbauer, Georg and Pietrzak, Krzysztof Z},
location = {San Francisco, CA, USA},
pages = {413 -- 428},
publisher = {Springer},
title = {{Constrained PRFs for unbounded inputs}},
doi = {10.1007/978-3-319-29485-8_24},
volume = {9610},
year = {2016},
}
@article{1238,
abstract = {The dynamic localization of endosomal compartments labeled with targeted fluorescent protein tags is routinely followed by time lapse fluorescence microscopy approaches and single particle tracking algorithms. In this way trajectories of individual endosomes can be mapped and linked to physiological processes as cell growth. However, other aspects of dynamic behavior including endosomal interactions are difficult to follow in this manner. Therefore, we characterized the localization and dynamic properties of early and late endosomes throughout the entire course of root hair formation by means of spinning disc time lapse imaging and post-acquisition automated multitracking and quantitative analysis. Our results show differential motile behavior of early and late endosomes and interactions of late endosomes that may be specified to particular root hair domains. Detailed data analysis revealed a particular transient interaction between late endosomes—termed herein as dancing-endosomes—which is not concluding to vesicular fusion. Endosomes preferentially located in the root hair tip interacted as dancing-endosomes and traveled short distances during this interaction. Finally, sizes of early and late endosomes were addressed by means of super-resolution structured illumination microscopy (SIM) to corroborate measurements on the spinning disc. This is a first study providing quantitative microscopic data on dynamic spatio-temporal interactions of endosomes during root hair tip growth.},
author = {Von Wangenheim, Daniel and Rosero, Amparo and Komis, George and Šamajová, Olga and Ovečka, Miroslav and Voigt, Boris and Šamaj, Jozef},
journal = {Frontiers in Plant Science},
number = {JAN2016},
publisher = {Frontiers Research Foundation},
title = {{Endosomal interactions during root hair growth}},
doi = {10.3389/fpls.2015.01262},
volume = {6},
year = {2016},
}
@article{1240,
abstract = {Background: Long non-coding RNAs (lncRNAs) are increasingly implicated as gene regulators and may ultimately be more numerous than protein-coding genes in the human genome. Despite large numbers of reported lncRNAs, reference annotations are likely incomplete due to their lower and tighter tissue-specific expression compared to mRNAs. An unexplored factor potentially confounding lncRNA identification is inter-individual expression variability. Here, we characterize lncRNA natural expression variability in human primary granulocytes. Results: We annotate granulocyte lncRNAs and mRNAs in RNA-seq data from 10 healthy individuals, identifying multiple lncRNAs absent from reference annotations, and use this to investigate three known features (higher tissue-specificity, lower expression, and reduced splicing efficiency) of lncRNAs relative to mRNAs. Expression variability was examined in seven individuals sampled three times at 1- or more than 1-month intervals. We show that lncRNAs display significantly more inter-individual expression variability compared to mRNAs. We confirm this finding in two independent human datasets by analyzing multiple tissues from the GTEx project and lymphoblastoid cell lines from the GEUVADIS project. Using the latter dataset we also show that including more human donors into the transcriptome annotation pipeline allows identification of an increasing number of lncRNAs, but minimally affects mRNA gene number. Conclusions: A comprehensive annotation of lncRNAs is known to require an approach that is sensitive to low and tight tissue-specific expression. Here we show that increased inter-individual expression variability is an additional general lncRNA feature to consider when creating a comprehensive annotation of human lncRNAs or proposing their use as prognostic or disease markers.},
author = {Kornienko, Aleksandra and Dotter, Christoph and Guenzl, Philipp and Gisslinger, Heinz and Gisslinger, Bettina and Cleary, Ciara and Kralovics, Robert and Pauler, Florian and Barlow, Denise},
journal = {Genome Biology},
number = {1},
publisher = {BioMed Central},
title = {{Long non-coding RNAs display higher natural expression variation than protein-coding genes in healthy humans}},
doi = {10.1186/s13059-016-0873-8},
volume = {17},
year = {2016},
}
@article{1241,
abstract = {How likely is it that a population escapes extinction through adaptive evolution? The answer to this question is of great relevance in conservation biology, where we aim at species’ rescue and the maintenance of biodiversity, and in agriculture and medicine, where we seek to hamper the emergence of pesticide or drug resistance. By reshuffling the genome, recombination has two antagonistic effects on the probability of evolutionary rescue: It generates and it breaks up favorable gene combinations. Which of the two effects prevails depends on the fitness effects of mutations and on the impact of stochasticity on the allele frequencies. In this article, we analyze a mathematical model for rescue after a sudden environmental change when adaptation is contingent on mutations at two loci. The analysis reveals a complex nonlinear dependence of population survival on recombination. We moreover find that, counterintuitively, a fast eradication of the wild type can promote rescue in the presence of recombination. The model also shows that two-step rescue is not unlikely to happen and can even be more likely than single-step rescue (where adaptation relies on a single mutation), depending on the circumstances.},
author = {Uecker, Hildegard and Hermisson, Joachim},
journal = {Genetics},
number = {2},
pages = {721 -- 732},
publisher = {Genetics Society of America},
title = {{The role of recombination in evolutionary rescue}},
doi = {10.1534/genetics.115.180299},
volume = {202},
year = {2016},
}
@article{1242,
abstract = {A crucial step in the regulation of gene expression is binding of transcription factor (TF) proteins to regulatory sites along the DNA. But transcription factors act at nanomolar concentrations, and noise due to random arrival of these molecules at their binding sites can severely limit the precision of regulation. Recent work on the optimization of information flow through regulatory networks indicates that the lower end of the dynamic range of concentrations is simply inaccessible, overwhelmed by the impact of this noise. Motivated by the behavior of homeodomain proteins, such as the maternal morphogen Bicoid in the fruit fly embryo, we suggest a scheme in which transcription factors also act as indirect translational regulators, binding to the mRNA of other regulatory proteins. Intuitively, each mRNA molecule acts as an independent sensor of the input concentration, and averaging over these multiple sensors reduces the noise. We analyze information flow through this scheme and identify conditions under which it outperforms direct transcriptional regulation. Our results suggest that the dual role of homeodomain proteins is not just a historical accident, but a solution to a crucial physics problem in the regulation of gene expression.},
author = {Sokolowski, Thomas R and Walczak, Aleksandra and Bialek, William and Tkacik, Gasper},
journal = {Physical Review E Statistical Nonlinear and Soft Matter Physics},
number = {2},
publisher = {American Institute of Physics},
title = {{Extending the dynamic range of transcription factor action by translational regulation}},
doi = {10.1103/PhysRevE.93.022404},
volume = {93},
year = {2016},
}
@article{1244,
abstract = {Cell polarity refers to a functional spatial organization of proteins that is crucial for the control of essential cellular processes such as growth and division. To establish polarity, cells rely on elaborate regulation networks that control the distribution of proteins at the cell membrane. In fission yeast cells, a microtubule-dependent network has been identified that polarizes the distribution of signaling proteins that restricts growth to cell ends and targets the cytokinetic machinery to the middle of the cell. Although many molecular components have been shown to play a role in this network, it remains unknown which molecular functionalities are minimally required to establish a polarized protein distribution in this system. Here we show that a membrane-binding protein fragment, which distributes homogeneously in wild-type fission yeast cells, can be made to concentrate at cell ends by attaching it to a cytoplasmic microtubule end-binding protein. This concentration results in a polarized pattern of chimera proteins with a spatial extension that is very reminiscent of natural polarity patterns in fission yeast. However, chimera levels fluctuate in response to microtubule dynamics, and disruption of microtubules leads to disappearance of the pattern. Numerical simulations confirm that the combined functionality of membrane anchoring and microtubule tip affinity is in principle sufficient to create polarized patterns. Our chimera protein may thus represent a simple molecular functionality that is able to polarize the membrane, onto which additional layers of molecular complexity may be built to provide the temporal robustness that is typical of natural polarity patterns.},
author = {Recouvreux, Pierre and Sokolowski, Thomas R and Grammoustianou, Aristea and Tenwolde, Pieter and Dogterom, Marileen},
journal = {PNAS},
number = {7},
pages = {1811 -- 1816},
publisher = {National Academy of Sciences},
title = {{Chimera proteins with affinity for membranes and microtubule tips polarize in the membrane of fission yeast cells}},
doi = {10.1073/pnas.1419248113},
volume = {113},
year = {2016},
}
@article{1246,
abstract = {Near-field imaging is a powerful tool to investigate the complex structure of light at the nanoscale. Recent advances in near-field imaging have indicated the possibility for the complete reconstruction of both electric and magnetic components of the evanescent field. Here we study the electro-magnetic field structure of surface plasmon polariton waves propagating along subwavelength gold nanowires by performing phase- and polarization-resolved near-field microscopy in collection mode. By applying the optical reciprocity theorem, we describe the signal collected by the probe as an overlap integral of the nanowire's evanescent field and the probe's response function. As a result, we find that the probe's sensitivity to the magnetic field is approximately equal to its sensitivity to the electric field. Through rigorous modeling of the nanowire mode as well as the aperture probe response function, we obtain a good agreement between experimentally measured signals and a numerical model. Our findings provide a better understanding of aperture-based near-field imaging of the nanoscopic plasmonic and photonic structures and are helpful for the interpretation of future near-field experiments.},
author = {Kabakova, Irina and De Hoogh, Anouk and Van Der Wel, Ruben and Wulf, Matthias and Le Feber, Boris and Kuipers, Laurens},
journal = {Scientific Reports},
publisher = {Nature Publishing Group},
title = {{Imaging of electric and magnetic fields near plasmonic nanowires}},
doi = {10.1038/srep22665},
volume = {6},
year = {2016},
}
@article{1247,
abstract = {The shaping of organs in plants depends on the intercellular flow of the phytohormone auxin, of which the directional signaling is determined by the polar subcellular localization of PIN-FORMED (PIN) auxin transport proteins. Phosphorylation dynamics of PIN proteins are affected by the protein phosphatase 2A (PP2A) and the PINOID kinase, which act antagonistically to mediate their apical-basal polar delivery. Here, we identified the ROTUNDA3 (RON3) protein as a regulator of the PP2A phosphatase activity in Arabidopsis thaliana. The RON3 gene was map-based cloned starting from the ron3-1 leaf mutant and found to be a unique, plant-specific gene coding for a protein with high and dispersed proline content. The ron3-1 and ron3-2 mutant phenotypes [i.e., reduced apical dominance, primary root length, lateral root emergence, and growth; increased ectopic stages II, IV, and V lateral root primordia; decreased auxin maxima in indole-3-acetic acid (IAA)-treated root apical meristems; hypergravitropic root growth and response; increased IAA levels in shoot apices; and reduced auxin accumulation in root meristems] support a role for RON3 in auxin biology. The affinity-purified PP2A complex with RON3 as bait suggested that RON3 might act in PIN transporter trafficking. Indeed, pharmacological interference with vesicle trafficking processes revealed that single ron3-2 and double ron3-2 rcn1 mutants have altered PIN polarity and endocytosis in specific cells. Our data indicate that RON3 contributes to auxin-mediated development by playing a role in PIN recycling and polarity establishment through regulation of the PP2A complex activity.},
author = {Karampelias, Michael and Neyt, Pia and De Groeve, Steven and Aesaert, Stijn and Coussens, Griet and Rolčík, Jakub and Bruno, Leonardo and De Winne, Nancy and Van Minnebruggen, Annemie and Van Montagu, Marc and Ponce, Maria and Micol, José and Friml, Jirí and De Jaeger, Geert and Van Lijsebettens, Mieke},
journal = {PNAS},
number = {10},
pages = {2768 -- 2773},
publisher = {National Academy of Sciences},
title = {{ROTUNDA3 function in plant development by phosphatase 2A-mediated regulation of auxin transporter recycling}},
doi = {10.1073/pnas.1501343112},
volume = {113},
year = {2016},
}
@article{1248,
abstract = {Life depends as much on the flow of information as on the flow of energy. Here we review the many efforts to make this intuition precise. Starting with the building blocks of information theory, we explore examples where it has been possible to measure, directly, the flow of information in biological networks, or more generally where information-theoretic ideas have been used to guide the analysis of experiments. Systems of interest range from single molecules (the sequence diversity in families of proteins) to groups of organisms (the distribution of velocities in flocks of birds), and all scales in between. Many of these analyses are motivated by the idea that biological systems may have evolved to optimize the gathering and representation of information, and we review the experimental evidence for this optimization, again across a wide range of scales.},
author = {Tkacik, Gasper and Bialek, William},
journal = {Annual Review of Condensed Matter Physics},
pages = {89 -- 117},
publisher = {Annual Reviews},
title = {{Information processing in living systems}},
doi = {10.1146/annurev-conmatphys-031214-014803},
volume = {7},
year = {2016},
}