{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T19:53:21Z","timestamp":1760730801718,"version":"3.37.3"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,2,13]],"date-time":"2016-02-13T00:00:00Z","timestamp":1455321600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2016,2,13]],"date-time":"2016-02-13T00:00:00Z","timestamp":1455321600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"abstract":"<jats:title>Abstract<\/jats:title><jats:sec>\n                <jats:title>Background<\/jats:title>\n                <jats:p>Networks or graphs play an important role in the biological sciences. Protein interaction networks and metabolic networks support the understanding of basic cellular mechanisms. In the human brain, networks of functional or structural connectivity model the information-flow between cortex regions. In this context, measures of network properties are needed. We propose a new measure, Ndim, estimating the complexity of arbitrary networks. This measure is based on a fractal dimension, which is similar to recently introduced box-covering dimensions. However, box-covering dimensions are only applicable to fractal networks. The construction of these network-dimensions relies on concepts proposed to measure fractality or complexity of irregular sets in <jats:inline-formula><jats:alternatives><jats:tex-math>$\\mathbb {R}^{n}$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                        <mml:msup>\n                          <mml:mrow>\n                            <mml:mi>\u211d<\/mml:mi>\n                          <\/mml:mrow>\n                          <mml:mrow>\n                            <mml:mi>n<\/mml:mi>\n                          <\/mml:mrow>\n                        <\/mml:msup>\n                      <\/mml:math><\/jats:alternatives><\/jats:inline-formula>.<\/jats:p>\n              <\/jats:sec><jats:sec>\n                <jats:title>Results<\/jats:title>\n                <jats:p>The network measure Ndim grows with the proliferation of increasing network connectivity and is essentially determined by the cardinality of a maximum <jats:italic>k<\/jats:italic>-clique, where <jats:italic>k<\/jats:italic> is the characteristic path length of the network. Numerical applications to lattice-graphs and to fractal and non-fractal graph models, together with formal proofs show, that Ndim estimates a dimension of complexity for arbitrary graphs. Box-covering dimensions for fractal graphs rely on a linear log\u2212log plot of minimum numbers of covering subgraph boxes versus the box sizes. We demonstrate the affinity between Ndim and the fractal box-covering dimensions but also that Ndim extends the concept of a fractal dimension to networks with non-linear log\u2212log plots. Comparisons of Ndim with topological measures of complexity (cost and efficiency) show that Ndim has larger informative power. Three different methods to apply Ndim to weighted networks are finally presented and exemplified by comparisons of functional brain connectivity of healthy and depressed subjects.<\/jats:p>\n              <\/jats:sec><jats:sec>\n                <jats:title>Conclusion<\/jats:title>\n                <jats:p>We introduce a new measure of complexity for networks. We show that Ndim has the properties of a dimension and overcomes several limitations of presently used topological and fractal complexity-measures. It allows the comparison of the complexity of networks of different type, e.g., between fractal graphs characterized by hub repulsion and small world graphs with strong hub attraction. The large informative power and a convenient computational CPU-time for moderately sized networks may make Ndim a valuable tool for the analysis of biological networks.<\/jats:p>\n              <\/jats:sec>","DOI":"10.1186\/s12859-016-0933-9","type":"journal-article","created":{"date-parts":[[2016,2,12]],"date-time":"2016-02-12T23:58:48Z","timestamp":1455321528000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["A new method to measure complexity in binary or weighted networks and applications to functional connectivity in the human brain"],"prefix":"10.1186","volume":"17","author":[{"given":"Klaus","family":"Hahn","sequence":"first","affiliation":[]},{"given":"Peter R.","family":"Massopust","sequence":"additional","affiliation":[]},{"given":"Sergei","family":"Prigarin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,2,13]]},"reference":[{"key":"933_CR1","volume-title":"Neuroproteomics","author":"A Vazquez","year":"2010","unstructured":"Vazquez A. Protein interaction networks. In: Alzate O, editor. Neuroproteomics. Boca Raton: CRC Press: 2010. p. 1\u201314."},{"key":"933_CR2","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1007\/s12257-014-0172-8","volume":"19","author":"LS Jing","year":"2014","unstructured":"Jing LS, Shah FFM, Mohamed MS, Hamram NL, Salleh AHM, Deris S, et al. Database and tools for metabolic analysis. Biotech Bioproc Eng. 2014; 19:568\u201385.","journal-title":"Biotech Bioproc Eng"},{"key":"933_CR3","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1038\/nrn2575","volume":"10","author":"ED Bullmore","year":"2009","unstructured":"Bullmore ED, Sporns O. Complex brain networks: graph theoretical analysis of structural and functional systems. Nat Rev Neurosci. 2009; 10:186\u201398.","journal-title":"Nat Rev Neurosci"},{"key":"933_CR4","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1016\/j.neuroimage.2011.08.085","volume":"62","author":"O Sporns","year":"2012","unstructured":"Sporns O. From simple graphs to the connectome: Networks in neuroimaging. NeuroImage. 2012; 62:881\u20136.","journal-title":"NeuroImage"},{"key":"933_CR5","doi-asserted-by":"publisher","first-page":"1059","DOI":"10.1016\/j.neuroimage.2009.10.003","volume":"52","author":"M Rubinov","year":"2010","unstructured":"Rubinov M, Sporns O. Complex network measures of brain connectivity: Uses and interpretations. NeuroImage. 2010; 52:1059\u201369.","journal-title":"NeuroImage"},{"key":"933_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0013701","volume":"5","author":"BCM Van Wijk","year":"2010","unstructured":"Van Wijk BCM, Stam CJ, Daffertshofer A. Comparing brain networks of different size and connectivity density using graph theory. PLOS-One. 2010; 5:1\u201313.","journal-title":"PLOS-One"},{"issue":"1\u20132","key":"933_CR7","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1080\/03081089008818029","volume":"28","author":"G Constantine","year":"1990","unstructured":"Constantine G. Graph complexity and the Laplacian matrix in blocked experiments. Linear Multilinear Algebra. 1990; 28(1\u20132):49\u201356.","journal-title":"Linear Multilinear Algebra"},{"issue":"5","key":"933_CR8","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF00279952","volume":"25","author":"P Pudlak","year":"1988","unstructured":"Pudlak P, Roedl V, Savicky P. Graph complexity. Acta Inform. 1988; 25(5):515\u201335.","journal-title":"Acta Inform"},{"issue":"6","key":"933_CR9","first-page":"651","volume":"59","author":"D Minoli","year":"1975","unstructured":"Minoli D. Combinatorial graph complexity. Atti Accad Naz Lincei Rend Cl Sci Fis Mat Nat. (8). 1975; 59(6):651\u201361.","journal-title":"Atti Accad Naz Lincei Rend Cl Sci Fis Mat Nat. (8)"},{"key":"933_CR10","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1038\/nature03248","volume":"433","author":"S Song","year":"2005","unstructured":"Song S, Havlin S, Makse HA. Self-similarity of complex networks. Nature. 2005; 433:392\u2013395.","journal-title":"Nature"},{"key":"933_CR11","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1038\/nphys266","volume":"2","author":"S Song","year":"2006","unstructured":"Song S, Havlin S, Makse HA. Origins of fractality in the growth of complex networks. Nat Phys. 2006; 2:275\u201381.","journal-title":"Nat Phys"},{"key":"933_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1103\/PhysRevE.75.056115","volume":"75","author":"M Kitsak","year":"2007","unstructured":"Kitsak M, Havlin S, Paul G, Riccaboni M, Pammolli F, Stanley HE. Betweenness centrality of fractal and nonfractal scale-free model networks and tests on real networks. Phys Rev E. 2007; 75:1\u20138.","journal-title":"Phys Rev E"},{"key":"933_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0378-4371(96)00248-8","volume":"233","author":"K Sandau","year":"1996","unstructured":"Sandau K. A note on fractal sets and the measurement of fractal dimension. Physica A. 1996; 233:1\u201318.","journal-title":"Physica A"},{"key":"933_CR14","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1046\/j.1365-2818.1997.1270685.x","volume":"186","author":"K Sandau","year":"1996","unstructured":"Sandau K, Kurz H. Measuring fractal dimension and complexity \u2013 an alternative approach with an application. J Microscopy. 1996; 186:164\u201376.","journal-title":"J Microscopy"},{"key":"933_CR15","volume-title":"Fractal Geometry","author":"K Falconer","year":"2005","unstructured":"Falconer K. Fractal Geometry, Second ed. New York: Wiley & Sons; 2005."},{"key":"933_CR16","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1016\/j.media.2009.05.003","volume":"13","author":"R Lopes","year":"2009","unstructured":"Lopes R, Betrouni N. Fractal and multifractal analysis: A review. Med Im An. 2009; 13:634\u201349.","journal-title":"Med Im An"},{"key":"933_CR17","first-page":"167","volume":"2","author":"S Prigarin","year":"2014","unstructured":"Prigarin S, Sandau K, Kazmierczak M, Hahn K. Estimation of fractal dimensions: a survey with numerical experiments and software description. Int J Biomath Biostat. 2014; 2:167\u201380.","journal-title":"Int J Biomath Biostat"},{"key":"933_CR18","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1126\/science.156.3775.636","volume":"156","author":"B Mandelbrot","year":"1967","unstructured":"Mandelbrot B. How long is the coast of Britain? Statistical self-similarity and fractional dimension. Science. 1967; 156:636\u20138.","journal-title":"Science"},{"key":"933_CR19","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1016\/j.physa.2007.07.069","volume":"386","author":"LK Gallos","year":"2007","unstructured":"Gallos LK, Song C, Makse HA. A review of fractality and self-similarity in complex networks. Physica A. 2007; 386:686\u201391.","journal-title":"Physica A"},{"doi-asserted-by":"publisher","unstructured":"Kim JS, Goh K-I, Kahn B, Kim D. Fractality and self-similarity in scale-free networks. New J Phys. 2007; 9. doi:10.1088\/1367-2630\/9\/6\/177.","key":"933_CR20","DOI":"10.1088\/1367-2630\/9\/6\/177"},{"key":"933_CR21","doi-asserted-by":"publisher","first-page":"2798","DOI":"10.1016\/j.physa.2011.12.055","volume":"391","author":"N Blagus","year":"2012","unstructured":"Blagus N, Subelji L, Bajee M. Self-similar scaling of density in complex real-world networks. Physica A. 2012; 391:2798\u2013802.","journal-title":"Physica A"},{"key":"933_CR22","doi-asserted-by":"publisher","first-page":"2825","DOI":"10.1073\/pnas.1106612109","volume":"109","author":"KL Gallos","year":"2012","unstructured":"Gallos KL, Makse HA, Sigman M. A small world of weak ties provides optimal global integration of self-similar modules in functional brain networks. PNAS. 2012; 109:2825\u201330.","journal-title":"PNAS"},{"key":"933_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3389\/fphys.2012.00123","volume":"3","author":"KL Gallos","year":"2012","unstructured":"Gallos KL, Sigman M, Makse HA. The conundrum of functional brain networks: small world-efficiency or fractal modularity. Frontiers Phys. 2012; 3:1\u20139.","journal-title":"Frontiers Phys"},{"key":"933_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1103\/PhysRevLett.110.168703","volume":"110","author":"L Lacasa","year":"2013","unstructured":"Lacasa L, Gomez-Gardenes J. Correlation dimension of complex networks. Phys Rev Lett. 2013; 110:1\u20135.","journal-title":"Phys Rev Lett"},{"doi-asserted-by":"crossref","unstructured":"Hahn K, Sandau K, Rodenacker K, Prigarin S. Novel algorithms to measure complexity in the human brain and to detect statistically significant complexity-differences. Electronic Supplement of Journal MAGMA, vol. 19, Suppl 1: Springer Link; 2006. http:\/\/dx.doi.org\/10.1007\/s10334-006-0043-1.","key":"933_CR25","DOI":"10.1007\/s10334-006-0043-1"},{"key":"933_CR26","first-page":"1858","volume":"15","author":"K Hahn","year":"2007","unstructured":"Hahn K, Prigarin S, Rodenacker K, Sandau K. A fractal dimension for exploratory fMRI analysis. Proc. Intl. Soc. Magn. Reson. Med. 2007; 15:1858.","journal-title":"Proc. Intl. Soc. Magn. Reson. Med"},{"key":"933_CR27","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1134\/S1995423908020079","volume":"1","author":"S Prigarin","year":"2008","unstructured":"Prigarin S, Hahn K, Winkler G. Comparative analysis of two numerical methods to measure Hausdorff dimension of the fractional Brownian motion. Num Anal and Appl. 2008; 1:163\u201378.","journal-title":"Num Anal and Appl"},{"key":"933_CR28","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/0012-365X(77)90144-3","volume":"17","author":"JK Doyle","year":"1977","unstructured":"Doyle JK, Graver JE. Mean distance in a graph. Discr Math. 1977; 17:147\u201354.","journal-title":"Discr Math"},{"key":"933_CR29","volume-title":"Structural Analysis of Complex Networks","author":"W Goddard","year":"2011","unstructured":"Goddard W, Oellermann OR. Distance in Graphs In: Dehner M, editor. Structural Analysis of Complex Networks. New York: Springer Verlag: 2011. p. 49\u201372."},{"unstructured":"Balasundaram B. Graph Theoretic Generalizations of Clique: Optimization and Extensions. PhD Thesis: Texas A&M University; 2007.","key":"933_CR30"},{"key":"933_CR31","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/0167-6377(90)90057-C","volume":"9","author":"R Carraghan","year":"1990","unstructured":"Carraghan R, Pardalos PM. An exact algorithm for the maximum clique problem. Oper Res Lett. 1990; 9:375\u201382.","journal-title":"Oper Res Lett"},{"key":"933_CR32","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.tcs.2006.06.015","volume":"363","author":"E Tomita","year":"2006","unstructured":"Tomita E, Tanaka A, Takahashi H. The worst-case time complexity for generating all maximal cliques and computational experiments. Theor Comp Sc. 2006; 363:28\u201342.","journal-title":"Theor Comp Sc"},{"doi-asserted-by":"publisher","unstructured":"Song C, Gallos LK, Havlin S, Makse HA. How to calculate the fractal dimension of a complex network: the box-covering algorithm. J Stat Mech Theory Exp. 2007. doi:10.1088\/1742-5468\/2007\/03\/P03006.","key":"933_CR33","DOI":"10.1088\/1742-5468\/2007\/03\/P03006"},{"key":"933_CR34","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-4529-6","volume-title":"A Textbook of GraphTheory","author":"R Balakrishnan","year":"2012","unstructured":"Balakrishnan R, Ranganathan K. A Textbook of GraphTheory, Second ed. New York: Springer Verlag; 2012."},{"key":"933_CR35","first-page":"1","volume":"70","author":"MEJ Newman","year":"2004","unstructured":"Newman MEJ. Analysis of weighted networks. Phys Rev E. 2004; 70:1\u20139.","journal-title":"Phys Rev E"},{"doi-asserted-by":"publisher","unstructured":"Antoniou IE, Tsompa ET. Statistical analysis of weighted networks. Discret Dyn Nat Soc. 2008. doi:10.1155\/2008\/375452.","key":"933_CR36","DOI":"10.1155\/2008\/375452"},{"key":"933_CR37","first-page":"1","volume":"4\/147","author":"AF Alexander-Bloch","year":"2010","unstructured":"Alexander-Bloch AF, Gogtay N, Meunier D, Birn R, Clasen L, Lalonde F, et al. Disrupted modularity and local connectivity of brain functional networks in childhood-onset schizophrenia front. Syst Neurosci. 2010; 4\/147:1\u201316.","journal-title":"Syst Neurosci"},{"key":"933_CR38","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.neuroimage.2013.05.011","volume":"81","author":"K Hahn","year":"2013","unstructured":"Hahn K, Myers N, Prigarin S, Rodenacker K, Kurz A, F\u00f6rstl H, et al. Selectively and progressively disrupted structural connectivity of functional brain networks in Alzheimer\u2019s disease \u2013 Revealed by a novel framework to analyze edge distributions of networks detecting disruptions with strong statistical evidence. NeuroImage. 2013; 81:96\u2013109.","journal-title":"NeuroImage"},{"key":"933_CR39","first-page":"1","volume":"76.016101","author":"SE Ahnert","year":"2007","unstructured":"Ahnert SE, Garlaschelli D, Fink TMA, Cardarelli G. Ensemble approach to the analysis of weighted networks. Phys Rev E. 2007; 76.016101:1\u20135.","journal-title":"Phys Rev E"},{"key":"933_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1088\/1751-8113\/41\/22\/224011","volume":"41","author":"SE Ahnert","year":"2008","unstructured":"Ahnert SE, Garlaschelli D, Fink TMA, Cardarelli G. Applying weighted network measures to microarray distance matrices. J Phys A. 2008; 41:1\u20136.","journal-title":"J Phys A"},{"key":"933_CR41","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.physrep.2005.10.009","volume":"424","author":"S Boccaletti","year":"2006","unstructured":"Boccaletti S, Latora V, Moreno Y, Chavez M, Hwang DU. Complex networks: Structure and dynamics. Phys Rep. 2006; 424:175\u2013308.","journal-title":"Phys Rep"},{"key":"933_CR42","doi-asserted-by":"publisher","first-page":"1064","DOI":"10.1016\/j.neuroimage.2007.10.060","volume":"40","author":"Y Iturria-Medina","year":"2008","unstructured":"Iturria-Medina Y, Sotero RS, Canales-Rodriguez EJ, Aleman-Gomez Y, Melie-Garcia L. Studying the human brain anatomical network via diffusion-weighted MRI and Graph Theory. NeuroImage. 2008; 40:1064\u201376.","journal-title":"NeuroImage"},{"key":"933_CR43","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra EW. A note on two problems in Connexion with graphs. Numer Math. 1959; 1:269\u201371.","journal-title":"Numer Math"},{"unstructured":"Cavique L, Mendes AB, Santos JMA. An Algorithm to Discover the k-Clique Cover in Networks. Lecture Notes in Computer Science. Vol. 5816: Springer Link; 2009, pp. 363\u201373. http:\/\/link.springer.com\/chapter\/10.1007%2F978-3-642-04686-5_30#page-1.","key":"933_CR44"},{"key":"933_CR45","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1093\/brain\/awt290","volume":"137","author":"C Meng","year":"2014","unstructured":"Meng C, Brandl F, Tahmasian M, Shao J, Manoliu A, Scherr M, et al. Aberrant topology of striatum\u2019s connectivity is associated with the number of episodes in depression. Brain. 2014; 137:598\u2013609.","journal-title":"Brain"},{"key":"933_CR46","volume-title":"Wavelet Methods for Time Series Analysis","author":"DB Percival","year":"2002","unstructured":"Percival DB, Walden AT. Wavelet Methods for Time Series Analysis. Cambridge, UK: Cambridge University Press; 2002."},{"key":"933_CR47","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1016\/j.neuroimage.2006.05.064","volume":"35","author":"M Sigman","year":"2007","unstructured":"Sigman M, Jobert A, LeBihan D, Dehaene S. Parsing a sequence of brain activations at psychological times using fMRI. NeuroImage. 2007; 35:655\u201368.","journal-title":"NeuroImage"},{"key":"933_CR48","doi-asserted-by":"publisher","first-page":"036","DOI":"10.1103\/PhysRevE.69.036103","volume":"69","author":"M Kaiser","year":"2004","unstructured":"Kaiser M, Hilgetag C-C. Spatial growth of real-world networks. Phys Rev E. 2004; 69:036\u2013103.","journal-title":"Phys Rev E"},{"doi-asserted-by":"publisher","unstructured":"Marcelino J, Kaiser M. Critical paths in a metapopulation model of H1N1: Efficiently delaying influenza spreading through flight cancellation. PLoS Currents Influenza. 2012; 4:e4f8c9a2e1fca8. doi:10.1371\/4f8c9a2e1fca8.","key":"933_CR49","DOI":"10.1371\/4f8c9a2e1fca8"},{"key":"933_CR50","first-page":"921","volume":"30","author":"Y Choe","year":"2004","unstructured":"Choe Y, McCormick BH, Koh W. Network connectivity analysis on the temporally augmented C. elegans web: A pilot study. Soc Neurosci Abstracts. 2004; 30:921\u20139.","journal-title":"Soc Neurosci Abstracts"},{"key":"933_CR51","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1385\/NI:2:2:127","volume":"2","author":"R K\u00f6tter","year":"2004","unstructured":"K\u00f6tter R. Online retrieval, processing, and visualization of primate connectivity data from the CoCoMac database. Neuroinformatics. 2004; 2:127\u201344.","journal-title":"Neuroinformatics"},{"key":"933_CR52","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1016\/j.biopsych.2011.05.018","volume":"70","author":"J Zhang","year":"2011","unstructured":"Zhang J, Wang J, Wu Q, Kuang W, Huang X, He Y, et al. Disrupted brain connectivity networks in drug-naive, First-epsiode major depressive disorder. Biol Psych. 2011; 70:334\u201342.","journal-title":"Biol Psych"},{"key":"933_CR53","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1002\/(SICI)1521-4036(200001)42:1<17::AID-BIMJ17>3.0.CO;2-U","volume":"42","author":"E Brunner","year":"2000","unstructured":"Brunner E, Munzel U. Nonparametric Behrens\u2013Fisher problem: asymptotic theory and a small-sample approximation. Biom J. 2000; 42:17\u201325.","journal-title":"Biom J"},{"key":"933_CR54","volume-title":"Dimensions and extensions","author":"JM Aarts","year":"1993","unstructured":"Aarts JM, Nishiura T. Dimensions and extensions. Amsterdam: North-Holland Publishing Co; 1993."},{"key":"933_CR55","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-74749-1","volume-title":"Measure, Topology, and Fractal Geometry","author":"GA Edgar","year":"2008","unstructured":"Edgar GA. Measure, Topology, and Fractal Geometry, Second ed. New York: Springer-Verlag; 2008."},{"key":"933_CR56","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14279-6","volume-title":"Graph Theory","author":"R Diestel","year":"2010","unstructured":"Diestel R. Graph Theory, Fourth ed. New York: Springer-Verlag; 2010."},{"key":"933_CR57","first-page":"1","volume":"4\/22","author":"A Formito","year":"2010","unstructured":"Formito A, Zalesky A, Bullmore ET. Network scaling effects in graph analytic studies of the hman resting-state fMRI data. Front Syst Neurosci. 2010; 4\/22:1\u201316.","journal-title":"Front Syst Neurosci"},{"doi-asserted-by":"crossref","unstructured":"Eblen JD. The Maximum Clique Problem: Algorithms, Applications and Implementations. PhD Thesis: University of Tennessee; 2010.","key":"933_CR58","DOI":"10.1007\/978-3-642-21260-4_30"}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-016-0933-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s12859-016-0933-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-016-0933-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-016-0933-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T17:59:10Z","timestamp":1706810350000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/s12859-016-0933-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,13]]},"references-count":58,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2016,12]]}},"alternative-id":["933"],"URL":"https:\/\/doi.org\/10.1186\/s12859-016-0933-9","relation":{},"ISSN":["1471-2105"],"issn-type":[{"type":"electronic","value":"1471-2105"}],"subject":[],"published":{"date-parts":[[2016,2,13]]},"assertion":[{"value":"2 October 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 January 2016","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 February 2016","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"87"}}