References

• 1. 1)
     • E. Ravasz , J. Mcdermott , R. Samudrala , R. Bumgarner , K. Montgomery , R. Ireton . (2009) Detecting hierarchical modularity in biological networks, Computer system biology.
  2. 2)
     • Laubenbacher, R.C.: `Modeling and simulation of biological networks', Proc. Symp. on Applied Mathematics, 2007.
  3. 3)
     • S.N. Dorogovtsev , J.F.F. Mendes . (2003) Evolution of networks. from biological networks to the internet and WWW.
  4. 4)
     • F. Harary . (1967) Graph theory and theoretical physics.
  5. 5)
     • P.J. Dickinson , H. Bunke , A. Dadej , M. Kraetzl . Matching graphs with unique node labels. Pattern Analysis Applications , 243 - 266
  6. 6)
     • B. Aranda , P. Achuthan , Y. Alam-Faruque . The IntAct molecular interaction database in 2010. Nucl. Acids Res.
  7. 7)
     • M. Rosvall , C.T. Bergstrom . An information-theoretic framework for resolving community structure in complex networks. Proc. Natl Acad. Sci. USA , 18 , 7327 - 31
  8. 8)
     • S.I. Berger , R. Iyengar . Network analyses in systems pharmacology. Bioinf. , 19 , 2466 - 2472
  9. 9)
     • F. Emmert-Streib , M. Dehmer . Topolocial mappings between graphs, trees and generalized trees. Appl. Math. Comput. , 2 , 1326 - 1333
  10. 10)
      • D. Minoli . Combinatorial graph complexity. Atti. Accad. Naz. Lincei, VIII. Ser., Rend., Cl. Sci. Fis. Mat. Nat. , 651 - 661
  11. 11)
      • H. Yu , P.M. Kim , E. Sprecher , V. Trifonov , M. Gerstein . The importance of bottlenecks in protein networks: correlation with gene essentiality and expression dynamics. PLoS Comput. Biol. , 4
  12. 12)
      • J. Chen , B. Aronow , A. Jegga . Disease candidate gene identification and prioritization using protein interaction networks. BMC Bioinf. , 1
  13. 13)
      • P. Bonacich . Factoring and weighting approaches to status scores and clique identification. J. Math. Soc. , 113 - 120
  14. 14)
      • J. Wang , G. Provan , J. Zhou . (2009) Characterizing the structural complexity of realworld complex networks.
  15. 15)
      • R.V. Solé , J.M. Montoya . Complexity and fragility in ecological networks. Proc. R. Soc. London B , 2039 - 2045
  16. 16)
      • M. Cosentino Lagomarsino , P. Jona , B. Bassetti , H. Isambert . Hierarchy and feedback in the evolution of the Escherichia coli transcription network. Proc. National Academy of Sciences , 13 , 5516 - 5520
  17. 17)
      • T.J. Hastie , R.J. Tibshirani , J. Friedman . (2001) The elements of statistical learning.
  18. 18)
      • T. Wilhelm , H.-P. Nasheuer , S. Huang . Physical and functional modularity of the protein network in yeast. Mol. Cell. Proteom. , 5 , 292 - 298
  19. 19)
      • E.W. Dijkstra . A note on two problems in connexion with graphs. Numerische mathematik , 269 - 271
  20. 20)
      • S. Wasserman , K. Faust . (1994) Social network analysis.
  21. 21)
      • D. König . (1936) Theorie der endlichen und unendlichen graphen.
  22. 22)
      • T. Nogrady , D.F. Weaver . (2005) Medicinal chemistry: a molecular and biochemical approach.
  23. 23)
      • M. Blatt , S. Wiseman , E. Domany . Superparamagnetic clustering of data. Phys. Rev. Lett. , 18 , 3251 - 3254
  24. 24)
      • M. Zaslavskiy , F. Bach , J.P. Vert . Global alignment of protein–protein interaction networks by graph matching methods. Bioinformatics , 12 , 1259 - 1267
  25. 25)
      • P. Pagel , S. Kovac , M. Oesterheld . The MIPS mammalian protein–protein interaction database. Bioinformatics , 6 , 832 - 834
  26. 26)
      • G. Gallo , G. Longo , S. Pallottino . Directed hypergraphs and applications. Discrete Appl. Math. , 2 , 177 - 201
  27. 27)
      • S. Jukna . On graph complexity. Comb. Probab. Comput. , 855 - 876
  28. 28)
      • T. Ihringer . (1994) Diskrete mathematik.
  29. 29)
      • E. Sommerfeld . (1994) Kognitive strukturen.
  30. 30)
      • T.H. Cormen , C.E. Leiserson , R.L. Rivest , C. Stein . (2009) Introduction to algorithms.
  31. 31)
      • L. Euler . Solutio problematis ad geometriam situs pertinentis. Comment. Acad. Sci. U. Petrop. , 128 - 140
  32. 32)
      • M. Behzad , G. Chartrand , L. Lesniak-Foster . (1979) Graphs and digraphs. International Series. Prindle.
  33. 33)
      • F. Olken . Graph data management for molecular biology. OMICS: J. Integrative Biol. , 1 , 75 - 78
  34. 34)
      • D. Cook , L.B. Holder . (2007) Mining graph data.
  35. 35)
      • G.H. Bakir , T. Hofmann , B. Schlkopf , A.J. Smola , B. Taskar , S.V.N. Vishwanathan . (2007) Predicting structured data.
  36. 36)
      • A. Wagner . The yeast protein interaction network evolves rapidly and contains few redundant duplicate genes. Mol. Biol. Evol. , 7 , 1283 - 1292
  37. 37)
      • S.L. Lauritzen , A.C. Atkinson , R.J. Carroll , D.J. Hand , D.A. Pierce , D.M. Titterington . (1996) Graphical models.
  38. 38)
      • F. Emmert-Streib , M. Dehmer . (2008) Analysis of microarray data: a network-based approach.
  39. 39)
      • J.L. Gross , J. Yellen . (1999) Graph theory and its applications.
  40. 40)
      • O. Mason , M. Verwoerd . Graph theory and networks in biology. IET Syst. Biol. , 2 , 89 - 119
  41. 41)
      • A. Mowshowitz , V. Mitsou , M. Dehmer , F. Emmert-Streib . (2009) Entropy, orbits and spectra of graphs.
  42. 42)
      • B. Zelinka . On a certain distance between isomorphism classes of graphs. Časopis pro p̌est. Mathematiky , 371 - 373
  43. 43)
      • M.E.J. Newman , M. Girvan . Finding and evaluating community structure in networks. Phys. Rev. E
  44. 44)
      • P. Lambrix , W. Dubitzky , F. Azuaje . (2006) Ontologies in bioinformatics and systems biology.
  45. 45)
      • V.A. Skorobogatov , A.A. Dobrynin . Metrical analysis of graphs. Commun. Math. Comp. Chem. , 105 - 155
  46. 46)
      • M. Li , P. Vitanyi . (1993) An introduction to Kolmogorov complexity and its applications.
  47. 47)
      • N. Pržulj . Network comparison using graphlet degree distribution. Bioinformatics , e177 - e183
  48. 48)
      • H.-W. Hong-Wu Ma , J. Buer , A.-P. Zeng . Hierarchical structure and modules in the escherichia coli transcriptional regulatory network revealed by a new top-down approach. BMC Bioinf.
  49. 49)
      • N. Kashtan , S. Itzkovitz , R. Milo , U. Alon . Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs. Bioinformatics , 11 , 1746 - 1758
  50. 50)
      • S. Bornholdt , H.G. Schuster . (2003) Handbook of graphs and networks: from the genome to the internet.
  51. 51)
      • V. van Noort , B. Snel , M.A. Huymen . The yeast coexpression network has a small-world, scale-free architecture and can be explained by a simple model. EMBO Rep. , 3 , 280 - 284
  52. 52)
      • A.A. Margolin , I. Nemenman , K. Basso . ARACNE: an algorithm for the reconstruction of gene regulatory networks in a mammalian cellular context. BMC Bioinf.
  53. 53)
      • L. von Bertalanffy . (1968) General system theory: foundation, development, application.
  54. 54)
      • B.D. McKay . Graph isomorphisms. Cong. Numerantium , 45 - 87
  55. 55)
      • B.-J. Breitkreutz , C. Stark , T. Reguly . The BioGRID Interaction Database: 2008 update. Nucl. Acids Res. , D637 - 640
  56. 56)
      • S. Toda . Graph isomorphism: its complexity and algorithms (abstract).
  57. 57)
      • Borgs, C., Chayes, J., Lovász, L., Sós, V.T., Szegedy, B., Vesztergombi, K.: `Graph limits and parameter testing', Proc. 38th Ann. ACM Symp. on Theory of Computing, 2006, Seattle, WA, USA, p. 261–270.
  58. 58)
      • A. Robles-Kelly , R. Hancock . Graph edit distance from spectral seriation. IEEE Trans. Pattern Anal. Mach. Intell. , 3 , 365 - 378
  59. 59)
      • X.-W. Chen , G. Anantha , X. Wang . An effective structure learning method for constructing gene networks. Bioinformatics , 11 , 1367 - 1374
  60. 60)
      • E. Ravasz , A.L. Somera , D.A. Mongru , Z.N. Oltvai , A.L. Barabasi . Hierarchical organization of modularity in metabolic networks. Science , 1551 - 1555
  61. 61)
      • P.H. Winne , L. Gupta , J.C. Nesbit . Exploring individual differences in studying strategies using graph theoretic statistics. Alberta J. Edu. Res. , 177 - 193
  62. 62)
      • Horváth, T., Gärtner, T., Wrobel, S.: `Cyclic pattern kernels for predictive graph mining', Proc. 2004 ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, 2004, p. 158–167.
  63. 63)
      • L. Antiqueira , L.F. Costa da . Characterization of subgraph relationships and distribution in complex networks. New J. Phys.
  64. 64)
      • A. Cayley . (1875) On the analytical forms called trees, with application to the theory of chemical combinatorics.
  65. 65)
      • M. Brinkmeier , T. Schank , U. Brandes , T. Erlebach . (2005) Network statistics, Network analysis.
  66. 66)
      • A.L. Barabasi , R. Albert . Emergence of scaling in random networks. Science , 509 - 512
  67. 67)
      • A.D. King , N. Przulj , I. Jurisica . Protein complex prediction via cost-based clustering. Bioinformatics , 17 , 3013 - 3020
  68. 68)
      • H. Schöbbermeyer , B.H. Junker , F. Schreiber . (2008) Network motifs, Analysis of biological networks, Wiley Series in Bioinformatics.
  69. 69)
      • A. Keller , C. Backes , A. Gerasch , M. Kaufmann , O. Kohlbacher , E. Meese , H.-P. Lenhof . A novel algorithm for detecting differentially regulated paths based on gene set enrichment analysis. Bioinformatics , 21 , 2787 - 2794
  70. 70)
      • P. Pudlák , V. Rödl , P. Savickiÿ . Graph complexity. Acta Inf. , 515 - 535
  71. 71)
      • C. Shannon , W. Weaver . (1949) The mathematical theory of communication.
  72. 72)
      • R. Todeschini , V. Consonni , R. Mannhold . (2002) Handbook of molecular descriptors.
  73. 73)
      • E. Ziv , M. Middendorf , C.H. Wiggins . Information theoretic approach to network modularity. Phys. Rev. E , 4
  74. 74)
      • S.C. Basak , V.R. Magnuson . Molecular topology and narcosis. Arzeim.-Forsch/Drug Design , 501 - 503
  75. 75)
      • D. Bonchev , N. Trinajstić . Information theory, distance matrix and molecular branching. J. Chem. Phys. , 4517 - 4533
  76. 76)
      • J.R. Ullman . An algorithm for subgraph isomorphism. J. ACM , 1 , 31 - 42
  77. 77)
      • E.D. Kolaczyk . (2009) Statistical analysis of network data: methods and models.
  78. 78)
      • M.E.J. Newman . Modularity and community structure in networks. Proc. Nat. Acad. Sci. , 23 , 8577 - 8582
  79. 79)
      • H.-P. Hsu , V. Mehra , P. Grassberger . Structure optimization in an off-lattice protein model. Phys. Rev. E , 3
  80. 80)
      • S.M. Dancoff , H. Quastler , H. Quastler . (1953) Information content and error rate of living things.
  81. 81)
      • P. Hage , F. Harary . Eccentricity and centrality in networks. Soc. Netw. , 57 - 63
  82. 82)
      • K. Zhang , R. Statman , D. Shasha . On the editing distance between unordered labeled trees. Inf. Process. Lett. , 3 , 133 - 139
  83. 83)
      • A.T. Balaban , T.S. Balaban . New vertex invariants and topological indices of chemical graphs based on information on distances. J. Math. Chem. , 383 - 397
  84. 84)
      • M. Koyutürk , Y. Kim , U. Topkara , S. Subramaniam , W. Szpankowski . Pairwise alignment of protein interaction networks. J. Comput. Biol. , 2 , 182 - 199
  85. 85)
      • J. Pearl . (1988) Probabilistic reasoning in intelligent systems.
  86. 86)
      • F. Tutzauer . Entropy as a measure of centrality in networks characterized by path-transfer flow. Soc. Netw. , 249 - 265
  87. 87)
      • S. Brohee , J. van Helden . Evaluation of clustering algorithms for protein-protein interaction networks. BMC Bioinf. , 1
  88. 88)
      • D. Bonchev . (1983) Information theoretic indices for characterization of chemical structures.
  89. 89)
      • Mehler, A., Dehmer, M., Gleim, R.: `Towards logical hypertext structure a graph-theoretic perspective', Proc. I2CS'04, (Lecture Notes), 2005, p. 136–150.
  90. 90)
      • H. Wiener . Structural determination of paraffin boiling points. J. Am. Chem. Soc. , 17 , 17 - 20
  91. 91)
      • A. Wagner . How the global structure of protein interaction networks evolves. Proc. R. Soc. London. Series B: Biol. Sci. , 1514 , 457 - 466
  92. 92)
      • D. Croes , F. Couche , S.J. Wodak , J. van Helden . Inferring meaningful pathways in weighted metabolic network. J. Mol. Biol. , 1 , 222 - 236
  93. 93)
      • U. Alon . Network motifs: theory and experimental approaches. Nat. Rev. Genet. , 450 - 461
  94. 94)
      • Slonim, N.: `The Information bottleneck: theory and applications', 2002, PhD, Hebrew University.
  95. 95)
      • M.R. Garey , D.S. Johnson , V. Klee . (1979) Computers and intractability: a guide to the theory of NP-completeness, Series of books in the mathematical sciences.
  96. 96)
      • J. Kim , T. Wilhelm . What is a complex graph?. Physica A , 2637 - 2652
  97. 97)
      • Kondor, R.I., Lafferty, J.: `Diffusion kernels on graphs and other discrete input spaces', Machine learning: Proc. 19th Int. Conf., 2002, San Mateo, CA.
  98. 98)
      • M. Sales-Pardo , R. Guimera , A.A. Moreira , L.N. Amaral . Extracting the hierarchical organization of complex systems. Proc. Natl Acad. Sci. , 39 , 15224 - 15229
  99. 99)
      • G. Sabidussi . The centrality index of a graph. Psychometrika , 581 - 603
  100. 100)
       • L. Adamic , B. Huberman . Power-law distribution of the world wide web. Science
  101. 101)
       • R. Dunn , F. Dudbridge , C. Sanderson . The use of edge-betweenness clustering to investigate biological function in protein interaction networks. BMC Bioinf. , 1
  102. 102)
       • F. Emmert-Streib , M. Dehmer , J. Kilian . Classification of large graphs by a local tree decomposition.
  103. 103)
       • M. Dehmer , F. Emmert-Streib . Structural information content of networks: graph entropy based on local vertex functionals. Comput. Biol. Chem. , 131 - 138
  104. 104)
       • A. Robles-Kelly , R. Hancock . String edit distance, random walks and graph matching. Int. J. Pattern Recognit. Artif. Intell. , 3 , 315 - 327
  105. 105)
       • J. Duch , A. Arenas . Community detection in complex networks using extremal optimization. Phys. Rev. E
  106. 106)
       • F. Emmert-Streib , A. Mushegian . A topological algorithm for identification of structural domains of proteins. BMC Bioinf.
  107. 107)
       • C. Berge . (1989) Hypergraphs: combinatorics of finite sets.
  108. 108)
       • P. Erdös , A. Rényi . On random graphs. Publ. Math. Inst. Hung. Acad. Sci.
  109. 109)
       • J. Fuite , S.B. Vernon , G. Broderick . Neuroendocrine and immune network re-modeling in chronic fatigue syndrome: an exploratory analysis. Genomics , 393 - 399
  110. 110)
       • M.E.J. Newman . The structure and function of complex networks. SIAM Rev. , 167 - 256
  111. 111)
       • A. Clauset , C. Moore , M.E.J. Newman . Hierarchical structure and the prediction of missing links in networks. Nature , 98 - 101
  112. 112)
       • F.V. Jensen , T.D. Nielsen , M. Jordan , J. Kleinburg , B. Schölkopf . (2007) Bayesian networks and decision graphs, Information science and statistics.
  113. 113)
       • S.H. Bertz . On the complexity of graphs and molecules. Bull. Math. Biol. , 849 - 855
  114. 114)
       • A. Zanzoni , M. Soler-Lopez , P. Aloy . A network medicine approach to human disease. FEBS Lett. , 11 , 1759 - 1765
  115. 115)
       • M. Dehmer , F. Lehner , F. Bodendorf . (2006) Strukturelle analyse web-basierter dokumente.
  116. 116)
       • A.L. Barabasi , Z.N. Oltvai . Network biology: understanding the cell's functional organization. Nat. Rev. , 101 - 113
  117. 117)
       • M. Dehmer , S. Borgert , F. Emmert-Streib . Entropy bounds for molecular hierarchical networks. PLoS ONE , 8
  118. 118)
       • S. Even . (1979) Graph algorithms.
  119. 119)
       • E. Trucco . A note on the information content of graphs. Bull. Math. Biol. , 2 , 129 - 135
  120. 120)
       • D. Bonchev , D.H. Rouvray , P.G. Mezey . (2005) Complexity in chemistry, biology, and ecology.
  121. 121)
       • G. Balázsi , A.-L. Barabási , Z.N. Oltvai . Topological units of environmental signal processing in the transcriptional regulatory network of Escherichia coli. Proc. Nat. Acad. Sci. USA , 22 , 7841 - 7846
  122. 122)
       • P.E. Meyer , K. Kontos , F. Lafitte , G. Bontempi . Informationtheoretic inference of large transcriptional regulatory networks. EURASIP J. Bioinf. Syst. Biol.
  123. 123)
       • L.da F. Costa , F. Rodrigues , G. Travieso . Characterization of complex networks: a survey of measurements. Adv. Phys. , 167 - 242
  124. 124)
       • A.-L. Barabasi , R. Albert . Emergence of scaling in random networks. Science , 509 - 511
  125. 125)
       • M. Randić , D. Plavšić . On the concept of molecular complexity. Croatica Chem. Acta , 107 - 116
  126. 126)
       • T. Ideker , R. Sharan . Protein networks in disease. Genome Res. , 4 , 644 - 652
  127. 127)
       • H.-Y. Chuang , E. Lee , Y.-T. Liu , T. Ideker . Network-based classification of breast cancer metastasis. Mol. Syst. Biol.
  128. 128)
       • M. Dehmer . Information-theoretic concepts for the analysis of complex networks. Appl. Artif. Intell. , 684 - 706
  129. 129)
       • H. Jeong , S.P. Mason , A.L. Barabasi , Z.N. Oltvai . Lethality and centrality in protein networks. Nature , 41 - 42
  130. 130)
       • X. Li , I. Gutman . (2006) Mathematical aspects of Randić-Type molecular structure descriptors’, in ‘Mathematical chemistry monographs.
  131. 131)
       • F. Harary . Status and contrastatus. Sociometry , 23 - 43
  132. 132)
       • J.S. Richardson . The anatomy and taxonomy of protein structure. Adv. Protein Chem. , 167 - 339
  133. 133)
       • D. Koschützki , K.A. Lehmann , L. Peters , S. Richter , D. Tenfelde-Podehl , O. Zlotkowski , U. Brandes , T. Erlebach . (2005) Clustering, Centrality indices.
  134. 134)
       • F. Emmert-Streib , M. Dehmer . Information processing in the transcriptional regulatory network of yeast: Functional robustness. BMC Syst. Biol. , 35
  135. 135)
       • A. Mazurie , D. Bonchev , B. Schwikowski , G.A. Buck . Phylogenetic distances are encoded in networks of interacting pathways. Bioinformatics , 22 , 2579 - 2585
  136. 136)
       • N. Tishby , F.C. Pereira , W. Bialek , B. Hajek , R.S. Sreenivas . (2009) The information bottleneck method.
  137. 137)
       • G. Bader , C. Hogue . An automated method for finding molecular complexes in large protein interaction networks. BMC Bioinf. , 1
  138. 138)
       • Bunke, H.: `Graph matching: theoretical foundations, algorithms, and applications', Proc. Vision Interface 2000, 2000, p. 82–88.
  139. 139)
       • A.L. Barabasi . Network Medicine – from obesity to the “diseasome” . N. Engl. J. Med. , 4 , 404 - 407
  140. 140)
       • D. Chowdhury , D. Stauffer . (2000) Principles of equilibrium statistical mechanics.
  141. 141)
       • N. Rashevsky . Life, information theory, and topology. Bull. Math. Biophys. , 229 - 235
  142. 142)
       • D.M. Cvetkovic , M. Doob , H. Sachs . (1997) Spectra of graphs. Theory and application.
  143. 143)
       • F. Markowetz , R. Spang . Inferring cellular networks–a review. BMC Bioinformatics
  144. 144)
       • K. Xia , Z. Fu , L. Hou . Impacts of protein–protein interaction domains on organism and network complexity. Genome Res. , 1500 - 1508
  145. 145)
       • Z. Dezso , Y. Nikolsky , T. Nikolskaya . Identifying disease-specific genes based on their topological significance in protein networks. BMC Syst. Biol. , 1
  146. 146)
       • N. Guelzim , S. Bottani , P. Bourgine , F. Kepes . Topological and causal structure of the yeast transcriptional regulatory network. Nat. Genet. , 1 , 60 - 63
  147. 147)
       • K. Basso , A.A. Margolin , G. Stolovitzky , U. Klein , R. Dalla-Favera , A. Califano . Reverse engineering of regulatory networks in human B cells. Nat. Genet. , 4 , 382 - 390
  148. 148)
       • G. Karev , Y. Wolf , A. Rzhetsky , F. Berezovskaya , E. Koonin . Birth and death of protein domains: a simple model of evolution explains power law behavior. BMC Evol. Biol. , 1
  149. 149)
       • U. Alon . (2006) An introduction to systems biology: design principles of biological circuits.
  150. 150)
       • H. Yu , M. Gerstein . Genomic analysis of the hierarchical structure of regulatory networks. Proc. Natl. Acad. Sci. USA , 14724 - 14731
  151. 151)
       • C. Christensen , A. Gupta , C.D. Maranas , R. Albert . Inference and graph-theoretical analysis of Bacillus Subtilis gene regulatory networks. Physica A , 796 - 810
  152. 152)
       • H. Ogata , W. Fujibuchi , S. Goto , M. Kanehisa . A heuristic graph comparison algorithm and its application to detect functionally related enzyme clusters. Nucleic Acids Res. , 4021 - 4028
  153. 153)
       • F. Emmert-Streib . The chronic fatigue syndrome: a comparative pathway analysis. J. Comput. Biol. , 7 , 961 - 972
  154. 154)
       • J. Felsenstein . (2003) Inferring phylogenies.
  155. 155)
       • H. Bunke , M. Neuhaus , D. Cook , L.B. Holder . (2007) Graph matching. exact and error-tolerant methods and the automatic learning of edit costs, Mining graph data.
  156. 156)
       • T.I. Lee , N.J. Rinaldi , F. Robert . Transcriptional regulatory networks in Saccharomyces cerevisiae. Science , 799 - 804
  157. 157)
       • R. Milo , S. Shen-Orr , S. Itzkovitz . Network motifs: simple building blocks of complex networks. Science , 824 - 827
  158. 158)
       • X. Zhu , M. Gerstein , M. Snyder . Getting connected: analysis and principles of biological networks. Genes Dev. , 9 , 1010 - 1024
  159. 159)
       • G.W. Klau . A new graph-based method for pairwise global network alignment. BMC Bioinf. , 1
  160. 160)
       • M.V. Diudea , I. Gutman , L. Jäntschi . (2001) Molecular topology.
  161. 161)
       • A. Brandstädt , V.B. Le , J.P. Sprinrand . (1999) Graph classes. A survey.
  162. 162)
       • R. Sharan , S. Suthram , R.M. Kelley . Conserved patterns of protein interaction in multiple species. Proc. Natl Acad. Sci. USA , 1974 - 1979
  163. 163)
       • J. Bang-Jensen , G. Gutin . (2002) Digraphs. theory, algorithms and applications.
  164. 164)
       • L.C. Freeman . Centrality in social networks: conceptual clarification. Soc. Netw. , 215 - 239
  165. 165)
       • R.B. Russell , A. Patrick . Targeting and tinkering with interaction networks. Nature Chem. Biol. , 666 - 673
  166. 166)
       • Y. Artzy-Randrup , S.J. Fleishman , N. Ben-Tal , L. Stone . Comment on “Network Motifs: Simple Building Blocks of Complex Networks” and “Superfamilies of Evolved and Designed Networks”. Science , 5687
  167. 167)
       • B.P. Kelley , R. Sharan , R.M. Karp . Conserved pathways within bacteria and yeast as revealed by global protein network alignment. Proc. Natl Acad. Sci. USA , 11394 - 11399
  168. 168)
       • P. Mukherjee , P. Desai , L. Ross , E.L. White , M.A. Averya . Structurebased virtual screening against sars-3clpro to identify novel non-peptidic hits. Bioorgan. Med. Chem. , 4138 - 4149
  169. 169)
       • S. Skiena , S. Pemmaraju , S. Skiena . (1990) Graph isomorphism, Implementing discrete mathematics: combinatorics and graph theory with mathematica.
  170. 170)
       • R. Halin . (1989) Graphentheorie.
  171. 171)
       • S.S. Shen-Orr , R. Milo , S. Mangan , U. Alon . Network motifs in the transcriptional regulation network of Escherichia coli. Nat. Genet. , 64 - 68
  172. 172)
       • Van Dongen, S.: `Graph clustering by flow simulation', 2000, PhD thesis, Centers for Mathematics and Computer Science (CWI), University of Utrecht.
  173. 173)
       • D. Koschützki , H. Schwöbbermeyer , F. Schreiber . Ranking of network elements based on functional substructures. J. Theor. Biol. , 471 - 479
  174. 174)
       • J. Devillers , A.T. Balaban . (1999) Topological indices and related descriptors in QSAR and QSPR.
  175. 175)
       • D. Bonchev . Information indices for atoms and molecules. Commun. Math. Comp. Chem. , 65 - 113
  176. 176)
       • B.H. Junker , F. Schreiber , Y. Pan , A.Y. Zomaya . (2008) Analysis of biological networks.
  177. 177)
       • A.N. Kolmogorov . Three approaches to the quantitative definition of “information”. Prob. Inf. Transm. , 1 - 7
  178. 178)
       • F. Emmert-Streib , M. Dehmer . Information theoretic measures of UHG graphs with low computational complexity. Appl. Math. Comput. , 1783 - 1794
  179. 179)
       • H. Bunke . On a relation between graph edit distance and maximum common subgraph. Pattern Recogn. Lett. , 9 , 689 - 694
  180. 180)
       • N. Trinajstić . (1992) Chemical graph theory.
  181. 181)
       • A. Clauset , M. Newman , C. Moore . Finding community structure in very large networks. Phys. Rev. E
  182. 182)
       • A. Wagner , D.A. Fell . The small world inside large metabolic networks. Proc. R. Soc. London. Series B: Biol. Sci. , 1478 , 1803 - 1810
  183. 183)
       • R. Singh , J. Xu , B. Berger . Pairwise global alignment of protein interaction networks by matching neighborhood topology.
  184. 184)
       • F. Harary . (1969) Graph theory.
  185. 185)
       • B.T. Messmer , H. Bunke . A new algorithm for error-tolerant subgraph isomorphism detection. IEEE Trans. Pattern Anal. Mach. Intell. , 5 , 493 - 504
  186. 186)
       • P.M. Gleiser , L. Danon . Community structure in jazz. Adv. Complex Syst. , 4 , 565 - 574
  187. 187)
       • G. Stolovitzky , D. Monroe , A. Califano . Dialogue on reverseengineering assessment and methods: the dream of high-throughput pathway inference. Ann NY Acad Sci. , 1 - 22
  188. 188)
       • I. Xenarios , D.W. Rice , L. Salwinski , M.K. Baron , E.M. Marcotte , D. Eisenberg . DIP: the database of interacting proteins. Nucl. Acids Res. , 1 , 289 - 291
  189. 189)
       • D.-S. Lee , J. Park , K.A. Kay , N.A. Christakis , Z.N. Oltvai , A.-L. Barabsi . The implications of human metabolic network topology for disease comorbidity. Proc. Nat. Acad. Sci. , 29 , 9880 - 9885
  190. 190)
       • M. Baitaluk , X. Qian , S. Godbole , A. Raval , A. Ray , A. Gupta . Pathsys: integrating molecular interaction graphs for systems biology. BMC Bioinf. , 1
  191. 191)
       • A. Mowshowitz . Entropy and the complexity of the graphs I: an index of the relative complexity of a graph. Bull. Math. Biophys. , 175 - 204
  192. 192)
       • M. Dehmer . A novel method for measuring the structural information content of networks. Cybern. Syst. , 8 , 825 - 842
  193. 193)
       • H. Morowitz . Some order-disorder considerations in living systems. Bull. Math. Biophys. , 81 - 86
  194. 194)
       • G. Ciriello , C. Guerra . A review on models and algorithms for motif discovery in protein-protein interaction networks. Brief Funct. Genomic Proteomic , 2
  195. 195)
       • F. Sobik . Graphmetriken und Klassifikation strukturierter Objekte. ZKIInf., Akad. Wiss. DDR , 82 , 63 - 122
  196. 196)
       • M. Dehmer , K. Varmuza , S. Borgert , F. Emmert-Streib . On entropybased molecular descriptors: statistical analysis of real and synthetic chemical structures. J. Chem. Inf. Model. , 1655 - 1663
  197. 197)
       • A.T. Balaban . Highly discriminating distance-based topological index. Chem. Phys. Lett. , 399 - 404
  198. 198)
       • D. Koschützki , F. Schreiber . Centrality analysis methods for biological networks and their application to gene regulatory networks. Gene Regulat. Syst. Biol.
  199. 199)
       • T. Grotkjaer , P. Christakopoulos , J. Nielsen , L. Olsson . Comparative metabolic network analysis of two xylose fermenting recombinant saccharomyces cerevisiae strains. Metab. Eng. , 437 - 444
  200. 200)
       • B. Schuster-Böckler , A. Bateman . Protein interactions in human genetic diseases. Genome Biol. , 1
  201. 201)
       • T.S. Gardner , J.J. Faith . Reverse-engineering transcription control networks. Phys. Life Rev. , 1 , 65 - 88
  202. 202)
       • Wernicke, S.: `A faster algorithm for detecting network motifs', Proc. 5th Workshop on Algorithms in Bioinformatics, (WABI'05), (LNCS, 3692), 2005, p. 165–177.
  203. 203)
       • H. Bunke . A graph distance metric based on the maximum common subgraph. Pattern Recognit. Lett. , 3 , 255 - 259
  204. 204)
       • P. Erdös , A. Rényi . On random graphs. Publ. Math. , 290 - 297
  205. 205)
       • A. Trewavai . A brief history of systems biology: every object that biology studies is a system of systems’, in Jacob F. (Ed.) (1974), ‘Plant cell’, 2006.
  206. 206)
       • F. Kaden . Graphmetriken und Isometrieprobleme zugehöriger distanzgraphen. ZKI-Informationen, Akad. Wiss. DDR , 1 - 100
  207. 207)
       • D.J. Watts , S.H. Strogatz . Collective dynamics of “small world” networks. Nature , 440 - 442
  208. 208)
       • F. Buckley , F. Harary . (1990) Distance in graphs.
  209. 209)
       • G. Stolovitzky , A. Califano . (2007) Reverse engineering biological networks: opportunities and challenges in computational methods for pathway inference.
  210. 210)
       • T. Gärtner , P.A. Flach , S. Wrobel . On graph kernels: Hardness results and efficient alternatives. COLT , 129 - 143
  211. 211)
       • F. Emmert-Streib , L. Chen , J. Storey . Functional annotation of genes in saccharomyces cerevisiae based on joint betweenness.
  212. 212)
       • R. Albert , A.-L. Barabasi . Statistical mechanics of complex networks. Rev. Mod. Phys. , 47 - 92
  213. 213)
       • S. Maslov , K. Sneppen . Specificity and stability in topology of protein networks. Science , 5569 , 910 - 913
  214. 214)
       • H. Jeong , B. Tombor , R. Albert , Z.N. Olivai , A.L. Barabasi . The large-scale organization of metabolic networks. Nature , 651 - 654
  215. 215)
       • H. Hirata , R.E. Ulanowicz . Information theoretical analysis of ecological networks. Int. J. Syst. Sci. , 261 - 270
  216. 216)
       • L.C. Freeman . Spheres, cubes, and boxes: graph dimensionality and network structure. Soc. Netw. , 139 - 156
  217. 217)
       • N. Cristianini , J. Shawe-Taylor . (2000) An introduction to support vector machines.
  218. 218)
       • A. Mehler , A. Mehler , S. Sharoff , G. Rehm , M. Santini . (2010) A quantitative graph model of social ontologies by example of wikipedia, Genres on the web: computational models and empirical studies.
  219. 219)
       • S.A. Kauffman . Metabolic stability and epigenesis in randomly constructed genetic nets. J. Theor. Biol. , 3 , 437 - 467
  220. 220)
       • J. Reichardt , S. Bornholdt . Detecting fuzzy community structures in complex networks with a potts model. Phys. Rev. Lett. , 21
  221. 221)
       • L. von Bertalanffy . The theory of open systems in physics and biology. Science , 2872 , 23 - 29
  222. 222)
       • S. Wasserman , K. Faust . (1994) Social network analysis: methods and applications, Structural analysis in the social sciences.
  223. 223)
       • A.J. Enright , S. Van Dongen , C.A. Ouzounis . An efficient algorithm for large-scale detection of protein families. Nucl. Acids Res. , 7 , 1575 - 1584
  224. 224)
       • Goh Kwang-Il , M.E. Cusick , D. Valle , B. Childs , M. Vidal , A. Barabasi . The human disease network. Proc. Nat. Acad. Sci. , 21 , 8685 - 8690
  225. 225)
       • F. (Ed.) Roberts . (1989) Applications of combinatorics and graph theory to the biological and social sciences series.
  226. 226)
       • E.M. Luks . Isomorphism of graphs of bounded valence can be tested in polynomial time. J. Comput. Syst. Sci. , 42 - 49
  227. 227)
       • E. Sommerfeld , F. Sobik , D. Albert . (1994) Operations on cognitive structures – their modeling on the basis of graph theory, Knowledge structures.
  228. 228)
       • F. Emmert-Streib , M. Dehmer . Fault tolerance of information processing in gene networks. Physica A , 4 , 541 - 548
  229. 229)
       • J. Vlasblom , S. Wodak . Markov clustering versus affinity propagation for the partitioning of protein interaction graphs. BMC Bioinf. , 1
  230. 230)
       • R. Bellman . (1957) Dynamic Programming’, in ‘International series.
  231. 231)
       • C. Semple , M. Steel , J. Ball , D. Welsh . (2003) Phylogenetics, Graduate Series mathematics and its applications.
  232. 232)
       • L. Shapiro . Organization of relational models for scene analysis. IEEE Trans. Pattern Anal. Mach. Intell. , 595 - 603
  233. 233)
       • D. Gernert . Measuring the similarity of complex structures by means of graph grammars. Bull. EATCS , 3 - 9
  234. 234)
       • U. Brandes , T. Erlebach . (2005) Network analysis.
  235. 235)
       • K. Park , D. Kim . Localized network centrality and essentiality in the yeast-protein interaction network. Proteomics , 22 , 5143 - 5154
  236. 236)
       • O. Wolkenhauer . (2008) Systems biology.
  237. 237)
       • F. Barrenas , S. Chavali , P. Holme , R. Mobini , M. Benson . Network properties of complex human disease genes identified through genome-wide association studies. PLoS ONE
  238. 238)
       • M. Girvan , M.E.J. Newman . Community structure in social and biological networks. Proc. National Acad. Sci. USA , 12 , 7821 - 7826
  239. 239)
       • L.R. Foulds . (1992) Graph theory applications.
  240. 240)
       • D. Gernert . Graph grammars which generate graphs with specified properties. Bull. EATCS , 13 - 20
  241. 241)
       • G. Constantine . Graph complexity and the laplacian matrix in blocked experiments. Linear Multilinear Algebr. , 49 - 56
  242. 242)
       • A. Cayley . On the theory of analytic forms called trees. Phil. Mag. , 19 - 30
  243. 243)
       • L.C. Freeman . A set of measures of centrality based on betweenness. Sociometry , 35 - 41
  244. 244)
       • M.A. Ildirim , K.-I. Goh , M.E. Cuisick , A.-L. Barabasi , M. Vidal . Drugtarget network. Nature Biotechnol. , 10 , 1119 - 1126