Novel topological descriptors for analyzing biological networks

被引:38
作者
Dehmer, Matthias M. [1 ]
Barbarini, Nicola N. [2 ]
Varmuza, Kurt K. [3 ]
Graber, Armin A. [1 ]
机构
[1] UMIT, Inst Bioinformat & Translat Res, A-6060 Hall In Tirol, Austria
[2] Univ Pavia, Dept Comp Sci & Syst, I-27100 Pavia, Italy
[3] Vienna Univ Technol, Inst Chem Engn, Lab Chemometr, A-1060 Vienna, Austria
关键词
INFORMATION-THEORY; CHEMICAL GRAPHS; INDEXES; CLASSIFICATION; ORGANIZATION; SIMILARITY; MODULARITY; DISTANCES; ALGORITHM; MUTAGENS;
D O I
10.1186/1472-6807-10-18
中图分类号
Q6 [生物物理学];
学科分类号
071011 ;
摘要
Background: Topological descriptors, other graph measures, and in a broader sense, graph-theoretical methods, have been proven as powerful tools to perform biological network analysis. However, the majority of the developed descriptors and graph-theoretical methods does not have the ability to take vertex-and edge-labels into account, e. g., atom-and bond-types when considering molecular graphs. Indeed, this feature is important to characterize biological networks more meaningfully instead of only considering pure topological information. Results: In this paper, we put the emphasis on analyzing a special type of biological networks, namely biochemical structures. First, we derive entropic measures to calculate the information content of vertex-and edge-labeled graphs and investigate some useful properties thereof. Second, we apply the mentioned measures combined with other well-known descriptors to supervised machine learning methods for predicting Ames mutagenicity. Moreover, we investigate the influence of our topological descriptors - measures for only unlabeled vs. measures for labeled graphs - on the prediction performance of the underlying graph classification problem. Conclusions: Our study demonstrates that the application of entropic measures to molecules representing graphs is useful to characterize such structures meaningfully. For instance, we have found that if one extends the measures for determining the structural information content of unlabeled graphs to labeled graphs, the uniqueness of the resulting indices is higher. Because measures to structurally characterize labeled graphs are clearly underrepresented so far, the further development of such methods might be valuable and fruitful for solving problems within biological network analysis.
引用
收藏
页数:17
相关论文
共 95 条
[51]   The large-scale organization of metabolic networks [J].
Jeong, H ;
Tombor, B ;
Albert, R ;
Oltvai, ZN ;
Barabási, AL .
NATURE, 2000, 407 (6804) :651-654
[52]   Exploration of biological network centralities with CentiBiN [J].
Junker, Bjoern H. ;
Koschuetzki, Dirk ;
Schreiber, Falk .
BMC BIOINFORMATICS, 2006, 7 (1)
[53]   Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs [J].
Kashtan, N ;
Itzkovitz, S ;
Milo, R ;
Alon, U .
BIOINFORMATICS, 2004, 20 (11) :1746-1758
[54]   An algorithm for finding maximal common subtopologies in a set of protein structures [J].
Koch, I ;
Lengauer, T ;
Wanke, E .
JOURNAL OF COMPUTATIONAL BIOLOGY, 1996, 3 (02) :289-306
[55]  
Kolaczyk ED, 2009, SPRINGER SER STAT, P1, DOI 10.1007/978-0-387-88146-1_1
[56]  
Konstantinova EV, 2003, INDIAN J CHEM A, V42, P1227
[57]  
KUBINYI H, 1993, HANSCH ANAL RELATED
[58]   Transcriptional regulatory networks in Saccharomyces cerevisiae [J].
Lee, TI ;
Rinaldi, NJ ;
Robert, F ;
Odom, DT ;
Bar-Joseph, Z ;
Gerber, GK ;
Hannett, NM ;
Harbison, CT ;
Thompson, CM ;
Simon, I ;
Zeitlinger, J ;
Jennings, EG ;
Murray, HL ;
Gordon, DB ;
Ren, B ;
Wyrick, JJ ;
Tagne, JB ;
Volkert, TL ;
Fraenkel, E ;
Gifford, DK ;
Young, RA .
SCIENCE, 2002, 298 (5594) :799-804
[59]   Predictive toxinology: An initial foray using calculated molecular descriptors to describe toxicity using saxitoxins as a model [J].
Llewellyn, Lyndon E. .
TOXICON, 2007, 50 (07) :901-913
[60]   Graph kernels for molecular structure-activity relationship analysis with support vector machines [J].
Mahé, P ;
Ueda, N ;
Akutsu, T ;
Perret, JL ;
Vert, JP .
JOURNAL OF CHEMICAL INFORMATION AND MODELING, 2005, 45 (04) :939-951