{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,12]],"date-time":"2025-09-12T19:30:45Z","timestamp":1757705445209,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319054001"},{"type":"electronic","value":"9783319054018"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-05401-8_11","type":"book-chapter","created":{"date-parts":[[2014,2,20]],"date-time":"2014-02-20T10:19:39Z","timestamp":1392891579000},"page":"107-118","source":"Crossref","is-referenced-by-count":19,"title":["Discovering Colored Network Motifs"],"prefix":"10.1007","author":[{"given":"Pedro","family":"Ribeiro","sequence":"first","affiliation":[]},{"given":"Fernando","family":"Silva","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"5594","key":"11_CR1","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":"18","key":"11_CR2","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"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1145\/2065023.2065036","volume-title":"3rd Int. Workshop on Search and Mining User-Generated Contents (SMUC)","author":"G. Wu","year":"2011","unstructured":"Wu, G., Harrigan, M., Cunningham, P.: Characterizing wikipedia pages using edit network motif profiles. In: 3rd Int. Workshop on Search and Mining User-Generated Contents (SMUC), pp. 45\u201352. ACM, New York (2011)"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Schbath, S., Lacroix, V., Sagot, M.: Assessing the exceptionality of coloured motifs in networks. EURASIP Journal on Bioinformatics and Systems Biology (2008)","DOI":"10.1155\/2009\/616234"},{"issue":"4","key":"11_CR5","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1162\/artl_a_00045","volume":"17","author":"C. Adami","year":"2011","unstructured":"Adami, C., Qian, J., Rupp, M., Hintze, A.: Information content of colored motifs in complex networks. Artificial Life\u00a017(4), 375\u2013390 (2011)","journal-title":"Artificial Life"},{"issue":"16","key":"11_CR6","doi-asserted-by":"publisher","first-page":"5934","DOI":"10.1073\/pnas.0306752101","volume":"101","author":"E. Yeger-Lotem","year":"2004","unstructured":"Yeger-Lotem, E., Sattath, S., Kashtan, N., Itzkovitz, S., Milo, R., Pinter, R.Y., Alon, U., Margalit, H.: Network motifs in integrated cellular networks of transcription-regulation and protein-protein interaction. Proc. of the National Academy of Sciences of the United States of America\u00a0101(16), 5934\u20135939 (2004)","journal-title":"Proc. of the National Academy of Sciences of the United States of America"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Ribeiro, P., Silva, F.: G-tries: an efficient data structure for discovering network motifs. In: 25th ACM Symposium on Applied Computing (SAC), pp. 1559\u20131566. ACM (March 2010)","DOI":"10.1145\/1774088.1774422"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Ribeiro, P., Silva, F.: G-tries: a data structure for storing and finding subgraphs. Data Mining and Knowledge Discovery (2013)","DOI":"10.1007\/s10618-013-0303-4"},{"issue":"1","key":"11_CR9","first-page":"81","volume":"1","author":"F. Bruno","year":"2010","unstructured":"Bruno, F., Palopoli, L., Rombo, S.E.: New trends in graph mining: Structural and node-colored network motifs. IJKDB\u00a01(1), 81\u201399 (2010)","journal-title":"IJKDB"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Qian, J., Hintze, A., Adami, C.: Colored Motifs Reveal Computational Building Blocks in the C. elegans Brain. PLoS ONE 6(3), e17013+ (2011)","DOI":"10.1371\/journal.pone.0017013"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Schbath, S., Lacroix, V., Sagot, M.F.: Assessing the exceptionality of coloured motifs in networks. EURASIP J. Bioinformatics and Systems Biology 2009 (2009)","DOI":"10.1155\/2009\/616234"},{"issue":"9","key":"11_CR12","doi-asserted-by":"publisher","first-page":"1152","DOI":"10.1093\/bioinformatics\/btl038","volume":"22","author":"S. Wernicke","year":"2006","unstructured":"Wernicke, S., Rasche, F.: Fanmod: a tool for fast network motif detection. Bioinformatics\u00a022(9), 1152\u20131153 (2006)","journal-title":"Bioinformatics"},{"issue":"4","key":"11_CR13","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 Transactions on Computational Biology and Bioinformatics\u00a03(4), 347\u2013359 (2006)","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"issue":"1","key":"11_CR14","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"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Paredes, P., Ribeiro, P.: Towards a faster network-centric subgraph census. In: International Conference on Advances in Social Networks Analysis and Mining, pp. 264\u2013271. IEEE (2013)","DOI":"10.1145\/2492517.2492535"},{"key":"11_CR16","series-title":"LNBI","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-540-71681-5_7","volume-title":"Research in Computational Molecular Biology","author":"J.A. Grochow","year":"2007","unstructured":"Grochow, J.A., Kellis, M.: Network motif discovery using subgraph enumeration and symmetry-breaking. In: Speed, T., Huang, H. (eds.) RECOMB 2007. LNCS (LNBI), vol.\u00a04453, pp. 92\u2013106. Springer, Heidelberg (2007)"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-642-15294-8_20","volume-title":"Algorithms in Bioinformatics","author":"P. Ribeiro","year":"2010","unstructured":"Ribeiro, P., Silva, F.: Efficient subgraph frequency estimation with G-tries. In: Moulton, V., Singh, M. (eds.) WABI 2010. LNCS, vol.\u00a06293, pp. 238\u2013249. Springer, Heidelberg (2010)"},{"issue":"11","key":"11_CR18","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":"11_CR19","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.jsc.2013.09.003","volume":"60","author":"B.D. McKay","year":"2013","unstructured":"McKay, B.D., Piperno, A.: Practical graph isomorphism, {II}. Journal of Symbolic Computation\u00a060, 94\u2013112 (2013)","journal-title":"Journal of Symbolic Computation"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Kao, M.Y. (ed.): Encyclopedia of Algorithms. Springer (2008)","DOI":"10.1007\/978-0-387-30162-4"},{"key":"11_CR21","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/1134271.1134277","volume-title":"3rd International Workshop on Link Discovery (LinkKDD)","author":"L.A. Adamic","year":"2005","unstructured":"Adamic, L.A., Glance, N.: The political blogosphere and the 2004 U.S. election: divided they blog. In: 3rd International Workshop on Link Discovery (LinkKDD), pp. 36\u201343. ACM, New York (2005)"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Kang, U., Papadimitriou, S., Sun, J., Tong, H.: Centralities in large networks: Algorithms and observations. In: SIAM International Conference on Data Mining, pp. 119\u2013130 (2011)","DOI":"10.1137\/1.9781611972818.11"},{"key":"11_CR23","unstructured":"Opsahl, T.: Why anchorage is not (that) important: Binary ties and sample selection (August 2011), \n                    http:\/\/toreopsahl.com\/2011\/08\/12\/"},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Huttenlocher, D., Kleinberg, J.: Signed networks in social media. In: SIGCHI Conference on Human Factors in Computing Systems, pp. 1361\u20131370. ACM (2010)","DOI":"10.1145\/1753326.1753532"}],"container-title":["Studies in Computational Intelligence","Complex Networks V"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-05401-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T08:41:57Z","timestamp":1675240917000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-05401-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319054001","9783319054018"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-05401-8_11","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2014]]}}}