z-logo
open-access-imgOpen Access
CHRR: coordinate hit-and-run with rounding for uniform sampling of constraint-based models
Author(s) -
Hulda S. Haraldsdóttir,
Ben Cousins,
Ines Thiele,
Ronan M. T. Fleming,
Santosh Vempala
Publication year - 2017
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/btx052
Subject(s) - computer science , curse of dimensionality , sampling (signal processing) , preprocessor , rounding , constraint (computer aided design) , algorithm , set (abstract data type) , mathematical optimization , mathematics , artificial intelligence , geometry , filter (signal processing) , computer vision , programming language , operating system
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.

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

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom