Evolution in Quantum Leaps: Multiple Combinatorial Transfers of HPI and Other Genetic Modules in Enterobacteriaceae

نویسندگان

  • Armand Paauw
  • Maurine A. Leverstein-van Hall
  • Jan Verhoef
  • Ad C. Fluit
چکیده

Horizontal gene transfer is a key step in the evolution of Enterobacteriaceae. By acquiring virulence determinants of foreign origin, commensals can evolve into pathogens. In Enterobacteriaceae, horizontal transfer of these virulence determinants is largely dependent on transfer by plasmids, phages, genomic islands (GIs) and genomic modules (GMs). The High Pathogenicity Island (HPI) is a GI encoding virulence genes that can be transferred between different Enterobacteriaceae. We investigated the HPI because it was present in an Enterobacter hormaechei outbreak strain (EHOS). Genome sequence analysis showed that the EHOS contained an integration site for mobile elements and harbored two GIs and three putative GMs, including a new variant of the HPI (HPI-ICEEh1). We demonstrate, for the first time, that combinatorial transfers of GIs and GMs between Enterobacter cloacae complex isolates must have occurred. Furthermore, the excision and circularization of several combinations of the GIs and GMs was demonstrated. Because of its flexibility, the multiple integration site of mobile DNA can be considered an integration hotspot (IHS) that increases the genomic plasticity of the bacterium. Multiple combinatorial transfers of diverse combinations of the HPI and other genomic elements among Enterobacteriaceae may accelerate the generation of new pathogenic strains.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A new metaheuristic genetic-based placement algorithm for 2D strip packing

Given a container of fixed width, infinite height and a set of rectangular block, the 2D-strip packing problem consists of orthogonally placing all the rectangles such that the height is minimized. The position is subject to confinement of no overlapping of blocks. The problem is a complex NP-hard combinatorial optimization, thus a heuristic based on genetic algorithm is proposed to solve it. I...

متن کامل

Efficient Genetic Based Methods for Optimizing the Reversible and Quantum Logic Circuits

Various synthesis methods have been proposed in the literature for reversible and quantum logic circuits. However, there are few algorithms to optimize an existing circuit with multiple constraints simultaneously. In this paper, some heuristics in genetic algorithms (GA) to optimize a given circuit in terms of quantum cost, number of gates, location of garbage outputs, and delay, are proposed. ...

متن کامل

Efficient Genetic Based Methods for Optimizing the Reversible and Quantum Logic Circuits

Various synthesis methods have been proposed in the literature for reversible and quantum logic circuits. However, there are few algorithms to optimize an existing circuit with multiple constraints simultaneously. In this paper, some heuristics in genetic algorithms (GA) to optimize a given circuit in terms of quantum cost, number of gates, location of garbage outputs, and delay, are proposed. ...

متن کامل

Enterobacteria secrete an inhibitor of Pseudomonas virulence during clinical bacteriuria.

Escherichia coli and other Enterobacteriaceae are among the most common pathogens of the human urinary tract. Among the genetic gains of function associated with urinary E. coli isolates is the Yersinia high pathogenicity island (HPI), which directs the biosynthesis of yersiniabactin (Ybt), a virulence-associated metallophore. Using a metabolomics approach, we found that E. coli and other Enter...

متن کامل

An optimization technique for vendor selection with quantity discounts using Genetic Algorithm

Vendor selection decisions are complicated by the fact that various conflicting multi-objective factors must be considered in the decision making process. The problem of vendor selection becomes still more compli-cated with the inclusion of incremental discount pricing schedule. Such hard combinatorial problems when solved using meta heuristics produce near optimal solutions. This paper propose...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره 5  شماره 

صفحات  -

تاریخ انتشار 2010