{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T12:05:36Z","timestamp":1759147536180},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540560241"},{"type":"electronic","value":"9783540473572"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-56024-6_18","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:53:18Z","timestamp":1330253598000},"page":"214-229","source":"Crossref","is-referenced-by-count":26,"title":["Two algorithms for the longest common subsequence of three (or more) strings"],"prefix":"10.1007","author":[{"given":"Robert W.","family":"Irving","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Campbell B.","family":"Fraser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"18_CR1","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. Information Processing Letters, 23:63\u201369, 1986.","journal-title":"Information Processing Letters"},{"key":"18_CR2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(92)90132-Y","volume":"92","author":"A. Apostolico","year":"1992","unstructured":"A. Apostolico, S. Browne, and C. Guerra. Fast linear-space computations of longest common subsequences. Theoretical Computer Science, 92:3\u201317, 1992.","journal-title":"Theoretical Computer Science"},{"key":"18_CR3","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF01840365","volume":"2","author":"A. Apostolico","year":"1987","unstructured":"A. Apostolico and C. Guerra. The longest common subsequence problem revisited. Algorithmica, 2:315\u2013336, 1987.","journal-title":"Algorithmica"},{"key":"18_CR4","first-page":"341","volume":"18","author":"D.S. Hirschberg","year":"1975","unstructured":"D.S. Hirschberg. A linear space algorithm for computing maximal common subsequences. Communications of the A.C.M., 18:341\u2013343, 1975.","journal-title":"Communications of the A.C.M."},{"key":"18_CR5","first-page":"664","volume":"24","author":"D.S. Hirschberg","year":"1977","unstructured":"D.S. Hirschberg. Algorithms for the longest common subsequence problem. Journal of the A.C.M., 24:664\u2013675, 1977.","journal-title":"Journal of the A.C.M."},{"key":"18_CR6","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF01934514","volume":"24","author":"W.J. Hsu","year":"1984","unstructured":"W.J. Hsu and M.W. Du. Computing a longest common subsequence for a set of strings. BIT, 24:45\u201359, 1984.","journal-title":"BIT"},{"key":"18_CR7","first-page":"350","volume":"20","author":"J.W. Hunt","year":"1977","unstructured":"J.W. Hunt and T.G. Szymanski. A fast algorithm for computing longest common subsequences. Communications of the A.C.M., 20:350\u2013353, 1977.","journal-title":"Communications of the A.C.M."},{"key":"18_CR8","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1007\/BF01934067","volume":"21","author":"S.Y. Itoga","year":"1981","unstructured":"S.Y. Itoga. The string merging problem. BIT, 21:20\u201330, 1981.","journal-title":"BIT"},{"key":"18_CR9","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:18\u201331, 1980.","journal-title":"J. Comput. System Sci."},{"key":"18_CR10","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/BF01840446","volume":"1","author":"E.W. Myers","year":"1986","unstructured":"E.W. Myers. An O(ND) difference algorithm and its variations. Algorithmica, 1:251\u2013266, 1986.","journal-title":"Algorithmica"},{"key":"18_CR11","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF00264437","volume":"18","author":"N. Nakatsu","year":"1982","unstructured":"N. Nakatsu, Y. Kambayashi, and S. Yajima. A longest common subsequence algorithm suitable for similar text strings. Acta Informatica, 18:171\u2013179, 1982.","journal-title":"Acta Informatica"},{"key":"18_CR12","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1073\/pnas.69.1.4","volume":"69","author":"D. Sankoff","year":"1972","unstructured":"D. Sankoff. Matching sequences under deletion insertion constraints. Proc. Nat. Acad. Sci. U.S.A., 69:4\u20136, 1972.","journal-title":"Proc. Nat. Acad. Sci. U.S.A."},{"key":"18_CR13","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/S0019-9958(85)80046-2","volume":"64","author":"E. Ukkonen","year":"1985","unstructured":"E. Ukkonen. Algorithms for approximate string matching. Information and Control, 64:100\u2013118, 1985.","journal-title":"Information and Control"},{"key":"18_CR14","first-page":"168","volume":"21","author":"R.A. Wagner","year":"1974","unstructured":"R.A. Wagner and M.J. Fischer. The string-to-string correction problem. Journal of the A.C.M., 21:168\u2013173, 1974.","journal-title":"Journal of the A.C.M."},{"key":"18_CR15","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0020-0190(90)90035-V","volume":"35","author":"S. Wu","year":"1990","unstructured":"S. Wu, U. Manber, G. Myers, and W. Miller. An O(NP) sequence comparison algorithm. Information Processing Letters, 35:317\u2013323, 1990.","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56024-6_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:48:23Z","timestamp":1619570903000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56024-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540560241","9783540473572"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-56024-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}