{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:36:54Z","timestamp":1725550614971},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540297406"},{"type":"electronic","value":"9783540322412"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11575832_34","type":"book-chapter","created":{"date-parts":[[2005,10,13]],"date-time":"2005-10-13T14:12:50Z","timestamp":1129212770000},"page":"301-314","source":"Crossref","is-referenced-by-count":0,"title":["Utilizing Dynamically Updated Estimates in Solving the Longest Common Subsequence Problem"],"prefix":"10.1007","author":[{"given":"Lasse","family":"Bergroth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"34_CR1","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"R.A. Wagner","year":"1974","unstructured":"Wagner, R.A., Fischer, M.J.: The string to string correction problem. Journal of the Association for Computing Machinery\u00a021(1), 168\u2013173 (1974)","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"4","key":"34_CR2","doi-asserted-by":"crossref","first-page":"664","DOI":"10.1145\/322033.322044","volume":"24","author":"D.S. Hirschberg","year":"1977","unstructured":"Hirschberg, D.S.: Algorithms for the Longest Common Subsequence problem. Journal of the Association for Computing Machinery\u00a024(4), 664\u2013675 (1977)","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"5","key":"34_CR3","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1145\/359581.359603","volume":"20","author":"J.W. Hunt","year":"1977","unstructured":"Hunt, J.W., Szymanski, T.G.: A Fast Algorithm for Computing Longest Common Subsequences. Communications of the ACM\u00a020(5), 350\u2013353 (1977)","journal-title":"Communications of the ACM"},{"key":"34_CR4","first-page":"69","volume-title":"Information Sciences","author":"A. Mukhopadhyay","year":"1980","unstructured":"Mukhopadhyay, A.: A Fast Algorithm for the Longest-Common-Subsequence Problem. In: Information Sciences, vol.\u00a020, pp. 69\u201382. Elsevier North Holland Inc., Amsterdam (1980)"},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"Bergroth, L., Hakonen, H., Raita, T.: A Survey of Longest Common Subsequence Algorithms. In: Proceedings of SPIRE 2000, A Coru\u00f1a, Spain, pp. 39\u201347 (2000)","DOI":"10.1109\/SPIRE.2000.878178"},{"issue":"4","key":"34_CR6","first-page":"463","volume":"13","author":"F.Y.L. Chin","year":"1990","unstructured":"Chin, F.Y.L., Poon, C.K.: A Fast Algorithm for Computing Longest Common Subsequences of Small Alphabet Size. Journal of Information Processing\u00a013(4), 463\u2013469 (1990)","journal-title":"Journal of Information Processing"},{"key":"34_CR7","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0022-0000(84)90025-4","volume":"29","author":"W.J. Hsu","year":"1984","unstructured":"Hsu, W.J., Du, M.W.: New Algorithms for the LCS Problem. Journal of Computer and System Sciences\u00a029, 133\u2013152 (1984)","journal-title":"Journal of Computer and System Sciences"},{"key":"34_CR8","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF01840365","volume":"2","author":"A. Apostolico","year":"1987","unstructured":"Apostolico, A., Guerra, C.: The Longest Common Subsequence Problem Revisited. Algorithmica\u00a02, 315\u2013336 (1987)","journal-title":"Algorithmica"},{"key":"34_CR9","unstructured":"Rick, C.: New Algorithms for the Longest Common Subsequence Problem, Institut f\u00fcr Informatik der Universit\u00e4t Bonn, Research Report No. 85123-Cs (October 1994)"},{"key":"34_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-540-39984-1_22","volume-title":"String Processing and Information Retrieval","author":"L. Bergroth","year":"2003","unstructured":"Bergroth, L., Hakonen, H., V\u00e4is\u00e4nen, J.: New Refinement Techniques for Longest Common Subsequence Algorithms. In: Nascimento, M.A., de Moura, E.S., Oliveira, A.L. (eds.) SPIRE 2003. LNCS, vol.\u00a02857, pp. 287\u2013303. Springer, Heidelberg (2003)"},{"issue":"11","key":"34_CR11","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1002\/spe.4380151102","volume":"15","author":"W. Miller","year":"1985","unstructured":"Miller, W., Myers, E.W.: A File Comparison Program. Software - Practice and Experience\u00a015(11), 1025\u20131040 (1985)","journal-title":"Software - Practice and Experience"},{"key":"34_CR12","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/BF01840446","volume":"1","author":"E.W. Myers","year":"1986","unstructured":"Myers, E.W.: An O(ND) Difference Algorithm and Its Variations. Algorithmica\u00a01, 251\u2013266 (1986)","journal-title":"Algorithmica"},{"key":"34_CR13","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/0020-0190(90)90035-V","volume":"35","author":"S. Wu","year":"1990","unstructured":"Wu, S., Manber, U., Myers, G., Miller, W.: An O(NP) Sequence Comparison Algorithm. Information Processing Letter\u00a035, 317\u2013323 (1990)","journal-title":"Information Processing Letter"},{"key":"34_CR14","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/BF00264437","volume":"18","author":"N. Nakatsu","year":"1982","unstructured":"Nakatsu, N., Kambayashi, Y., Yajima, S.: A Longest Common Subsequence Algorithm Suitable for Similar Text Strings. Acta Informatica\u00a018, 171\u2013179 (1982)","journal-title":"Acta Informatica"},{"issue":"3-4","key":"34_CR15","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1145\/74697.74702","volume":"23","author":"S. Kuo","year":"1989","unstructured":"Kuo, S., Cross, G.R.: An Improved Algorithm to Find the Length of the Longest Common Subsequence of Two Strings. ACM SIGIR Forum\u00a023(3-4), 89\u201399 (Spring \/ Summer, 1989)","journal-title":"ACM SIGIR Forum"},{"key":"34_CR16","doi-asserted-by":"crossref","unstructured":"Chin, F., Poon, C.K.: Performance Analysis of Some Simple Heuristics for Longest Common Subsequences. Algorithmica\u00a012, 293\u2013311","DOI":"10.1007\/BF01185429"},{"key":"34_CR17","doi-asserted-by":"crossref","unstructured":"Bergroth, L., Hakonen, H., Raita, T.: New Approximation Algorithms for Longest Common Subsequences. In: Proceedings of SPIRE 1998, Santa Cruz de la Sierra, Bolivia (September 1998)","DOI":"10.1109\/SPIRE.1998.712980"},{"key":"34_CR18","unstructured":"Johtela, T., Smed, J., Hakonen, H., Raita, T.: An Efficient Heuristic for the LCS Problem. In: Third South American Workshop on String Processing, WSP 1996, Recife, Brazil, August 1996, pp. 126\u2013140 (1996)"},{"issue":"6","key":"34_CR19","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/S0020-0190(00)00114-9","volume":"75","author":"C. Rick","year":"2000","unstructured":"Rick, C.: Simple and Fast Linear Space Computation of Longest Common Subsequences. Information Processing Letters\u00a075(6), 275\u2013281 (2000)","journal-title":"Information Processing Letters"},{"key":"34_CR20","unstructured":"Goeman, H., Clausen, M.: A New Practical Linear Space Algorithm for the Longest Common Subsequence Problem. In: Proceedings of the Prague Stringology Club Workshop (1999)"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11575832_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:42:57Z","timestamp":1619505777000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11575832_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540297406","9783540322412"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11575832_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}