Preferred Language
Articles
/
JheNaI8BVTCNdQwCb3ce
Impacts of Starvation Stress on Biofilm Formation and expression of Virulence Genes in Mono-and Mixed-species cultures of Pseudomonas Aeruginosa and Staphylococcus aureus
...Show More Authors

Staphylococcus aureus and Pseudomonas aeruginosa are the major globally distributed pathogens, which causes chronic and recalcitrant infections due to their capacity to produce biofilms in large part. Biofilm production represents a survival strategy in these species, allowing them to endure environmental stress by altering their gene expression to match their own survival needs. In this study, we co-cultured different clinical isolates of S. aureus and P. aeruginosa as mono- and mixed-species biofilms in a full-strength Brain Heart Infusion Broth (BHI) and in a 1000-fold diluted Brain Heart Infusion Broth (BHI/1000) using Microtiter plate assay and determination of colony-forming units. Furthermore, the effect of starvation stress on the expression of pslA and fnbA genes of both species was investigated using RT-PCR. This work indicated that starvation stress significantly increased the biofilm biomass and bacterial density in all mono and mixed biofilm-producing strains. Interestingly, co-culture biofilms exhibited higher resistance to starvation as compared to monoculture. The current results also showed that the expression of fnbA and pslA genes was up-regulated under starvation stress in mono-and coculture biofilm. meanwhile, up-regulates of both genes in co-culture biofilm was significantly higher than mono- species biofilm.

Scopus
Publication Date
Sun Apr 01 2012
Journal Name
2012 International Conference On Future Communication Networks
Efficient method to find the multiplicative inverse in GF (2<sup>m</sup>) using FPGA by exponentiation to (2<sup>k</sup>)
...Show More Authors

Crossref (1)
Crossref
Publication Date
Sun Apr 01 2012
Journal Name
2012 International Conference On Future Communication Networks
Efficient method to find the multiplicative inverse in GF (2<sup>m</sup>) using FPGA by exponentiation to (2<sup>k</sup>)
...Show More Authors

Multiplicative inverse in GF (2 m ) is a complex step in some important application such as Elliptic Curve Cryptography (ECC) and other applications. It operates by multiplying and squaring operation depending on the number of bits (m) in the field GF (2 m ). In this paper, a fast method is suggested to find inversion in GF (2 m ) using FPGA by reducing the number of multiplication operations in the Fermat's Theorem and transferring the squaring into a fast method to find exponentiation to (2 k ). In the proposed algorithm, the multiplicative inverse in GF(2 m ) is achieved by number of multiplications depending on log 2 (m) and each exponentiation is operates in a single clock cycle by generating a reduction matrix for high power of two ex

... Show More
View Publication
Scopus (1)
Crossref (1)
Scopus Crossref