CHRR: coordinate hit-and-run with rounding for uniform sampling of constraint-based models

被引:65
作者
Haraldsdottir, Hulda S. [1 ]
Cousins, Ben [2 ]
Thiele, Ines [1 ]
Fleming, Ronan M. T. [1 ]
Vempala, Santosh [2 ]
机构
[1] Univ Luxembourg, Luxembourg Ctr Syst Biomed, Belvaux, Luxembourg
[2] Georgia Inst Technol, Sch Comp Sci, Algorithms & Randomness Ctr, Atlanta, GA 30332 USA
关键词
VOLUME ALGORITHM; METABOLISM;
D O I
10.1093/bioinformatics/btx052
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
The Summary: In constraint-based metabolic modelling, physical and biochemical constraints define a polyhedral convex set of feasible flux vectors. Uniform sampling of this set provides an unbiased characterization of the metabolic capabilities of a biochemical network. However, reliable uniform sampling of genome-scale biochemical networks is challenging due to their high dimensionality and inherent anisotropy. Here, we present an implementation of a new sampling algorithm, coordinate hit-and-run with rounding (CHRR). This algorithm is based on the provably efficient hit-and-run random walk and crucially uses a preprocessing step to round the anisotropic flux set. CHRR provably converges to a uniform stationary sampling distribution. We apply it to metabolic networks of increasing dimensionality. We show that it converges several times faster than a popular artificial centering hit-and-run algorithm, enabling reliable and tractable sampling of genome-scale biochemical networks. Supplementary information: Supplementary data are available at Bioinformatics online.
引用
收藏
页码:1741 / 1743
页数:3
相关论文
共 15 条
[1]  
[Anonymous], 2013, Bayesian data analysis, third edition
[2]   HIT-AND-RUN ALGORITHMS FOR THE IDENTIFICATION OF NONREDUNDANT LINEAR INEQUALITIES [J].
BERBEE, HCP ;
BOENDER, CGE ;
KAN, AHGR ;
SCHEFFER, CL ;
SMITH, RL ;
TELGEN, J .
MATHEMATICAL PROGRAMMING, 1987, 37 (02) :184-207
[3]   Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs [J].
Burer, S ;
Monteiro, RDC ;
Zhang, Y .
SIAM JOURNAL ON OPTIMIZATION, 2001, 12 (02) :503-521
[4]   A practical volume algorithm [J].
Cousins B. ;
Vempala S. .
Mathematical Programming Computation, 2016, 8 (02) :133-160
[5]   Uniform Sampling of Steady States in Metabolic Networks: Heterogeneous Scales and Rounding [J].
De Martino, Daniele ;
Mori, Matteo ;
Parisi, Valerio .
PLOS ONE, 2015, 10 (04)
[6]   Direction choice for accelerated convergence in hit-and-run sampling [J].
Kaufman, DE ;
Smith, RL .
OPERATIONS RESEARCH, 1998, 46 (01) :84-95
[7]   Constraining the metabolic genotype-phenotype relationship using a phylogeny of in silico methods [J].
Lewis, Nathan E. ;
Nagarajan, Harish ;
Palsson, Bernhard O. .
NATURE REVIEWS MICROBIOLOGY, 2012, 10 (04) :291-305
[8]   Hit-and-run from a corner [J].
Lovász, L ;
Vempala, S .
SIAM JOURNAL ON COMPUTING, 2006, 35 (04) :985-1005
[9]   Simulated annealing in convex bodies and an O*(n4) volume algorithm [J].
Lovász, L ;
Vempala, S .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2006, 72 (02) :392-417
[10]   optGpSampler: An Improved Tool for Uniformly Sampling the Solution-Space of Genome-Scale Metabolic Networks [J].
Megchelenbrink, Wout ;
Huynen, Martijn ;
Marchiori, Elena .
PLOS ONE, 2014, 9 (02)