@article{7, abstract = {Animal social networks are shaped by multiple selection pressures, including the need to ensure efficient communication and functioning while simultaneously limiting disease transmission. Social animals could potentially further reduce epidemic risk by altering their social networks in the presence of pathogens, yet there is currently no evidence for such pathogen-triggered responses. We tested this hypothesis experimentally in the ant Lasius niger using a combination of automated tracking, controlled pathogen exposure, transmission quantification, and temporally explicit simulations. Pathogen exposure induced behavioral changes in both exposed ants and their nestmates, which helped contain the disease by reinforcing key transmission-inhibitory properties of the colony's contact network. This suggests that social network plasticity in response to pathogens is an effective strategy for mitigating the effects of disease in social groups.}, author = {Stroeymeyt, Nathalie and Grasse, Anna V and Crespi, Alessandro and Mersch, Danielle and Cremer, Sylvia and Keller, Laurent}, issn = {1095-9203}, journal = {Science}, number = {6417}, pages = {941 -- 945}, publisher = {AAAS}, title = {{Social network plasticity decreases disease transmission in a eusocial insect}}, doi = {10.1126/science.aat4793}, volume = {362}, year = {2018}, } @article{70, abstract = {We consider the totally asymmetric simple exclusion process in a critical scaling parametrized by a≥0, which creates a shock in the particle density of order aT−1/3, T the observation time. When starting from step initial data, we provide bounds on the limiting law which in particular imply that in the double limit lima→∞limT→∞ one recovers the product limit law and the degeneration of the correlation length observed at shocks of order 1. This result is shown to apply to a general last-passage percolation model. We also obtain bounds on the two-point functions of several airy processes.}, author = {Nejjar, Peter}, issn = {1980-0436}, journal = {Latin American Journal of Probability and Mathematical Statistics}, number = {2}, pages = {1311--1334}, publisher = {Instituto Nacional de Matematica Pura e Aplicada}, title = {{Transition to shocks in TASEP and decoupling of last passage times}}, doi = {10.30757/ALEA.v15-49}, volume = {15}, year = {2018}, } @article{703, abstract = {We consider the NP-hard problem of MAP-inference for undirected discrete graphical models. We propose a polynomial time and practically efficient algorithm for finding a part of its optimal solution. Specifically, our algorithm marks some labels of the considered graphical model either as (i) optimal, meaning that they belong to all optimal solutions of the inference problem; (ii) non-optimal if they provably do not belong to any solution. With access to an exact solver of a linear programming relaxation to the MAP-inference problem, our algorithm marks the maximal possible (in a specified sense) number of labels. We also present a version of the algorithm, which has access to a suboptimal dual solver only and still can ensure the (non-)optimality for the marked labels, although the overall number of the marked labels may decrease. We propose an efficient implementation, which runs in time comparable to a single run of a suboptimal dual solver. Our method is well-scalable and shows state-of-the-art results on computational benchmarks from machine learning and computer vision.}, author = {Shekhovtsov, Alexander and Swoboda, Paul and Savchynskyy, Bogdan}, issn = {01628828}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, number = {7}, pages = {1668--1682}, publisher = {IEEE}, title = {{Maximum persistency via iterative relaxed inference with graphical models}}, doi = {10.1109/TPAMI.2017.2730884}, volume = {40}, year = {2018}, } @article{705, abstract = {Although dopamine receptors D1 and D2 play key roles in hippocampal function, their synaptic localization within the hippocampus has not been fully elucidated. In order to understand precise functions of pre- or postsynaptic dopamine receptors (DRs), the development of protocols to differentiate pre- and postsynaptic DRs is essential. So far, most studies on determination and quantification of DRs did not discriminate between subsynaptic localization. Therefore, the aim of the study was to generate a robust workflow for the localization of DRs. This work provides the basis for future work on hippocampal DRs, in light that DRs may have different functions at pre- or postsynaptic sites. Synaptosomes from rat hippocampi isolated by a sucrose gradient protocol were prepared for super-resolution direct stochastic optical reconstruction microscopy (dSTORM) using Bassoon as a presynaptic zone and Homer1 as postsynaptic density marker. Direct labeling of primary validated antibodies against dopamine receptors D1 (D1R) and D2 (D2R) with Alexa Fluor 594 enabled unequivocal assignment of D1R and D2R to both, pre- and postsynaptic sites. D1R immunoreactivity clusters were observed within the presynaptic active zone as well as at perisynaptic sites at the edge of the presynaptic active zone. The results may be useful for the interpretation of previous studies and the design of future work on DRs in the hippocampus. Moreover, the reduction of the complexity of brain tissue by the use of synaptosomal preparations and dSTORM technology may represent a useful tool for synaptic localization of brain proteins.}, author = {Miklosi, Andras and Del Favero, Giorgia and Bulat, Tanja and Höger, Harald and Shigemoto, Ryuichi and Marko, Doris and Lubec, Gert}, journal = {Molecular Neurobiology}, number = {6}, pages = {4857 – 4869}, publisher = {Springer}, title = {{Super resolution microscopical localization of dopamine receptors 1 and 2 in rat hippocampal synaptosomes}}, doi = {10.1007/s12035-017-0688-y}, volume = {55}, year = {2018}, } @inproceedings{7116, abstract = {Training deep learning models has received tremendous research interest recently. In particular, there has been intensive research on reducing the communication cost of training when using multiple computational devices, through reducing the precision of the underlying data representation. Naturally, such methods induce system trade-offs—lowering communication precision could de-crease communication overheads and improve scalability; but, on the other hand, it can also reduce the accuracy of training. In this paper, we study this trade-off space, and ask:Can low-precision communication consistently improve the end-to-end performance of training modern neural networks, with no accuracy loss?From the performance point of view, the answer to this question may appear deceptively easy: compressing communication through low precision should help when the ratio between communication and computation is high. However, this answer is less straightforward when we try to generalize this principle across various neural network architectures (e.g., AlexNet vs. ResNet),number of GPUs (e.g., 2 vs. 8 GPUs), machine configurations(e.g., EC2 instances vs. NVIDIA DGX-1), communication primitives (e.g., MPI vs. NCCL), and even different GPU architectures(e.g., Kepler vs. Pascal). Currently, it is not clear how a realistic realization of all these factors maps to the speed up provided by low-precision communication. In this paper, we conduct an empirical study to answer this question and report the insights.}, author = {Grubic, Demjan and Tam, Leo and Alistarh, Dan-Adrian and Zhang, Ce}, booktitle = {Proceedings of the 21st International Conference on Extending Database Technology}, isbn = {9783893180783}, issn = {2367-2005}, location = {Vienna, Austria}, pages = {145--156}, publisher = {OpenProceedings}, title = {{Synchronous multi-GPU training for deep learning with low-precision communications: An empirical study}}, doi = {10.5441/002/EDBT.2018.14}, year = {2018}, } @inproceedings{7123, abstract = {Population protocols are a popular model of distributed computing, in which n agents with limited local state interact randomly, and cooperate to collectively compute global predicates. Inspired by recent developments in DNA programming, an extensive series of papers, across different communities, has examined the computability and complexity characteristics of this model. Majority, or consensus, is a central task in this model, in which agents need to collectively reach a decision as to which one of two states A or B had a higher initial count. Two metrics are important: the time that a protocol requires to stabilize to an output decision, and the state space size that each agent requires to do so. It is known that majority requires Ω(log log n) states per agent to allow for fast (poly-logarithmic time) stabilization, and that O(log2 n) states are sufficient. Thus, there is an exponential gap between the space upper and lower bounds for this problem. This paper addresses this question. On the negative side, we provide a new lower bound of Ω(log n) states for any protocol which stabilizes in O(n1–c) expected time, for any constant c > 0. This result is conditional on monotonicity and output assumptions, satisfied by all known protocols. Technically, it represents a departure from previous lower bounds, in that it does not rely on the existence of dense configurations. Instead, we introduce a new generalized surgery technique to prove the existence of incorrect executions for any algorithm which would contradict the lower bound. Subsequently, our lower bound also applies to general initial configurations, including ones with a leader. On the positive side, we give a new algorithm for majority which uses O(log n) states, and stabilizes in O(log2 n) expected time. Central to the algorithm is a new leaderless phase clock technique, which allows agents to synchronize in phases of Θ(n log n) consecutive interactions using O(log n) states per agent, exploiting a new connection between population protocols and power-of-two-choices load balancing mechanisms. We also employ our phase clock to build a leader election algorithm with a state space of size O(log n), which stabilizes in O(log2 n) expected time.}, author = {Alistarh, Dan-Adrian and Aspnes, James and Gelashvili, Rati}, booktitle = {Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms}, isbn = {9781611975031}, location = {New Orleans, LA, United States}, pages = {2221--2239}, publisher = {ACM}, title = {{Space-optimal majority in population protocols}}, doi = {10.1137/1.9781611975031.144}, year = {2018}, } @article{723, abstract = {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.}, author = {Oliveto, Pietro and Paixao, Tiago and Pérez Heredia, Jorge and Sudholt, Dirk and Trubenova, Barbora}, journal = {Algorithmica}, number = {5}, pages = {1604 -- 1633}, publisher = {Springer}, title = {{How to escape local optima in black box optimisation when non elitism outperforms elitism}}, doi = {10.1007/s00453-017-0369-2}, volume = {80}, year = {2018}, } @article{738, abstract = {This paper is devoted to automatic competitive analysis of real-time scheduling algorithms for firm-deadline tasksets, where only completed tasks con- tribute some utility to the system. Given such a taskset T , the competitive ratio of an on-line scheduling algorithm A for T is the worst-case utility ratio of A over the utility achieved by a clairvoyant algorithm. We leverage the theory of quantitative graph games to address the competitive analysis and competitive synthesis problems. For the competitive analysis case, given any taskset T and any finite-memory on- line scheduling algorithm A , we show that the competitive ratio of A in T can be computed in polynomial time in the size of the state space of A . Our approach is flexible as it also provides ways to model meaningful constraints on the released task sequences that determine the competitive ratio. We provide an experimental study of many well-known on-line scheduling algorithms, which demonstrates the feasibility of our competitive analysis approach that effectively replaces human ingenuity (required Preliminary versions of this paper have appeared in Chatterjee et al. ( 2013 , 2014 ). B Andreas Pavlogiannis pavlogiannis@ist.ac.at Krishnendu Chatterjee krish.chat@ist.ac.at Alexander Kößler koe@ecs.tuwien.ac.at Ulrich Schmid s@ecs.tuwien.ac.at 1 IST Austria (Institute of Science and Technology Austria), Am Campus 1, 3400 Klosterneuburg, Austria 2 Embedded Computing Systems Group, Vienna University of Technology, Treitlstrasse 3, 1040 Vienna, Austria 123 Real-Time Syst for finding worst-case scenarios) by computing power. For the competitive synthesis case, we are just given a taskset T , and the goal is to automatically synthesize an opti- mal on-line scheduling algorithm A , i.e., one that guarantees the largest competitive ratio possible for T . We show how the competitive synthesis problem can be reduced to a two-player graph game with partial information, and establish that the compu- tational complexity of solving this game is Np -complete. The competitive synthesis problem is hence in Np in the size of the state space of the non-deterministic labeled transition system encoding the taskset. Overall, the proposed framework assists in the selection of suitable scheduling algorithms for a given taskset, which is in fact the most common situation in real-time systems design. }, author = {Chatterjee, Krishnendu and Pavlogiannis, Andreas and Kößler, Alexander and Schmid, Ulrich}, journal = {Real-Time Systems}, number = {1}, pages = {166 -- 207}, publisher = {Springer}, title = {{Automated competitive analysis of real time scheduling with graph games}}, doi = {10.1007/s11241-017-9293-4}, volume = {54}, year = {2018}, } @inproceedings{7407, abstract = {Proofs of space (PoS) [Dziembowski et al., CRYPTO'15] are proof systems where a prover can convince a verifier that he "wastes" disk space. PoS were introduced as a more ecological and economical replacement for proofs of work which are currently used to secure blockchains like Bitcoin. In this work we investigate extensions of PoS which allow the prover to embed useful data into the dedicated space, which later can be recovered. Our first contribution is a security proof for the original PoS from CRYPTO'15 in the random oracle model (the original proof only applied to a restricted class of adversaries which can store a subset of the data an honest prover would store). When this PoS is instantiated with recent constructions of maximally depth robust graphs, our proof implies basically optimal security. As a second contribution we show three different extensions of this PoS where useful data can be embedded into the space required by the prover. Our security proof for the PoS extends (non-trivially) to these constructions. We discuss how some of these variants can be used as proofs of catalytic space (PoCS), a notion we put forward in this work, and which basically is a PoS where most of the space required by the prover can be used to backup useful data. Finally we discuss how one of the extensions is a candidate construction for a proof of replication (PoR), a proof system recently suggested in the Filecoin whitepaper. }, author = {Pietrzak, Krzysztof Z}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, isbn = {978-3-95977-095-8}, issn = {1868-8969}, location = {San Diego, CA, United States}, pages = {59:1--59:25}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Proofs of catalytic space}}, doi = {10.4230/LIPICS.ITCS.2019.59}, volume = {124}, year = {2018}, } @article{742, abstract = {We give a detailed and easily accessible proof of Gromov’s Topological Overlap Theorem. Let X be a finite simplicial complex or, more generally, a finite polyhedral cell complex of dimension d. Informally, the theorem states that if X has sufficiently strong higher-dimensional expansion properties (which generalize edge expansion of graphs and are defined in terms of cellular cochains of X) then X has the following topological overlap property: for every continuous map (Formula presented.) there exists a point (Formula presented.) that is contained in the images of a positive fraction (Formula presented.) of the d-cells of X. More generally, the conclusion holds if (Formula presented.) is replaced by any d-dimensional piecewise-linear manifold M, with a constant (Formula presented.) that depends only on d and on the expansion properties of X, but not on M.}, author = {Dotterrer, Dominic and Kaufman, Tali and Wagner, Uli}, journal = {Geometriae Dedicata}, number = {1}, pages = {307–317}, publisher = {Springer}, title = {{On expansion and topological overlap}}, doi = {10.1007/s10711-017-0291-4}, volume = {195}, year = {2018}, } @unpublished{75, abstract = {We prove that any convex body in the plane can be partitioned into m convex parts of equal areas and perimeters for any integer m≥2; this result was previously known for prime powers m=pk. We also give a higher-dimensional generalization.}, author = {Akopyan, Arseniy and Avvakumov, Sergey and Karasev, Roman}, publisher = {arXiv}, title = {{Convex fair partitions into arbitrary number of pieces}}, doi = {10.48550/arXiv.1804.03057}, year = {2018}, } @article{76, abstract = {Consider a fully-connected synchronous distributed system consisting of n nodes, where up to f nodes may be faulty and every node starts in an arbitrary initial state. In the synchronous C-counting problem, all nodes need to eventually agree on a counter that is increased by one modulo C in each round for given C>1. In the self-stabilising firing squad problem, the task is to eventually guarantee that all non-faulty nodes have simultaneous responses to external inputs: if a subset of the correct nodes receive an external “go” signal as input, then all correct nodes should agree on a round (in the not-too-distant future) in which to jointly output a “fire” signal. Moreover, no node should generate a “fire” signal without some correct node having previously received a “go” signal as input. We present a framework reducing both tasks to binary consensus at very small cost. For example, we obtain a deterministic algorithm for self-stabilising Byzantine firing squads with optimal resilience f<n/3, asymptotically optimal stabilisation and response time O(f), and message size O(log f). As our framework does not restrict the type of consensus routines used, we also obtain efficient randomised solutions.}, author = {Lenzen, Christoph and Rybicki, Joel}, journal = {Distributed Computing}, publisher = {Springer}, title = {{Near-optimal self-stabilising counting and firing squads}}, doi = {10.1007/s00446-018-0342-6}, year = {2018}, } @article{77, abstract = {Holes confined in quantum dots have gained considerable interest in the past few years due to their potential as spin qubits. Here we demonstrate two-axis control of a spin 3/2 qubit in natural Ge. The qubit is formed in a hut wire double quantum dot device. The Pauli spin blockade principle allowed us to demonstrate electric dipole spin resonance by applying a radio frequency electric field to one of the electrodes defining the double quantum dot. Coherent hole spin oscillations with Rabi frequencies reaching 140 MHz are demonstrated and dephasing times of 130 ns are measured. The reported results emphasize the potential of Ge as a platform for fast and electrically tunable hole spin qubit devices.}, author = {Watzinger, Hannes and Kukucka, Josip and Vukusic, Lada and Gao, Fei and Wang, Ting and Schäffler, Friedrich and Zhang, Jian and Katsaros, Georgios}, journal = {Nature Communications}, number = {3902 }, publisher = {Nature Publishing Group}, title = {{A germanium hole spin qubit}}, doi = {10.1038/s41467-018-06418-4}, volume = {9}, year = {2018}, } @article{456, abstract = {Inhibition of the endoplasmic reticulum stress pathway may hold the key to Zika virus-associated microcephaly treatment. }, author = {Novarino, Gaia}, journal = {Science Translational Medicine}, number = {423}, publisher = {American Association for the Advancement of Science}, title = {{Zika-associated microcephaly: Reduce the stress and race for the treatment}}, doi = {10.1126/scitranslmed.aar7514}, volume = {10}, year = {2018}, } @article{457, abstract = {Temperate bacteriophages integrate in bacterial genomes as prophages and represent an important source of genetic variation for bacterial evolution, frequently transmitting fitness-augmenting genes such as toxins responsible for virulence of major pathogens. However, only a fraction of bacteriophage infections are lysogenic and lead to prophage acquisition, whereas the majority are lytic and kill the infected bacteria. Unless able to discriminate lytic from lysogenic infections, mechanisms of immunity to bacteriophages are expected to act as a double-edged sword and increase the odds of survival at the cost of depriving bacteria of potentially beneficial prophages. We show that although restriction-modification systems as mechanisms of innate immunity prevent both lytic and lysogenic infections indiscriminately in individual bacteria, they increase the number of prophage-acquiring individuals at the population level. We find that this counterintuitive result is a consequence of phage-host population dynamics, in which restriction-modification systems delay infection onset until bacteria reach densities at which the probability of lysogeny increases. These results underscore the importance of population-level dynamics as a key factor modulating costs and benefits of immunity to temperate bacteriophages}, author = {Pleska, Maros and Lang, Moritz and Refardt, Dominik and Levin, Bruce and Guet, Calin C}, journal = {Nature Ecology and Evolution}, number = {2}, pages = {359 -- 366}, publisher = {Springer Nature}, title = {{Phage-host population dynamics promotes prophage acquisition in bacteria with innate immunity}}, doi = {10.1038/s41559-017-0424-z}, volume = {2}, year = {2018}, } @article{458, abstract = {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.}, author = {Akopyan, Arseniy and Bobenko, Alexander}, journal = {Transactions of the American Mathematical Society}, number = {4}, pages = {2825 -- 2854}, publisher = {American Mathematical Society}, title = {{Incircular nets and confocal conics}}, doi = {10.1090/tran/7292}, volume = {370}, year = {2018}, } @article{46, abstract = {We analyze a disordered central spin model, where a central spin interacts equally with each spin in a periodic one-dimensional (1D) random-field Heisenberg chain. If the Heisenberg chain is initially in the many-body localized (MBL) phase, we find that the coupling to the central spin suffices to delocalize the chain for a substantial range of coupling strengths. We calculate the phase diagram of the model and identify the phase boundary between the MBL and ergodic phase. Within the localized phase, the central spin significantly enhances the rate of the logarithmic entanglement growth and its saturation value. We attribute the increase in entanglement entropy to a nonextensive enhancement of magnetization fluctuations induced by the central spin. Finally, we demonstrate that correlation functions of the central spin can be utilized to distinguish between MBL and ergodic phases of the 1D chain. Hence, we propose the use of a central spin as a possible experimental probe to identify the MBL phase.}, author = {Hetterich, Daniel and Yao, Norman and Serbyn, Maksym and Pollmann, Frank and Trauzettel, Björn}, journal = {Physical Review B}, number = {16}, publisher = {American Physical Society}, title = {{Detection and characterization of many-body localization in central spin models}}, doi = {10.1103/PhysRevB.98.161122}, volume = {98}, year = {2018}, } @article{461, abstract = {Turbulence is the major cause of friction losses in transport processes and it is responsible for a drastic drag increase in flows over bounding surfaces. While much effort is invested into developing ways to control and reduce turbulence intensities, so far no methods exist to altogether eliminate turbulence if velocities are sufficiently large. We demonstrate for pipe flow that appropriate distortions to the velocity profile lead to a complete collapse of turbulence and subsequently friction losses are reduced by as much as 90%. Counterintuitively, the return to laminar motion is accomplished by initially increasing turbulence intensities or by transiently amplifying wall shear. Since neither the Reynolds number nor the shear stresses decrease (the latter often increase), these measures are not indicative of turbulence collapse. Instead, an amplification mechanism measuring the interaction between eddies and the mean shear is found to set a threshold below which turbulence is suppressed beyond recovery.}, author = {Kühnen, Jakob and Song, Baofang and Scarselli, Davide and Budanur, Nazmi B and Riedl, Michael and Willis, Ashley and Avila, Marc and Hof, Björn}, journal = {Nature Physics}, pages = {386--390}, publisher = {Nature Publishing Group}, title = {{Destabilizing turbulence in pipe flow}}, doi = {10.1038/s41567-017-0018-3}, volume = {14}, year = {2018}, } @article{462, abstract = {AtNHX5 and AtNHX6 are endosomal Na+,K+/H+ antiporters that are critical for growth and development in Arabidopsis, but the mechanism behind their action remains unknown. Here, we report that AtNHX5 and AtNHX6, functioning as H+ leak, control auxin homeostasis and auxin-mediated development. We found that nhx5 nhx6 exhibited growth variations of auxin-related defects. We further showed that nhx5 nhx6 was affected in auxin homeostasis. Genetic analysis showed that AtNHX5 and AtNHX6 were required for the function of the ER-localized auxin transporter PIN5. Although AtNHX5 and AtNHX6 were co-localized with PIN5 at ER, they did not interact directly. Instead, the conserved acidic residues in AtNHX5 and AtNHX6, which are essential for exchange activity, were required for PIN5 function. AtNHX5 and AtNHX6 regulated the pH in ER. Overall, AtNHX5 and AtNHX6 may regulate auxin transport across the ER via the pH gradient created by their transport activity. H+-leak pathway provides a fine-tuning mechanism that controls cellular auxin fluxes. }, author = {Fan, Ligang and Zhao, Lei and Hu, Wei and Li, Weina and Novák, Ondřej and Strnad, Miroslav and Simon, Sibu and Friml, Jirí and Shen, Jinbo and Jiang, Liwen and Qiu, Quan}, journal = {Plant, Cell and Environment}, pages = {850 -- 864}, publisher = {Wiley-Blackwell}, title = {{NHX antiporters regulate the pH of endoplasmic reticulum and auxin-mediated development}}, doi = {10.1111/pce.13153}, volume = {41}, year = {2018}, } @article{47, abstract = {Plant hormones as signalling molecules play an essential role in the control of plant growth and development. Typically, sites of hormonal action are usually distant from the site of biosynthesis thus relying on efficient transport mechanisms. Over the last decades, molecular identification of proteins and protein complexes involved in hormonal transport has started. Advanced screens for genes involved in hormonal transport in combination with transport assays using heterologous systems such as yeast, insect, or tobacco BY2 cells or Xenopus oocytes provided important insights into mechanisms underlying distribution of hormones in plant body and led to identification of principal transporters for each hormone. This review gives a short overview of the mechanisms of hormonal transport and transporters identified in Arabidopsis thaliana.}, author = {Abualia, Rashed and Benková, Eva and Lacombe, Benoît}, journal = {Advances in Botanical Research}, pages = {115 -- 138}, publisher = {Elsevier}, title = {{Transporters and mechanisms of hormone transport in arabidopsis}}, doi = {10.1016/bs.abr.2018.09.007}, volume = {87}, year = {2018}, }