Imperial College London
Portrait Picture

DrLeonidChindelevitch

Faculty of Medicine, School of Public Health

Lecturer in Infectious Disease Epidemiology
 
 
 
//

Contact

 

l.chindelevitch Website

 
 
//

Location

 

Sir Michael Uren HubWhite City Campus

//

Summary

 

Publications

Citation

BibTex format

@article{Miraskarshahi:2019:bioinformatics/btz393,
author = {Miraskarshahi, R and Zabeti, H and Stephen, T and Chindelevitch, L},
doi = {bioinformatics/btz393},
journal = {Bioinformatics},
pages = {i615--i623},
title = {MCS2: minimal coordinated supports for fast enumeration of minimal cut sets in metabolic networks},
url = {http://dx.doi.org/10.1093/bioinformatics/btz393},
volume = {35},
year = {2019}
}
Download

RIS format (EndNote, RefMan)

TY  - JOUR
AB  - Motivation:Constraint-based modeling of metabolic networks helps researchers gain insight into the metabolic processes of many organisms, both prokaryotic and eukaryotic. Minimal cut sets (MCSs) are minimal sets of reactions whose inhibition blocks a target reaction in a metabolic network. Most approaches for finding the MCSs in constrained-based models require, either as an intermediate step or as a byproduct of the calculation, the computation of the set of elementary flux modes (EFMs), a convex basis for the valid flux vectors in the network. Recently, Ballerstein et al. proposed a method for computing the MCSs of a network without first computing its EFMs, by creating a dual network whose EFMs are a superset of the MCSs of the original network. However, their dual network is always larger than the original network and depends on the target reaction. Here we propose the construction of a different dual network, which is typically smaller than the original network and is independent of the target reaction, for the same purpose. We prove the correctness of our approach, minimal coordinated support (MCS2), and describe how it can be modified to compute the few smallest MCSs for a given target reaction.Results:We compare MCS2 to the method of Ballerstein et al. and two other existing methods. We show that MCS2 succeeds in calculating the full set of MCSs in many models where other approaches cannot finish within a reasonable amount of time. Thus, in addition to its theoretical novelty, our approach provides a practical advantage over existing methods.Availability and implementation:MCS2 is freely available at https://github.com/RezaMash/MCS under the GNU 3.0 license.
AU  - Miraskarshahi,R
AU  - Zabeti,H
AU  - Stephen,T
AU  - Chindelevitch,L
DO  - bioinformatics/btz393
EP  - 623
PY  - 2019///
SN  - 1367-4803
SP  - 615
TI  - MCS2: minimal coordinated supports for fast enumeration of minimal cut sets in metabolic networks
T2  - Bioinformatics
UR  - http://dx.doi.org/10.1093/bioinformatics/btz393
UR  - http://hdl.handle.net/10044/1/86914
VL  - 35
ER  -
Download