{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T04:39:23Z","timestamp":1776400763616,"version":"3.51.2"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,2,12]],"date-time":"2013-02-12T00:00:00Z","timestamp":1360627200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2014,3]]},"DOI":"10.1007\/s10618-013-0303-4","type":"journal-article","created":{"date-parts":[[2013,2,11]],"date-time":"2013-02-11T10:45:53Z","timestamp":1360579553000},"page":"337-377","source":"Crossref","is-referenced-by-count":55,"title":["G-Tries: a data structure for storing and finding subgraphs"],"prefix":"10.1007","volume":"28","author":[{"given":"Pedro","family":"Ribeiro","sequence":"first","affiliation":[]},{"given":"Fernando","family":"Silva","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,2,12]]},"reference":[{"key":"303_CR1","unstructured":"Adamic LA, Glance N (2005) The political blogosphere and the 2004 U.S. election: divided they blog. In: 3rd International workshop on link discovery (LinkKDD). ACM, New York, pp 36\u201343"},{"issue":"18","key":"303_CR2","doi-asserted-by":"crossref","first-page":"3346","DOI":"10.1093\/bioinformatics\/bth402","volume":"20","author":"I Albert","year":"2004","unstructured":"Albert I, Albert R (2004) Conserved network motifs allow protein\u2013protein interaction prediction. Bioinformatics 20(18):3346\u20133352","journal-title":"Bioinformatics"},{"key":"303_CR3","doi-asserted-by":"crossref","unstructured":"Albert R, Barabasi AL (2002) Statistical mechanics of complex networks. Rev Modern Phys 74(1):47\u201397. doi: 10.1103\/RevModPhys.74.47","DOI":"10.1103\/RevModPhys.74.47"},{"key":"303_CR4","unstructured":"Arenas A (2011) Network data sets. http:\/\/deim.urv.cat\/aarenas\/data\/welcome.htm"},{"key":"303_CR5","unstructured":"Batagelj V, Mrvar A (2006) Pajek datasets. http:\/\/vlado.fmf.uni-lj.si\/pub\/networks\/data\/"},{"key":"303_CR6","unstructured":"Borgelt C, Berthold MR (2002) Mining molecular fragments: finding relevant substructures of molecules. In: 2nd IEEE International conference on data mining (ICDM). IEEE Computer Society Press, Washington, DC"},{"issue":"9","key":"303_CR7","doi-asserted-by":"crossref","first-page":"2443","DOI":"10.1093\/nar\/gkg340","volume":"31","author":"D Bu","year":"2003","unstructured":"Bu D, Zhao Y, Cai L, Xue H, Zhu X, Lu H, Zhang J, Sun S, Ling L, Zhang N, Li G, Chen R (2003) Topological structure analysis of the protein\u2013protein interaction network in budding yeast. Nucleic Acids Res 31(9):2443\u20132450","journal-title":"Nucleic Acids Res"},{"key":"303_CR8","doi-asserted-by":"crossref","unstructured":"Cha M, Haddadi H, Benevenuto F, Gummadi KP (2010) Measuring user influence in twitter: the million follower fallacy. In: 4th International AAAI conference on weblogs and social media (ICWSM)","DOI":"10.1609\/icwsm.v4i1.14033"},{"key":"303_CR9","doi-asserted-by":"crossref","unstructured":"Chen J, Hsu W, Lee ML, Ng SK (2006) Nemofinder: dissecting genome-wide protein\u2013protein interactions with meso-scale network motifs. In: 12th ACM SIGKDD international conference on knowledge discovery and data mining (KDD). ACM, New York, pp 106\u2013115","DOI":"10.1145\/1150402.1150418"},{"issue":"2","key":"303_CR10","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1093\/bfgp\/eln015","volume":"7","author":"G Ciriello","year":"2008","unstructured":"Ciriello G, Guerra C (2008) A review on models and algorithms for motif discovery in protein\u2013protein interaction networks. Briefings Funct Genomics 7(2):147\u2013156","journal-title":"Briefings Funct Genomics"},{"key":"303_CR11","doi-asserted-by":"crossref","unstructured":"Cook SA (1971) The complexity of theorem-proving procedures. In: 3rd Annual ACM symposium on theory of computing, STOC \u201971. ACM, New York, pp 151\u2013158","DOI":"10.1145\/800157.805047"},{"key":"303_CR12","doi-asserted-by":"crossref","unstructured":"da Costa LF, Rodrigues FA, Travieso G, Boas PRV (2007) Characterization of complex networks: a survey of measurements. Adv Phys 56:167","DOI":"10.1080\/00018730601170527"},{"key":"303_CR13","doi-asserted-by":"crossref","unstructured":"Duch J, Arenas A (2005) Community detection in complex networks using extremal optimization. Phys Rev E (Stat Nonlinear Soft Matter Phys) 72:027,104","DOI":"10.1103\/PhysRevE.72.027104"},{"issue":"9","key":"303_CR14","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1145\/367390.367400","volume":"3","author":"E Fredkin","year":"1960","unstructured":"Fredkin E (1960) Trie memory. Commun ACM 3(9):490\u2013499","journal-title":"Commun ACM"},{"key":"303_CR15","doi-asserted-by":"crossref","unstructured":"Grochow J, Kellis M (2007) Network motif discovery using subgraph enumeration and symmetry-breaking. Res Comput Mol Biol 92\u2013106","DOI":"10.1007\/978-3-540-71681-5_7"},{"key":"303_CR16","unstructured":"Howe D (2010) Foldoc, free online dictionary of computing. http:\/\/foldoc.org\/"},{"key":"303_CR17","doi-asserted-by":"crossref","unstructured":"Huan J, Bandyopadhyay D, Prins J, Snoeyink J, Tropsha A, Wang W (2006) Distance-based identification of structure motifs in proteins using constrained frequent subgraph mining. In: IEEE Symposium on computational intelligence in bioinformatics and computational biology (CIBCB)","DOI":"10.1142\/9781860947575_0029"},{"key":"303_CR18","doi-asserted-by":"crossref","unstructured":"Huan J, Wang W, Prins J (2003) Efficient mining of frequent subgraphs in the presence of isomorphism. In: 3rd IEEE International conference on data mining (ICDM). IEEE Computer Society Press, Washington, DC, p 549","DOI":"10.1109\/ICDM.2003.1250974"},{"key":"303_CR19","unstructured":"K\u00e4rkk\u00e4inen L (2008) Yet another java vs. c++ shootout. http:\/\/zi.fi\/shootout\/"},{"issue":"1","key":"303_CR20","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1186\/1471-2105-10-318","volume":"10","author":"Z Kashani","year":"2009","unstructured":"Kashani Z, Ahrabian H, Elahi E, Nowzari-Dalini A, Ansari E, Asadi S, Mohammadi S, Schreiber F, Masoudi-Nejad A (2009) Kavosh: a new algorithm for finding network motifs. BMC Bioinform 10(1):318","journal-title":"BMC Bioinform"},{"issue":"11","key":"303_CR21","doi-asserted-by":"crossref","first-page":"1746","DOI":"10.1093\/bioinformatics\/bth163","volume":"20","author":"N Kashtan","year":"2004","unstructured":"Kashtan N, Itzkovitz S, Milo R, Alon U (2004) Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs. Bioinformatics 20(11):1746\u20131758","journal-title":"Bioinformatics"},{"key":"303_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0333-9","volume-title":"The graph isomorphism problem: its structural complexity (Progress in Theoretical Computer Science)","author":"J K\u00f6bler","year":"1993","unstructured":"K\u00f6bler J, Sch\u00f6ning U, Tor\u00e1n J (1993) The graph isomorphism problem: its structural complexity (Progress in Theoretical Computer Science). Birkhauser Verlag, Basel"},{"key":"303_CR23","doi-asserted-by":"crossref","unstructured":"Lacroix V, Fernandes CG, Sagot MF (2006) Motif search in graphs: application to metabolic networks. IEEE\/ACM Trans Comput Biol Bioinform 3(4):360\u2013368","DOI":"10.1109\/TCBB.2006.55"},{"key":"303_CR24","doi-asserted-by":"crossref","unstructured":"Lancichinetti A, Fortunato S, Radicchi F (2008) Benchmark graphs for testing community detection algorithms. Phys Rev E (Stat Nonlinear Soft Matter Phys) 78(4):046,110","DOI":"10.1103\/PhysRevE.78.046110"},{"issue":"4","key":"303_CR25","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1007\/s00265-003-0651-y","volume":"54","author":"D Lusseau","year":"2003","unstructured":"Lusseau D, Schneider K, Boisseau OJ, Haase P, Slooten E, Dawson SM (2003) The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations. Can geographic isolation explain this unique trait? Behav Ecol Sociobiol 54(4):396\u2013405","journal-title":"Behav Ecol Sociobiol"},{"key":"303_CR26","first-page":"45","volume":"30","author":"B McKay","year":"1981","unstructured":"McKay B (1981) Practical graph isomorphism. Congressus Numerantium 30:45\u201387","journal-title":"Congressus Numerantium"},{"issue":"2","key":"303_CR27","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1006\/jagm.1997.0898","volume":"26","author":"B McKay","year":"1998","unstructured":"McKay B (1998) Isomorph-free exhaustive generation. J Algorithms 26(2):306\u2013324","journal-title":"J Algorithms"},{"issue":"5663","key":"303_CR28","doi-asserted-by":"crossref","first-page":"1538","DOI":"10.1126\/science.1089167","volume":"303","author":"R Milo","year":"2004","unstructured":"Milo R, Itzkovitz S, Kashtan N, Levitt R, Shen-Orr S, Ayzenshtat I, Sheffer M, Alon U (2004) Superfamilies of evolved and designed networks. Science 303(5663):1538\u20131542","journal-title":"Science"},{"issue":"5594","key":"303_CR29","doi-asserted-by":"crossref","first-page":"824","DOI":"10.1126\/science.298.5594.824","volume":"298","author":"R Milo","year":"2002","unstructured":"Milo R, Shen-Orr S, Itzkovitz S, Kashtan N, Chklovskii D, Alon U (2002) Network motifs: simple building blocks of complex networks. Science 298(5594):824\u2013827","journal-title":"Science"},{"key":"303_CR30","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1145\/1273442.1250746","volume":"42","author":"N Nethercote","year":"2007","unstructured":"Nethercote N, Seward J (2007) Valgrind: a framework for heavyweight dynamic binary instrumentation. ACM SIGPLAN Notices 42:89\u2013100","journal-title":"ACM SIGPLAN Notices"},{"key":"303_CR31","unstructured":"Newman M (2009) Network data. http:\/\/www-personal.umich.edu\/mejn\/netdata\/"},{"key":"303_CR32","doi-asserted-by":"crossref","unstructured":"Newman MEJ (2003) The structure and function of complex networks. SIAM Rev 45(2):167\u2013256. doi: 10.1137\/S003614450342480","DOI":"10.1137\/S003614450342480"},{"key":"303_CR33","doi-asserted-by":"crossref","unstructured":"Newman MEJ (2006) Finding community structure in networks using the eigenvectors of matrices. Phys Rev E (Stat Nonlinear Soft Matter Phys) 74(3):036,104","DOI":"10.1103\/PhysRevE.74.036104"},{"key":"303_CR34","doi-asserted-by":"crossref","unstructured":"Nijssen S, Kok JN (2004) Frequent graph mining and its application to molecular databases. In: 2004 IEEE International conference on systems, man and cybernetics, vol 5. doi: 10.1109\/ICSMC.2004.1401252","DOI":"10.1109\/ICSMC.2004.1401252"},{"key":"303_CR35","unstructured":"Norlen K, Lucas G, Gebbie M, Chuang J (2002) EVA: extraction, visualization and analysis of the telecommunications and media ownership network. In: International telecommunications society 14th biennial conference (ITS). International Telecommunications Society, Seoul"},{"issue":"5","key":"303_CR36","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1266\/ggs.84.385","volume":"84","author":"S Omidi","year":"2009","unstructured":"Omidi S, Schreiber F, Masoudi-Nejad A (2009) Moda: an efficient algorithm for network motif discovery in biological networks. Genes Genetic Syst 84(5):385\u2013395","journal-title":"Genes Genetic Syst"},{"key":"303_CR37","doi-asserted-by":"crossref","unstructured":"Pasquier N, Bastide Y, Taouil R, Lakhal L. (1999) Discovering frequent closed itemsets for association rules. In: ICDT \u201999: 7th international conference on database theory. Springer, London, pp 398\u2013416","DOI":"10.1007\/3-540-49257-7_25"},{"key":"303_CR38","doi-asserted-by":"crossref","first-page":"e177","DOI":"10.1093\/bioinformatics\/btl301","volume":"23","author":"N Pr\u017eulj","year":"2007","unstructured":"Pr\u017eulj N (2007) Biological network comparison using graphlet degree distribution. Bioinformatics 23:e177\u2013e183","journal-title":"Bioinformatics"},{"key":"303_CR39","unstructured":"Reitz J (2002) Odlis: online dictionary of library and information science. http:\/\/vlado.fmf.uni-lj.si\/pub\/networks\/data\/dic\/odlis\/odlis.pdf"},{"key":"303_CR40","unstructured":"Ribeiro P, Silva F (2010) Efficient subgraph frequency estimation with g-tries. In: International workshop on algorithms in bioinformatics (WABI), LNCS. Springer, vol 6293, pp 238\u2013249"},{"key":"303_CR41","doi-asserted-by":"crossref","unstructured":"Ribeiro P, Silva F (2010) G-tries: n efficient data structure for discovering network motifs. In: 25th ACM symposium on applied computing (SAC). ACM, pp 1559\u20131566","DOI":"10.1145\/1774088.1774422"},{"key":"303_CR42","doi-asserted-by":"crossref","unstructured":"Ribeiro P, Silva F (2012) Querying subgraph sets with g-tries. In: 2nd ACM SIGMOD workshop on databases and social networks. ACM 25\u201330. doi: 10.1145\/2304536.2304541 .","DOI":"10.1145\/2304536.2304541"},{"key":"303_CR43","doi-asserted-by":"crossref","unstructured":"Ribeiro P, Silva F, Kaiser M (2009) Strategies for network motifs discovery. In: 5th IEEE international conference on e-science. IEEE Computer Society Press, Oxford, pp 80\u201387","DOI":"10.1109\/e-Science.2009.20"},{"key":"303_CR44","doi-asserted-by":"crossref","unstructured":"Ribeiro P, Silva F, Lopes L (2010) Efficient parallel subgraph counting using g-tries. In: IEEE International conference on cluster computing (Cluster). IEEE Computer Society Press, pp 1559\u20131566","DOI":"10.1109\/CLUSTER.2010.27"},{"key":"303_CR45","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/j.jpdc.2011.08.007","volume":"72","author":"P Ribeiro","year":"2012","unstructured":"Ribeiro P, Silva F, Lopes L (2012) Parallel discovery of network motifs. J Parallel Distrib Comput 72:144\u2013154","journal-title":"J Parallel Distrib Comput"},{"key":"303_CR46","unstructured":"Schreiber F, Schwobbermeyer H (2004) Towards motif detection in networks: frequency concepts and flexible search. In: International workshop on network tools and applications in biology (NETTAB), pp 91\u2013102"},{"issue":"1","key":"303_CR47","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1038\/ng881","volume":"31","author":"SS Shen-Orr","year":"2002","unstructured":"Shen-Orr SS, Milo R, Mangan S, Alon U (2002) Network motifs in the transcriptional regulation network of Escherichia coli. Nat Genet 31(1):64\u201368","journal-title":"Nat Genet"},{"key":"303_CR48","doi-asserted-by":"crossref","unstructured":"Sporns O, Kotter R (2004) Motifs in brain networks. PLoS Biol 2(11):e369. doi: 10.1371\/journal.pbio.0020369","DOI":"10.1371\/journal.pbio.0020369"},{"key":"303_CR49","doi-asserted-by":"crossref","unstructured":"Tarjan R (1971) Depth-first search and linear graph algorithms. In: Annual IEEE symposium on foundations of computer science. IEEE Computer Society, Los Alamitos, pp 114\u2013121","DOI":"10.1109\/SWAT.1971.10"},{"key":"303_CR50","doi-asserted-by":"crossref","unstructured":"Valverde S, Sol\u00e9 RV (2005) Network motifs in computational graphs: A case study in software architecture. Phys Rev E 72(2), 026107. doi: 10.1103\/PhysRevE.72.026107","DOI":"10.1103\/PhysRevE.72.026107"},{"key":"303_CR51","doi-asserted-by":"crossref","unstructured":"Wang C, Parthasarathy S (2004) Parallel algorithms for mining frequent structural motifs in scientific data. In: ACM International conference on supercomputing (ICS)","DOI":"10.1145\/1006209.1006215"},{"issue":"6684","key":"303_CR52","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts DJ, Strogatz SH (1998) Collective dynamics of \u2019small-world\u2019 networks. Nature 393(6684):440\u2013442","journal-title":"Nature"},{"key":"303_CR53","doi-asserted-by":"crossref","unstructured":"Wernicke S (2005) A faster algorithm for detecting network motifs. In: International workshop on algorithms in bioinformatics (WABI), LNCS. Springer, vol 3692, pp. 165\u2013177","DOI":"10.1007\/11557067_14"},{"issue":"4","key":"303_CR54","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1109\/TCBB.2006.51","volume":"3","author":"S Wernicke","year":"2006","unstructured":"Wernicke S (2006) Efficient detection of network motifs. IEEE\/ACM Trans Comput Biol Bioinform 3(4):347\u2013359","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"key":"303_CR55","doi-asserted-by":"crossref","unstructured":"White JG, Southgate E, Thomson JN, Brenner S (1986) The structure of the nervous system of the Nematode Caenorhabditis elegans. Philos Trans R Soc London B Biol Sci 314(1165):1\u2013340","DOI":"10.1098\/rstb.1986.0056"},{"key":"303_CR56","unstructured":"Yan X, Han J (2002) gspan: graph-based substructure pattern mining. In: 2nd IEEE International conference on data mining (ICDM). IEEE Computer Society Press, Washington, DC, p 721"},{"key":"303_CR57","doi-asserted-by":"crossref","unstructured":"Yan X, Yu PS, Han J (2004) Graph indexing: a frequent structure-based approach. In: Proceedings of the 2004 ACM SIGMOD international conference on management of data, SIGMOD \u201904. ACM, New York, pp 335\u2013346","DOI":"10.1145\/1007568.1007607"},{"key":"303_CR58","unstructured":"Yuan D, Mitra P (2011) A lattice-based graph index for subgraph search. In: 14th International workshop on the web and databases (WebDB)"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-013-0303-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-013-0303-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-013-0303-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,29]],"date-time":"2023-06-29T10:52:47Z","timestamp":1688035967000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-013-0303-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,12]]},"references-count":58,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,3]]}},"alternative-id":["303"],"URL":"https:\/\/doi.org\/10.1007\/s10618-013-0303-4","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2,12]]}}}