{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T01:07:09Z","timestamp":1773277629729,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642024405","type":"print"},{"value":"9783642024412","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02441-2_20","type":"book-chapter","created":{"date-parts":[[2009,6,17]],"date-time":"2009-06-17T09:19:32Z","timestamp":1245230372000},"page":"221-235","source":"Crossref","is-referenced-by-count":13,"title":["Maximum Motif Problem in Vertex-Colored Graphs"],"prefix":"10.1007","author":[{"given":"Riccardo","family":"Dondi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guillaume","family":"Fertin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"St\u00e9phane","family":"Vialette","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"20_CR1","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1145\/210332.210337","volume":"42","author":"N. Alon","year":"1995","unstructured":"Alon, N., Yuster, R., Zwick, U.: Color coding. Journal of the ACM\u00a042(4), 844\u2013856 (1995)","journal-title":"Journal of the ACM"},{"key":"20_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-69068-9_6","volume-title":"Combinatorial Pattern Matching","author":"N. Betzler","year":"2008","unstructured":"Betzler, N., Fellows, M.R., Komusiewicz, C., Niedermeier, R.: Parameterized algorithms and hardness results for some graph motif problems. In: Ferragina, P., Landau, G.M. (eds.) CPM 2008. LNCS, vol.\u00a05029, pp. 31\u201343. Springer, Heidelberg (2008)"},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/978-3-642-02008-7_6","volume-title":"Proc. 13th Annual International Conference on Computational Molecular Biology (RECOMB 2009)","author":"S. Bruckner","year":"2009","unstructured":"Bruckner, S., H\u00fcffner, F., Karp, R.M., Shamir, R., Sharan, R.: Topology-free querying of protein interaction networks. In: Batzoglou, S. (ed.) Proc. 13th Annual International Conference on Computational Molecular Biology (RECOMB 2009). LNCS, vol.\u00a05541, pp. 74\u201389. Springer, Heidelberg (2009)"},{"key":"20_CR4","series-title":"Graduate texts in Mathematics","volume-title":"Graph theory","author":"R. Diestel","year":"2000","unstructured":"Diestel, R.: Graph theory, 2nd edn. Graduate texts in Mathematics, vol.\u00a0173. Springer, Heidelberg (2000)","edition":"2"},{"key":"20_CR5","first-page":"27","volume-title":"Proc. 10th Italian Conference on Theoretical Computer Science (ICTCS)","author":"R. Dondi","year":"2007","unstructured":"Dondi, R., Fertin, G., Vialette, S.: Weak pattern matching in colored graphs: Minimizing the number of connected components. In: Proc. 10th Italian Conference on Theoretical Computer Science (ICTCS), Roma, Italy, pp. 27\u201338. World Scientific, Singapore (2007)"},{"key":"20_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized complexity","author":"R. Downey","year":"1999","unstructured":"Downey, R., Fellows, M.: Parameterized complexity. Springer, Heidelberg (1999)"},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/978-3-540-73420-8_31","volume-title":"Automata, Languages and Programming","author":"M. Fellows","year":"2007","unstructured":"Fellows, M., Fertin, G., Hermelin, D., Vialette, S.: Sharp tractability borderlines for finding connected motifs in vertex-colored graphs. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 340\u2013351. Springer, Heidelberg (2007)"},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/S0166-218X(96)00062-5","volume":"71","author":"J. Hein","year":"1996","unstructured":"Hein, J., Jiang, T., Wang, L., Zhang, K.: On the complexity of comparing evolutionary trees. Discrete Applied Mathematics\u00a071, 153\u2013169 (1996)","journal-title":"Discrete Applied Mathematics"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"1122","DOI":"10.1137\/S009753979223842X","volume":"24","author":"T. Jiang","year":"1995","unstructured":"Jiang, T., Li, M.: On the approximation of shortest common supersequences and longest common subsequences. SIAM Journal on Computing\u00a024, 1122\u20131139 (1995)","journal-title":"SIAM Journal on Computing"},{"key":"20_CR10","doi-asserted-by":"publisher","first-page":"1122","DOI":"10.1137\/S009753979223842X","volume":"24","author":"D. Karger","year":"1995","unstructured":"Karger, D., Motwani, R., Ramkumar, G.D.S.: On approximating the longest path in a graph. SIAM Journal on Computing\u00a024, 1122\u20131139 (1995)","journal-title":"SIAM Journal on Computing"},{"issue":"20","key":"20_CR11","doi-asserted-by":"publisher","first-page":"11394","DOI":"10.1073\/pnas.1534710100","volume":"100","author":"B.P. Kelley","year":"2003","unstructured":"Kelley, B.P., Sharan, R., Karp, R.M., Sittler, T., Root, D.E., Stockwell, B.R., Ideker, T.: Conserved pathways within bacteria and yeast as revealed by global protein network alignment. Proceedings of the National Academy of Sciences\u00a0100(20), 11394\u201311399 (2003)","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"20_CR12","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/11415770_4","volume-title":"Research in Computational Molecular Biology","author":"M. Koyut\u00fcrk","year":"2005","unstructured":"Koyut\u00fcrk, M., Grama, A., Szpankowski, W.: Pairwise local alignment of protein interaction networks guided by models of evolution. In: Miyano, S., Mesirov, J., Kasif, S., Istrail, S., Pevzner, P.A., Waterman, M. (eds.) RECOMB 2005. LNCS (LNBI), vol.\u00a03500, pp. 48\u201365. Springer, Heidelberg (2005)"},{"issue":"4","key":"20_CR13","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1109\/TCBB.2006.55","volume":"3","author":"V. Lacroix","year":"2006","unstructured":"Lacroix, V., Fernandes, C.G., Sagot, M.-F.: Motif search in graphs: application to metabolic networks. IEEE\/ACM Transactions on Computational Biology and Bioinformatics (TCBB)\u00a03(4), 360\u2013368 (2006)","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics (TCBB)"},{"key":"20_CR14","series-title":"Lecture Series in Mathematics and Its Applications","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to fixed parameter algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to fixed parameter algorithms. Lecture Series in Mathematics and Its Applications. Oxford University Press, Oxford (2006)"},{"key":"20_CR15","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"C.H. Papadimitriou","year":"1991","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation and complexity classes. Journal of Computer and System Sciences\u00a043, 425\u2013440 (1991)","journal-title":"Journal of Computer and System Sciences"},{"key":"20_CR16","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1089\/cmb.2006.13.133","volume":"13","author":"J. Scott","year":"2006","unstructured":"Scott, J., Ideker, T., Karp, R.M., Sharan, R.: Efficient algorithms for detecting signaling pathways in protein interaction networks. Journal of Computational Biology\u00a013, 133\u2013144 (2006)","journal-title":"Journal of Computational Biology"},{"key":"20_CR17","first-page":"282","volume-title":"Proc. 8th annual international conference on Computational molecular biology (RECOMB)","author":"R. Sharan","year":"2004","unstructured":"Sharan, R., Ideker, T., Kelley, B., Shamir, R., Karp, R.M.: Identification of protein complexes by comparative analysis of yeast and bacterial protein interaction data. In: Proc. 8th annual international conference on Computational molecular biology (RECOMB), San Diego, California, USA, pp. 282\u2013289. ACM Press, New York (2004)"},{"issue":"6","key":"20_CR18","doi-asserted-by":"publisher","first-page":"1974","DOI":"10.1073\/pnas.0409522102","volume":"102","author":"R. Sharan","year":"2005","unstructured":"Sharan, R., Suthram, S., Kelley, R.M., Kuhn, T., McCuine, S., Uetz, P., Sittler, T., Karp, R.M., Ideker, T.: Conserved patterns of protein interaction in multiple species. Proc. Natl Acad. Sci. USA\u00a0102(6), 1974\u20131979 (2005)","journal-title":"Proc. Natl Acad. Sci. USA"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02441-2_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,8]],"date-time":"2019-03-08T15:54:04Z","timestamp":1552060444000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02441-2_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642024405","9783642024412"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02441-2_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}