{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:24:24Z","timestamp":1743121464325,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642306419"},{"type":"electronic","value":"9783642306426"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-30642-6_26","type":"book-chapter","created":{"date-parts":[[2012,8,11]],"date-time":"2012-08-11T08:01:39Z","timestamp":1344672099000},"page":"278-289","source":"Crossref","is-referenced-by-count":5,"title":["Some Results on more Flexible Versions of Graph Motif"],"prefix":"10.1007","author":[{"given":"Romeo","family":"Rizzi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florian","family":"Sikora","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"26_CR1","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/S0959-440X(03)00031-9","volume":"13","author":"E. Alm","year":"2003","unstructured":"Alm, E., Arkin, A.P.: Biological Networks. Curr. Opin. Struct. Biol.\u00a013(2), 193\u2013202 (2003)","journal-title":"Curr. Opin. Struct. Biol."},{"key":"26_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-642-17493-3_4","volume-title":"Parameterized and Exact Computation","author":"A.M. Ambalath","year":"2010","unstructured":"Ambalath, A.M., Balasundaram, R., Rao H., C., Koppula, V., Misra, N., Philip, G., Ramanujan, M.S.: On the Kernelization Complexity of Colorful Motifs. In: Raman, V., Saurabh, S. (eds.) IPEC 2010. LNCS, vol.\u00a06478, pp. 14\u201325. Springer, Heidelberg (2010)"},{"key":"26_CR3","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":"26_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-642-04241-6_2","volume-title":"Algorithms in Bioinformatics","author":"S. B\u00f6cker","year":"2009","unstructured":"B\u00f6cker, S., Rasche, F., Steijger, T.: Annotating Fragmentation Patterns. In: Salzberg, S.L., Warnow, T. (eds.) WABI 2009. LNCS, vol.\u00a05724, pp. 13\u201324. Springer, Heidelberg (2009)"},{"issue":"3","key":"26_CR5","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1089\/cmb.2009.0170","volume":"17","author":"S. Bruckner","year":"2010","unstructured":"Bruckner, S., H\u00fcffner, F., Karp, R.M., Shamir, R., Sharan, R.: Topology-Free Querying of Protein Interaction Networks. J. Comput. Bio.\u00a017(3), 237\u2013252 (2010)","journal-title":"J. Comput. Bio."},{"issue":"1","key":"26_CR6","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0012-365X(81)90138-2","volume":"37","author":"M. Chein","year":"1981","unstructured":"Chein, M., Habib, M., Maurer, M.-C.: Partitive hypergraphs. Discrete Math.\u00a037(1), 35\u201350 (1981)","journal-title":"Discrete Math."},{"issue":"5964","key":"26_CR7","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1126\/science.1180823","volume":"327","author":"M. Costanzo","year":"2010","unstructured":"Costanzo, M., et al.: The Genetic Landscape of a Cell. Science\u00a0327(5964), 425\u2013431 (2010)","journal-title":"Science"},{"issue":"1","key":"26_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.: Complexity issues in vertex-colored graph pattern matching. J. Discr. Algo.\u00a09(1), 82\u201399 (2011)","journal-title":"J. Discr. Algo."},{"key":"26_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/978-3-642-21458-5_33","volume-title":"Combinatorial Pattern Matching","author":"R. Dondi","year":"2011","unstructured":"Dondi, R., Fertin, G., Vialette, S.: Finding Approximate and Constrained Motifs in Graphs. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol.\u00a06661, pp. 388\u2013401. Springer, Heidelberg (2011)"},{"issue":"10","key":"26_CR10","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1016\/S0168-9525(02)02763-4","volume":"18","author":"A.M. Edwards","year":"2002","unstructured":"Edwards, A.M., et al.: Bridging structural biology and genomics: assessing protein interaction data with known complexes. Trends Gen.\u00a018(10), 529\u2013536 (2002)","journal-title":"Trends Gen."},{"key":"26_CR11","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.R. Fellows","year":"2007","unstructured":"Fellows, M.R., 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)"},{"issue":"8","key":"26_CR12","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1186\/gb-2004-5-8-r57","volume":"5","author":"J. Gagneur","year":"2004","unstructured":"Gagneur, J., Krause, R., Bouwmeester, T., Casari, G.: Modular decomposition of protein-protein interaction networks. Genome Biol.\u00a05(8), R57 (2004)","journal-title":"Genome Biol."},{"key":"26_CR13","unstructured":"Guillemot, S., Sikora, F.: Finding and counting vertex-colored subtrees. Algorithmica, 10.1007\/s00453-011-9600-8"},{"key":"26_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-642-15155-2_36","volume-title":"Mathematical Foundations of Computer Science 2010","author":"S. Guillemot","year":"2010","unstructured":"Guillemot, S., Sikora, F.: Finding and Counting Vertex-Colored Subtrees. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol.\u00a06281, pp. 405\u2013416. Springer, Heidelberg (2010)"},{"key":"26_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-540-27810-8_17","volume-title":"Algorithm Theory - SWAT 2004","author":"M. Habib","year":"2004","unstructured":"Habib, M., de Montgolfier, F., Paul, C.: A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol.\u00a03111, pp. 187\u2013198. Springer, Heidelberg (2004)"},{"key":"26_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/978-3-642-02927-1_54","volume-title":"Automata, Languages and Programming","author":"I. Koutis","year":"2009","unstructured":"Koutis, I., Williams, R.: Limits and Applications of Group Algebras for Parameterized Problems. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol.\u00a05555, pp. 653\u2013664. Springer, Heidelberg (2009)"},{"issue":"4","key":"26_CR17","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 T. Comput. Bi.\u00a03(4), 360\u2013368 (2006)","journal-title":"IEEE\/ACM T. Comput. Bi."},{"key":"26_CR18","doi-asserted-by":"crossref","unstructured":"Niedermeier, R.: Invitation to Fixed Parameter Algorithms. Lecture Series in Mathematics and Its Applications. Oxford University Press (2006)","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"issue":"5586","key":"26_CR19","doi-asserted-by":"publisher","first-page":"1551","DOI":"10.1126\/science.1073374","volume":"297","author":"E. Ravasz","year":"2002","unstructured":"Ravasz, E., et al.: Hierarchical Organization of Modularity in Metabolic Networks. Science\u00a0297(5586), 1551\u20131555 (2002)","journal-title":"Science"},{"key":"26_CR20","doi-asserted-by":"crossref","unstructured":"Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In: STOC, pp. 475\u2013484. ACM (1997)","DOI":"10.1145\/258533.258641"},{"issue":"2","key":"26_CR21","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1038\/ng1165","volume":"34","author":"E. Segal","year":"2003","unstructured":"Segal, E., et al.: Module networks: identifying regulatory modules and their condition-specific regulators from gene expression data. Nat. Genet.\u00a034(2), 166\u2013176 (2003)","journal-title":"Nat. Genet."},{"issue":"4","key":"26_CR22","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1038\/nbt1196","volume":"24","author":"R. Sharan","year":"2006","unstructured":"Sharan, R., Ideker, T.: Modeling cellular machinery through biological network comparison. Nat. Biotechnol.\u00a024(4), 427\u2013433 (2006)","journal-title":"Nat. Biotechnol."},{"key":"26_CR23","unstructured":"Sikora, F.: Aspects algorithmiques de la comparaison d\u2019\u00e9l\u00e9ments biologiques. PhD thesis, Universit\u00e9 Paris-Est (2011) (in French)"},{"issue":"1","key":"26_CR24","doi-asserted-by":"publisher","first-page":"103","DOI":"10.4086\/toc.2007.v003a006","volume":"3","author":"D. Zuckerman","year":"2007","unstructured":"Zuckerman, D.: Linear Degree Extractors and the Inapproximability of Max Clique and Chromatic Number. Theor. Comput.\u00a03(1), 103\u2013128 (2007)","journal-title":"Theor. Comput."}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30642-6_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T23:59:06Z","timestamp":1675209546000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-30642-6_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642306419","9783642306426"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30642-6_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}