{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:01Z","timestamp":1740122401218,"version":"3.37.3"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,6,2]],"date-time":"2020-06-02T00:00:00Z","timestamp":1591056000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,2]],"date-time":"2020-06-02T00:00:00Z","timestamp":1591056000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2020,8]]},"DOI":"10.1007\/s10878-020-00590-4","type":"journal-article","created":{"date-parts":[[2020,6,2]],"date-time":"2020-06-02T22:02:51Z","timestamp":1591135371000},"page":"379-411","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Searching and inferring colorful topological motifs in vertex-colored graphs"],"prefix":"10.1007","volume":"40","author":[{"given":"Diego P.","family":"Rubert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eloi","family":"Araujo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco A.","family":"Stefanes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jens","family":"Stoye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6809-3547","authenticated-orcid":false,"given":"F\u00e1bio V.","family":"Martinez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,6,2]]},"reference":[{"key":"590_CR1","doi-asserted-by":"crossref","unstructured":"Araujo E, Stefanes MA (2013) Some results on topological colored motifs in metabolic networks. In: Proceedings of the BIBE, pp 1\u20135","DOI":"10.1109\/BIBE.2013.6701650"},{"issue":"1","key":"590_CR2","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1038\/75556","volume":"25","author":"M Ashburner","year":"2000","unstructured":"Ashburner M et al (2000) Gene ontology: tool for the unification of biology. Nat Genet 25(1):25\u201329","journal-title":"Nat Genet"},{"key":"590_CR3","unstructured":"Blin G, Sikora F, Vialette S (2010) GraMoFoNe: a cytoscape plugin for querying motifs without topology in protein-protein interactions networks. In: Proceedings of BICoB, pp 38\u201343"},{"issue":"18","key":"590_CR4","doi-asserted-by":"publisher","first-page":"3710","DOI":"10.1093\/bioinformatics\/bth456","volume":"20","author":"EI Boyle","year":"2004","unstructured":"Boyle EI et al (2004) GO::TermFinder-open source software for accessing Gene Ontology information and finding significantly enriched Gene Ontology terms associated with a list of genes. Bioinformatics 20(18):3710\u20133715","journal-title":"Bioinformatics"},{"issue":"3","key":"590_CR5","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1089\/cmb.2009.0170","volume":"17","author":"S Bruckner","year":"2010","unstructured":"Bruckner S et al (2010) Topology-free querying of protein interaction networks. J Comput Biol 17(3):237\u2013252","journal-title":"J Comput Biol"},{"issue":"D1","key":"590_CR6","doi-asserted-by":"publisher","first-page":"D471","DOI":"10.1093\/nar\/gkv1164","volume":"44","author":"R Caspi","year":"2016","unstructured":"Caspi R et al (2016) The MetaCyc database of metabolic pathways and enzymes and the BioCyc collection of pathway\/genome databases. Nucleic Acids Res 44(D1):D471\u201380","journal-title":"Nucleic Acids Res"},{"key":"590_CR7","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2009) Introduction to algorithms, 3rd edn. The MIT Press, Cambridge","edition":"3"},{"issue":"1","key":"590_CR8","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.jda.2010.09.002","volume":"9","author":"R Dondi","year":"2011","unstructured":"Dondi R, Fertin G, Vialette S (2011) Complexity issues in vertex-colored graph pattern matching. J Discrete Algorithms 9(1):82\u201399","journal-title":"J Discrete Algorithms"},{"issue":"7","key":"590_CR9","doi-asserted-by":"publisher","first-page":"913","DOI":"10.1089\/cmb.2007.0172","volume":"15","author":"B Dost","year":"2008","unstructured":"Dost B et al (2008) QNet: a tool for querying protein interaction networks. J Comput Biol 15(7):913\u2013925","journal-title":"J Comput Biol"},{"issue":"4","key":"590_CR10","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1090\/S0002-9904-1947-08785-1","volume":"53","author":"P Erd\u00f6s","year":"1947","unstructured":"Erd\u00f6s P (1947) Some remarks on the theory of graphs. Bull Am Math Soc 53(4):292\u2013294","journal-title":"Bull Am Math Soc"},{"key":"590_CR11","doi-asserted-by":"crossref","unstructured":"Fellows MR, Fertin G, Hermelin D, Vialette S (2007) Sharp tractability borderlines for finding connected motifs in vertex-colored graphs. In: Proceedings\u00a0of ICALP, LNCS, vol 4596, pp 340\u2013351","DOI":"10.1007\/978-3-540-73420-8_31"},{"issue":"4","key":"590_CR12","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1016\/j.jcss.2010.07.003","volume":"77","author":"MR Fellows","year":"2011","unstructured":"Fellows MR, Fertin G, Hermelin D, Vialette S (2011) Upper and lower bounds for finding connected motifs in vertex-colored graphs. J Comput Syst Sci 77(4):799\u2013811","journal-title":"J Comput Syst Sci"},{"key":"590_CR13","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman and Company, Murray Hill"},{"key":"590_CR14","doi-asserted-by":"publisher","first-page":"828","DOI":"10.1007\/s00453-011-9600-8","volume":"65","author":"S Guillemot","year":"2013","unstructured":"Guillemot S, Sikora F (2013) Finding and counting vertex-colored subtrees. Algorithmica 65:828\u2013844","journal-title":"Algorithmica"},{"key":"590_CR15","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1186\/1471-2105-10-318","volume":"10","author":"ZRM Kashani","year":"2009","unstructured":"Kashani ZRM et al (2009) Kavosh: a new algorithm for finding network motifs. BMC Bioinform 10:318","journal-title":"BMC Bioinform"},{"issue":"20","key":"590_CR16","doi-asserted-by":"publisher","first-page":"11394","DOI":"10.1073\/pnas.1534710100","volume":"100","author":"BP Kelley","year":"2003","unstructured":"Kelley BP et al (2003) Conserved pathways within bacteria and yeast as revealed by global protein network alignment. Proc Natl Acad Sci USA 100(20):11394\u201311399","journal-title":"Proc Natl Acad Sci USA"},{"issue":"4","key":"590_CR17","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1109\/TCBB.2008.79","volume":"5","author":"V Lacroix","year":"2008","unstructured":"Lacroix V, Cottret L, Th\u00e9bault P, Sagot MF (2008) An introduction to metabolic networks and their structural analysis. IEEE\/ACM Trans Comput Biol Bioinform 5(4):594\u2013617","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"key":"590_CR18","doi-asserted-by":"crossref","unstructured":"Lacroix V, Fernandes CG, Sagot MF (2005) Reaction motifs in metabolic networks. In: Proceedings of WABI, LNBI, vol 3692, pp 178\u2013191","DOI":"10.1007\/11557067_15"},{"issue":"4","key":"590_CR19","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1109\/TCBB.2006.55","volume":"3","author":"V Lacroix","year":"2006","unstructured":"Lacroix V, Fernandes CG, Sagot MF (2006) Motif search in graphs: application to metabolic networks. IEEE\/ACM Trans Comput Biol Bioinform 3(4):360\u2013368","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"issue":"2","key":"590_CR20","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/322063.322075","volume":"25","author":"D Maier","year":"1978","unstructured":"Maier D (1978) The complexity of some problems on subsequences and supersequences. JACM 25(2):322\u2013336","journal-title":"JACM"},{"key":"590_CR21","doi-asserted-by":"crossref","unstructured":"Marx D (2007) Can you beat treewidth? In: Proceedings\u00a0of FOCS, pp 169\u2013179","DOI":"10.1109\/FOCS.2007.27"},{"key":"590_CR22","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.dam.2016.04.026","volume":"213","author":"R Pinter","year":"2016","unstructured":"Pinter R, Shachnai H, Zehavi M (2016) Deterministic parameterized algorithms for the graph motif problem. Discrete Appl Math 213:162\u2013178","journal-title":"Discrete Appl Math"},{"key":"590_CR23","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.jda.2014.03.002","volume":"27","author":"R Pinter","year":"2014","unstructured":"Pinter R, Zehavi M (2014) Algorithms for topology-free and alignment network queries. J Discrete Algorithms 27:29\u201353","journal-title":"J Discrete Algorithms"},{"key":"590_CR24","doi-asserted-by":"crossref","unstructured":"Rubert DP, Araujo E, Stefanes MA (2015) SIMBio: searching and inferring colorful motifs in biological networks. In: Proceedings\u00a0of BIBE, pp 1\u20136","DOI":"10.1109\/BIBE.2015.7367733"},{"key":"590_CR25","doi-asserted-by":"crossref","unstructured":"Schbath S, Lacroix V, Sagot MF (2009) Assessing the exceptionality of coloured motifs in networks. EURASIP J\u00a0Bioinform Syst\u00a0Biol Article ID 616234, 9 pages","DOI":"10.1186\/1687-4153-2009-616234"},{"issue":"1","key":"590_CR26","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1038\/ng881","volume":"31","author":"SS Shen-Orr","year":"2002","unstructured":"Shen-Orr SS, Milo R, Mangan S, Alon U (2002) Network motifs in the transcriptional regulation network of Escherichia coli. Nat Genet 31(1):64\u201368","journal-title":"Nat Genet"},{"key":"590_CR27","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1186\/1471-2105-7-199","volume":"7","author":"T Shlomi","year":"2006","unstructured":"Shlomi T, Segal D, Ruppin E, Sharan R (2006) QPath: a method for querying pathways in a protein\u2013protein interaction network. BMC Bioinform 7:199","journal-title":"BMC Bioinform"},{"issue":"9","key":"590_CR28","doi-asserted-by":"publisher","first-page":"1152","DOI":"10.1093\/bioinformatics\/btl038","volume":"22","author":"S Wernicke","year":"2006","unstructured":"Wernicke S, Rasche F (2006) FANMOD: a tool for fast network motif detection. Bioinformatics 22(9):1152","journal-title":"Bioinformatics"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00590-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-020-00590-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00590-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,2]],"date-time":"2021-06-02T00:34:46Z","timestamp":1622594086000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-020-00590-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,2]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,8]]}},"alternative-id":["590"],"URL":"https:\/\/doi.org\/10.1007\/s10878-020-00590-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2020,6,2]]},"assertion":[{"value":"2 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}