{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T04:11:25Z","timestamp":1771042285062,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,3,22]],"date-time":"2010-03-22T00:00:00Z","timestamp":1269216000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["SFRH\/BD\/19753\/2004"],"award-info":[{"award-number":["SFRH\/BD\/19753\/2004"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,3,22]]},"DOI":"10.1145\/1774088.1774422","type":"proceedings-article","created":{"date-parts":[[2010,4,27]],"date-time":"2010-04-27T12:45:48Z","timestamp":1272372348000},"page":"1559-1566","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":78,"title":["g-tries"],"prefix":"10.1145","author":[{"given":"Pedro","family":"Ribeiro","sequence":"first","affiliation":[{"name":"Universidade do Porto, R. Campo Alegre, Porto, Portugal"}]},{"given":"Fernando","family":"Silva","sequence":"additional","affiliation":[{"name":"Universidade do Porto, R. Campo Alegre, Porto, Portugal"}]}],"member":"320","published-online":{"date-parts":[[2010,3,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/645920.672836"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bth402"},{"key":"e_1_3_2_1_3_1","volume-title":"Pajek datasets","author":"Batagelj V.","year":"2006","unstructured":"V. Batagelj and A. Mrvar . Pajek datasets , 2006 . http:\/\/vlado.fmf.uni-lj.si\/pub\/networks\/data\/. V. Batagelj and A. Mrvar. Pajek datasets, 2006. http:\/\/vlado.fmf.uni-lj.si\/pub\/networks\/data\/."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkg340"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132952.1132954"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1080\/00018730601170527"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-5-10"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/367390.367400"},{"key":"e_1_3_2_1_9_1","first-page":"92","volume-title":"Network motif discovery using subgraph enumeration and symmetry-breaking","author":"Grochow J.","year":"2007","unstructured":"J. Grochow and M. Kellis . Network motif discovery using subgraph enumeration and symmetry-breaking . pages 92 -- 106 . 2007 . J. Grochow and M. Kellis. Network motif discovery using subgraph enumeration and symmetry-breaking. pages 92--106. 2007."},{"key":"e_1_3_2_1_10_1","volume-title":"Data Mining","author":"Han J.","year":"2006","unstructured":"J. Han and M. Kamber . Data Mining , Second Edition : Concepts and Techniques. Morgan Kaufmann , September 2006 . J. Han and M. Kamber. Data Mining, Second Edition: Concepts and Techniques. Morgan Kaufmann, September 2006."},{"key":"e_1_3_2_1_11_1","volume-title":"January","author":"Itzkovitz S.","year":"2005","unstructured":"S. Itzkovitz , R. Levitt , N. Kashtan , R. Milo , M. Itzkovitz , and U. Alon . Coarse-graining and self-dissimilarity of complex networks. Phys Rev E Stat Nonlin Soft Matter Phys, 71(1 Pt 2) , January 2005 . S. Itzkovitz, R. Levitt, N. Kashtan, R. Milo, M. Itzkovitz, and U. Alon. Coarse-graining and self-dissimilarity of complex networks. Phys Rev E Stat Nonlin Soft Matter Phys, 71(1 Pt 2), January 2005."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bth163"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0805870105"},{"key":"e_1_3_2_1_14_1","volume-title":"IEEE International Conference on, 0: 313","author":"Kuramochi M.","year":"2001","unstructured":"M. Kuramochi and G. Karypis . Frequent subgraph discovery. Data Mining , IEEE International Conference on, 0: 313 , 2001 . M. Kuramochi and G. Karypis. Frequent subgraph discovery. Data Mining, IEEE International Conference on, 0:313, 2001."},{"key":"e_1_3_2_1_15_1","volume-title":"Benchmark graphs for testing community detection algorithms. Physical Review E (Statistical, Nonlinear, and Soft Matter Physics), 78(4)","author":"Lancichinetti A.","year":"2008","unstructured":"A. Lancichinetti , S. Fortunato , and F. Radicchi . Benchmark graphs for testing community detection algorithms. Physical Review E (Statistical, Nonlinear, and Soft Matter Physics), 78(4) , 2008 . A. Lancichinetti, S. Fortunato, and F. Radicchi. Benchmark graphs for testing community detection algorithms. Physical Review E (Statistical, Nonlinear, and Soft Matter Physics), 78(4), 2008."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00265-003-0651-y"},{"key":"e_1_3_2_1_17_1","first-page":"45","article-title":"Practical graph isomorphism","volume":"30","author":"McKay B.","year":"1981","unstructured":"B. McKay . Practical graph isomorphism . Cong. Numerantium , 30 : 45 -- 87 , 1981 . B. McKay. Practical graph isomorphism. Cong. Numerantium, 30:45--87, 1981.","journal-title":"Cong. Numerantium"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.298.5594.824"},{"key":"e_1_3_2_1_19_1","volume-title":"Network data, september","author":"Newman M.","year":"2009","unstructured":"M. Newman . Network data, september , 2009 . http:\/\/www-personal.umich.edu\/~mejn\/netdata\/. M. Newman. Network data, september, 2009. http:\/\/www-personal.umich.edu\/~mejn\/netdata\/."},{"key":"e_1_3_2_1_20_1","first-page":"45","article-title":"The structure and function of complex networks","author":"Newman M. E. J.","year":"2003","unstructured":"M. E. J. Newman . The structure and function of complex networks . SIAM Review , 45 , 2003 . M. E. J. Newman. The structure and function of complex networks. SIAM Review, 45, 2003.","journal-title":"SIAM Review"},{"key":"e_1_3_2_1_21_1","first-page":"2","article-title":"Motifs in brain networks","author":"Sporns O.","year":"2004","unstructured":"O. Sporns and R. Kotter . Motifs in brain networks . PLoS Biology , 2 , 2004 . O. Sporns and R. Kotter. Motifs in brain networks. PLoS Biology, 2, 2004.","journal-title":"PLoS Biology"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511815478","volume-title":"Social Network Analysis: Methods and Applications (Structural Analysis in the Social Sciences)","author":"Wasserman S.","year":"1994","unstructured":"S. Wasserman , K. Faust , and D. Iacobucci . Social Network Analysis: Methods and Applications (Structural Analysis in the Social Sciences) . Cambridge University Press , November 1994 . S. Wasserman, K. Faust, and D. Iacobucci. Social Network Analysis: Methods and Applications (Structural Analysis in the Social Sciences). Cambridge University Press, November 1994."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2006.51"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl038"}],"event":{"name":"SAC'10: The 2010 ACM Symposium on Applied Computing","location":"Sierre Switzerland","acronym":"SAC'10","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"]},"container-title":["Proceedings of the 2010 ACM Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1774088.1774422","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1774088.1774422","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:41:33Z","timestamp":1750250493000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1774088.1774422"}},"subtitle":["an efficient data structure for discovering network motifs"],"short-title":[],"issued":{"date-parts":[[2010,3,22]]},"references-count":25,"alternative-id":["10.1145\/1774088.1774422","10.1145\/1774088"],"URL":"https:\/\/doi.org\/10.1145\/1774088.1774422","relation":{},"subject":[],"published":{"date-parts":[[2010,3,22]]},"assertion":[{"value":"2010-03-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}