{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,27]],"date-time":"2023-08-27T13:38:24Z","timestamp":1693143504246},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"4-5","license":[{"start":{"date-parts":[[1994,11,1]],"date-time":"1994-11-01T00:00:00Z","timestamp":783648000000},"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":[[1994,11]]},"DOI":"10.1007\/bf01185429","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T16:12:30Z","timestamp":1108743150000},"page":"293-311","source":"Crossref","is-referenced-by-count":19,"title":["Performance analysis of some simple heuristics for computing longest common subsequences"],"prefix":"10.1007","volume":"12","author":[{"given":"F.","family":"Chin","sequence":"first","affiliation":[]},{"given":"C. K.","family":"Poon","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01185429_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":"BF01185429_CR2","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 (1987), 315\u2013336.","journal-title":"Algorithmica"},{"issue":"4","key":"BF01185429_CR3","first-page":"463","volume":"13","author":"F. Chin","year":"1990","unstructured":"F. Chin and C. K. Poon, A fast algorithm for computing longest common subsequences of small alphabet size,J. Inform. Process., 13(4) (1990), 463\u2013469. A preliminary version also appeared inProceedings of the International Workshop on Discrete Algorithms and Complexity, 1989, pp. 163\u2013168.","journal-title":"J. Inform. Process."},{"key":"BF01185429_CR4","unstructured":"F. Chin and C. K. Poon, Performance of heuristics for the longest common subsequences problem,Proceedings of the 1990 International Computer Symposium, Hsinchu, Taiwan, December 1990, pp. 164\u2013169."},{"key":"BF01185429_CR5","unstructured":"G. R. Cross and S. Kuo, Two-Step String-Matching Procedure, Technical Report CS-89-198, Washington State University, 1989."},{"key":"BF01185429_CR6","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":"BF01185429_CR7","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 problem,J. Assoc. Comput. Mach.,24 (1977), 664\u2013675.","journal-title":"J. Assoc. Comput. Mach."},{"issue":"1","key":"BF01185429_CR8","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/0020-0190(78)90037-6","volume":"7","author":"D. S. Hirschberg","year":"1978","unstructured":"D. S. Hirschberg, An information-theoretic lower bound for the longest common subsequence problem,Inform. Process. Lett., 7(1) (1978), 40\u201341.","journal-title":"Inform. Process. Lett."},{"key":"BF01185429_CR9","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":"BF01185429_CR10","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 computing string edit distances,J. Comput. System Sci,20 (1980), 18\u201331.","journal-title":"J. Comput. System Sci"},{"key":"BF01185429_CR11","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/BF01840446","volume":"1","author":"E. W. Myers","year":"1986","unstructured":"E. W. Myers, AnO(ND) difference algorithm and its variations,Algorithmica,1 (1986), 251\u2013266.","journal-title":"Algorithmica"},{"key":"BF01185429_CR12","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 Inform.,18 (1982), 171\u2013179.","journal-title":"Acta Inform."},{"key":"BF01185429_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,Inform, and Control,64 (1985), 100\u2013118.","journal-title":"Inform, and Control"},{"issue":"1","key":"BF01185429_CR14","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(1) (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\/BF01185429.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01185429\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01185429","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T16:41:38Z","timestamp":1556728898000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01185429"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,11]]},"references-count":14,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[1994,11]]}},"alternative-id":["BF01185429"],"URL":"https:\/\/doi.org\/10.1007\/bf01185429","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,11]]}}}