z-logo
open-access-imgOpen Access
Reconciling high-throughput gene essentiality data with metabolic network reconstructions
Author(s) -
Anna S. Blazier,
Jason A. Papin
Publication year - 2019
Publication title -
plos computational biology/plos computational biology
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 2.628
H-Index - 182
eISSN - 1553-7358
pISSN - 1553-734X
DOI - 10.1371/journal.pcbi.1006507
Subject(s) - identification (biology) , computational biology , biology , transposon mutagenesis , genome , gene , gene regulatory network , transposable element , metabolic network , genetics , gene expression , botany
The identification of genes essential for bacterial growth and survival represents a promising strategy for the discovery of antimicrobial targets. Essential genes can be identified on a genome-scale using transposon mutagenesis approaches; however, variability between screens and challenges with interpretation of essentiality data hinder the identification of both condition-independent and condition-dependent essential genes. To illustrate the scope of these challenges, we perform a large-scale comparison of multiple published Pseudomonas aeruginosa gene essentiality datasets, revealing substantial differences between the screens. We then contextualize essentiality using genome-scale metabolic network reconstructions and demonstrate the utility of this approach in providing functional explanations for essentiality and reconciling differences between screens. Genome-scale metabolic network reconstructions also enable a high-throughput, quantitative analysis to assess the impact of media conditions on the identification of condition-independent essential genes. Our computational model-driven analysis provides mechanistic insight into essentiality and contributes novel insights for design of future gene essentiality screens and the identification of core metabolic processes.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here