{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T09:12:55Z","timestamp":1770714775980,"version":"3.49.0"},"reference-count":17,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7868,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCR-89-00305"],"award-info":[{"award-number":["CCR-89-00305"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["90-0107"],"award-info":[{"award-number":["90-0107"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100004415","name":"North Atlantic Treaty Organization","doi-asserted-by":"publisher","award":["CRG900293"],"award-info":[{"award-number":["CRG900293"]}],"id":[{"id":"10.13039\/100004415","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003407","name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003407","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004462","name":"Consiglio Nazionale delle Ricerche","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004462","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1992,1]]},"DOI":"10.1016\/0304-3975(92)90132-y","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:17:21Z","timestamp":1027642641000},"page":"3-17","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":41,"title":["Fast linear-space computations of longest common subsequences"],"prefix":"10.1016","volume":"92","author":[{"given":"A.","family":"Apostolico","sequence":"first","affiliation":[]},{"given":"S.","family":"Browne","sequence":"additional","affiliation":[]},{"given":"C.","family":"Guerra","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/0304-3975(92)90132-Y_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/321921.321922","article-title":"Bounds on the complexity of the maximal common subsequence problem","volume":"23","author":"Aho","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(92)90132-Y_BIB2","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0020-0190(86)90044-X","article-title":"Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings","volume":"23","author":"Apostolico","year":"1986","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(92)90132-Y_BIB3","series-title":"Proc. 23rd Allerton Conf. Monticello","article-title":"A fast linear-space algorithm for computing longest common subsequences","author":"Apostolico","year":"1985"},{"key":"10.1016\/0304-3975(92)90132-Y_BIB4","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF01840365","article-title":"The longest common subsequence problem revisited","volume":"2","author":"Apostolico","year":"1987","journal-title":"Algorithmica"},{"key":"10.1016\/0304-3975(92)90132-Y_BIB5","series-title":"Introductory Combinatorics","author":"Bogart","year":"1983"},{"key":"10.1016\/0304-3975(92)90132-Y_BIB6","series-title":"Proc. 10th STOC","first-page":"19","article-title":"A representation of linear lists with movable fingers","author":"Brown","year":"1978"},{"issue":"6","key":"10.1016\/0304-3975(92)90132-Y_BIB7","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":"4","key":"10.1016\/0304-3975(92)90132-Y_BIB8","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"},{"issue":"5","key":"10.1016\/0304-3975(92)90132-Y_BIB9","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1145\/359581.359603","article-title":"A fast algorithm for computing longest common subsequences","volume":"20","author":"Hunt","year":"1977","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(92)90132-Y_BIB10","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF00265993","article-title":"A linear-space algorithm for the LCS problem","volume":"24","author":"Kumar","year":"1987","journal-title":"Acta Inform."},{"issue":"4","key":"10.1016\/0304-3975(92)90132-Y_BIB11","volume":"46","year":"1984","journal-title":"Bulletin of Mathematical Biology"},{"key":"10.1016\/0304-3975(92)90132-Y_BIB12","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/0022-0000(80)90002-1","article-title":"A faster algorithm for computing string editing distances","volume":"20","author":"Masek","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(92)90132-Y_BIB13","series-title":"EATCS Monographs on TCS","article-title":"Data Structures and Algorithms 1: Sorting and Searching","author":"Mehlhorn","year":"1984"},{"key":"10.1016\/0304-3975(92)90132-Y_BIB14","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/BF01840446","article-title":"An O(ND) difference algorithm and its variations","volume":"1","author":"Myers","year":"1986","journal-title":"Algorithmica"},{"key":"10.1016\/0304-3975(92)90132-Y_BIB15","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF00264437","article-title":"A longest common subsequence algorithm suitable for similar text strings","volume":"18","author":"Nakatsu","year":"1982","journal-title":"Acta Informatica"},{"key":"10.1016\/0304-3975(92)90132-Y_BIB16","year":"1983"},{"issue":"1","key":"10.1016\/0304-3975(92)90132-Y_BIB17","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":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290132Y?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290132Y?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T03:42:00Z","timestamp":1762227720000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759290132Y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,1]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,1]]}},"alternative-id":["030439759290132Y"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)90132-y","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1992,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Fast linear-space computations of longest common subsequences","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0304-3975(92)90132-Y","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1992 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}