首页> 美国卫生研究院文献>Bioinformatics >CHRR: coordinate hit-and-run with rounding for uniform sampling of constraint-based models
【2h】

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

机译:CHRR:通过四舍五入来协调即点即用以统一采样基于约束的模型

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

SummaryIn 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.
机译:总结在基于约束的代谢建模中,物理和生化约束定义了可行通量向量的多面体凸集。该集合的均匀采样提供了生化网络代谢功能的无偏特征。但是,由于基因组规模的生化网络的高维和固有的各向异性,对其进行可靠的均匀采样是一项挑战。在这里,我们介绍了一种新的采样算法的实现,该算法以四舍五入的方式协调即插即用(CHRR)。该算法基于可证明的高效运行随机游走,并严格使用预处理步骤对各向异性磁通集进行取整。 CHRR可证明收敛到均匀的固定采样分布。我们将其应用于维数增加的代谢网络。我们显示,它的收敛速度比流行的人工居中即点即用算法快几倍,可对基因组规模的生化网络进行可靠且易于处理的采样。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号