{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:02:42Z","timestamp":1725552162497},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540310006"},{"type":"electronic","value":"9783540314684"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11604686_24","type":"book-chapter","created":{"date-parts":[[2005,12,5]],"date-time":"2005-12-05T15:02:01Z","timestamp":1133794921000},"page":"271-282","source":"Crossref","is-referenced-by-count":5,"title":["Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints"],"prefix":"10.1007","author":[{"given":"Guillaume","family":"Blin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guillaume","family":"Fertin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"Hermelin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"St\u00e9phane","family":"Vialette","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/978-3-540-27801-6_20","volume-title":"Combinatorial Pattern Matching","author":"R. Backofen","year":"2004","unstructured":"Backofen, R., Busch, A.: Computational design of new and recombinant selenoproteins. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol.\u00a03109, pp. 270\u2013284. Springer, Heidelberg (2004)"},{"key":"24_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/3-540-45841-7_22","volume-title":"STACS 2002","author":"R. Backofen","year":"2002","unstructured":"Backofen, R., Narayanaswamy, N.S., Swidan, F.: On the complexity of protein similarity search under mRNA structure constraints. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol.\u00a02285, pp. 274\u2013286. Springer, Heidelberg (2002)"},{"issue":"3","key":"24_CR3","first-page":"275","volume":"2","author":"R. Backofen","year":"2002","unstructured":"Backofen, R., Narayanaswamy, N.S., Swidan, F.: Protein similarity search under mRNA structural constraints: application to targeted selenocystein insertion. In Silico Biology\u00a02(3), 275\u2013290 (2002)","journal-title":"In Silico Biology"},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/PL00009182","volume":"19","author":"T.C. Biedl","year":"1997","unstructured":"Biedl, T.C., Kant, G., Kaufmann, M.: On triangulating planar graphs under the four-connectivity constraints. Algorithmica\u00a019, 427\u2013446 (1997)","journal-title":"Algorithmica"},{"issue":"2","key":"24_CR5","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1016\/0968-0004(91)90180-4","volume":"16","author":"A. B\u00f6ch","year":"1991","unstructured":"B\u00f6ch, A., Forchhammer, K., Heider, J., Baron, C.: Selenoprotein synthesis: a review. Trends in Biochemical Sciences\u00a016(2), 463\u2013467 (1991)","journal-title":"Trends in Biochemical Sciences"},{"key":"24_CR6","unstructured":"Bodlaender, H.L.: Classes of graphs with bounded tree-width. Research Report RUU-CS-86-22, Utrecht University, Padualaan 14, Utrecht, The Netherlands (December 1986)"},{"key":"24_CR7","first-page":"49","volume":"11","author":"H.L. Bodlaender","year":"1995","unstructured":"Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hallett, M.T., Wareham, H.T.: Parameterized complexity analysis in computational biology. Computer Applications in the Biosciences\u00a011, 49\u201357 (1995)","journal-title":"Computer Applications in the Biosciences"},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-540-24618-3_14","volume-title":"SOFSEM 2004: Theory and Practice of Computer Science","author":"D. Bongartz","year":"2004","unstructured":"Bongartz, D.: Some notes on the complexity of protein similarity search under mRNA structure constraints. In: Van Emde Boas, P., Pokorn\u00fd, J., Bielikov\u00e1, M., \u0160tuller, J. (eds.) SOFSEM 2004. LNCS, vol.\u00a02932, pp. 174\u2013183. Springer, Heidelberg (2004)"},{"issue":"1-3","key":"24_CR9","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0012-365X(89)90083-6","volume":"75","author":"F.R. Chung","year":"1989","unstructured":"Chung, F.R., Seymour, P.D.: Graphs with small bandwidth and cutwidth. Discrete Math.\u00a075(1-3), 113\u2013119 (1989)","journal-title":"Discrete Math."},{"key":"24_CR10","doi-asserted-by":"crossref","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":"24_CR11","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1038\/331280a0","volume":"331","author":"T. Jacks","year":"1988","unstructured":"Jacks, T., Power, M., Masiarz, F., Luciw, P., Barr, P., Varmus, H.: Characterization of ribosomal frameshifting in HIV-1 gag-pol expression. Nature\u00a0331, 280\u2013283 (1988)","journal-title":"Nature"},{"key":"24_CR12","doi-asserted-by":"publisher","first-page":"1237","DOI":"10.1126\/science.2416054","volume":"230","author":"T. Jacks","year":"1985","unstructured":"Jacks, T., Varmus, H.: Expression of the Rous sarcoma virus pol gene by ribosomal frameshifting. Science\u00a0230, 1237\u20131242 (1985)","journal-title":"Science"},{"issue":"1","key":"24_CR13","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0166-218X(93)90171-J","volume":"43","author":"E. Korach","year":"1993","unstructured":"Korach, E., Solel, N.: Tree-width, path-width, and cutwidth. Discrete Applied Mathematics\u00a043(1), 97\u2013101 (1993)","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"24_CR14","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/S0022-0000(02)00004-1","volume":"65","author":"G. Lin","year":"2002","unstructured":"Lin, G., Chen, Z.-Z., Jiang, T., Wen, J.: The longest common subsequence problem for sequences with nested arc annotations. Journal of Computer and System Sciences\u00a065(3), 465\u2013480 (2002) Special issue on computational biology","journal-title":"Journal of Computer and System Sciences"},{"key":"24_CR15","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors II: algorithmic aspects of tree-width. Journal of Algorithms\u00a07, 309\u2013322 (1986)","journal-title":"Journal of Algorithms"},{"key":"24_CR16","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1002\/net.3230130202","volume":"13","author":"J.A. Wald","year":"1983","unstructured":"Wald, J.A., Colbourn, C.J.: Stiener trees, partial 2-trees, and minimum ifi networks. Networks\u00a013, 159\u2013167 (1983)","journal-title":"Networks"},{"key":"24_CR17","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/0022-0000(89)90032-9","volume":"38","author":"M. Yannakakis","year":"1986","unstructured":"Yannakakis, M.: Embedding planar graphs in four pages. Journal of Computer and System Sciences\u00a038, 36\u201367 (1986)","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11604686_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:04:23Z","timestamp":1619507063000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11604686_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540310006","9783540314684"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11604686_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}