{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,6]],"date-time":"2024-06-06T00:05:01Z","timestamp":1717632301668},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,12,11]],"date-time":"2014-12-11T00:00:00Z","timestamp":1418256000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["BioData Mining"],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1186\/s13040-014-0029-x","type":"journal-article","created":{"date-parts":[[2014,12,11]],"date-time":"2014-12-11T11:09:47Z","timestamp":1418296187000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Motif mining based on network space compression"],"prefix":"10.1186","volume":"8","author":[{"given":"Qiang","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,12,11]]},"reference":[{"key":"29_CR1","first-page":"824","volume":"298","author":"R Milo","year":"2002","unstructured":"Milo R, Shen-Orr S, Itzkovita S, Kastan N, Chklovskii D, Alon U: Network motifs: simple building blocks of complex networks. Sci STKE. 2002, 298: 824-827.","journal-title":"Sci STKE"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Koyut\u00fcrk M, Subramaniam S, Grama A: Introduction to Network Biology.Functional Coherence of Molecular Networks in Bioinformatics 2012, 1\u201313.,","DOI":"10.1007\/978-1-4614-0320-3_1"},{"key":"29_CR3","doi-asserted-by":"publisher","first-page":"1746","DOI":"10.1093\/bioinformatics\/bth163","volume":"20","author":"N Kashtan","year":"2004","unstructured":"Kashtan N, Itzkovita S, Milo R, Alon U: Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs. Bioinformatics. 2004, 20: 1746-1758. 10.1093\/bioinformatics\/bth163.","journal-title":"Bioinformatics"},{"issue":"4","key":"29_CR4","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. Comput Biol Bioinform. 2006, 3 (4): 347-359. 10.1109\/TCBB.2006.51.","journal-title":"Comput Biol Bioinform"},{"key":"29_CR5","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1016\/j.physa.2007.02.102","volume":"381","author":"R Itzhack","year":"2007","unstructured":"Itzhack R, Mogilevski Y, Louzoun Y: An optimal algorithm for counting network motifs. Physics A. 2007, 381: 482-490. 10.1016\/j.physa.2007.02.102.","journal-title":"Physics A"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Itzkovitz S, Milo R, Kastan N, Ziv G, Alon U: Physics Review E 2003(2), 68:026127.","DOI":"10.1103\/PhysRevE.68.026127"},{"issue":"9","key":"29_CR7","doi-asserted-by":"publisher","first-page":"1152","DOI":"10.1093\/bioinformatics\/btl038","volume":"22","author":"S Wernicke","year":"2006","unstructured":"Wernicke S, Rasche FFANMOD: A tool for fast network motif detection. Bionformatics. 2006, 22 (9): 1152-1153. 10.1093\/bioinformatics\/btl038.","journal-title":"Bionformatics"},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"051903","DOI":"10.1103\/PhysRevE.74.051903","volume":"74","author":"K Baskerville","year":"2006","unstructured":"Baskerville K, Paczuski M: Subgraph Ensembles and motif discovery using a new heuristic for graph isomorphism. Physics Review E. 2006, 74: 051903. 10.1103\/PhysRevE.74.051903.","journal-title":"Physics Review E"},{"issue":"1","key":"29_CR9","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s11222-009-9147-6","volume":"21","author":"JW Lau","year":"2011","unstructured":"Lau JW, So MKP: A Monte Carlo Markov chain algorithm for a class of mixture time series models. Stat Comput. 2011, 21 (1): 69-81. 10.1007\/s11222-009-9147-6.","journal-title":"Stat Comput"},{"issue":"2","key":"29_CR10","doi-asserted-by":"publisher","first-page":"940","DOI":"10.1109\/TVT.2009.2035044","volume":"59","author":"S Srinivasa","year":"2010","unstructured":"Srinivasa S, Haenggi M: Distance distributions in finite uniformly random networks: Theory and applications. Vehicular Technology. 2010, 59 (2): 940-949. 10.1109\/TVT.2009.2035044.","journal-title":"Vehicular Technology"},{"key":"29_CR11","doi-asserted-by":"publisher","first-page":"1761","DOI":"10.1016\/j.phpro.2012.03.308","volume":"25","author":"LJ Tian","year":"2012","unstructured":"Tian LJ, Liu CQ, Xie JQ: A Partition Method for Graph Isomorphism. Phys Procedia. 2012, 25: 1761-1768. 10.1016\/j.phpro.2012.03.308.","journal-title":"Phys Procedia"},{"issue":"5","key":"29_CR12","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1016\/j.ic.2006.02.002","volume":"204","author":"V Arvind","year":"2006","unstructured":"Arvind V, Kurur PP: Graph Isomorphism is in SPP. Inf Comput. 2006, 204 (5): 835-852. 10.1016\/j.ic.2006.02.002.","journal-title":"Inf Comput"},{"issue":"1","key":"29_CR13","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.mechmachtheory.2008.02.008","volume":"44","author":"H Ding","year":"2009","unstructured":"Ding H, Huang Z: Isomorphism identification of graphs: Especially for the graphs of kinematic chains. Mech Mach Theory. 2009, 44 (1): 122-139. 10.1016\/j.mechmachtheory.2008.02.008.","journal-title":"Mech Mach Theory"},{"key":"29_CR14","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-642-02124-4_15","volume":"5534","author":"D Knossow","year":"2009","unstructured":"Knossow D, Sharma A, Mateus D, Horaud R: Inexact matching of large and sparse graphs using laplacian eigenvectors. Graph-Based Representations in Pattern Recognition. 2009, 5534: 144-153. 10.1007\/978-3-642-02124-4_15.","journal-title":"Graph-Based Representations in Pattern Recognition"},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"Ogras UY, Marculescu R: Energy-and performance-driven NoC communication architecture synthesis using a decomposition approach, Proceeding of the conference on Design, Automation and Test in Europe, Washington, DC, USA 2005. 2005, 1:352\u2013357.","DOI":"10.1109\/DATE.2005.137"},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"Ribeiro P, Sliva F: G-Tries: an efficient data structure for discovering network motifs. Sierre, Switzerland: ACM 25th Symposium On Applied Computing-Bioinformatics Track; 2010:1559\u20131566.","DOI":"10.1145\/1774088.1774422"},{"issue":"318","key":"29_CR17","first-page":"1","volume":"10","author":"ZR Kashani","year":"2009","unstructured":"Kashani ZR, Ahrabian H, Elahi E, Nowzari-Dalini A, Ansari ES, Asadi S, Mohammadi S, Schreiber F, Masoudi-Nejad A: Kavosh: a new algorithm for finding network motifs. BMC Bioinformatics. 2009, 10 (318): 1-12.","journal-title":"BMC Bioinformatics"},{"issue":"4","key":"29_CR18","doi-asserted-by":"publisher","first-page":"S7","DOI":"10.1186\/1752-0509-7-S4-S7","volume":"7","author":"V Liao","year":"2013","unstructured":"Liao V, Chen M: Efficient mining gapped sequential patterns for motifs in biological sequences. BMC Syst Biol. 2013, 7 (4): S7. 10.1186\/1752-0509-7-S4-S7.","journal-title":"BMC Syst Biol"},{"key":"29_CR19","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1186\/1471-2105-11-466","volume":"11","author":"M Zhang","year":"2010","unstructured":"Zhang M, Lu L: Investigating the validity of current network analysis on static conglomerate networks by protein network stratification. BMC Bioinformatics. 2010, 11: 466. 10.1186\/1471-2105-11-466.","journal-title":"BMC Bioinformatics"},{"key":"29_CR20","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1186\/1471-2105-14-96","volume":"14","author":"S Srinivasan","year":"2013","unstructured":"Srinivasan S, Vural S, King B, Guda C: Mining for class-specific motifs in protein sequence classification. BMC Bioinformatics. 2013, 14: 96. 10.1186\/1471-2105-14-96.","journal-title":"BMC Bioinformatics"},{"key":"29_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"JA Bondy","year":"2008","unstructured":"Bondy JA, Murty USR: Graph Theory. 2008, Springer Verlag, Berlin"},{"key":"29_CR22","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/BFb0059424","volume":"186","author":"PZ Chinn","year":"1971","unstructured":"Chinn PZ: The frequency partition of a graph. Recent Trends in Graph Theory. Lecture Notes in Mathematics (Berlin: Springer-Verlag). 1971, 186: 69-70. 10.1007\/BFb0059424.","journal-title":"Lecture Notes in Mathematics (Berlin: Springer-Verlag)"},{"key":"29_CR23","first-page":"155","volume":"10","author":"Y Xu","year":"2014","unstructured":"Xu Y, Zhang Q, Zhou C: A New Method for Motif Mining in Biological Network. Evol Bioinforma. 2014, 10: 155-163.","journal-title":"Evol Bioinforma"},{"issue":"8","key":"29_CR24","doi-asserted-by":"crossref","first-page":"2020","DOI":"10.1002\/prot.24090","volume":"80","author":"P Xie","year":"2012","unstructured":"Xie P: A dynamic model for processive transcription elongation and backtracking long pauses by multisubunit RNA polymerases. Proteins: Structure, Function, and Bioinformatics. 2012, 80 (8): 2020-2034.","journal-title":"Proteins: Structure, Function, and Bioinformatics"},{"key":"29_CR25","unstructured":"UriAlonLab: Weizmannnetworks. 2012. http:\/\/www.weizmann.ac.il\/mcb\/UriAlon\/groupNetworksData.html ."},{"key":"29_CR26","unstructured":"Hu JL, Gao L: A novel graph isomorphism algorithm based on feature selection in network motif discovery. 2011. http:\/\/www.paper.edu.cn\/html\/releasepaper\/2011\/09\/56\/ ."}],"container-title":["BioData Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13040-014-0029-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s13040-014-0029-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13040-014-0029-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13040-014-0029-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,5]],"date-time":"2024-06-05T20:05:41Z","timestamp":1717617941000},"score":1,"resource":{"primary":{"URL":"https:\/\/biodatamining.biomedcentral.com\/articles\/10.1186\/s13040-014-0029-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,11]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["29"],"URL":"https:\/\/doi.org\/10.1186\/s13040-014-0029-x","relation":{},"ISSN":["1756-0381"],"issn-type":[{"value":"1756-0381","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12,11]]},"assertion":[{"value":"14 January 2014","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 November 2014","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 December 2014","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"29"}}