{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T11:46:36Z","timestamp":1759146396745},"reference-count":16,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1985,10,1]],"date-time":"1985-10-01T00:00:00Z","timestamp":496972800000},"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":[[1985,10]]},"DOI":"10.1016\/0020-0190(85)90058-4","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T14:37:33Z","timestamp":1047652653000},"page":"191-198","source":"Crossref","is-referenced-by-count":31,"title":["A systolic array for the longest common subsequence problem"],"prefix":"10.1016","volume":"21","author":[{"given":"Yves","family":"Robert","sequence":"first","affiliation":[]},{"given":"Maurice","family":"Tchuente","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/0020-0190(85)90058-4_BIB1","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\/0020-0190(85)90058-4_BIB2","series-title":"Res. Rept. CS-81-36","article-title":"On a family of L languages resulting from systolic tree automata","author":"Culik","year":"1981"},{"issue":"1","key":"10.1016\/0020-0190(85)90058-4_BIB3","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1109\/MC.1980.1653338","article-title":"The design of special-purpose VLSI chips","volume":"13","author":"Foster","year":"1980","journal-title":"IEEE Comput."},{"key":"10.1016\/0020-0190(85)90058-4_BIB4","series-title":"Proc. Conf. on Advanced Research in VLSI","article-title":"Systolic stacks, queues and counters","author":"Guibas","year":"1982"},{"issue":"4","key":"10.1016\/0020-0190(85)90058-4_BIB5","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1145\/356827.356830","article-title":"Approximate string matching","volume":"12","author":"Hall","year":"1980","journal-title":"Comput. Surveys"},{"issue":"4","key":"10.1016\/0020-0190(85)90058-4_BIB6","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":"1","key":"10.1016\/0020-0190(85)90058-4_BIB7","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\/0020-0190(85)90058-4_BIB8","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"},{"issue":"10","key":"10.1016\/0020-0190(85)90058-4_BIB9","doi-asserted-by":"crossref","first-page":"1000","DOI":"10.1109\/TC.1982.1675909","article-title":"Systolic processing and an implementation for signal and image processing","volume":"C-31","author":"Kulkarni","year":"1982","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"10.1016\/0020-0190(85)90058-4_BIB10","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1109\/MC.1982.1653825","article-title":"Why systolic architectures","volume":"15","author":"Kung","year":"1982","journal-title":"IEEE Comput."},{"key":"10.1016\/0020-0190(85)90058-4_BIB11","series-title":"Proc. Symp. on Sparse Matrix and Their Applications","article-title":"Systolic arrays for (VLSI)","author":"Kung","year":"1978"},{"key":"10.1016\/0020-0190(85)90058-4_BIB12","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\/0020-0190(85)90058-4_BIB13","unstructured":"M.S. Paterson, Unpublished manuscript, Univ. of Warwick, Coventry, U.K., 1974."},{"key":"10.1016\/0020-0190(85)90058-4_BIB14_1","series-title":"Res. Rept. 420","article-title":"R\u00e9solution systolique de syst\u00e8mes lin\u00e9ares denses","author":"Robert","year":"1983"},{"issue":"3","key":"10.1016\/0020-0190(85)90058-4_BIB14_2","volume":"19","author":"Robert","year":"1985","journal-title":"RAIRO Numer. Anal."},{"key":"10.1016\/0020-0190(85)90058-4_BIB15","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0304-3975(83)90146-9","article-title":"Systolic trees and systolic language recognition by tree automata (Note)","volume":"22","author":"Steinby","year":"1983","journal-title":"Theoret. Comput. Sci."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019085900584?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019085900584?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T05:28:10Z","timestamp":1553578090000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019085900584"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,10]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1985,10]]}},"alternative-id":["0020019085900584"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(85)90058-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1985,10]]}}}