{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,27]],"date-time":"2024-06-27T00:53:13Z","timestamp":1719449593386},"reference-count":8,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2004,5,1]],"date-time":"2004-05-01T00:00:00Z","timestamp":1083369600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2004,5]]},"DOI":"10.1016\/j.ipl.2004.02.008","type":"journal-article","created":{"date-parts":[[2004,4,8]],"date-time":"2004-04-08T09:08:34Z","timestamp":1081415314000},"page":"175-179","source":"Crossref","is-referenced-by-count":70,"title":["A simple algorithm for the constrained sequence problems"],"prefix":"10.1016","volume":"90","author":[{"given":"Francis Y.L.","family":"Chin","sequence":"first","affiliation":[]},{"given":"Alfredo","family":"De Santis","sequence":"additional","affiliation":[]},{"given":"Anna Lisa","family":"Ferrara","sequence":"additional","affiliation":[]},{"given":"N.L.","family":"Ho","sequence":"additional","affiliation":[]},{"given":"S.K.","family":"Kim","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ipl.2004.02.008_BIB001","series-title":"Proceedings of the IEEE Computer Society Conference on Bioinformatics","first-page":"337","article-title":"Efficient constrained multiple sequence alignment with performance guarantee","author":"Chin","year":"2003"},{"key":"10.1016\/j.ipl.2004.02.008_BIB002","series-title":"Introduction to Algorithms","author":"Cormen","year":"1990"},{"key":"10.1016\/j.ipl.2004.02.008_BIB003","doi-asserted-by":"crossref","first-page":"664","DOI":"10.1145\/322033.322044","article-title":"Algorithms for the longest common subsequence problem","volume":"24","author":"Hirschberg","year":"1977","journal-title":"J. ACM"},{"key":"10.1016\/j.ipl.2004.02.008_BIB004","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":"Mayer","year":"1978","journal-title":"J. ACM"},{"key":"10.1016\/j.ipl.2004.02.008_BIB005","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/0022-0000(80)90002-1","article-title":"A faster algorithm computing string edit distances","volume":"20","author":"Masek","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/j.ipl.2004.02.008_BIB006","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1142\/S0219720003000095","article-title":"Constrained multiple sequence alignment tool development and its application to RNase family alignment","volume":"1","author":"Tang","year":"2003","journal-title":"J. Bioinform. Comput. Biol."},{"key":"10.1016\/j.ipl.2004.02.008_BIB007","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/j.ipl.2003.07.001","article-title":"The constrained longest common subsequence problem","volume":"88","author":"Tsai","year":"2003","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.ipl.2004.02.008_BIB008","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/321796.321811","article-title":"The string-to-string correction problem","volume":"21","author":"Wagner","year":"1974","journal-title":"J. ACM"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019004000614?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019004000614?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,14]],"date-time":"2019-02-14T07:29:56Z","timestamp":1550129396000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019004000614"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,5]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2004,5]]}},"alternative-id":["S0020019004000614"],"URL":"https:\/\/doi.org\/10.1016\/j.ipl.2004.02.008","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2004,5]]}}}