@article{19, abstract = {Bacteria regulate genes to survive antibiotic stress, but regulation can be far from perfect. When regulation is not optimal, mutations that change gene expression can contribute to antibiotic resistance. It is not systematically understood to what extent natural gene regulation is or is not optimal for distinct antibiotics, and how changes in expression of specific genes quantitatively affect antibiotic resistance. Here we discover a simple quantitative relation between fitness, gene expression, and antibiotic potency, which rationalizes our observation that a multitude of genes and even innate antibiotic defense mechanisms have expression that is critically nonoptimal under antibiotic treatment. First, we developed a pooled-strain drug-diffusion assay and screened Escherichia coli overexpression and knockout libraries, finding that resistance to a range of 31 antibiotics could result from changing expression of a large and functionally diverse set of genes, in a primarily but not exclusively drug-specific manner. Second, by synthetically controlling the expression of single-drug and multidrug resistance genes, we observed that their fitness-expression functions changed dramatically under antibiotic treatment in accordance with a log-sensitivity relation. Thus, because many genes are nonoptimally expressed under antibiotic treatment, many regulatory mutations can contribute to resistance by altering expression and by activating latent defenses.}, author = {Palmer, Adam and Chait, Remy P and Kishony, Roy}, issn = {0737-4038}, journal = {Molecular Biology and Evolution}, number = {11}, pages = {2669 -- 2684}, publisher = {Oxford University Press}, title = {{Nonoptimal gene expression creates latent potential for antibiotic resistance}}, doi = {10.1093/molbev/msy163}, volume = {35}, year = {2018}, } @article{190, abstract = {The German cockroach, Blattella germanica, is a worldwide pest that infests buildings, including homes, restaurants, and hospitals, often living in unsanitary conditions. As a disease vector and producer of allergens, this species has major health and economic impacts on humans. Factors contributing to the success of the German cockroach include its resistance to a broad range of insecticides, immunity to many pathogens, and its ability, as an extreme generalist omnivore, to survive on most food sources. The recently published genome shows that B. germanica has an exceptionally high number of protein coding genes. In this study, we investigate the functions of the 93 significantly expanded gene families with the aim to better understand the success of B. germanica as a major pest despite such inhospitable conditions. We find major expansions in gene families with functions related to the detoxification of insecticides and allelochemicals, defense against pathogens, digestion, sensory perception, and gene regulation. These expansions might have allowed B. germanica to develop multiple resistance mechanisms to insecticides and pathogens, and enabled a broad, flexible diet, thus explaining its success in unsanitary conditions and under recurrent chemical control. The findings and resources presented here provide insights for better understanding molecular mechanisms that will facilitate more effective cockroach control.}, author = {Harrison, Mark and Arning, Nicolas and Kremer, Lucas and Ylla, Guillem and Belles, Xavier and Bornberg Bauer, Erich and Huylmans, Ann K and Jongepier, Evelien and Puilachs, Maria and Richards, Stephen and Schal, Coby}, journal = {Journal of Experimental Zoology Part B: Molecular and Developmental Evolution}, pages = {254--264}, publisher = {Wiley}, title = {{Expansions of key protein families in the German cockroach highlight the molecular basis of its remarkable success as a global indoor pest}}, doi = {10.1002/jez.b.22824}, volume = {330}, year = {2018}, } @article{192, abstract = {The phytohormone auxin is the information carrier in a plethora of developmental and physiological processes in plants(1). It has been firmly established that canonical, nuclear auxin signalling acts through regulation of gene transcription(2). Here, we combined microfluidics, live imaging, genetic engineering and computational modelling to reanalyse the classical case of root growth inhibition(3) by auxin. We show that Arabidopsis roots react to addition and removal of auxin by extremely rapid adaptation of growth rate. This process requires intracellular auxin perception but not transcriptional reprogramming. The formation of the canonical TIR1/AFB-Aux/IAA co-receptor complex is required for the growth regulation, hinting to a novel, non-transcriptional branch of this signalling pathway. Our results challenge the current understanding of root growth regulation by auxin and suggest another, presumably non-transcriptional, signalling output of the canonical auxin pathway.}, author = {Fendrych, Matyas and Akhmanova, Maria and Merrin, Jack and Glanc, Matous and Hagihara, Shinya and Takahashi, Koji and Uchida, Naoyuki and Torii, Keiko U and Friml, Jirí}, journal = {Nature Plants}, number = {7}, pages = {453 -- 459}, publisher = {Springer Nature}, title = {{Rapid and reversible root growth inhibition by TIR1 auxin signalling}}, doi = {10.1038/s41477-018-0190-1}, volume = {4}, year = {2018}, } @inproceedings{193, abstract = {We show attacks on five data-independent memory-hard functions (iMHF) that were submitted to the password hashing competition (PHC). Informally, an MHF is a function which cannot be evaluated on dedicated hardware, like ASICs, at significantly lower hardware and/or energy cost than evaluating a single instance on a standard single-core architecture. Data-independent means the memory access pattern of the function is independent of the input; this makes iMHFs harder to construct than data-dependent ones, but the latter can be attacked by various side-channel attacks. Following [Alwen-Blocki'16], we capture the evaluation of an iMHF as a directed acyclic graph (DAG). The cumulative parallel pebbling complexity of this DAG is a measure for the hardware cost of evaluating the iMHF on an ASIC. Ideally, one would like the complexity of a DAG underlying an iMHF to be as close to quadratic in the number of nodes of the graph as possible. Instead, we show that (the DAGs underlying) the following iMHFs are far from this bound: Rig.v2, TwoCats and Gambit each having an exponent no more than 1.75. Moreover, we show that the complexity of the iMHF modes of the PHC finalists Pomelo and Lyra2 have exponents at most 1.83 and 1.67 respectively. To show this we investigate a combinatorial property of each underlying DAG (called its depth-robustness. By establishing upper bounds on this property we are then able to apply the general technique of [Alwen-Block'16] for analyzing the hardware costs of an iMHF.}, author = {Alwen, Joel F and Gazi, Peter and Kamath Hosdurg, Chethan and Klein, Karen and Osang, Georg F and Pietrzak, Krzysztof Z and Reyzin, Lenoid and Rolinek, Michal and Rybar, Michal}, booktitle = {Proceedings of the 2018 on Asia Conference on Computer and Communication Security}, location = {Incheon, Republic of Korea}, pages = {51 -- 65}, publisher = {ACM}, title = {{On the memory hardness of data independent password hashing functions}}, doi = {10.1145/3196494.3196534}, year = {2018}, } @article{195, abstract = {We demonstrate that identical impurities immersed in a two-dimensional many-particle bath can be viewed as flux-tube-charged-particle composites described by fractional statistics. In particular, we find that the bath manifests itself as an external magnetic flux tube with respect to the impurities, and hence the time-reversal symmetry is broken for the effective Hamiltonian describing the impurities. The emerging flux tube acts as a statistical gauge field after a certain critical coupling. This critical coupling corresponds to the intersection point between the quasiparticle state and the phonon wing, where the angular momentum is transferred from the impurity to the bath. This amounts to a novel configuration with emerging anyons. The proposed setup paves the way to realizing anyons using electrons interacting with superfluid helium or lattice phonons, as well as using atomic impurities in ultracold gases.}, author = {Yakaboylu, Enderalp and Lemeshko, Mikhail}, journal = {Physical Review B - Condensed Matter and Materials Physics}, number = {4}, publisher = {American Physical Society}, title = {{Anyonic statistics of quantum impurities in two dimensions}}, doi = {10.1103/PhysRevB.98.045402}, volume = {98}, year = {2018}, } @article{19544, abstract = {Medicinal bioinorganic chemistry is a thriving field of drug research for cancer treatment. Transition metal complexes coordinated to essential biological scaffolds represent a highly promising class of compounds for design of novel target-specific therapeutics. We report here the biological evaluation of a novel Isatin-Schiff base derivative and its Cu(II) complex in several tumor cell lines by assessing their effects on cellular metabolism, real-time cell proliferation and induction of apoptosis. Further, the impact of compounds on the p53 protein and expression of its target genes, including MDM2, p21/CDKN1A, and PUMA was evaluated. Results obtained in this study provide further evidence in support of our prior data suggesting the p53-mediated mechanism of action for Isatin-Schiff base derivatives and their complexes and also shed light on potential use of these compounds for stimulation of apoptosis in breast cancer cells via activation of the pro-apoptotic PUMA gene.}, author = {Bulatov, Emil and Sayarova, Regina and Mingaleeva, Rimma and Miftakhova, Regina and Gomzikova, Marina and Ignatev, Iurii and Petukhov, Alexey and Davidovich, Pavel and Rizvanov, Albert and Barlev, Nickolai A.}, issn = {2058-7716}, journal = {Cell Death Discovery}, publisher = {Springer Nature}, title = {{Isatin-Schiff base-copper (II) complex induces cell death in p53-positive tumors}}, doi = {10.1038/s41420-018-0120-z}, volume = {4}, year = {2018}, } @article{19706, abstract = {The importance of astrocytic l-lactate (LL) for normal functioning of neural circuits such as those regulating learning/memory, sleep/wake state, autonomic homeostasis, or emotional behaviour is being increasingly recognised. l-Lactate can act on neurones as a metabolic or redox substrate, but transmembrane receptor targets are also emerging. A comparative review of the hydroxy-carboxylic acid receptor (HCA1, formerly known as GPR81), Olfactory Receptor Family 51 Subfamily E Member 2 (OR51E2), and orphan receptor GPR4 highlights differences in their LL sensitivity, pharmacology, intracellular coupling, and localisation in the brain. In addition, a putative Gs-coupled receptor on noradrenergic neurones, LLRx, which we previously postulated, remains to be identified. Next-generation sequencing revealed several orphan receptors expressed in locus coeruleus neurones. Screening of a selection of these suggests additional LL-sensitive receptors: GPR180 which inhibits and GPR137 which activates intracellular cyclic AMP signalling in response to LL in a heterologous expression system. To further characterise binding of LL at LLRx, we carried out a structure–activity relationship study which demonstrates that carboxyl and 2-hydroxyl moieties of LL are essential for triggering d-lactate-sensitive noradrenaline release in locus coeruleus, and that the size of the LL binding pocket is limited towards the methyl group position. The evidence accumulating to date suggests that LL acts via multiple receptor targets to modulate distinct brain functions.}, author = {Mosienko, Valentina and Rasooli-Nejad, Seyed and Kishi, Kasumi and De Both, Matt and Jane, David and Huentelman, Matt J. and Kasparov, Sergey and Teschemacher, Anja G.}, issn = {2571-6980}, journal = {Neuroglia}, number = {2}, pages = {365--380}, publisher = {MDPI}, title = {{Putative receptors underpinning L-Lactate signalling in locus coeruleus}}, doi = {10.3390/neuroglia1020025}, volume = {1}, year = {2018}, } @article{148, abstract = {Land plants evolved from charophytic algae, among which Charophyceae possess the most complex body plans. We present the genome of Chara braunii; comparison of the genome to those of land plants identified evolutionary novelties for plant terrestrialization and land plant heritage genes. C. braunii employs unique xylan synthases for cell wall biosynthesis, a phragmoplast (cell separation) mechanism similar to that of land plants, and many phytohormones. C. braunii plastids are controlled via land-plant-like retrograde signaling, and transcriptional regulation is more elaborate than in other algae. The morphological complexity of this organism may result from expanded gene families, with three cases of particular note: genes effecting tolerance to reactive oxygen species (ROS), LysM receptor-like kinases, and transcription factors (TFs). Transcriptomic analysis of sexual reproductive structures reveals intricate control by TFs, activity of the ROS gene network, and the ancestral use of plant-like storage and stress protection proteins in the zygote.}, author = {Nishiyama, Tomoaki and Sakayama, Hidetoshi and De Vries, Jan and Buschmann, Henrik and Saint Marcoux, Denis and Ullrich, Kristian and Haas, Fabian and Vanderstraeten, Lisa and Becker, Dirk and Lang, Daniel and Vosolsobě, Stanislav and Rombauts, Stephane and Wilhelmsson, Per and Janitza, Philipp and Kern, Ramona and Heyl, Alexander and Rümpler, Florian and Calderón Villalobos, Luz and Clay, John and Skokan, Roman and Toyoda, Atsushi and Suzuki, Yutaka and Kagoshima, Hiroshi and Schijlen, Elio and Tajeshwar, Navindra and Catarino, Bruno and Hetherington, Alexander and Saltykova, Assia and Bonnot, Clemence and Breuninger, Holger and Symeonidi, Aikaterini and Radhakrishnan, Guru and Van Nieuwerburgh, Filip and Deforce, Dieter and Chang, Caren and Karol, Kenneth and Hedrich, Rainer and Ulvskov, Peter and Glöckner, Gernot and Delwiche, Charles and Petrášek, Jan and Van De Peer, Yves and Friml, Jirí and Beilby, Mary and Dolan, Liam and Kohara, Yuji and Sugano, Sumio and Fujiyama, Asao and Delaux, Pierre Marc and Quint, Marcel and Theissen, Gunter and Hagemann, Martin and Harholt, Jesper and Dunand, Christophe and Zachgo, Sabine and Langdale, Jane and Maumus, Florian and Van Der Straeten, Dominique and Gould, Sven B and Rensing, Stefan}, journal = {Cell}, number = {2}, pages = {448 -- 464.e24}, publisher = {Cell Press}, title = {{The Chara genome: Secondary complexity and implications for plant terrestrialization}}, doi = {10.1016/j.cell.2018.06.033}, volume = {174}, year = {2018}, } @article{150, abstract = {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.}, author = {Dick, Robert and Zadrozny, Kaneil K and Xu, Chaoyi and Schur, Florian and Lyddon, Terri D and Ricana, Clifton L and Wagner, Jonathan M and Perilla, Juan R and Ganser, Pornillos Barbie K and Johnson, Marc C and Pornillos, Owen and Vogt, Volker}, issn = {1476-4687}, journal = {Nature}, number = {7719}, pages = {509–512}, publisher = {Nature Publishing Group}, title = {{Inositol phosphates are assembly co-factors for HIV-1}}, doi = {10.1038/s41586-018-0396-4}, volume = {560}, year = {2018}, } @article{152, abstract = {Complex I has an essential role in ATP production by coupling electron transfer from NADH to quinone with translocation of protons across the inner mitochondrial membrane. Isolated complex I deficiency is a frequent cause of mitochondrial inherited diseases. Complex I has also been implicated in cancer, ageing, and neurodegenerative conditions. Until recently, the understanding of complex I deficiency on the molecular level was limited due to the lack of high-resolution structures of the enzyme. However, due to developments in single particle cryo-electron microscopy (cryo-EM), recent studies have reported nearly atomic resolution maps and models of mitochondrial complex I. These structures significantly add to our understanding of complex I mechanism and assembly. The disease-causing mutations are discussed here in their structural context.}, author = {Fiedorczuk, Karol and Sazanov, Leonid A}, journal = {Trends in Cell Biology}, number = {10}, pages = {835 -- 867}, publisher = {Elsevier}, title = {{Mammalian mitochondrial complex I structure and disease causing mutations}}, doi = {10.1016/j.tcb.2018.06.006}, volume = {28}, year = {2018}, } @inbook{153, abstract = {Cells migrating in multicellular organisms steadily traverse complex three-dimensional (3D) environments. To decipher the underlying cell biology, current experimental setups either use simplified 2D, tissue-mimetic 3D (e.g., collagen matrices) or in vivo environments. While only in vivo experiments are truly physiological, they do not allow for precise manipulation of environmental parameters. 2D in vitro experiments do allow mechanical and chemical manipulations, but increasing evidence demonstrates substantial differences of migratory mechanisms in 2D and 3D. Here, we describe simple, robust, and versatile “pillar forests” to investigate cell migration in complex but fully controllable 3D environments. Pillar forests are polydimethylsiloxane-based setups, in which two closely adjacent surfaces are interconnected by arrays of micrometer-sized pillars. Changing the pillar shape, size, height and the inter-pillar distance precisely manipulates microenvironmental parameters (e.g., pore sizes, micro-geometry, micro-topology), while being easily combined with chemotactic cues, surface coatings, diverse cell types and advanced imaging techniques. Thus, pillar forests combine the advantages of 2D cell migration assays with the precise definition of 3D environmental parameters.}, author = {Renkawitz, Jörg and Reversat, Anne and Leithner, Alexander F and Merrin, Jack and Sixt, Michael K}, booktitle = {Methods in Cell Biology}, issn = {0091-679X}, pages = {79 -- 91}, publisher = {Academic Press}, title = {{Micro-engineered “pillar forests” to study cell migration in complex but controlled 3D environments}}, doi = {10.1016/bs.mcb.2018.07.004}, volume = {147}, year = {2018}, } @article{106, abstract = {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.}, author = {Akopyan, Arseniy and Petrunin, Anton}, journal = {Mathematical Intelligencer}, number = {3}, pages = {26 -- 31}, publisher = {Springer}, title = {{Long geodesics on convex surfaces}}, doi = {10.1007/s00283-018-9795-5}, volume = {40}, year = {2018}, } @article{1064, abstract = {In 1945, A.W. Goodman and R.E. Goodman proved the following conjecture by P. Erdős: Given a family of (round) disks of radii r1, … , rn in the plane, it is always possible to cover them by a disk of radius R= ∑ ri, provided they cannot be separated into two subfamilies by a straight line disjoint from the disks. In this note we show that essentially the same idea may work for different analogues and generalizations of their result. In particular, we prove the following: Given a family of positive homothetic copies of a fixed convex body K⊂ Rd with homothety coefficients τ1, … , τn> 0 , it is always possible to cover them by a translate of d+12(∑τi)K, provided they cannot be separated into two subfamilies by a hyperplane disjoint from the homothets.}, author = {Akopyan, Arseniy and Balitskiy, Alexey and Grigorev, Mikhail}, issn = {14320444}, journal = {Discrete & Computational Geometry}, number = {4}, pages = {1001--1009}, publisher = {Springer}, title = {{On the circle covering theorem by A.W. Goodman and R.E. Goodman}}, doi = {10.1007/s00454-017-9883-x}, volume = {59}, year = {2018}, } @article{107, abstract = {We introduce the notion of “non-malleable codes” which relaxes the notion of error correction and error detection. Informally, a code is non-malleable if the message contained in a modified codeword is either the original message, or a completely unrelated value. In contrast to error correction and error detection, non-malleability can be achieved for very rich classes of modifications. We construct an efficient code that is non-malleable with respect to modifications that affect each bit of the codeword arbitrarily (i.e., leave it untouched, flip it, or set it to either 0 or 1), but independently of the value of the other bits of the codeword. Using the probabilistic method, we also show a very strong and general statement: there exists a non-malleable code for every “small enough” family F of functions via which codewords can be modified. Although this probabilistic method argument does not directly yield efficient constructions, it gives us efficient non-malleable codes in the random-oracle model for very general classes of tampering functions—e.g., functions where every bit in the tampered codeword can depend arbitrarily on any 99% of the bits in the original codeword. As an application of non-malleable codes, we show that they provide an elegant algorithmic solution to the task of protecting functionalities implemented in hardware (e.g., signature cards) against “tampering attacks.” In such attacks, the secret state of a physical system is tampered, in the hopes that future interaction with the modified system will reveal some secret information. This problem was previously studied in the work of Gennaro et al. in 2004 under the name “algorithmic tamper proof security” (ATP). We show that non-malleable codes can be used to achieve important improvements over the prior work. In particular, we show that any functionality can be made secure against a large class of tampering attacks, simply by encoding the secret state with a non-malleable code while it is stored in memory.}, author = {Dziembowski, Stefan and Pietrzak, Krzysztof Z and Wichs, Daniel}, journal = {Journal of the ACM}, number = {4}, publisher = {ACM}, title = {{Non-malleable codes}}, doi = {10.1145/3178432}, volume = {65}, year = {2018}, } @inproceedings{108, abstract = {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.}, author = {Obremski, Marciej and Skorski, Maciej}, location = {Vail, CO, USA}, publisher = {IEEE}, title = {{Inverted leftover hash lemma}}, doi = {10.1109/ISIT.2018.8437654}, volume = {2018}, year = {2018}, } @inbook{10864, abstract = {We prove that every congruence distributive variety has directed Jónsson terms, and every congruence modular variety has directed Gumm terms. The directed terms we construct witness every case of absorption witnessed by the original Jónsson or Gumm terms. This result is equivalent to a pair of claims about absorption for admissible preorders in congruence distributive and congruence modular varieties, respectively. For finite algebras, these absorption theorems have already seen significant applications, but until now, it was not clear if the theorems hold for general algebras as well. Our method also yields a novel proof of a result by P. Lipparini about the existence of a chain of terms (which we call Pixley terms) in varieties that are at the same time congruence distributive and k-permutable for some k.}, author = {Kazda, Alexandr and Kozik, Marcin and McKenzie, Ralph and Moore, Matthew}, booktitle = {Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science}, editor = {Czelakowski, J}, isbn = {9783319747712}, issn = {2211-2766}, pages = {203--220}, publisher = {Springer Nature}, title = {{Absorption and directed Jónsson terms}}, doi = {10.1007/978-3-319-74772-9_7}, volume = {16}, year = {2018}, } @article{10880, abstract = {Acquisition of evolutionary novelties is a fundamental process for adapting to the external environment and invading new niches and results in the diversification of life, which we can see in the world today. How such novel phenotypic traits are acquired in the course of evolution and are built up in developing embryos has been a central question in biology. Whole-genome duplication (WGD) is a process of genome doubling that supplies raw genetic materials and increases genome complexity. Recently, it has been gradually revealed that WGD and subsequent fate changes of duplicated genes can facilitate phenotypic evolution. Here, we review the current understanding of the relationship between WGD and the acquisition of evolutionary novelties. We show some examples of this link and discuss how WGD and subsequent duplicated genes can facilitate phenotypic evolution as well as when such genomic doubling can be advantageous for adaptation.}, author = {Yuuta, Moriyama and Koshiba-Takeuchi, Kazuko}, issn = {2041-2657}, journal = {Briefings in Functional Genomics}, keywords = {Genetics, Molecular Biology, Biochemistry, General Medicine}, number = {5}, pages = {329--338}, publisher = {Oxford University Press}, title = {{Significance of whole-genome duplications on the emergence of evolutionary novelties}}, doi = {10.1093/bfgp/ely007}, volume = {17}, year = {2018}, } @article{10881, abstract = {Strigolactones (SLs) are a relatively recent addition to the list of plant hormones that control different aspects of plant development. SL signalling is perceived by an α/β hydrolase, DWARF 14 (D14). A close homolog of D14, KARRIKIN INSENSTIVE2 (KAI2), is involved in perception of an uncharacterized molecule called karrikin (KAR). Recent studies in Arabidopsis identified the SUPPRESSOR OF MAX2 1 (SMAX1) and SMAX1-LIKE 7 (SMXL7) to be potential SCF–MAX2 complex-mediated proteasome targets of KAI2 and D14, respectively. Genetic studies on SMXL7 and SMAX1 demonstrated distinct developmental roles for each, but very little is known about these repressors in terms of their sequence features. In this study, we performed an extensive comparative analysis of SMXLs and determined their phylogenetic and evolutionary history in the plant lineage. Our results show that SMXL family members can be sub-divided into four distinct phylogenetic clades/classes, with an ancient SMAX1. Further, we identified the clade-specific motifs that have evolved and that might act as determinants of SL-KAR signalling specificity. These specificities resulted from functional diversities among the clades. Our results suggest that a gradual co-evolution of SMXL members with their upstream receptors D14/KAI2 provided an increased specificity to both the SL perception and response in land plants.}, author = {Moturu, Taraka Ramji and Thula, Sravankumar and Singh, Ravi Kumar and Nodzyński, Tomasz and Vařeková, Radka Svobodová and Friml, Jiří and Simon, Sibu}, issn = {1460-2431}, journal = {Journal of Experimental Botany}, keywords = {Plant Science, Physiology}, number = {9}, pages = {2367--2378}, publisher = {Oxford University Press}, title = {{Molecular evolution and diversification of the SMXL gene family}}, doi = {10.1093/jxb/ery097}, volume = {69}, year = {2018}, } @inproceedings{10882, abstract = {We introduce Intelligent Annotation Dialogs for bounding box annotation. We train an agent to automatically choose a sequence of actions for a human annotator to produce a bounding box in a minimal amount of time. Specifically, we consider two actions: box verification [34], where the annotator verifies a box generated by an object detector, and manual box drawing. We explore two kinds of agents, one based on predicting the probability that a box will be positively verified, and the other based on reinforcement learning. We demonstrate that (1) our agents are able to learn efficient annotation strategies in several scenarios, automatically adapting to the image difficulty, the desired quality of the boxes, and the detector strength; (2) in all scenarios the resulting annotation dialogs speed up annotation compared to manual box drawing alone and box verification alone, while also outperforming any fixed combination of verification and drawing in most scenarios; (3) in a realistic scenario where the detector is iteratively re-trained, our agents evolve a series of strategies that reflect the shifting trade-off between verification and drawing as the detector grows stronger.}, author = {Uijlings, Jasper and Konyushkova, Ksenia and Lampert, Christoph and Ferrari, Vittorio}, booktitle = {2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition}, isbn = {9781538664209}, issn = {2575-7075}, location = {Salt Lake City, UT, United States}, pages = {9175--9184}, publisher = {IEEE}, title = {{Learning intelligent dialogs for bounding box annotation}}, doi = {10.1109/cvpr.2018.00956}, year = {2018}, } @inproceedings{10883, abstract = {Solving parity games, which are equivalent to modal μ-calculus model checking, is a central algorithmic problem in formal methods, with applications in reactive synthesis, program repair, verification of branching-time properties, etc. Besides the standard compu- tation model with the explicit representation of games, another important theoretical model of computation is that of set-based symbolic algorithms. Set-based symbolic algorithms use basic set operations and one-step predecessor operations on the implicit description of games, rather than the explicit representation. The significance of symbolic algorithms is that they provide scalable algorithms for large finite-state systems, as well as for infinite-state systems with finite quotient. Consider parity games on graphs with n vertices and parity conditions with d priorities. While there is a rich literature of explicit algorithms for parity games, the main results for set-based symbolic algorithms are as follows: (a) the basic algorithm that requires O(nd) symbolic operations and O(d) symbolic space; and (b) an improved algorithm that requires O(nd/3+1) symbolic operations and O(n) symbolic space. In this work, our contributions are as follows: (1) We present a black-box set-based symbolic algorithm based on the explicit progress measure algorithm. Two important consequences of our algorithm are as follows: (a) a set-based symbolic algorithm for parity games that requires quasi-polynomially many symbolic operations and O(n) symbolic space; and (b) any future improvement in progress measure based explicit algorithms immediately imply an efficiency improvement in our set-based symbolic algorithm for parity games. (2) We present a set-based symbolic algorithm that requires quasi-polynomially many symbolic operations and O(d · log n) symbolic space. Moreover, for the important special case of d ≤ log n, our algorithm requires only polynomially many symbolic operations and poly-logarithmic symbolic space.}, author = {Chatterjee, Krishnendu and Dvořák, Wolfgang and Henzinger, Monika H and Svozil, Alexander}, booktitle = {22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning}, issn = {2398-7340}, location = {Awassa, Ethiopia}, pages = {233--253}, publisher = {EasyChair}, title = {{Quasipolynomial set-based symbolic algorithms for parity games}}, doi = {10.29007/5z5k}, volume = {57}, year = {2018}, }