TY - JOUR AB - Conventional wisdom has it that proteins fold and assemble into definite structures, and that this defines their function. Glycosaminoglycans (GAGs) are different. In most cases the structures they form have a low degree of order, even when interacting with proteins. Here, we discuss how physical features common to all GAGs — hydrophilicity, charge, linearity and semi-flexibility — underpin the overall properties of GAG-rich matrices. By integrating soft matter physics concepts (e.g. polymer brushes and phase separation) with our molecular understanding of GAG–protein interactions, we can better comprehend how GAG-rich matrices assemble, what their properties are, and how they function. Taking perineuronal nets (PNNs) — a GAG-rich matrix enveloping neurons — as a relevant example, we propose that microphase separation determines the holey PNN anatomy that is pivotal to PNN functions. AU - Richter, Ralf AU - Baranova, Natalia AU - Day, Anthony AU - Kwok, Jessica ID - 555 JF - Current Opinion in Structural Biology TI - Glycosaminoglycans in extracellular matrix organisation: Are concepts from soft matter physics key to understanding the formation of perineuronal nets? VL - 50 ER - TY - JOUR AB - Around 150 million years ago, eusocial termites evolved from within the cockroaches, 50 million years before eusocial Hymenoptera, such as bees and ants, appeared. Here, we report the 2-Gb genome of the German cockroach, Blattella germanica, and the 1.3-Gb genome of the drywood termite Cryptotermes secundus. We show evolutionary signatures of termite eusociality by comparing the genomes and transcriptomes of three termites and the cockroach against the background of 16 other eusocial and non-eusocial insects. Dramatic adaptive changes in genes underlying the production and perception of pheromones confirm the importance of chemical communication in the termites. These are accompanied by major changes in gene regulation and the molecular evolution of caste determination. Many of these results parallel molecular mechanisms of eusocial evolution in Hymenoptera. However, the specific solutions are remarkably different, thus revealing a striking case of convergence in one of the major evolutionary transitions in biological complexity. AU - Harrison, Mark AU - Jongepier, Evelien AU - Robertson, Hugh AU - Arning, Nicolas AU - Bitard Feildel, Tristan AU - Chao, Hsu AU - Childers, Christopher AU - Dinh, Huyen AU - Doddapaneni, Harshavardhan AU - Dugan, Shannon AU - Gowin, Johannes AU - Greiner, Carolin AU - Han, Yi AU - Hu, Haofu AU - Hughes, Daniel AU - Huylmans, Ann K AU - Kemena, Karsten AU - Kremer, Lukas AU - Lee, Sandra AU - López Ezquerra, Alberto AU - Mallet, Ludovic AU - Monroy Kuhn, Jose AU - Moser, Annabell AU - Murali, Shwetha AU - Muzny, Donna AU - Otani, Saria AU - Piulachs, Maria AU - Poelchau, Monica AU - Qu, Jiaxin AU - Schaub, Florentine AU - Wada Katsumata, Ayako AU - Worley, Kim AU - Xie, Qiaolin AU - Ylla, Guillem AU - Poulsen, Michael AU - Gibbs, Richard AU - Schal, Coby AU - Richards, Stephen AU - Belles, Xavier AU - Korb, Judith AU - Bornberg Bauer, Erich ID - 448 IS - 3 JF - Nature Ecology and Evolution TI - Hemimetabolous genomes reveal molecular basis of termite eusociality VL - 2 ER - TY - JOUR AB - Escaping local optima is one of the major obstacles to function optimisation. Using the metaphor of a fitness landscape, local optima correspond to hills separated by fitness valleys that have to be overcome. We define a class of fitness valleys of tunable difficulty by considering their length, representing the Hamming path between the two optima and their depth, the drop in fitness. For this function class we present a runtime comparison between stochastic search algorithms using different search strategies. The (1+1) EA is a simple and well-studied evolutionary algorithm that has to jump across the valley to a point of higher fitness because it does not accept worsening moves (elitism). In contrast, the Metropolis algorithm and the Strong Selection Weak Mutation (SSWM) algorithm, a famous process in population genetics, are both able to cross the fitness valley by accepting worsening moves. We show that the runtime of the (1+1) EA depends critically on the length of the valley while the runtimes of the non-elitist algorithms depend crucially on the depth of the valley. Moreover, we show that both SSWM and Metropolis can also efficiently optimise a rugged function consisting of consecutive valleys. AU - Oliveto, Pietro AU - Paixao, Tiago AU - Pérez Heredia, Jorge AU - Sudholt, Dirk AU - Trubenova, Barbora ID - 723 IS - 5 JF - Algorithmica TI - How to escape local optima in black box optimisation when non elitism outperforms elitism VL - 80 ER - TY - JOUR AB - The twelve papers in this special section focus on learning systems with shared information for computer vision and multimedia communication analysis. In the real world, a realistic setting for computer vision or multimedia recognition problems is that we have some classes containing lots of training data and many classes containing a small amount of training data. Therefore, how to use frequent classes to help learning rare classes for which it is harder to collect the training data is an open question. Learning with shared information is an emerging topic in machine learning, computer vision and multimedia analysis. There are different levels of components that can be shared during concept modeling and machine learning stages, such as sharing generic object parts, sharing attributes, sharing transformations, sharing regularization parameters and sharing training examples, etc. Regarding the specific methods, multi-task learning, transfer learning and deep learning can be seen as using different strategies to share information. These learning with shared information methods are very effective in solving real-world large-scale problems. AU - Darrell, Trevor AU - Lampert, Christoph AU - Sebe, Nico AU - Wu, Ying AU - Yan, Yan ID - 321 IS - 5 JF - IEEE Transactions on Pattern Analysis and Machine Intelligence TI - Guest editors' introduction to the special section on learning with Shared information for computer vision and multimedia analysis VL - 40 ER - TY - GEN AB - Around 150 million years ago, eusocial termites evolved from within the cockroaches, 50 million years before eusocial Hymenoptera, such as bees and ants, appeared. Here, we report the 2-Gb genome of the German cockroach, Blattella germanica, and the 1.3-Gb genome of the drywood termite Cryptotermes secundus. We show evolutionary signatures of termite eusociality by comparing the genomes and transcriptomes of three termites and the cockroach against the background of 16 other eusocial and non-eusocial insects. Dramatic adaptive changes in genes underlying the production and perception of pheromones confirm the importance of chemical communication in the termites. These are accompanied by major changes in gene regulation and the molecular evolution of caste determination. Many of these results parallel molecular mechanisms of eusocial evolution in Hymenoptera. However, the specific solutions are remarkably different, thus revealing a striking case of convergence in one of the major evolutionary transitions in biological complexity. AU - Harrison, Mark C. AU - Jongepier, Evelien AU - Robertson, Hugh M. AU - Arning, Nicolas AU - Bitard-Feildel, Tristan AU - Chao, Hsu AU - Childers, Christopher P. AU - Dinh, Huyen AU - Doddapaneni, Harshavardhan AU - Dugan, Shannon AU - Gowin, Johannes AU - Greiner, Carolin AU - Han, Yi AU - Hu, Haofu AU - Hughes, Daniel S. T. AU - Huylmans, Ann K AU - Kemena, Carsten AU - Kremer, Lukas P. M. AU - Lee, Sandra L. AU - Lopez-Ezquerra, Alberto AU - Mallet, Ludovic AU - Monroy-Kuhn, Jose M. AU - Moser, Annabell AU - Murali, Shwetha C. AU - Muzny, Donna M. AU - Otani, Saria AU - Piulachs, Maria-Dolors AU - Poelchau, Monica AU - Qu, Jiaxin AU - Schaub, Florentine AU - Wada-Katsumata, Ayako AU - Worley, Kim C. AU - Xie, Qiaolin AU - Ylla, Guillem AU - Poulsen, Michael AU - Gibbs, Richard A. AU - Schal, Coby AU - Richards, Stephen AU - Belles, Xavier AU - Korb, Judith AU - Bornberg-Bauer, Erich ID - 9841 TI - Data from: Hemimetabolous genomes reveal molecular basis of termite eusociality ER - TY - JOUR AB - The functional role of AMPA receptor (AMPAR)-mediated synaptic signaling between neurons and oligodendrocyte precursor cells (OPCs) remains enigmatic. We modified the properties of AMPARs at axon-OPC synapses in the mouse corpus callosum in vivo during the peak of myelination by targeting the GluA2 subunit. Expression of the unedited (Ca2+ permeable) or the pore-dead GluA2 subunit of AMPARs triggered proliferation of OPCs and reduced their differentiation into oligodendrocytes. Expression of the cytoplasmic C-terminal (GluA2(813-862)) of the GluA2 subunit (C-tail), a modification designed to affect the interaction between GluA2 and AMPAR-binding proteins and to perturb trafficking of GluA2-containing AMPARs, decreased the differentiation of OPCs without affecting their proliferation. These findings suggest that ionotropic and non-ionotropic properties of AMPARs in OPCs, as well as specific aspects of AMPAR-mediated signaling at axon-OPC synapses in the mouse corpus callosum, are important for balancing the response of OPCs to proliferation and differentiation cues. In the brain, oligodendrocyte precursor cells (OPCs) receive glutamatergic AMPA-receptor-mediated synaptic input from neurons. Chen et al. show that modifying AMPA-receptor properties at axon-OPC synapses alters proliferation and differentiation of OPCs. This expands the traditional view of synaptic transmission by suggesting neurons also use synapses to modulate behavior of glia. AU - Chen, Ting AU - Kula, Bartosz AU - Nagy, Balint AU - Barzan, Ruxandra AU - Gall, Andrea AU - Ehrlich, Ingrid AU - Kukley, Maria ID - 32 IS - 4 JF - Cell Reports TI - In Vivo regulation of Oligodendrocyte processor cell proliferation and differentiation by the AMPA-receptor Subunit GluA2 VL - 25 ER - TY - JOUR AB - The release of IgM is the first line of an antibody response and precedes the generation of high affinity IgG in germinal centers. Once secreted by freshly activated plasmablasts, IgM is released into the efferent lymph of reactive lymph nodes as early as 3 d after immunization. As pentameric IgM has an enormous size of 1,000 kD, its diffusibility is low, and one might wonder how it can pass through the densely lymphocyte-packed environment of a lymph node parenchyma in order to reach its exit. In this issue of JEM, Thierry et al. show that, in order to reach the blood stream, IgM molecules take a specific micro-anatomical route via lymph node conduits. AU - Reversat, Anne AU - Sixt, Michael K ID - 5672 IS - 12 JF - Journal of Experimental Medicine SN - 00221007 TI - IgM's exit route VL - 215 ER - TY - JOUR AB - We consider congruences of straight lines in a plane with the combinatorics of the square grid, with all elementary quadrilaterals possessing an incircle. It is shown that all the vertices of such nets (we call them incircular or IC-nets) lie on confocal conics. Our main new results are on checkerboard IC-nets in the plane. These are congruences of straight lines in the plane with the combinatorics of the square grid, combinatorially colored as a checkerboard, such that all black coordinate quadrilaterals possess inscribed circles. We show how this larger class of IC-nets appears quite naturally in Laguerre geometry of oriented planes and spheres and leads to new remarkable incidence theorems. Most of our results are valid in hyperbolic and spherical geometries as well. We present also generalizations in spaces of higher dimension, called checkerboard IS-nets. The construction of these nets is based on a new 9 inspheres incidence theorem. AU - Akopyan, Arseniy AU - Bobenko, Alexander ID - 458 IS - 4 JF - Transactions of the American Mathematical Society TI - Incircular nets and confocal conics VL - 370 ER - TY - CONF AB - In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the winner or payoff of the game. Such games are central in formal verification since they model the interaction between a non-terminating system and its environment. We study bidding games in which the players bid for the right to move the token. Two bidding rules have been defined. In Richman bidding, in each round, the players simultaneously submit bids, and the higher bidder moves the token and pays the other player. Poorman bidding is similar except that the winner of the bidding pays the “bank” rather than the other player. While poorman reachability games have been studied before, we present, for the first time, results on infinite-duration poorman games. A central quantity in these games is the ratio between the two players’ initial budgets. The questions we study concern a necessary and sufficient ratio with which a player can achieve a goal. For reachability objectives, such threshold ratios are known to exist for both bidding rules. We show that the properties of poorman reachability games extend to complex qualitative objectives such as parity, similarly to the Richman case. Our most interesting results concern quantitative poorman games, namely poorman mean-payoff games, where we construct optimal strategies depending on the initial ratio, by showing a connection with random-turn based games. The connection in itself is interesting, because it does not hold for reachability poorman games. We also solve the complexity problems that arise in poorman bidding games. AU - Avni, Guy AU - Henzinger, Thomas A AU - Ibsen-Jensen, Rasmus ID - 5788 SN - 03029743 TI - Infinite-duration poorman-bidding games VL - 11316 ER - TY - JOUR AB - A short, 14-amino-acid segment called SP1, located in the Gag structural protein1, has a critical role during the formation of the HIV-1 virus particle. During virus assembly, the SP1 peptide and seven preceding residues fold into a six-helix bundle, which holds together the Gag hexamer and facilitates the formation of a curved immature hexagonal lattice underneath the viral membrane2,3. Upon completion of assembly and budding, proteolytic cleavage of Gag leads to virus maturation, in which the immature lattice is broken down; the liberated CA domain of Gag then re-assembles into the mature conical capsid that encloses the viral genome and associated enzymes. Folding and proteolysis of the six-helix bundle are crucial rate-limiting steps of both Gag assembly and disassembly, and the six-helix bundle is an established target of HIV-1 inhibitors4,5. Here, using a combination of structural and functional analyses, we show that inositol hexakisphosphate (InsP6, also known as IP6) facilitates the formation of the six-helix bundle and assembly of the immature HIV-1 Gag lattice. IP6 makes ionic contacts with two rings of lysine residues at the centre of the Gag hexamer. Proteolytic cleavage then unmasks an alternative binding site, where IP6 interaction promotes the assembly of the mature capsid lattice. These studies identify IP6 as a naturally occurring small molecule that promotes both assembly and maturation of HIV-1. AU - Dick, Robert AU - Zadrozny, Kaneil K AU - Xu, Chaoyi AU - Schur, Florian AU - Lyddon, Terri D AU - Ricana, Clifton L AU - Wagner, Jonathan M AU - Perilla, Juan R AU - Ganser, Pornillos Barbie K AU - Johnson, Marc C AU - Pornillos, Owen AU - Vogt, Volker ID - 150 IS - 7719 JF - Nature TI - Inositol phosphates are assembly co-factors for HIV-1 VL - 560 ER - TY - JOUR AB - The theory of tropical series, that we develop here, firstly appeared in the study of the growth of pluriharmonic functions. Motivated by waves in sandpile models we introduce a dynamic on the set of tropical series, and it is experimentally observed that this dynamic obeys a power law. So, this paper serves as a compilation of results we need for other articles and also introduces several objects interesting by themselves. AU - Kalinin, Nikita AU - Shkolnikov, Mikhail ID - 303 IS - 6 JF - Discrete and Continuous Dynamical Systems- Series A TI - Introduction to tropical series and wave dynamic on them VL - 38 ER - TY - JOUR AB - Adaptive introgression is common in nature and can be driven by selection acting on multiple, linked genes. We explore the effects of polygenic selection on introgression under the infinitesimal model with linkage. This model assumes that the introgressing block has an effectively infinite number of genes, each with an infinitesimal effect on the trait under selection. The block is assumed to introgress under directional selection within a native population that is genetically homogeneous. We use individual-based simulations and a branching process approximation to compute various statistics of the introgressing block, and explore how these depend on parameters such as the map length and initial trait value associated with the introgressing block, the genetic variability along the block, and the strength of selection. Our results show that the introgression dynamics of a block under infinitesimal selection is qualitatively different from the dynamics of neutral introgression. We also find that in the long run, surviving descendant blocks are likely to have intermediate lengths, and clarify how the length is shaped by the interplay between linkage and infinitesimal selection. Our results suggest that it may be difficult to distinguish introgression of single loci from that of genomic blocks with multiple, tightly linked and weakly selected loci. AU - Sachdeva, Himani AU - Barton, Nicholas H ID - 282 IS - 4 JF - Genetics TI - Introgression of a block of genome under infinitesimal selection VL - 209 ER - TY - CONF AB - Universal hashing found a lot of applications in computer science. In cryptography the most important fact about universal families is the so called Leftover Hash Lemma, proved by Impagliazzo, Levin and Luby. In the language of modern cryptography it states that almost universal families are good extractors. In this work we provide a somewhat surprising characterization in the opposite direction. Namely, every extractor with sufficiently good parameters yields a universal family on a noticeable fraction of its inputs. Our proof technique is based on tools from extremal graph theory applied to the \'collision graph\' induced by the extractor, and may be of independent interest. We discuss possible applications to the theory of randomness extractors and non-malleable codes. AU - Obremski, Marciej AU - Skorski, Maciej ID - 108 TI - Inverted leftover hash lemma VL - 2018 ER - TY - CONF AB - We present layered concurrent programs, a compact and expressive notation for specifying refinement proofs of concurrent programs. A layered concurrent program specifies a sequence of connected concurrent programs, from most concrete to most abstract, such that common parts of different programs are written exactly once. These programs are expressed in the ordinary syntax of imperative concurrent programs using gated atomic actions, sequencing, choice, and (recursive) procedure calls. Each concurrent program is automatically extracted from the layered program. We reduce refinement to the safety of a sequence of concurrent checker programs, one each to justify the connection between every two consecutive concurrent programs. These checker programs are also automatically extracted from the layered program. Layered concurrent programs have been implemented in the CIVL verifier which has been successfully used for the verification of several complex concurrent programs. AU - Kragl, Bernhard AU - Qadeer, Shaz ID - 160 TI - Layered Concurrent Programs VL - 10981 ER - TY - JOUR AB - In experimental cultures, when bacteria are mixed with lytic (virulent) bacteriophage, bacterial cells resistant to the phage commonly emerge and become the dominant population of bacteria. Following the ascent of resistant mutants, the densities of bacteria in these simple communities become limited by resources rather than the phage. Despite the evolution of resistant hosts, upon which the phage cannot replicate, the lytic phage population is most commonly maintained in an apparently stable state with the resistant bacteria. Several mechanisms have been put forward to account for this result. Here we report the results of population dynamic/evolution experiments with a virulent mutant of phage Lambda, λVIR, and Escherichia coli in serial transfer cultures. We show that, following the ascent of λVIR-resistant bacteria, λVIRis maintained in the majority of cases in maltose-limited minimal media and in all cases in nutrient-rich broth. Using mathematical models and experiments, we show that the dominant mechanism responsible for maintenance of λVIRin these resource-limited populations dominated by resistant E. coli is a high rate of either phenotypic or genetic transition from resistance to susceptibility—a hitherto undemonstrated mechanism we term "leaky resistance." We discuss the implications of leaky resistance to our understanding of the conditions for the maintenance of phage in populations of bacteria—their “existence conditions.”. AU - Chaudhry, Waqas AU - Pleska, Maros AU - Shah, Nilang AU - Weiss, Howard AU - Mccall, Ingrid AU - Meyer, Justin AU - Gupta, Animesh AU - Guet, Calin C AU - Levin, Bruce ID - 82 IS - 8 JF - PLoS Biology TI - Leaky resistance and the conditions for the existence of lytic bacteriophage VL - 16 ER - TY - JOUR AB - We present a data-driven technique to instantly predict how fluid flows around various three-dimensional objects. Such simulation is useful for computational fabrication and engineering, but is usually computationally expensive since it requires solving the Navier-Stokes equation for many time steps. To accelerate the process, we propose a machine learning framework which predicts aerodynamic forces and velocity and pressure fields given a threedimensional shape input. Handling detailed free-form three-dimensional shapes in a data-driven framework is challenging because machine learning approaches usually require a consistent parametrization of input and output. We present a novel PolyCube maps-based parametrization that can be computed for three-dimensional shapes at interactive rates. This allows us to efficiently learn the nonlinear response of the flow using a Gaussian process regression. We demonstrate the effectiveness of our approach for the interactive design and optimization of a car body. AU - Umetani, Nobuyuki AU - Bickel, Bernd ID - 4 IS - 4 JF - ACM Trans. Graph. TI - Learning three-dimensional flow for interactive aerodynamic design VL - 37 ER - TY - JOUR AB - We consider large random matrices X with centered, independent entries which have comparable but not necessarily identical variances. Girko's circular law asserts that the spectrum is supported in a disk and in case of identical variances, the limiting density is uniform. In this special case, the local circular law by Bourgade et. al. [11,12] shows that the empirical density converges even locally on scales slightly above the typical eigenvalue spacing. In the general case, the limiting density is typically inhomogeneous and it is obtained via solving a system of deterministic equations. Our main result is the local inhomogeneous circular law in the bulk spectrum on the optimal scale for a general variance profile of the entries of X. AU - Alt, Johannes AU - Erdös, László AU - Krüger, Torben H ID - 566 IS - 1 JF - Annals Applied Probability TI - Local inhomogeneous circular law VL - 28 ER - TY - JOUR AB - The goal of this article is to introduce the reader to the theory of intrinsic geometry of convex surfaces. We illustrate the power of the tools by proving a theorem on convex surfaces containing an arbitrarily long closed simple geodesic. Let us remind ourselves that a curve in a surface is called geodesic if every sufficiently short arc of the curve is length minimizing; if, in addition, it has no self-intersections, we call it simple geodesic. A tetrahedron with equal opposite edges is called isosceles. The axiomatic method of Alexandrov geometry allows us to work with the metrics of convex surfaces directly, without approximating it first by a smooth or polyhedral metric. Such approximations destroy the closed geodesics on the surface; therefore it is difficult (if at all possible) to apply approximations in the proof of our theorem. On the other hand, a proof in the smooth or polyhedral case usually admits a translation into Alexandrov’s language; such translation makes the result more general. In fact, our proof resembles a translation of the proof given by Protasov. Note that the main theorem implies in particular that a smooth convex surface does not have arbitrarily long simple closed geodesics. However we do not know a proof of this corollary that is essentially simpler than the one presented below. AU - Akopyan, Arseniy AU - Petrunin, Anton ID - 106 IS - 3 JF - Mathematical Intelligencer TI - Long geodesics on convex surfaces VL - 40 ER - TY - JOUR AB - Lymphatic endothelial cells (LECs) release extracellular chemokines to guide the migration of dendritic cells. In this study, we report that LECs also release basolateral exosome-rich endothelial vesicles (EEVs) that are secreted in greater numbers in the presence of inflammatory cytokines and accumulate in the perivascular stroma of small lymphatic vessels in human chronic inflammatory diseases. Proteomic analyses of EEV fractions identified > 1,700 cargo proteins and revealed a dominant motility-promoting protein signature. In vitro and ex vivo EEV fractions augmented cellular protrusion formation in a CX3CL1/fractalkine-dependent fashion and enhanced the directional migratory response of human dendritic cells along guidance cues. We conclude that perilymphatic LEC exosomes enhance exploratory behavior and thus promote directional migration of CX3CR1-expressing cells in complex tissue environments. AU - Brown, Markus AU - Johnson, Louise AU - Leone, Dario AU - Májek, Peter AU - Vaahtomeri, Kari AU - Senfter, Daniel AU - Bukosza, Nora AU - Schachner, Helga AU - Asfour, Gabriele AU - Langer, Brigitte AU - Hauschild, Robert AU - Parapatics, Katja AU - Hong, Young AU - Bennett, Keiryn AU - Kain, Renate AU - Detmar, Michael AU - Sixt, Michael K AU - Jackson, David AU - Kerjaschki, Dontscho ID - 275 IS - 6 JF - Journal of Cell Biology TI - Lymphatic exosomes promote dendritic cell migration along guidance cues VL - 217 ER - TY - JOUR AB - The angiosperm seed is composed of three genetically distinct tissues: the diploid embryo that originates from the fertilized egg cell, the triploid endosperm that is produced from the fertilized central cell, and the maternal sporophytic integuments that develop into the seed coat1. At the onset of embryo development in Arabidopsis thaliana, the zygote divides asymmetrically, producing a small apical embryonic cell and a larger basal cell that connects the embryo to the maternal tissue2. The coordinated and synchronous development of the embryo and the surrounding integuments, and the alignment of their growth axes, suggest communication between maternal tissues and the embryo. In contrast to animals, however, where a network of maternal factors that direct embryo patterning have been identified3,4, only a few maternal mutations have been described to affect embryo development in plants5–7. Early embryo patterning in Arabidopsis requires accumulation of the phytohormone auxin in the apical cell by directed transport from the suspensor8–10. However, the origin of this auxin has remained obscure. Here we investigate the source of auxin for early embryogenesis and provide evidence that the mother plant coordinates seed development by supplying auxin to the early embryo from the integuments of the ovule. We show that auxin response increases in ovules after fertilization, due to upregulated auxin biosynthesis in the integuments, and this maternally produced auxin is required for correct embryo development. AU - Robert, Hélène AU - Park, Chulmin AU - Gutièrrez, Carla AU - Wójcikowska, Barbara AU - Pěnčík, Aleš AU - Novák, Ondřej AU - Chen, Junyi AU - Grunewald, Wim AU - Dresselhaus, Thomas AU - Friml, Jirí AU - Laux, Thomas ID - 158 IS - 8 JF - Nature Plants TI - Maternal auxin supply contributes to early embryo patterning in Arabidopsis VL - 4 ER -