{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T04:25:53Z","timestamp":1747196753620,"version":"3.40.5"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319135236"},{"type":"electronic","value":"9783319135243"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-13524-3_25","type":"book-chapter","created":{"date-parts":[[2014,12,2]],"date-time":"2014-12-02T17:51:38Z","timestamp":1417542698000},"page":"294-306","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Improved Parameterized Algorithms for\u00a0Network Query Problems"],"prefix":"10.1007","author":[{"given":"Ron Y.","family":"Pinter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hadas","family":"Shachnai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meirav","family":"Zehavi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,12,3]]},"reference":[{"issue":"4","key":"25_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. J. Assoc. Comput. Mach. 42(4), 844\u2013856 (1995)","journal-title":"J. Assoc. Comput. Mach."},{"issue":"5","key":"25_CR2","doi-asserted-by":"publisher","first-page":"1296","DOI":"10.1109\/TCBB.2011.19","volume":"8","author":"N Betzler","year":"2011","unstructured":"Betzler, N., Bevern, R., Fellows, M.R., Komusiewicz, C., Niedermeier, R.: Parameterized algorithmics for finding connected motifs in biological networks. IEEE\/ACM Trans. Comput. Biol. Bioinf. 8(5), 1296\u20131308 (2011)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"key":"25_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. 5029, pp. 31\u201343. Springer, Heidelberg (2008)"},{"doi-asserted-by":"crossref","unstructured":"Bj$${\\ddot{\\rm o}}$$rklund, A.: Determinant sums for undirected hamiltonicity. In: FOCS, pp. 173\u2013182 (2010)","key":"25_CR4","DOI":"10.1109\/FOCS.2010.24"},{"unstructured":"Bj$${\\ddot{\\rm o}}$$rklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Narrow sieves for parameterized paths and packings. CoRR (2010). arxiv:1007.1161","key":"25_CR5"},{"unstructured":"Bj$${\\ddot{\\rm o}}$$rklund, A., Kaski, P., Kowalik, L.: Probably optimal graph motifs. In: STACS, pp. 20\u201331 (2013)","key":"25_CR6"},{"issue":"4","key":"25_CR7","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1109\/TCBB.2010.53","volume":"7","author":"G Blin","year":"2010","unstructured":"Blin, G., Sikora, F., Vialette, S.: Querying graphs in protein-protein interactions networks using feedback vertex set. IEEE\/ACM Trans. Comput. Biol. Bioinf. 7(4), 628\u2013635 (2010)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"doi-asserted-by":"crossref","unstructured":"Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6), 1305\u20131317 (1996)","key":"25_CR8","DOI":"10.1137\/S0097539793251219"},{"issue":"3","key":"25_CR9","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1093\/comjnl\/bxm037","volume":"51","author":"HL Bodlaender","year":"2008","unstructured":"Bodlaender, H.L., Koster, A.M.C.A.: Combinatorial optimization on graphs of bounded treewidth. Comput. J. 51(3), 255\u2013269 (2008)","journal-title":"Comput. J."},{"issue":"3","key":"25_CR10","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. Biol. 17(3), 237\u2013252 (2010)","journal-title":"J. Comput. Biol."},{"issue":"6","key":"25_CR11","doi-asserted-by":"publisher","first-page":"2526","DOI":"10.1137\/080716475","volume":"38","author":"J Chen","year":"2009","unstructured":"Chen, J., Kneis, J., Lu, S., Molle, D., Richter, S., Rossmanith, P., Sze, S., Zhang, F.: Randomized divide-and-conquer: Improved path, matching, and packing algorithms. SIAM J. Comput. 38(6), 2526\u20132547 (2009)","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Dondi, R., Fertin, G., Vialette, S.: Maximum motif problem in vertex-colored graphs. In: CPM, pp. 388\u2013401 (2011)","key":"25_CR12","DOI":"10.1007\/978-3-642-21458-5_33"},{"issue":"7","key":"25_CR13","doi-asserted-by":"publisher","first-page":"913","DOI":"10.1089\/cmb.2007.0172","volume":"15","author":"B Dost","year":"2008","unstructured":"Dost, B., Shlomi, T., Gupta, N., Ruppin, E., Bafna, V., Sharan, R.: Qnet: a tool for querying protein interaction networks. J. Comput. Biol. 15(7), 913\u2013925 (2008)","journal-title":"J. Comput. Biol."},{"issue":"1\u20132","key":"25_CR14","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0304-3975(94)00097-3","volume":"141","author":"RG Downey","year":"1995","unstructured":"Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness II: on completeness for W[1]. Theor. Comput. Sci. 141(1\u20132), 109\u2013131 (1995)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"25_CR15","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1016\/j.jcss.2010.07.003","volume":"77","author":"MR Fellows","year":"2011","unstructured":"Fellows, M.R., Fertin, G., Hermelin, D., Vialette, S.: Upper and lower bounds for finding connected motifs in vertex-colored graphs. J. Com. Sys. Sci. 77(4), 799\u2013811 (2011)","journal-title":"J. Com. Sys. Sci."},{"issue":"4","key":"25_CR16","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1089\/cmb.2009.0144","volume":"18","author":"V Fionda","year":"2011","unstructured":"Fionda, V., Palopoli, L.: Biological network querying techniques: Analysis and comparison. J. Comput. Biol. 18(4), 595\u2013625 (2011)","journal-title":"J. Comput. Biol."},{"issue":"3","key":"25_CR17","doi-asserted-by":"publisher","first-page":"698","DOI":"10.1016\/j.jcss.2011.10.001","volume":"78","author":"FV Fomin","year":"2012","unstructured":"Fomin, F.V., Lokshtanov, D., Raman, V., Saurabh, S., Rao, B.V.R.: Faster algorithms for finding and counting subgraphs. J. Com. Sys. Sci. 78(3), 698\u2013706 (2012)","journal-title":"J. Com. Sys. Sci."},{"key":"25_CR18","volume-title":"Computers And Intractability: A Guide To The Theory Of Np-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers And Intractability: A Guide To The Theory Of Np-Completeness. W.H. Freeman, New York (1979)"},{"issue":"4","key":"25_CR19","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.: Finding and counting vertex-colored subtrees. Algorithmica 65(4), 828\u2013844 (2013)","journal-title":"Algorithmica"},{"issue":"2","key":"25_CR20","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/s00453-007-9008-7","volume":"52","author":"F H\u00fcffner","year":"2008","unstructured":"H\u00fcffner, F., Wernicke, S., Zichner, T.: Algorithm engineering for color-coding with applications to signaling pathway detection. Algorithmica 52(2), 114\u2013132 (2008)","journal-title":"Algorithmica"},{"key":"25_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/978-3-540-70575-8_47","volume-title":"Automata, Languages and Programming","author":"I Koutis","year":"2008","unstructured":"Koutis, I.: Faster algebraic algorithms for path and packing problems. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 575\u2013586. Springer, Heidelberg (2008)"},{"issue":"22","key":"25_CR22","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/j.ipl.2012.08.008","volume":"112","author":"I Koutis","year":"2012","unstructured":"Koutis, I.: Constrained multilinear detection for faster functional motif discovery. Inf. Process. Lett. 112(22), 889\u2013892 (2012)","journal-title":"Inf. Process. Lett."},{"key":"25_CR23","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, Part I. LNCS, vol. 5555, pp. 653\u2013664. Springer, Heidelberg (2009)"},{"issue":"4","key":"25_CR24","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 Trans. Comput. Biol. Bioinf. 3(4), 360\u2013368 (2006)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"issue":"2","key":"25_CR25","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s10878-011-9394-2","volume":"24","author":"N Misra","year":"2012","unstructured":"Misra, N., Philip, G., Raman, V., Saurabh, S., Sikdar, S.: FPT algorithms for connected feedback vertex set. J. Comb. Optim. 24(2), 131\u2013146 (2012)","journal-title":"J. Comb. Optim."},{"issue":"16","key":"25_CR26","doi-asserted-by":"publisher","first-page":"3401","DOI":"10.1093\/bioinformatics\/bti554","volume":"21","author":"RY Pinter","year":"2005","unstructured":"Pinter, R.Y., Rokhlenko, O., Yeger-Lotem, E., Ziv-Ukelson, M.: Alignment of metabolic pathways. Bioinformatics 21(16), 3401\u20133408 (2005)","journal-title":"Bioinformatics"},{"key":"25_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/978-3-642-45278-9_31","volume-title":"Combinatorial Algorithms","author":"RY Pinter","year":"2013","unstructured":"Pinter, R.Y., Zehavi, M.: Partial information network queries. In: Lecroq, T., Mouchard, L. (eds.) IWOCA 2013. LNCS, vol. 8288, pp. 362\u2013375. Springer, Heidelberg (2013)"},{"key":"25_CR28","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.jda.2014.03.002","volume":"27","author":"RY Pinter","year":"2014","unstructured":"Pinter, R.Y., Zehavi, M.: Algorithms for topology-free and alignment network queries. J. Discrete Algorithms 27, 29\u201353 (2014)","journal-title":"J. Discrete Algorithms"},{"issue":"4","key":"25_CR29","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"JT Schwartz","year":"1980","unstructured":"Schwartz, J.T.: Fast probabilistic algorithms for verification of polynomial identities. J. Assoc. Comput. Mach. 27(4), 701\u2013717 (1980)","journal-title":"J. Assoc. Comput. Mach."},{"key":"25_CR30","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.: Qpath: a method for querying pathways in a protein-protein interaction networks. BMC Bioinform. 7, 199 (2006)","journal-title":"BMC Bioinform."},{"unstructured":"Sikora, F.: An (almost complete) state of the art around the graph motif problem. Universit$${\\acute{\\rm e}}$$ Paris-Est Technical reports (2012)","key":"25_CR31"},{"key":"25_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/3-540-09519-5_73","volume-title":"Symbolic and Algebraic Computation","author":"R Zippel","year":"1979","unstructured":"Zippel, R.: Probabilistic algorithms for sparse polynomials. In: Ng, K.W. (ed.) EUROSAM 1979. LNCS, vol. 72, pp. 216\u2013226. Springer, Heidelberg (1979)"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13524-3_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T22:34:32Z","timestamp":1747175672000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-13524-3_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319135236","9783319135243"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13524-3_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"3 December 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}