{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T09:58:46Z","timestamp":1742378326752},"reference-count":19,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1995,8,1]],"date-time":"1995-08-01T00:00:00Z","timestamp":807235200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6560,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1995,8]]},"DOI":"10.1016\/0304-3975(94)00251-d","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T06:09:04Z","timestamp":1051250944000},"page":"31-54","source":"Crossref","is-referenced-by-count":48,"title":["The parameterized complexity of sequence alignment and consensus"],"prefix":"10.1016","volume":"147","author":[{"given":"Hans L.","family":"Bodlaender","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rodney G.","family":"Downey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael R.","family":"Fellows","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Harold T.","family":"Wareham","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)00251-D_BIB1","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0304-3975(91)90358-9","article-title":"Searching subsequences","volume":"78","author":"Baeza-Yates","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)00251-D_BIB2","series-title":"Proc. 26th ACM Symp. on the Theory of Computing","first-page":"449","article-title":"Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy","author":"Bodlaender","year":"1994"},{"key":"10.1016\/0304-3975(94)00251-D_BIB3","author":"Cai","year":"1993"},{"key":"10.1016\/0304-3975(94)00251-D_BIB4","series-title":"Information and Classification \u2014 Concepts, Methods, and Applications","first-page":"393","article-title":"Discovering consensus molecular sequences","author":"Day","year":"1993"},{"key":"10.1016\/0304-3975(94)00251-D_BIB5","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0895-7177(93)90117-H","article-title":"The computation of consensus patterns in DNA sequences","volume":"17","author":"Day","year":"1993","journal-title":"Math. Comput. Modelling"},{"key":"10.1016\/0304-3975(94)00251-D_BIB6","series-title":"Proc. 6th ACM Workshop on Computational Learning Theory (COLT)","first-page":"51","article-title":"Parameterized learning complexity","author":"Downey","year":"1993"},{"key":"10.1016\/0304-3975(94)00251-D_BIB7","series-title":"Proc. 7th Ann. Conf. on Structure in Complexity Theory","first-page":"36","article-title":"Fixed-parameter intractability (extended abstract)","author":"Downey","year":"1992"},{"key":"10.1016\/0304-3975(94)00251-D_BIB8","series-title":"Proc. Symp. on the Logical Foundations of Computer Science","first-page":"89","article-title":"The parameterized complexity of some problems in logic and linguistics","volume":"Vol. 813","author":"Downey","year":"1994"},{"key":"10.1016\/0304-3975(94)00251-D_BIB9","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF02460299","article-title":"Efficient methods for multiple sequence alignment with guaranteed error bounds","volume":"55","author":"Gusfield","year":"1993","journal-title":"Bull. Math. Biology"},{"key":"10.1016\/0304-3975(94)00251-D_BIB10","series-title":"Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison","first-page":"325","article-title":"Recent results on the complexity of common subsequence problems","author":"Hirschberg","year":"1983"},{"key":"10.1016\/0304-3975(94)00251-D_BIB11","series-title":"Proc. 3rd Ann. Symp. on Combinatorial Pattern Matching","first-page":"214","article-title":"Two algorithms for the longest common subsequence of three (or more) strings","volume":"Vol. 644","author":"Irving","year":"1992"},{"key":"10.1016\/0304-3975(94)00251-D_BIB12","series-title":"Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison","first-page":"265","article-title":"An anthology of algorithms and concepts for sequence comparison","author":"Kruskal","year":"1983"},{"key":"10.1016\/0304-3975(94)00251-D_BIB13","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1109\/TSMC.1978.4309979","article-title":"A sentence-to-sentence clustering procedure for pattern analysis","volume":"8","author":"Lu","year":"1978","journal-title":"IEEE Trans. Systems Man and Cybernet."},{"key":"10.1016\/0304-3975(94)00251-D_BIB14","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/322063.322075","article-title":"The complexity of some problems on subsequences and supersequences","volume":"25","author":"Maier","year":"1978","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(94)00251-D_BIB15","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1016\/0076-6879(92)10029-D","article-title":"Dynamic programming algorithms for biological sequence comparison","volume":"183","author":"Pearson","year":"1992","journal-title":"Methods in Enzymology"},{"key":"10.1016\/0304-3975(94)00251-D_BIB16","doi-asserted-by":"crossref","first-page":"1763","DOI":"10.1137\/0152101","article-title":"Multiple alignment, communication cost, and graph matching","volume":"52","author":"Pevzner","year":"1992","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0304-3975(94)00251-D_BIB17","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1073\/pnas.69.1.4","article-title":"Matching comparisons under deletion\/insertion constraints","volume":"69","author":"Sankoff","year":"1972","journal-title":"PNAS"},{"key":"10.1016\/0304-3975(94)00251-D_BIB18","doi-asserted-by":"crossref","first-page":"810","DOI":"10.1137\/0145048","article-title":"Simultaneous solution of the RNA folding, alignment, and protosequence problems","volume":"45","author":"Sankoff","year":"1985","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0304-3975(94)00251-D_BIB19","series-title":"Technical Report no. 9301","article-title":"On the computational complexity of inferring evolutionary trees","author":"Wareham","year":"1993"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759400251D?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759400251D?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T08:50:09Z","timestamp":1555404609000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759400251D"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,8]]},"references-count":19,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1995,8]]}},"alternative-id":["030439759400251D"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)00251-d","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1995,8]]}}}