{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:09Z","timestamp":1759639089802,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319559100"},{"type":"electronic","value":"9783319559117"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-55911-7_16","type":"book-chapter","created":{"date-parts":[[2017,3,20]],"date-time":"2017-03-20T10:23:37Z","timestamp":1490005417000},"page":"216-230","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Algorithmic Aspects of the Maximum Colorful Arborescence Problem"],"prefix":"10.1007","author":[{"given":"Guillaume","family":"Fertin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julien","family":"Fradin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00e9raldine","family":"Jean","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,3,21]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties","author":"G Ausiello","year":"1999","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer-Verlag, Heidelberg (1999)"},{"doi-asserted-by":"crossref","unstructured":"B\u00f6cker, S., Rasche, F.: Towards de novo identification of metabolites by analyzing tandem mass spectra. In: Proceedings of Seventh European Conference on Computational Biology and Bioinformatics, ECCB 2008, vol. 24, no. 16, pp. i49\u2013i55 (2008)","key":"16_CR2","DOI":"10.1093\/bioinformatics\/btn270"},{"key":"16_CR3","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. 5724, pp. 13\u201324. Springer, Heidelberg (2009). doi:\n10.1007\/978-3-642-04241-6_2"},{"issue":"10","key":"16_CR4","first-page":"1396","volume":"14","author":"YJ Chu","year":"1965","unstructured":"Chu, Y.J., Liu, T.H.: On shortest arborescence of a directed graph. Sci. Sinica 14(10), 1396 (1965)","journal-title":"Sci. Sinica"},{"key":"16_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Cham (2015)"},{"issue":"1","key":"16_CR6","doi-asserted-by":"crossref","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. Discrete Algorithms 9(1), 82\u201399 (2011)","journal-title":"J. Discrete Algorithms"},{"unstructured":"Fertin, G., Komusiewicz, C.: Graph Motif problems parameterized by dual. In: Grossi, R., Lewenstein, M. (eds.) 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016. LIPIcs, vol. 54, pp. 7:1\u20137:12. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016)","key":"16_CR7"},{"doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Comput. Syst. Sci. 63(4), 512\u2013530 (2001)","key":"16_CR8","DOI":"10.1006\/jcss.2001.1774"},{"issue":"4","key":"16_CR9","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1109\/TCBB.2006.55","volume":"3","author":"V Lacroix","year":"2006","unstructured":"Lacroix, V., Fernandes, C.G., Sagot, M.: Motif search in graphs: application to metabolic networks. IEEE\/ACM Trans. Comput. Biol. Bioinform. 3(4), 360\u2013368 (2006)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"issue":"4","key":"16_CR10","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1089\/cmb.2012.0083","volume":"20","author":"I Rauf","year":"2013","unstructured":"Rauf, I., Rasche, F., Nicolas, F., B\u00f6cker, S.: Finding maximum colorful subtrees in practice. J. Comput. Biol. 20(4), 311\u2013321 (2013)","journal-title":"J. Comput. Biol."},{"issue":"11","key":"16_CR11","doi-asserted-by":"crossref","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. 18(11), 1383\u20131397 (2011)","journal-title":"J. Comput. Biol."},{"issue":"2","key":"16_CR12","doi-asserted-by":"crossref","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. J. Comput. Biol. 13(2), 133\u2013144 (2006)","journal-title":"J. Comput. Biol."},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-319-21398-9_25","volume-title":"Computing and Combinatorics","author":"WTJ White","year":"2015","unstructured":"White, W.T.J., Beyer, S., D\u00fchrkop, K., Chimani, M., B\u00f6cker, S.: Speedy colorful subtrees. In: Xu, D., Du, D., Du, D. (eds.) COCOON 2015. LNCS, vol. 9198, pp. 310\u2013322. Springer, Cham (2015). doi:\n10.1007\/978-3-319-21398-9_25"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-55911-7_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,11,22]],"date-time":"2017-11-22T04:01:41Z","timestamp":1511323301000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-55911-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319559100","9783319559117"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-55911-7_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}