{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T17:13:06Z","timestamp":1767373986352},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642152931"},{"type":"electronic","value":"9783642152948"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15294-8_20","type":"book-chapter","created":{"date-parts":[[2010,9,10]],"date-time":"2010-09-10T08:51:46Z","timestamp":1284108706000},"page":"238-249","source":"Crossref","is-referenced-by-count":16,"title":["Efficient Subgraph Frequency Estimation with G-Tries"],"prefix":"10.1007","author":[{"given":"Pedro","family":"Ribeiro","sequence":"first","affiliation":[]},{"given":"Fernando","family":"Silva","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"18","key":"20_CR1","doi-asserted-by":"publisher","first-page":"3346","DOI":"10.1093\/bioinformatics\/bth402","volume":"20","author":"I. Albert","year":"2004","unstructured":"Albert, I., Albert, R.: Conserved network motifs allow protein-protein interaction prediction. Bioinformatics\u00a020(18), 3346\u20133352 (2004)","journal-title":"Bioinformatics"},{"issue":"9","key":"20_CR2","doi-asserted-by":"publisher","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.: Topological structure analysis of the protein-protein interaction network in budding yeast. Nucl. Acids Res.\u00a031(9), 2443\u20132450 (2003)","journal-title":"Nucl. Acids Res."},{"issue":"2","key":"20_CR3","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1093\/bfgp\/eln015","volume":"7","author":"G. Ciriello","year":"2008","unstructured":"Ciriello, G., Guerra, C.: A review on models and algorithms for motif discovery in protein-protein interaction networks. Brief Funct. Genomic Proteomic\u00a07(2), 147\u2013156 (2008)","journal-title":"Brief Funct. Genomic Proteomic"},{"key":"20_CR4","unstructured":"da\u00a0Costa Luciano, F., Oliveira Jr., O.N., Travieso, G., Rodrigues, F.A., Villas Boas, P.R., Antiqueira, L., Viana, M.P., da Rocha, L.E.C.: Analyzing and modeling real-world phenomena with complex networks: A survey of applications. ArXiv e-prints\u00a00711(3199) (2007)"},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1186\/1471-2105-5-10","volume":"5","author":"R. Dobrin","year":"2004","unstructured":"Dobrin, R., Beg, Q.K., Barabasi, A., Oltvai, Z.: Aggregation of topological motifs in the escherichia coli transcriptional regulatory network. BMC Bioinformatics\u00a05, 10 (2004)","journal-title":"BMC Bioinformatics"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Duch, J., Arenas, A.: Community identification using extremal optimization. Phys. Rev. E. (Stat. Nonlin. Soft Matter Phys.)\u00a072, 027104 (2005)","DOI":"10.1103\/PhysRevE.72.027104"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Grochow, J., Kellis, M.: Network motif discovery using subgraph enumeration and symmetry-breaking. Research in Computational Molecular Biology, 92\u2013106 (2007)","DOI":"10.1007\/978-3-540-71681-5_7"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Itzkovitz, S., Levitt, R., Kashtan, N., Milo, R., Itzkovitz, M., Alon, U.: Coarse-graining and self-dissimilarity of complex networks. Phys. Rev. E (Stat. Nonlin. Soft Matter Phys.)\u00a071(1 Pt. 2) (January 2005)","DOI":"10.1103\/PhysRevE.71.016127"},{"key":"20_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-540-85565-1_13","volume-title":"Knowledge-Based Intelligent Information and Engineering Systems","author":"K. Juszczyszyn","year":"2008","unstructured":"Juszczyszyn, K., Kazienko, P., Musial, K.: Local topology of social network based on motif analysis. In: Lovrek, I., Howlett, R.J., Jain, L.C. (eds.) KES 2008, Part II. LNCS (LNAI), vol.\u00a05178, pp. 97\u2013105. Springer, Heidelberg (2008)"},{"issue":"1","key":"20_CR10","doi-asserted-by":"publisher","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.: Kavosh: a new algorithm for finding network motifs. BMC Bioinformatics\u00a010(1), 318 (2009)","journal-title":"BMC Bioinformatics"},{"issue":"11","key":"20_CR11","doi-asserted-by":"publisher","first-page":"1746","DOI":"10.1093\/bioinformatics\/bth163","volume":"20","author":"N. Kashtan","year":"2004","unstructured":"Kashtan, N., Itzkovitz, S., Milo, R., Alon, U.: Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs. Bioinformatics\u00a020(11), 1746\u20131758 (2004)","journal-title":"Bioinformatics"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: IEEE International Conference on Data Mining, p. 313 (2001)","DOI":"10.1109\/ICDM.2001.989534"},{"issue":"4","key":"20_CR13","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/s00265-003-0651-y","volume":"54","author":"D. Lusseau","year":"2003","unstructured":"Lusseau, D., Schneider, K., Boisseau, O.J., Haase, P., Slooten, E., Dawson, S.M.: The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations. can geographic isolation explain this unique trait? Behavioral Ecology and Sociobiology\u00a054(4), 396\u2013405 (2003)","journal-title":"Behavioral Ecology and Sociobiology"},{"key":"20_CR14","first-page":"45","volume":"30","author":"B. McKay","year":"1981","unstructured":"McKay, B.: Practical graph isomorphism. Cong. Numerantium\u00a030, 45\u201387 (1981)","journal-title":"Cong. Numerantium"},{"issue":"5594","key":"20_CR15","doi-asserted-by":"publisher","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.: Network motifs: simple building blocks of complex networks. Science\u00a0298(5594), 824\u2013827 (2002)","journal-title":"Science"},{"issue":"5","key":"20_CR16","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1266\/ggs.84.385","volume":"84","author":"S. Omidi","year":"2009","unstructured":"Omidi, S., Schreiber, F., Masoudi-Nejad, A.: Moda: An efficient algorithm for network motif discovery in biological networks. Genes & genetic systems\u00a084(5), 385\u2013395 (2009)","journal-title":"Genes & genetic systems"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Ribeiro, P., Silva, F.: G-tries: an efficient data structure for discovering network motifs. In: ACM Symposium on Applied Computing (2010)","DOI":"10.1145\/1774088.1774422"},{"key":"20_CR18","volume-title":"5th IEEE International Conference on e-Science","author":"P. Ribeiro","year":"2009","unstructured":"Ribeiro, P., Silva, F., Kaiser, M.: Strategies for network motifs discovery. In: 5th IEEE International Conference on e-Science. IEEE CS Press, Oxford (2009)"},{"key":"20_CR19","unstructured":"Schreiber, F., Schwobbermeyer, H.: Towards motif detection in networks: Frequency concepts and flexible search. In: Proc. of the Int. Workshop on Network Tools and Applications in Biology (NETTAB 2004), pp. 91\u2013102 (2004)"},{"key":"20_CR20","doi-asserted-by":"crossref","unstructured":"Sporns, O., Kotter, R.: Motifs in brain networks. PLoS Biology\u00a02 (2004)","DOI":"10.1371\/journal.pbio.0020369"},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"Valverde, S., Sol\u00e9, R.V.: Network motifs in computational graphs: A case study in software architecture. Phys. Rev. E (Stat. Nonlin. Soft Matter Phys.)\u00a072(2) (2005)","DOI":"10.1103\/PhysRevE.72.026107"},{"issue":"6684","key":"20_CR22","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"D.J. Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of small-world networks. Nature\u00a0393(6684), 440\u2013442 (1998)","journal-title":"Nature"},{"issue":"4","key":"20_CR23","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1109\/TCBB.2006.51","volume":"3","author":"S. Wernicke","year":"2006","unstructured":"Wernicke, S.: Efficient detection of network motifs. IEEE\/ACM Trans. Comput. Biol. Bioinformatics\u00a03(4), 347\u2013359 (2006)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinformatics"}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15294-8_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T07:51:50Z","timestamp":1553068310000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15294-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642152931","9783642152948"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15294-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}