{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T02:02:45Z","timestamp":1725674565947},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642296260"},{"type":"electronic","value":"9783642296277"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29627-7_22","type":"book-chapter","created":{"date-parts":[[2012,4,12]],"date-time":"2012-04-12T09:02:04Z","timestamp":1334221324000},"page":"213-223","source":"Crossref","is-referenced-by-count":4,"title":["Finding Maximum Colorful Subtrees in Practice"],"prefix":"10.1007","author":[{"given":"Imran","family":"Rauf","sequence":"first","affiliation":[]},{"given":"Florian","family":"Rasche","sequence":"additional","affiliation":[]},{"given":"Fran\u00e7ois","family":"Nicolas","sequence":"additional","affiliation":[]},{"given":"Sebastian","family":"B\u00f6cker","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/1250790.1250801","volume-title":"Proc. of ACM Symposium on Theory of Computing (STOC 2007)","author":"A. Bj\u00f6rklund","year":"2007","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier meets M\u00f6bius: fast subset convolution. In: Proc. of ACM Symposium on Theory of Computing (STOC 2007), pp. 67\u201374. ACM Press, New York (2007)"},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1093\/bioinformatics\/btn270","volume":"24","author":"S. B\u00f6cker","year":"2008","unstructured":"B\u00f6cker, S., Rasche, F.: Towards de novo identification of metabolites by analyzing tandem mass spectra. Bioinformatics\u00a024, I49\u2013I55 (2008)","journal-title":"Bioinformatics"},{"key":"22_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-642-02441-2_20","volume-title":"Combinatorial Pattern Matching","author":"R. Dondi","year":"2009","unstructured":"Dondi, R., Fertin, G., Vialette, S.: Maximum Motif Problem in Vertex-Colored Graphs. In: Kucherov, G., Ukkonen, E. (eds.) CPM 2009. LNCS, vol.\u00a05577, pp. 221\u2013235. Springer, Heidelberg (2009)"},{"issue":"3","key":"22_CR4","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1002\/net.3230010302","volume":"1","author":"S.E. Dreyfus","year":"1972","unstructured":"Dreyfus, S.E., Wagner, R.A.: The Steiner problem in graphs. Networks\u00a01(3), 195\u2013207 (1972)","journal-title":"Networks"},{"issue":"2","key":"22_CR5","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s00493-006-0011-4","volume":"26","author":"M.R. Fellows","year":"2006","unstructured":"Fellows, M.R., Gramm, J., Niedermeier, R.: On the parameterized intractability of motif search problems. Combinatorica\u00a026(2), 141\u2013167 (2006)","journal-title":"Combinatorica"},{"issue":"9","key":"22_CR6","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1038\/nrm1451","volume":"5","author":"A.R. Fernie","year":"2004","unstructured":"Fernie, A.R., Trethewey, R.N., Krotzky, A.J., Willmitzer, L.: Metabolite profiling: from diagnostics to systems biology. Nat. Rev. Mol. Cell Biol.\u00a05(9), 763\u2013769 (2004)","journal-title":"Nat. Rev. Mol. Cell Biol."},{"key":"22_CR7","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)"},{"issue":"14","key":"22_CR8","doi-asserted-by":"publisher","first-page":"5574","DOI":"10.1021\/ac800548g","volume":"80","author":"D.W. Hill","year":"2008","unstructured":"Hill, D.W., Kertesz, T.M., Fontaine, D., Friedman, R., Grant, D.F.: Mass spectral metabonomics beyond elemental formula: Chemical database querying by matching experimental with computational fragmentation spectra. Anal. Chem.\u00a080(14), 5574\u20135582 (2008)","journal-title":"Anal. Chem."},{"key":"22_CR9","unstructured":"Ito, T.: Finding maximum weight arborescence in an edge-weighted DAG. Theoretical Computer Science \u2013 Stack Exchange, \n                  \n                    http:\/\/cstheory.stackexchange.com\/q\/4088\/189\n                  \n                  \n                 (retrieved: October 12, 2011)"},{"key":"22_CR10","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":"5937","key":"22_CR11","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1126\/science.1168243","volume":"325","author":"J.W.-H. Li","year":"2009","unstructured":"Li, J.W.-H., Vederas, J.C.: Drug discovery and natural products: end of an era or an endless frontier? Science\u00a0325(5937), 161\u2013165 (2009)","journal-title":"Science"},{"key":"22_CR12","unstructured":"Ljubi\u0107, I., Weiskircher, R., Pferschy, U., Klau, G.W., Mutzel, P., Fischetti, M.: Solving the prize-collecting Steiner tree problem to optimality. In: Proc. of Algorithm Engineering and Experiments (ALENEX 2005), pp. 68\u201376. SIAM (2005)"},{"issue":"4","key":"22_CR13","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1002\/jms.1545","volume":"44","author":"H. Oberacher","year":"2009","unstructured":"Oberacher, H., Pavlic, M., Libiseller, K., Schubert, B., Sulyok, M., Schuhmacher, R., Csaszar, E., K\u00f6feler, H.C.: On the inter-instrument and inter-laboratory transferability of a tandem mass spectral reference library: 1. results of an Austrian multicenter study. J. Mass Spectrom.\u00a044(4), 485\u2013493 (2009)","journal-title":"J. Mass Spectrom."},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Rasche, F., Scheubert, K., Hufsky, F., Zichner, T., Kai, M., Svato\u0161, A., B\u00f6cker, S.: Identifying the unknowns by aligning fragmentation trees (October 2011) (manuscript)","DOI":"10.1021\/ac300304u"},{"key":"22_CR15","doi-asserted-by":"publisher","first-page":"1243","DOI":"10.1021\/ac101825k","volume":"83","author":"F. Rasche","year":"2011","unstructured":"Rasche, F., Svato\u0161, A., Maddula, R.K., B\u00f6ttcher, C., B\u00f6cker, S.: Computing fragmentation trees from tandem mass spectrometry data. Anal. Chem.\u00a083, 1243\u20131251 (2011)","journal-title":"Anal. Chem."},{"issue":"11","key":"22_CR16","doi-asserted-by":"publisher","first-page":"1383","DOI":"10.1089\/cmb.2011.0168","volume":"18","author":"K. Scheubert","year":"2011","unstructured":"Scheubert, K., Hufsky, F., Rasche, F., B\u00f6cker, S.: Computing fragmentation trees from metabolite multiple mass spectrometry data. J. Comput. Biol.\u00a018(11), 1383\u20131397 (2011)","journal-title":"J. Comput. Biol."},{"key":"22_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/978-3-642-20036-6_36","volume-title":"Research in Computational Molecular Biology","author":"K. Scheubert","year":"2011","unstructured":"Scheubert, K., Hufsky, F., Rasche, F., B\u00f6cker, S.: Computing Fragmentation Trees from Metabolite Multiple Mass Spectrometry Data. In: Bafna, V., Sahinalp, S.C. (eds.) RECOMB 2011. LNCS, vol.\u00a06577, pp. 377\u2013391. Springer, Heidelberg (2011)"},{"key":"22_CR18","unstructured":"Sikora, F.: An (almost complete) state of the art around the graph motif problem. Technical report, Universit\u00e9 Paris-Est, France (2010), \n                  \n                    http:\/\/www-igm.univ-mlv.fr\/~fsikora\/pub\/GraphMotif-Resume.pdf"},{"key":"22_CR19","unstructured":"Sikora, F.: Aspects algorithmiques de la comparaison d\u2019\u00e9l\u00e9ments biologiques. PhD thesis, Universit\u00e9 Paris-Est (2011)"},{"issue":"3","key":"22_CR20","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.tcs.2006.01.001","volume":"355","author":"K. Xu","year":"2006","unstructured":"Xu, K., Li, W.: Many hard examples in exact phase transitions. Theor. Comput. Sci.\u00a0355(3), 291\u2013302 (2006)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Research in Computational Molecular Biology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29627-7_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:10:31Z","timestamp":1620126631000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29627-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642296260","9783642296277"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29627-7_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}