Journal
COMPUTATIONAL BIOLOGY AND CHEMISTRY
Volume 32, Issue 2, Pages 131-138Publisher
ELSEVIER SCI LTD
DOI: 10.1016/j.compbiolchem.2007.09.007
Keywords
structural information content; graph entropy; information theory; gene networks; chemical graph theory
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available