Information indices with high discriminative power for graphs

PLoS ONE

Volumn 7, Issue 2, 2012, Pages

  Dehmer, Matthias ^a   Grabner, Martin ^a   Varmuza, Kurt ^b  

^a UMIT   (Australia)

^b UNIVERSITY OF VIENNA   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

ARTICLE; COMPUTER PROGRAM; CONTROLLED STUDY; DISCRIMINANT ANALYSIS; INFORMATION FUNCTIONAL; INTERMETHOD COMPARISON; MATHEMATICAL COMPUTING; MATHEMATICAL PARAMETERS; PLOTS AND CURVES; POWER ANALYSIS; ALGORITHM; CHEMICAL MODEL; CHEMISTRY; COMPUTER GRAPHICS; ENTROPY; INFORMATION SCIENCE; METHODOLOGY; STATISTICAL MODEL; STATISTICS;

ALKANE;

ALGORITHMS; ALKANES; COMPUTER GRAPHICS; ENTROPY; INFORMATICS; MODELS, CHEMICAL; MODELS, STATISTICAL; SOFTWARE; STATISTICS AS TOPIC;

EID: 84857678752     PISSN: None     EISSN: 19326203     Source Type: Journal    
DOI: 10.1371/journal.pone.0031214     Document Type: Article

References (46)

1. Bonchev D, (1983) Information Theoretic Indices for Characterization of Chemical Structures. Research Studies Press, Chichester.
2. Bonchev D, Rouvray DH, (2005) Complexity in Chemistry, Biology, and Ecology. Mathematical and Computational Chemistry. Springer. New York, NY, USA.
3. da F Costa L, Rodrigues F, Travieso G, (2007) Characterization of complex networks: A survey of measurements. Advances in Physics 56: 167-242.
4. Dehmer M, Mowshowitz A, (2011) A history of graph entropy measures. Information Sciences 1: 57-78.
5. Emmert-Streib F, Dehmer M, (2007) Information theoretic measures of UHG graphs with low computational complexity. Applied Mathematics and Computation 190: 1783-1794.
6. Mehler A, Weiß P, Lücking A, (2010) A network model of interpersonal alignment. Entropy 12: 1440-1483.
7. Todeschini R, Consonni V, Mannhold R, (2002) Handbook of Molecular Descriptors. Wiley-VCH. Weinheim, Germany.
8. Bonchev D, Trinajstić N, (1977) Information theory, distance matrix and molecular branching. J Chem Phys 67: 4517-4533.
9. Bonchev D, Mekenyan O, Trinajstić N, (1981) Isomer discrimination by topological information approach. J Comp Chem 2: 127-148.
10. Trinajstić N, (1992) Chemical Graph Theory. CRC Press. Boca Raton, FL, USA.
11. Raychaudhury C, Ray SK, Ghosh JJ, Roy AB, Basak SC, (1984) Discrimination of isomeric structures using information theoretic topological indices. Journal of Computational Chemistry 5: 581-588.
12. Konstantinova EV, (1996) The discrimination ability of some topological and information distance indices for graphs of unbranched hexagonal systems. J Chem Inf Comput Sci 36: 54-57.
13. Konstantinova EV, Paleev AA, (1990) Sensitivity of topological indices of polycyclic graphs. Vychisl Sistemy 136: 38-48.
14. Diudea MV, Ilić A, Varmuza K, Dehmer M, (2011) Network analysis using a novel highly discriminating topological index. Complexity 16: 32-39.
15. Dehmer M, Varmuza K, Borgert S, Emmert-Streib F, (2009) On entropy-based molecular descriptors: Statistical analysis of real and synthetic chemical structures. J Chem InfModel 49: 1655-1663.
16. Xu CYHL, (1996) On highly discriminating molecular topological index. J Chem Inf Comput Sci 36: 82-90.
17. Kim J, Wilhelm T, (2008) What is a complex graph? Physica A 387: 2637-2652.
18. Dorogovtsev SN, Mendes JFF, (2003) Evolution of Networks. From Biological Networks to the Internet and WWW. Oxford University Press.
19. Balaban AT, (1982) Highly discriminating distance-based topological index. Chem Phys Lett 89: 399-404.
20. Vukičević D, Balaban AT, (2005) On the degeneracy of topological index J. Internet Electronic Journal of Molecular Design 4: 491-500.
21. Dehmer M, (2008) Information processing in complex networks: Graph entropy and information functionals. Appl Math Comput 201: 82-94.
22. Dehmer M, Barbarini N, Varmuza K, Graber A, (2009) A large scale analysis of informationtheoretic network complexity measures using chemical structures. PLoS ONE 4: e8057.
23. Li X, Gutman I, (2006) Mathematical Aspects of Randić-Type Molecular Structure Descriptors. Mathematical Chemistry Monographs. University of Kragujevac and Faculty of Science Kragujevac.
24. Zhou B, (2008) Bounds on the balaban index. Croatica Chemica Acta 81: 319-323.
25. Dehmer M, Borgert S, Emmert-Streib F, (2008) Entropy bounds for molecular hierarchical networks. PLoS ONE 3: e3079.
26. Dehmer M, Borgert S, Bonchev D, (2008) Information inequalities for graphs. Symmetry: Culture and Science Symmetry in Nanostructures (Special issue edited by M Diudea) 19: 269-284.
27. Devillers J, Balaban AT, (1999) Topological Indices and Related Descriptors in QSAR and QSPR. Gordon and Breach Science Publishers. Amsterdam, The Netherlands.
28. Dehmer M, Barbarini N, Varmuza K, Graber A, (2010) Novel topological descriptors for analyzing biological networks. BMC Structural Biology 10.
29. Skorobogatov VA, Dobrynin AA, (1988) Metrical analysis of graphs. Commun Math Comp Chem 23: 105-155.
30. Bonchev D, (2009) Information theoretic measures of complexity. In: Meyers R, editors. pp. 4820-4838 Encyclopedia of Complexity and System Science, Springer, volume 5.
31. Mowshowitz A, (1968) Entropy and the complexity of the graphs I: An index of the relative complexity of a graph. Bull Math Biophys 30: 175-204.
32. Shannon CE, Weaver W, (1949) The Mathematical Theory of Communication. University of Illinois Press.
33. Dijkstra EW, (1959) A note on two problems in connection with graphs. Numerische Math 1: 269-271.
34. Dehmer M, Emmert-Streib F, Tsoy Y, Varmuza K, (2011) Quantifying structural complexity of graphs: Information measures in mathematical chemistry. In: Putz M, editors. pp. 479-498 Quantum Frontiers of Atoms and Molecules, Nova Publishing.
35. Harary F, (1969) Graph Theory. Addison Wesley Publishing Company. Reading, MA, USA.
36. Balaban AT, Balaban TS, (1991) New vertex invariants and topological indices of chemical graphs based on information on distances. J Math Chem 8: 383-397.
37. McKay BD, (2010) Nauty.http://cs.anu.edu.au/_bdm/nauty/.
38. McKay BD, (1998) Isomorph-free exhaustive generation. Journal of Algorithms 26: 306-324.
39. (2000) Molgen isomer generator software. www.molgen.de. Institute of Mathematics II, University of Bayreuth, Germany.
40. (2011) R, software, a language and environment for statistical computing. www.r-project.org. R Development Core Team, Foundation for Statistical Computing, Vienna, Austria.
41. Müller LAJ, Kugler KG, Dander A, Graber A, Dehmer M, (2010) QuACN- an R package for analyzing complex biological networks quantitatively. Bioinformatics pp. 140-141.
42. Rashevsky N, (1955) Life, information theory, and topology. Bull Math Biophys 17: 229-235.
43. Randić M, (1975) On characterization of molecular branching. J Amer Chem Soc 97: 6609-6615.
44. Wiener H, (1947) Structural determination of paraffin boiling points. Journal of the American Chemical Society 69: 17-20.
45. Konstantinova EV, Skorobogatov VA, Vidyuk MV, (2002) Applications of information theory in chemical graph theory. Indian Journal of Chemistry 42: 1227-1240.
46. Bertz SH, (1981) The first general index of molecular complexity. Journal of the American Chemical Society 103: 3241-3243.