{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T05:06:30Z","timestamp":1648789590467},"reference-count":8,"publisher":"Elsevier BV","issue":"5-6","license":[{"start":{"date-parts":[[2000,6,1]],"date-time":"2000-06-01T00:00:00Z","timestamp":959817600000},"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":[[2000,6]]},"DOI":"10.1016\/s0020-0190(00)00057-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:44:54Z","timestamp":1027651494000},"page":"229-233","source":"Crossref","is-referenced-by-count":2,"title":["Multi-subsequence searching"],"prefix":"10.1016","volume":"74","author":[{"given":"Weimin","family":"Chen","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(00)00057-0_ID004","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/S0020-0190(00)00057-0_ID005","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1007\/BF01840365","article-title":"The longest common subsequence problem revisited","volume":"Vol. 2","author":"Apostolico","year":"1987","journal-title":"Algorithmica"},{"issue":"2","key":"10.1016\/S0020-0190(00)00057-0_ID006","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0304-3975(91)90358-9","article-title":"Searching subsequences","volume":"Vol. 78","author":"Baeza-Yates","year":"1991","journal-title":"Theoret. Comput. Sci."},{"issue":"6","key":"10.1016\/S0020-0190(00)00057-0_ID007","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1145\/360825.360861","article-title":"A linear space algorithm for computing maximal common subsequences","volume":"Vol. 18","author":"Hirschberg","year":"1975","journal-title":"Comm. ACM"},{"issue":"5","key":"10.1016\/S0020-0190(00)00057-0_ID008","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1145\/359581.359603","article-title":"A fast algorithm for computing longest subsequences","volume":"Vol. 20","author":"Hunt","year":"1977","journal-title":"Comm. ACM"},{"issue":"2","key":"10.1016\/S0020-0190(00)00057-0_ID009","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1137\/S0097539791218202","article-title":"Ordered and unordered tree inclusion","volume":"Vol. 24","author":"Kilpel\u00e4inen","year":"1995","journal-title":"SIAM J. Comput."},{"issue":"1\u20132","key":"10.1016\/S0020-0190(00)00057-0_ID010","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0304-3975(97)88195-9","article-title":"Matching a set of strings with variable length don't cares","volume":"Vol. 178","author":"Kucherov","year":"1997","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(00)00057-0_ID011","series-title":"Time Warps, String Edits, and Macromolecules: the Theory and Practice of Sequence Comparison","author":"Sankoff","year":"1983"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000000570?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000000570?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T08:25:00Z","timestamp":1555230300000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019000000570"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,6]]},"references-count":8,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2000,6]]}},"alternative-id":["S0020019000000570"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(00)00057-0","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2000,6]]}}}