{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T23:56:07Z","timestamp":1725839767610},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319261805"},{"type":"electronic","value":"9783319261812"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-26181-2_30","type":"book-chapter","created":{"date-parts":[[2015,11,28]],"date-time":"2015-11-28T09:25:12Z","timestamp":1448702712000},"page":"317-328","source":"Crossref","is-referenced-by-count":1,"title":["A Method of Motif Mining Based on Backtracking and Dynamic Programming"],"prefix":"10.1007","author":[{"given":"Xiaoli","family":"Song","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changjun","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiang","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,29]]},"reference":[{"key":"30_CR1","first-page":"155","volume":"10","author":"Y Xu","year":"2014","unstructured":"Xu, Y., Zhang, Q., Zhou, C.J.: A new method for motif mining in biological networks. Evol. Bionform. 10, 155\u2013163 (2014)","journal-title":"Evol. Bionform."},{"key":"30_CR2","first-page":"104","volume-title":"Post-genome Informatics","author":"M Kanehisa","year":"2001","unstructured":"Kanehisa, M.: Post-genome Informatics, vol. 3, pp. 104\u2013131. Oxford University Press, Oxford (2001)"},{"key":"30_CR3","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, S., Alon, U.: Efficient sampling algorithm for estimating sub graph concentrations and detecting network motifs. Bioinformatics 20, 1746\u20131758 (2004)","journal-title":"Bioinformatics"},{"key":"30_CR4","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 298, 824\u2013827 (2002)","journal-title":"Science"},{"key":"30_CR5","first-page":"1","volume":"5","author":"M Koyut\u00fcrk","year":"2011","unstructured":"Koyut\u00fcrk, M., Subramaniam, S., Grama, A.: Introduction to network biology. Bioinformatics 5, 1\u201313 (2011)","journal-title":"Bioinformatics"},{"key":"30_CR6","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1038\/nrg2102","volume":"8","author":"U Alon","year":"2007","unstructured":"Alon, U.: Network motifs: theory and experimental approaches. Nat. Rev. Genet. 8, 450\u2013461 (2007)","journal-title":"Nat. Rev. Genet."},{"key":"30_CR7","doi-asserted-by":"publisher","first-page":"i213","DOI":"10.1093\/bioinformatics\/bti1049","volume":"21","author":"HY Hu","year":"2005","unstructured":"Hu, H.Y., Yan, X.F.: Mining coherent dense sub graphs across massive biological networks for functional discovery. BMC Bioinformat. 21, i213\u2013i221 (2005)","journal-title":"BMC Bioinformat."},{"key":"30_CR8","doi-asserted-by":"publisher","first-page":"2981","DOI":"10.1073\/pnas.0308661100","volume":"101","author":"A Tanay","year":"2004","unstructured":"Tanay, A.: Revealing modularity and organization in the yeast molecular network by integrated analysis of highly heterogeneous genome wide data. Proc. Natl. Acad. Sci. U.S.A. 101, 2981\u20132986 (2004)","journal-title":"Proc. Natl. Acad. Sci. U.S.A."},{"key":"30_CR9","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1002\/prot.10505","volume":"54","author":"JB Pereira","year":"2004","unstructured":"Pereira, J.B., Enright, A.J., Quzounis, C.A.: Detection of functional modules from protein interaction networks. Proteins 54, 49\u201357 (2004)","journal-title":"Proteins"},{"key":"30_CR10","doi-asserted-by":"publisher","first-page":"9404","DOI":"10.1073\/pnas.0507841103","volume":"103","author":"R Jiang","year":"2006","unstructured":"Jiang, R., Tu, Z.D., Chen, T., Sun, F.Z.: Network motif identification in stochastic networks. PNAS 103, 9404\u20139409 (2006)","journal-title":"PNAS"},{"key":"30_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Bioinformatics)","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-540-71681-5_7","volume-title":"Research in Computational Molecular Biology","author":"JA 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. 4453, pp. 92\u2013106. Springer, Heidelberg (2007)"},{"key":"30_CR12","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1093\/bioinformatics\/btn163","volume":"24","author":"N Alon","year":"2008","unstructured":"Alon, N., Dao, P., Hormozdiari, F.: Biomolecular network motif counting and discovery by color coding. Bioinformatics 24, 241\u2013249 (2008)","journal-title":"Bioinformatics"},{"key":"30_CR13","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1186\/1471-2105-10-318","volume":"10","author":"Z Kshani","year":"2009","unstructured":"Kshani, Z., Ahrabian, H., Elahi, E., Nowzari-Dalini, A.: a new algorithm for finding network motifs. BMC Bioinform. 10, 318 (2009)","journal-title":"BMC Bioinform."},{"key":"30_CR14","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.mechmachtheory.2008.02.008","volume":"44","author":"D Huafeng","year":"2009","unstructured":"Huafeng, D., Huang, Z.: Isomorphism identification of graphs: Especially for the graphs of kinematic chains. Mech. Mach. Theory 44, 122\u2013139 (2009)","journal-title":"Mech. Mach. Theory"},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Ribeiro, P., Silva, F.: G-tries: An efficient data structure for discovering network motifs. In: 25th Proceedings of the 2010 ACM Symposium on Applied Computing, pp. 1559\u20131565. ACM Press, Sierre (2010)","DOI":"10.1145\/1774088.1774422"},{"key":"30_CR16","first-page":"347","volume":"3","author":"S Wernicke","year":"2006","unstructured":"Wernicke, S.: Efficient detection of network motifs. Comput. Biol. 3, 347\u2013359 (2006)","journal-title":"Comput. Biol."},{"key":"30_CR17","unstructured":"Hu, J.L., Sun, L., Yu, L., Gao, L.: A novel graph isomorphism algorithm based on feature selection in network motif discovery (2011). \n                      http:\/\/www.paper.edu.cn\/html\/releasepaper\/2011\/09\/56\/"},{"key":"30_CR18","doi-asserted-by":"publisher","first-page":"1761","DOI":"10.1016\/j.phpro.2012.03.308","volume":"25","author":"LJ Tian","year":"2012","unstructured":"Tian, L.J., Liu, C.Q., Xie, J.Q.: A partition method for graph isomorphism. Phys. Procedia 25, 1761\u20131768 (2012)","journal-title":"Phys. Procedia"},{"key":"30_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1756-0381-7-1","volume":"7","author":"Z Qiang","year":"2014","unstructured":"Qiang, Z., Xu, Y.: Motif mining based on network space compression. Biodata Min. 7, 1\u201313 (2014)","journal-title":"Biodata Min."},{"key":"30_CR20","doi-asserted-by":"publisher","first-page":"2020","DOI":"10.1002\/prot.24132","volume":"80","author":"P Xie","year":"2012","unstructured":"Xie, P.: A dynamic model for processive transcription elongation and backtracking long pauses by multi subunit RNA polymerases. Proteins 80, 2020\u20132024 (2012)","journal-title":"Proteins"},{"key":"30_CR21","doi-asserted-by":"publisher","first-page":"1152","DOI":"10.1093\/bioinformatics\/btl038","volume":"22","author":"S Wernicke","year":"2006","unstructured":"Wernicke, S., Rasche, F.: FFANMOD: A tool for fast network motif detection. Bionformatics 22, 1152\u20131153 (2006)","journal-title":"Bionformatics"},{"key":"30_CR22","unstructured":"Milo, R., Kastan, N., Itzkovitz, S., Newman, M., Alon, U.: Uniform generation of random graphs with arbitrary degree sequences. arXiv:cond-mat\/0312028. 106, 1\u20134 (2003)"}],"container-title":["Lecture Notes in Computer Science","Multi-disciplinary Trends in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-26181-2_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T18:35:20Z","timestamp":1559327720000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-26181-2_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319261805","9783319261812"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-26181-2_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}