{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T04:20:13Z","timestamp":1759033213615},"reference-count":75,"publisher":"Public Library of Science (PLoS)","issue":"8","license":[{"start":{"date-parts":[[2008,8,28]],"date-time":"2008-08-28T00:00:00Z","timestamp":1219881600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["www.plosone.org"],"crossmark-restriction":false},"short-container-title":["PLoS ONE"],"DOI":"10.1371\/journal.pone.0003079","type":"journal-article","created":{"date-parts":[[2008,8,27]],"date-time":"2008-08-27T22:21:32Z","timestamp":1219875692000},"page":"e3079","update-policy":"http:\/\/dx.doi.org\/10.1371\/journal.pone.corrections_policy","source":"Crossref","is-referenced-by-count":34,"title":["Entropy Bounds for Hierarchical Molecular Networks"],"prefix":"10.1371","volume":"3","author":[{"given":"Matthias","family":"Dehmer","sequence":"first","affiliation":[]},{"given":"Stephan","family":"Borgert","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Emmert-Streib","sequence":"additional","affiliation":[]}],"member":"340","published-online":{"date-parts":[[2008,8,28]]},"reference":[{"key":"ref1","article-title":"Chemical Graph Theory. Introduction and Fundamentals","author":"D Bonchev","year":"1991"},{"key":"ref2","article-title":"Molecular Topology","author":"MV Diudea","year":"2001"},{"key":"ref3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-70982-1","article-title":"Mathematical Concepts in Organic Chemistry","author":"I Gutman","year":"1986"},{"key":"ref4","article-title":"Chemical Graph Theory","author":"N Trinajsti\u0107","year":"1992"},{"key":"ref5","first-page":"25","article-title":"Similarity measures between structured objects.","author":"V Batagelj","year":"1988"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"4397","DOI":"10.1063\/1.434593","article-title":"Information theory, distance matrix and molecular branching.","volume":"67","author":"D Bonchev","year":"1977","journal-title":"Journal of Chemical Physics"},{"key":"ref7","article-title":"Information Theoretic Indices for Characterization of Chemical Structures","author":"D Bonchev","year":"1983"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"2280","DOI":"10.1021\/ci700274r","article-title":"Kernel approach to molecular similarity based on iterative graph similarity.","volume":"47","author":"M Rupp","year":"2007","journal-title":"J Chem Inf Comput Sci"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"785","DOI":"10.1021\/ci970037b","article-title":"Molecular similarity. I. Analytical description of the set of graph similarity measures.","volume":"38","author":"MI Skvortsova","year":"1998","journal-title":"J Chem Inf Comput Sci"},{"key":"ref10","doi-asserted-by":"crossref","DOI":"10.1201\/9780203010822","article-title":"Quantitative Structure-Activity Relationship (QSAR) Models of Mutagens and Carcinogens","author":"R Benigni","year":"2003"},{"key":"ref11","doi-asserted-by":"crossref","DOI":"10.1201\/9781482296945","article-title":"Topological Indices and Related Descriptors in QSAR and QSPAR","author":"J Devillers","year":"2000"},{"key":"ref12","article-title":"QSPR\/QSAR Studies by Molecular Descriptors","author":"MV Diudea","year":"2001"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"934","DOI":"10.1021\/ci990120u","article-title":"Overall connectivities and topological complexities: A new powerful tool for QSPR\/QSAR.","volume":"40(4)","author":"D Bonchev","year":"2000","journal-title":"J Chem Inf Comput Sci"},{"key":"ref14","article-title":"Complexity in Chemistry. Introduction and Fundamentals","author":"D Bonchev","year":"2003"},{"key":"ref15","first-page":"35","article-title":"What is the distance between graphs?","volume":"20","author":"H Bunke","year":"1983","journal-title":"Bulletin of the EATCS"},{"key":"ref16","first-page":"117","article-title":"Recent developments in graph matching.","author":"H Bunke","year":"2000"},{"key":"ref17","first-page":"17","article-title":"Graph matching. Exact and error-tolerant methods and the automatic learning of edit costs.","author":"H Bunke","year":"2007"},{"key":"ref18","first-page":"63","article-title":"Graphmetriken und Klassifikation strukturierter Objekte.","volume":"2(82)","author":"F Sobik","year":"1982","journal-title":"ZKI-Informationen, Akad Wiss DDR"},{"key":"ref19","first-page":"104","article-title":"Modellierung von Vergleichsprozessen auf der Grundlage von \u00c4hnlichkeitsma\u00dfen f\u00fcr Graphen.","volume":"4","author":"F Sobik","year":"1986","journal-title":"ZKI-Informationen, Akad Wiss DDR"},{"key":"ref20","first-page":"1","article-title":"Graphmetriken und Distanzgraphen.","volume":"2(82)","author":"F Kaden","journal-title":"ZKI-Informationen, Akad Wiss DDR"},{"key":"ref21","first-page":"371","article-title":"On a certain distance between isomorphism classes of graphs. \u010casopis pro pest.","volume":"100","author":"B Zelinka","year":"1975","journal-title":"Mathematiky"},{"key":"ref22","doi-asserted-by":"crossref","DOI":"10.5244\/C.19.69","article-title":"A study of graph spectra for comparing graphs.","author":"P Zhu","year":"2005"},{"key":"ref23","first-page":"293","article-title":"Network statistics.","author":"M Brinkmeier","year":"2005"},{"key":"ref24","article-title":"Evolution of Networks. From Biological Networks to the Internet and WWW","author":"SN Dorogovtsev","year":"2003"},{"key":"ref25","article-title":"How Everything Is Connected to Everything Else and What It Means","author":"AL Barab\u00e1si","year":"2003"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1049\/iet-syb:20060038","article-title":"Graph theory and networks in biology.","volume":"1(2)","author":"O Mason","year":"2007","journal-title":"IET Systems Biology"},{"key":"ref27","doi-asserted-by":"crossref","DOI":"10.1007\/b136300","article-title":"Complexity in Chemistry, Biology, and Ecology","author":"D Bonchev","year":"2005"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/j.compbiolchem.2007.09.007","article-title":"Structural information content of networks: Graph entropy based on local vertex functionals.","volume":"32","author":"M Dehmer","year":"2008","journal-title":"Computational Biology and Chemistry"},{"key":"ref29","article-title":"Net-sign identity information index: A novel approach towards numerical characterization of chemical signed graph theory.","author":"PK Sahu","year":"2008","journal-title":"Chemical Physics Letters"},{"key":"ref30","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF02477985","article-title":"Some order-disorder considerations in living systems.","volume":"17","author":"H Morowitz","year":"1953","journal-title":"Bull Math Biophys"},{"key":"ref31","article-title":"Information Theory in Biology","author":"H Quastler","year":"1953"},{"key":"ref32","first-page":"263","article-title":"Information content and error rate of living things.","author":"S Dancoff","year":"1953"},{"key":"ref33","first-page":"14","article-title":"The information content of a battery cell.","author":"H Linshitz","year":"1953"},{"key":"ref34","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF02477860","article-title":"Life, information theory, and topology.","volume":"17","author":"N Rashewsky","year":"1955","journal-title":"Bull Math Biophys"},{"key":"ref35","first-page":"129","article-title":"A note on the information content of graphs.","volume":"18(2)","author":"E Trucco","year":"1956","journal-title":"Bulletin of Mathematical Biology"},{"key":"ref36","article-title":"The Mathematical Theory of Communication","author":"CE Shannon","year":"1997"},{"key":"ref37","doi-asserted-by":"crossref","DOI":"10.1063\/1.3059856","article-title":"Science and Information Theory","author":"L Brillouin","year":"1956"},{"key":"ref38","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF02476948","article-title":"Entropy and the complexity of the graphs I: An index of the relative complexity of a graph.","volume":"30","author":"A Mowshowitz","year":"1968","journal-title":"Bull Math Biophys"},{"key":"ref39","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF02476692","article-title":"Entropy and the complexity of graphs II: The information content of digraphs and infinite graphs.","volume":"30","author":"A Mowshowitz","year":"1968","journal-title":"Bull Math Biophys"},{"key":"ref40","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/BF02476603","article-title":"Entropy and the complexity of graphs III: Graphs with prescribed information content.","volume":"30","author":"A Mowshowitz","year":"1968","journal-title":"Bull Math Biophys"},{"key":"ref41","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1007\/BF02476673","article-title":"Entropy and the complexity of graphs IV: Entropy measures and graphical structure.","volume":"30","author":"A Mowshowitz","year":"1968","journal-title":"Bull Math Biophys"},{"key":"ref42","first-page":"63","article-title":"Entropy and coding for graphs.","volume":"6(1)","author":"JI Fujii","year":"1997","journal-title":"Int J Math Stat Sci"},{"key":"ref43","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1090\/S1079-6762-97-00018-8","article-title":"Ergodic behavior of graph entropy.","volume":"3","author":"J Kieffer","year":"1997","journal-title":"Electronic Research Announcements of the American Mathematical Society"},{"key":"ref44","first-page":"411","article-title":"Coding of an information source having ambiguous alphabet and the entropy of graphs. Transactions of the 6-th Prague Conference on Information Theory","author":"J K\u00f6rner","year":"1973"},{"key":"ref45","first-page":"293","article-title":"Perfect graphs and graph entropy. An updated survey.","author":"G Simonyi","year":"2001"},{"key":"ref46","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","article-title":"Graph Theory","author":"F Harary","year":"1969"},{"key":"ref47","first-page":"136","article-title":"Towards logical hypertext structure \u2014 A graph-theoretic perspective.","author":"A Mehler","year":"2004"},{"key":"ref48","doi-asserted-by":"crossref","first-page":"958","DOI":"10.1021\/ci0001536","article-title":"A linear algorithm for the hyper-wiener index of chemical trees.","volume":"41(4)","author":"R Aringhieri","year":"2001","journal-title":"J Chem Inf Comput Sci"},{"key":"ref49","first-page":"67","article-title":"Chemical trees enumeration algorithms.","volume":"1(1)","author":"R Aringhieri","year":"2003","journal-title":"4OR, A Quarterly Journal of Operations Research"},{"key":"ref50","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1021\/ci00024a007","article-title":"A comparison between the matula numbers and bit-tuple notation for rooted trees.","volume":"35(2)","author":"WR M\u00fcller","year":"1995","journal-title":"J Chem Inf Comput Sci"},{"key":"ref51","first-page":"273","article-title":"A natural rooted tree enumeration by prime factorization.","volume":"10","author":"DW Matula","year":"1968","journal-title":"SIAM Review"},{"key":"ref52","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/BF01170004","article-title":"A canonical ordering of polybenzenes and polyadamantanes using a prime factorization technique.","volume":"4","author":"SB Elk","year":"1990","journal-title":"J Math Chem"},{"key":"ref53","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1016\/S1093-3263(01)00144-9","article-title":"Developing a methodology for an inverse quantitative structure-activity relationship using the signature molecular descriptor.","volume":"20","author":"DP Visco","year":"2002","journal-title":"Journal of Molecular Graphics and Modelling"},{"key":"ref54","first-page":"75","article-title":"The hosoya-wiener polynomial of weighted trees.","volume":"80(1)","author":"B Zmazeka","year":"2007","journal-title":"Croatica Chemica Acta"},{"key":"ref55","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1021\/ci00015a010","article-title":"Symmetry of chemical structures: A novel method of graph automorphism group determination.","volume":"33","author":"S Bohanec","year":"1993","journal-title":"J Chem Inf Comput Sci"},{"key":"ref56","doi-asserted-by":"crossref","first-page":"1169","DOI":"10.1021\/ci9600869","article-title":"On distances in benzenoid systems.","volume":"36","author":"V Chepoi","year":"1996","journal-title":"J Chem Inf Comput Sci"},{"key":"ref57","first-page":"331","article-title":"Trees with the minimum wiener number.","volume":"78(5)","author":"SC Liu","year":"2000","journal-title":"International Journal of Quantum Chemistry"},{"key":"ref58","first-page":"105","article-title":"Metrical analysis of graphs.","volume":"23","author":"VA Skorobogatov","year":"1988","journal-title":"MATCH"},{"key":"ref59","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0166-218X(00)00202-X","article-title":"A supertree method for rooted trees.","volume":"105(1-3)","author":"C Semple","year":"2000","journal-title":"Discrete Applied Mathematics"},{"key":"ref60","article-title":"Inferring Phylogenies","author":"J Felsenstein","year":"2003"},{"key":"ref61","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0933-1","article-title":"Graph Theory Applications","author":"LR Foulds","year":"1992"},{"key":"ref62","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1093\/sysbio\/49.2.363","article-title":"Simple but fundamental limitations on supertree and consensus tree methods.","volume":"49","author":"M Steel","year":"2000","journal-title":"Systematic Biology"},{"key":"ref63","article-title":"Phylogenetics. Graduate Series Mathematics and its Applications","author":"C Semple","year":"2003"},{"key":"ref64","first-page":"159","article-title":"Local similarity in RNA secondary structures.","author":"M H\u00f6chstmann","year":"2003"},{"key":"ref65","first-page":"309","article-title":"Comparing multiple RNA secondary structures using tree comparisons.","volume":"6(4)","author":"BA Shapiro","year":"1990","journal-title":"Comp Appl Biosci"},{"key":"ref66","first-page":"200","article-title":"Classification of large graphs by a local tree decomposition.","author":"F Emmert-Streib","year":"2005"},{"key":"ref67","first-page":"158","article-title":"Cyclic pattern kernels for predictive graph mining.","author":"T Horv\u00e1th","year":"2005"},{"key":"ref68","first-page":"1","article-title":"Hierarchical clustering based upon contextual alignment of proteins: A different way to approach phylogeny.","volume":"328(1)","author":"A Gambin","year":"2005","journal-title":"Comptes Rendus Biologies"},{"key":"ref69","first-page":"1","article-title":"A novel clustering method for analysis of biological networks using maximal components of graphs.","volume":"99","author":"H Morihiro","year":"2006","journal-title":"IPSJ SIG Technical Reports"},{"key":"ref70","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0166-1280(89)85011-0","article-title":"The concept for the center of a chemical structure and its applications.","volume":"185","author":"D Bonchev","year":"1989","journal-title":"Journal of Molecular Structure: Theochem"},{"key":"ref71","article-title":"Digraphs. Theory, Algorithms and Applications","author":"J Bang-Jensen","year":"2002"},{"key":"ref72","doi-asserted-by":"crossref","DOI":"10.1515\/9783112471401","article-title":"Graphentheorie","author":"R Halin","year":"1989"},{"key":"ref73","first-page":"1","article-title":"Measuring the structural similarity of web-based documents: A novel approach.","volume":"3(1)","author":"M Dehmer","year":"2006","journal-title":"International Journal of Computational Intelligence"},{"key":"ref74","first-page":"17","article-title":"Ranking genes from DNA microarray data of cervical cancer by a local tree comparison.","volume":"1(1)","author":"F Emmert-Streib","year":"2006","journal-title":"International Journal of Biomedical Science"},{"key":"ref75","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/j.amc.2007.12.010","article-title":"Information processing in complex networks: Graph entropy and information functionals.","volume":"201","author":"M Dehmer","year":"2008","journal-title":"Applied Mathematics and Computation"}],"container-title":["PLoS ONE"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/dx.plos.org\/10.1371\/journal.pone.0003079","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,19]],"date-time":"2023-05-19T19:25:12Z","timestamp":1684524312000},"score":1,"resource":{"primary":{"URL":"https:\/\/dx.plos.org\/10.1371\/journal.pone.0003079"}},"subtitle":[],"editor":[{"given":"Enrico","family":"Scalas","sequence":"first","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2008,8,28]]},"references-count":75,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2008,8,28]]}},"URL":"https:\/\/doi.org\/10.1371\/journal.pone.0003079","relation":{},"ISSN":["1932-6203"],"issn-type":[{"value":"1932-6203","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,8,28]]}}}