...
首页> 外文期刊>Bioinformatics >CHRR: coordinate hit-and-run with rounding for uniform sampling of constraint-based models
【24h】

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

机译:CHRR:坐标命中和运行,舍入以统一采样的基于约束的模型

获取原文
获取原文并翻译 | 示例
           

摘要

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.
机译:摘要:在基于约束的代谢建模中,物理和生化约束定义了一种可行性通量矢量的多面体凸起集。 该组的均匀采样提供了生物化学网络的代谢能力的无偏见表征。 然而,由于其高维度和固有的各向异性,可靠性均匀的生物化学网络的均匀抽样是挑战性的。 在这里,我们介绍了一种新的采样算法的实现,使用舍入(CHRR)坐标命中和运行。 该算法基于可提供有效的击球和运行随机步行,并且大致使用预处理步骤来绕各向异性通量组。 Chrr可否收敛到统一的固定取样分布。 我们将其应用于增加维度的代谢网络。 我们表明它会收敛多次,比流行的人工居中命令算法快几倍,从而实现了基因组规模的生物化学网络的可靠和易于采样。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号