代谢网络自动绘制的快速网格布局算法  

A Fast Grid Layout Algorithm for Automatic Drawing Complex Metabolic Network

作　　者：何胜[1,2,3] 梅娟[1,2] 石贵阳[1,2] 王正祥[1,2] 李炜疆[1,2] 

机构地区：[1]江南大学生物工程学院,江苏无锡214122 [2]江南大学工业生物技术教育部重点实验室,江苏无锡214122 [3]江苏技术师范学院计算机科学与工程学院,江苏常州213001

出　　处：《食品与生物技术学报》2008年第5期86-90,共5页Journal of Food Science and Biotechnology

基　　金：国家863计划项目(2006AA020204);江苏技术师范学院青年科研基金项目(KYY06081)

摘　　要：描述众多代谢物之间的拓扑关系的代谢网络,是抽象的高维数据。为了帮助人们分析这些复杂的数据,需要开发高效的可视化算法。近年来日益引起关注的网格布局算法在代谢网络自动绘图中显示了很好的特性,其面临的一个主要问题是如何有效降低计算量以满足快速、准实时网络绘图的需求。作者提出了一种快速网格布局算法,采用邻域试探和扰动再优化的全局搜索策略,能够数秒内产生高质量的典型代谢网络布局,适用于更广泛的代谢网络可视化分析应用。Describing topological relationships between large amounts of metabolites, the metabolic networks are abstract, high dimensional data. Efficient visualization algorithm is necessary to aid human analyses of such complex data. Developed in recent years, grid layout exhibits good features in automatic drawing of metabolic networks and thus attracts increasing interests. A main challenge of grid layout algorithms is to decrease the high computational cost to satisfy the requirement of fast, nearly real-time network drawing. A fast grid layout algorithm using neighborhood-test search and re optimization-after-perturbation strategies were proposed. The new algorithm could produce high-quality layouts in a few seconds for typical large-scale metabolic networks and was suitable for more versatile applications for visual analysis of metabolic networks.

关 键 词：代谢网络 网格布局算法 绘图 可视化 

分 类 号：Q811.4[生物学—生物工程]