期刊
COMPUTATIONAL BIOLOGY AND CHEMISTRY
卷 32, 期 2, 页码 131-138出版社
ELSEVIER SCI LTD
DOI: 10.1016/j.compbiolchem.2007.09.007
关键词
structural information content; graph entropy; information theory; gene networks; chemical graph theory
In this paper we define the structural information content of graphs as their corresponding graph entropy. This definition is based on local vertex functionals obtained by calculating-spheres via the algorithm of Dijkstra. We prove that the graph entropy and, hence, the local vertex functionals can be computed with polynomial time complexity enabling the application of our measure for large graphs. In this paper we present numerical results for the graph entropy of chemical graphs and discuss resulting properties. (C) 2007 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据