gMCS: fast computation of genetic minimal cut sets in large networks | Zendy

Iñigo Apaolaza | Zendy; Luis V. Valcárcel | Zendy; Francisco J. Planes | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

gMCS: fast computation of genetic minimal cut sets in large networks

Author(s) -

Iñigo Apaolaza,

Luis V. Valcárcel,

Francisco J. Planes

Publication year - 2018

Publication title -

bioinformatics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 3.599

H-Index - 390

eISSN - 1367-4811

pISSN - 1367-4803

DOI - 10.1093/bioinformatics/bty656

Subject(s) - computer science , toolbox , tree (set theory) , identification (biology) , computation , task (project management) , reduction (mathematics) , cobra , constraint (computer aided design) , theoretical computer science , computational biology , algorithm , data mining , programming language , biology , mathematics , mathematical analysis , botany , geometry , management , economics

The identification of minimal gene knockout strategies to engineer metabolic systems constitutes one of the most relevant applications of the COnstraint-Based Reconstruction and Analysis (COBRA) framework. In the last years, the minimal cut sets (MCSs) approach has emerged as a promising tool to carry out this task. However, MCSs define reaction knockout strategies, which are not necessarily transformed into feasible strategies at the gene level.

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

Accelerating Research