{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,2]],"date-time":"2026-10-02T10:10:41Z","timestamp":1790935841686,"version":"4.1.0"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[1987,11,1]],"date-time":"1987-11-01T00:00:00Z","timestamp":562723200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1987,11]]},"DOI":"10.1007\/bf01840365","type":"journal-article","created":{"date-parts":[[2005,6,28]],"date-time":"2005-06-28T23:41:00Z","timestamp":1120002060000},"page":"315-336","source":"Crossref","is-referenced-by-count":141,"title":["The longest common subsequence problem revisited"],"prefix":"10.1007","volume":"2","author":[{"given":"A.","family":"Apostolico","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"C.","family":"Guerra","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"BF01840365_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/321921.321922","volume":"23","author":"A. V. Aho","year":"1976","unstructured":"A. V. Aho, D. S. Hirschberg, and J. D. Ullman, Bounds on the complexity of the maximal common subsequence problem,J. Assoc. Comput. Mach.,23 (1976), 1\u201312.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01840365_CR2","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. V. Aho","year":"1976","unstructured":"A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1976"},{"key":"BF01840365_CR3","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0020-0190(86)90044-X","volume":"23","author":"A. Apostolico","year":"1986","unstructured":"A. Apostolico, Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings,Inform. Process. Lett.,23 (1986), 63\u201369.","journal-title":"Inform. Process. Lett."},{"key":"BF01840365_CR4","unstructured":"A. Apostolico and C. Guerra, A fast linear space algorithm for computing longest common subsequences,Proceedings of the 23rd Allerton Conference, Monticello, IL, 1985, pp. 76\u201384."},{"key":"BF01840365_CR5","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/0020-0190(76)90071-5","volume":"5","author":"J. L. Bentley","year":"1976","unstructured":"J. L. Bentley and A. C.-C. Yao, An almost optimal algorithm for unbounded searching,Inform. Process. Lett.,5 (1976), 82\u201387.","journal-title":"Inform. Process. Lett."},{"key":"BF01840365_CR6","doi-asserted-by":"crossref","unstructured":"M. R. Brown, and R. E. Tarjan, A representation of linear lists with movable fingers,Proceedings of the Wth Annual ACM Symposium on Theory of Computing, San Diego, CA, 1978, pp. 19\u201329.","DOI":"10.1145\/800133.804328"},{"key":"BF01840365_CR7","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1145\/322123.322127","volume":"26","author":"M. R. Brown","year":"1979","unstructured":"M. R. Brown and R. E. Tarjan, A fast merging algorithm,J. Assoc. Comput. Mach. 26 (1979), 211\u2013226.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01840365_CR8","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1145\/360825.360861","volume":"18","author":"D. S. Hirschberg","year":"1975","unstructured":"D. S. Hirschberg, A linear space algorithm for computing maximal common subsequences,Comm. ACM,18 (1975), 341\u2013343.","journal-title":"Comm. ACM"},{"key":"BF01840365_CR9","doi-asserted-by":"crossref","first-page":"664","DOI":"10.1145\/322033.322044","volume":"24","author":"D. S. Hirschberg","year":"1977","unstructured":"D. S. Hirschberg, Algorithms for the longest common subsequence problemJ Assoc. Comput. Mach.,24 (1977), 664\u2013675.","journal-title":"J Assoc. Comput. Mach."},{"key":"BF01840365_CR10","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0022-0000(84)90025-4","volume":"29","author":"W. J. Hsu","year":"1984","unstructured":"W. J. Hsu and M. W. Du, New algorithms for the LCS problem,J. Comput. System Sci.,29 (1984), 133\u2013152.","journal-title":"J. Comput. System Sci."},{"key":"BF01840365_CR11","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1145\/359581.359603","volume":"20","author":"J. W. Hunt","year":"1977","unstructured":"J. W. Hunt and T. G. Szymanski, A fast algorithm for computing longest common subsequences,Comm. ACM,20 (1977), 350\u2013353.","journal-title":"Comm. ACM"},{"key":"BF01840365_CR12","unstructured":"H. M. Martinez (ed.), Mathematical and computational problems in the analysis of molecular sequences,Bull. Math. Biol,46, 4 (1984)."},{"key":"BF01840365_CR13","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/0022-0000(80)90002-1","volume":"20","author":"W. J. Masek","year":"1980","unstructured":"W. J. Masek and M. S. Paterson, A faster algorithm for computing string editing distances,J. Comput. System Sci.,20 (1980), 18\u201331.","journal-title":"J. Comput. System Sci."},{"key":"BF01840365_CR14","volume-title":"EATCS Monographs on TCS","author":"K. Mehlhorn","year":"1984","unstructured":"K. Mehlhorn,Data Structures and Algorithms 1: Sorting and Searching, EATCS Monographs on TCS, Springer-Verlag, Berlin, 1984."},{"key":"BF01840365_CR15","volume-title":"Time Warps, String Edits and Macromolecules: The Theory and Practice of Sequence Comparisons","year":"1983","unstructured":"D. Sankoff and J. B. Kruskal (eds.),Time Warps, String Edits and Macromolecules: The Theory and Practice of Sequence Comparisons, Addison-Wesley, Reading, MA, 1983."},{"key":"BF01840365_CR16","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0020-0190(77)90031-X","volume":"6","author":"P. Emde Boas van","year":"1977","unstructured":"P. van Emde Boas, Preserving order in a forest in less than logarithmic time and linear space,Inform. Process. Lett.,6 (1977), 80\u201382.","journal-title":"Inform. Process. Lett."},{"key":"BF01840365_CR17","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"R. A. Wagner","year":"1974","unstructured":"R. A. Wagner and M. J. Fischer, The string to string correction problem,J. Assoc. Comput. Mach.,21 (1974), 168\u2013173.","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01840365.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01840365\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01840365","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T15:35:30Z","timestamp":1557416130000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01840365"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,11]]},"references-count":17,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1987,11]]}},"alternative-id":["BF01840365"],"URL":"https:\/\/doi.org\/10.1007\/bf01840365","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,11]]}}}