首页> 美国卫生研究院文献>BMC Bioinformatics >A new dynamical layout algorithm for complex biochemical reaction networks
【2h】

A new dynamical layout algorithm for complex biochemical reaction networks

机译:复杂生化反应网络的动态布局新算法

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

摘要

BackgroundTo study complex biochemical reaction networks in living cells researchers more and more rely on databases and computational methods. In order to facilitate computational approaches, visualisation techniques are highly important. Biochemical reaction networks, e.g. metabolic pathways are often depicted as graphs and these graphs should be drawn dynamically to provide flexibility in the context of different data. Conventional layout algorithms are not sufficient for every kind of pathway in biochemical research. This is mainly due to certain conventions to which biochemists/biologists are used to and which are not in accordance to conventional layout algorithms. A number of approaches has been developed to improve this situation. Some of these are used in the context of biochemical databases and make more or less use of the information in these databases to aid the layout process. However, visualisation becomes also more and more important in modelling and simulation tools which mostly do not offer additional connections to databases. Therefore, layout algorithms used in these tools have to work independently of any databases. In addition, all of the existing algorithms face some limitations with respect to the number of edge crossings when it comes to larger biochemical systems due to the interconnectivity of these. Last but not least, in some cases, biochemical conventions are not met properly.
机译:背景技术为了研究活细胞中复杂的生化反应网络,研究人员越来越依赖数据库和计算方法。为了促进计算方法,可视化技术非常重要。生化反应网络,例如代谢途径通常被描绘为图表,这些图表应动态绘制以在不同数据的情况下提供灵活性。传统的布局算法不足以用于生化研究中的每种途径。这主要是由于生物化学家/生物学家习惯于某些约定,而这些约定与常规布局算法不符。已经开发出许多方法来改善这种情况。其中一些在生化数据库中使用,或多或少地利用这些数据库中的信息来辅助布局过程。但是,可视化在建模和仿真工具中也变得越来越重要,这些工具大多不提供与数据库的附加连接。因此,这些工具中使用的布局算法必须独立于任何数据库工作。另外,由于较大的生化系统的互连性,所有现有算法在边缘交叉的数量方面都面临一些限制。最后但并非最不重要的一点是,在某些情况下,生化约定得不到适当满足。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号