{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T13:19:03Z","timestamp":1762175943447},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354550"},{"type":"electronic","value":"9783540354611"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11780441_30","type":"book-chapter","created":{"date-parts":[[2006,6,30]],"date-time":"2006-06-30T11:02:51Z","timestamp":1151665371000},"page":"330-341","source":"Crossref","is-referenced-by-count":12,"title":["Faster Algorithms for Computing Longest Common Increasing Subsequences"],"prefix":"10.1007","author":[{"given":"Gerth St\u00f8lting","family":"Brodal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kanela","family":"Kaligosi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Irit","family":"Katriel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Kutz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"30_CR1","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1090\/S0273-0979-99-00796-X","volume":"36","author":"D. Aldous","year":"1999","unstructured":"Aldous, D., Diaconis, P.: Longest increasing subsequences: From patience sorting to the Baik-Deift-Johansson theorem. Bull. AMS\u00a036(4), 413\u2013432 (1999)","journal-title":"Bull. AMS"},{"key":"30_CR2","first-page":"39","volume-title":"SPIRE 2000","author":"L. Bergroth","year":"2000","unstructured":"Bergroth, L., Hakonen, H., Raita, T.: A survey of longest common subsequence algorithms. In: SPIRE 2000, pp. 39\u201348. IEEE Computer Society, Los Alamitos (2000)"},{"issue":"1-2","key":"30_CR3","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/S0020-0190(00)00124-1","volume":"76","author":"S. Bespamyatnikh","year":"2000","unstructured":"Bespamyatnikh, S., Segal, M.: Enumerating longest increasing subsequences and patience sorting. Inf. Process. Lett.\u00a076(1-2), 7\u201311 (2000)","journal-title":"Inf. Process. Lett."},{"key":"30_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1007\/11602613_67","volume-title":"Algorithms and Computation","author":"W.-T. Chan","year":"2005","unstructured":"Chan, W.-T., Zhang, Y., Fung, S.P.Y., Ye, D., Zhu, H.: Efficient Algorithms for Finding a Longest Common Increasing Subsequence. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol.\u00a03827, pp. 665\u2013674. Springer, Heidelberg (2005)"},{"issue":"1","key":"30_CR5","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0012-365X(75)90103-X","volume":"11","author":"M.L. Fredman","year":"1975","unstructured":"Fredman, M.L.: On computing the length of longest increasing subsequences. Discrete Mathematics\u00a011(1), 29\u201335 (1975)","journal-title":"Discrete Mathematics"},{"key":"30_CR6","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1145\/800057.808675","volume-title":"STOC 1984","author":"H.N. Gabow","year":"1984","unstructured":"Gabow, H.N., Bentley, J.L., Tarjan, R.E.: Scaling and related techniques for geometry problems. In: STOC 1984, pp. 135\u2013143. ACM Press, New York (1984)"},{"issue":"6","key":"30_CR7","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1145\/360825.360861","volume":"18","author":"D.S. Hirschberg","year":"1975","unstructured":"Hirschberg, D.S.: A linear space algorithm for computing maximal common subsequences. Commun. ACM\u00a018(6), 341\u2013343 (1975)","journal-title":"Commun. ACM"},{"issue":"5","key":"30_CR8","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. Commun. ACM\u00a020(5), 350\u2013353 (1977)","journal-title":"Commun. ACM"},{"key":"30_CR9","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/0022-0000(80)90002-1","volume":"20","author":"W.J. Masek","year":"1980","unstructured":"Masek, W.J., Paterson, M.S.: A faster algorithm computing string edit distances. J. Comput. System Sci.\u00a020, 18\u201331 (1980)","journal-title":"J. Comput. System Sci."},{"issue":"2","key":"30_CR10","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1137\/0214021","volume":"14","author":"E.M. McCreight","year":"1985","unstructured":"McCreight, E.M.: Priority search trees. SIAM Journal on Computing\u00a014(2), 257\u2013276 (1985)","journal-title":"SIAM Journal on Computing"},{"key":"30_CR11","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/BF01683268","volume":"10","author":"P. Emde Boas van","year":"1977","unstructured":"van Emde Boas, P., Kaas, R., Zijlstra, E.: Design and implementation of an efficient priority queue. Mathematical Systems Theory\u00a010, 99\u2013127 (1977)","journal-title":"Mathematical Systems Theory"},{"issue":"1","key":"30_CR12","doi-asserted-by":"publisher","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. J. ACM\u00a021(1), 168\u2013173 (1974)","journal-title":"J. ACM"},{"issue":"2","key":"30_CR13","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0020-0190(83)90075-3","volume":"17","author":"D.E. Willard","year":"1983","unstructured":"Willard, D.E.: Log-logarithmic worst-case range queries are possible in space Theta(N). Inf. Process. Lett.\u00a017(2), 81\u201384 (1983)","journal-title":"Inf. Process. Lett."},{"key":"30_CR14","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/j.ipl.2004.10.014","volume":"93\/5","author":"I.-H. Yang","year":"2005","unstructured":"Yang, I.-H., Huang, C.-P., Chao, K.-M.: A fast algorithm for computing a longest common increasing subsequence. Inf. Process. Lett.\u00a093\/5, 249\u2013253 (2005)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11780441_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:16:18Z","timestamp":1619493378000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780441_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354550","9783540354611"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11780441_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}