{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:04:34Z","timestamp":1763467474169},"reference-count":16,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2001,12,1]],"date-time":"2001-12-01T00:00:00Z","timestamp":1007164800000},"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":[[2001,12]]},"DOI":"10.1016\/s0020-0190(01)00182-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:47:08Z","timestamp":1027615628000},"page":"279-285","source":"Crossref","is-referenced-by-count":53,"title":["A fast and practical bit-vector algorithm for the Longest Common Subsequence problem"],"prefix":"10.1016","volume":"80","author":[{"given":"Maxime","family":"Crochemore","sequence":"first","affiliation":[]},{"given":"Costas S.","family":"Iliopoulos","sequence":"additional","affiliation":[]},{"given":"Yoan J.","family":"Pinzon","sequence":"additional","affiliation":[]},{"given":"James F.","family":"Reid","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(01)00182-X_BIB001","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/321921.321922","article-title":"Bounds on the complexity of the longest common subsequence problem","volume":"23","author":"Aho","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(01)00182-X_BIB002","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0020-0190(86)90091-8","article-title":"A bit-string longest common subsequence algorithm","volume":"23","author":"Allison","year":"1986","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(01)00182-X_BIB003","series-title":"Introductory Combinatorics","author":"Bogart","year":"1983"},{"key":"10.1016\/S0020-0190(01)00182-X_BIB004","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1145\/135239.135243","article-title":"A new approach to text searching","volume":"35","author":"Baeza-Yates","year":"1992","journal-title":"Comm. ACM"},{"issue":"6","key":"10.1016\/S0020-0190(01)00182-X_BIB005","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1145\/360825.360861","article-title":"A linear space algorithm for computing maximal common subsequences","volume":"18","author":"Hirschberg","year":"1975","journal-title":"Comm. ACM"},{"issue":"1","key":"10.1016\/S0020-0190(01)00182-X_BIB006","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/0020-0190(78)90037-6","article-title":"An information theoretic lower bound for the longest common subsequence problem","volume":"7","author":"Hirschberg","year":"1978","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(01)00182-X_BIB007","first-page":"707","article-title":"Binary codes capable of correcting deletions, insertions and reversals","volume":"6","author":"Levenshtein","year":"1966","journal-title":"Sov. Phys. Dokl."},{"key":"10.1016\/S0020-0190(01)00182-X_BIB008","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/BF01942606","article-title":"A subquadratic algorithm for approximate limited expression matching","volume":"15","author":"Manber","year":"1996","journal-title":"Algorithmica"},{"key":"10.1016\/S0020-0190(01)00182-X_BIB009","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."},{"issue":"3","key":"10.1016\/S0020-0190(01)00182-X_BIB010","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1145\/316542.316550","article-title":"A fast bit-vector algorithm for approximate string matching based on dynamic programming","volume":"46","author":"Myers","year":"1999","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(01)00182-X_BIB011","series-title":"Combinatorial Algorithms: Theory and Practice","author":"Reingold","year":"1977"},{"key":"10.1016\/S0020-0190(01)00182-X_BIB012","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0012-365X(73)80007-X","article-title":"Shortcuts, diversions and maximal chains in partially ordered sets","volume":"4","author":"Sankoff","year":"1973","journal-title":"Discrete Math."},{"key":"10.1016\/S0020-0190(01)00182-X_BIB013","series-title":"Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison","year":"1983"},{"issue":"1","key":"10.1016\/S0020-0190(01)00182-X_BIB014","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"},{"key":"10.1016\/S0020-0190(01)00182-X_BIB015","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1002\/spe.4380240402","article-title":"Approximate string matching using within-word parallelism","volume":"24","author":"Wright","year":"1994","journal-title":"Soft. Pract. Exper."},{"key":"10.1016\/S0020-0190(01)00182-X_BIB016","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1145\/135239.135244","article-title":"Fast text searching allowing errors","volume":"35","author":"Wu","year":"1992","journal-title":"Comm. ACM"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002001900100182X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002001900100182X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T16:57:04Z","timestamp":1556211424000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S002001900100182X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,12]]},"references-count":16,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2001,12]]}},"alternative-id":["S002001900100182X"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00182-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2001,12]]}}}