{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:14:47Z","timestamp":1759637687674},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642140303"},{"type":"electronic","value":"9783642140310"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14031-0_37","type":"book-chapter","created":{"date-parts":[[2010,6,28]],"date-time":"2010-06-28T09:50:06Z","timestamp":1277718606000},"page":"338-347","source":"Crossref","is-referenced-by-count":3,"title":["The Longest Almost-Increasing Subsequence"],"prefix":"10.1007","author":[{"given":"Amr","family":"Elmasry","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"37_CR1","first-page":"263","volume":"146","author":"G. Adelson-Velskii","year":"1962","unstructured":"Adelson-Velskii, G., Landis, E.: On an information organization algorithm. Doklady Akademia Nauk SSSR\u00a0146, 263\u2013266 (1962)","journal-title":"Doklady Akademia Nauk SSSR"},{"key":"37_CR2","first-page":"225","volume":"28","author":"M. Albert","year":"2003","unstructured":"Albert, M., Aldred, R., Atkinson, M., Ditmarsch, H., Handley, B., Handley, C., Opatrny, J.: Longest subsequences in permutations. Australian J. Combinatorics\u00a028, 225\u2013238 (2003)","journal-title":"Australian J. Combinatorics"},{"key":"37_CR3","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.ipl.2006.08.003","volume":"101","author":"M. Albert","year":"2007","unstructured":"Albert, M., Atkinson, M., Nussbaum, D., Sack, J., Santoro, N.: On the longest increasing subsequence of a circular list. Information Processing Letters\u00a0101, 55\u201359 (2007)","journal-title":"Information Processing Letters"},{"key":"37_CR4","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.tcs.2004.03.057","volume":"321","author":"M. Albert","year":"2004","unstructured":"Albert, M., Golnski, A., Hamel, A., Lopez-Ortiz, A., Rao, S., Safari, M.: Longest increasing subsequences in sliding windows. Theoretical Computer Science\u00a0321, 405\u2013414 (2004)","journal-title":"Theoretical Computer Science"},{"key":"37_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0166-218X(92)90200-T","volume":"36","author":"A. Apostolico","year":"1992","unstructured":"Apostolico, A., Atallah, M., Hambrusch, S.: New clique and independent set algorithms for circle graphs. Discrete Appl. Math.\u00a036, 1\u201324 (1992)","journal-title":"Discrete Appl. Math."},{"key":"37_CR6","doi-asserted-by":"publisher","first-page":"1119","DOI":"10.1090\/S0894-0347-99-00307-0","volume":"12","author":"J. Baik","year":"1999","unstructured":"Baik, J., Deift, P., Johannsson, K.: On the distribution of the length of the longest increasing subsequence of random permutations. J. American Math. Society\u00a012, 1119\u20131178 (1999)","journal-title":"J. American Math. Society"},{"key":"37_CR7","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/S0020-0190(00)00124-1","volume":"76","author":"M. Chang","year":"2000","unstructured":"Chang, M., Wang, F.: Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs. Information Processing Letters\u00a076, 7\u201311 (2000)","journal-title":"Information Processing Letters"},{"key":"37_CR8","volume-title":"Introduction to Algorithms","author":"T. Cormen","year":"2001","unstructured":"Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Press, Cambridge (2001)","edition":"2"},{"key":"37_CR9","doi-asserted-by":"publisher","first-page":"2369","DOI":"10.1093\/nar\/27.11.2369","volume":"27","author":"A. Delcher","year":"1999","unstructured":"Delcher, A., Kasif, S., Fleischmann, R., Paterson, J., White, O., Salzberg, S.: Alignment of whole genomes. Nucl. Acis. Res.\u00a027, 2369\u20132376 (1999)","journal-title":"Nucl. Acis. Res."},{"issue":"1","key":"37_CR10","first-page":"27","volume":"12","author":"A. Elmasry","year":"2005","unstructured":"Elmasry, A.: Deterministic jumplists. Nordic J. Comp.\u00a012(1), 27\u201339 (2005)","journal-title":"Nordic J. Comp."},{"key":"37_CR11","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0012-365X(75)90103-X","volume":"11","author":"M. Fredman","year":"1975","unstructured":"Fredman, M.: On computing the length of longest increasing subsequence. Disc. Math.\u00a011, 29\u201335 (1975)","journal-title":"Disc. Math."},{"key":"37_CR12","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1145\/359581.359603","volume":"20","author":"J. Hunt","year":"1977","unstructured":"Hunt, J., Szymanski, T.: A fast algorithm for computing longest common subsequences. ACM Comm.\u00a020, 350\u2013353 (1977)","journal-title":"ACM Comm."},{"key":"37_CR13","doi-asserted-by":"crossref","first-page":"709","DOI":"10.2140\/pjm.1970.34.709","volume":"34","author":"D. Knuth","year":"1970","unstructured":"Knuth, D.: Permutations, matrices, and generalized Young tableaux. Pacific J. Math.\u00a034, 709\u2013727 (1970)","journal-title":"Pacific J. Math."},{"issue":"3-4","key":"37_CR14","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1080\/00207169708804607","volume":"65","author":"P. Ramanan","year":"1997","unstructured":"Ramanan, P.: Tight \u03a9(n logn) lower bound for finding a longest increasing subsequence. International J. Comp. Math.\u00a065(3-4), 161\u2013164 (1997)","journal-title":"International J. Comp. Math."},{"key":"37_CR15","doi-asserted-by":"publisher","first-page":"745","DOI":"10.2307\/2371609","volume":"60","author":"G. Robinson","year":"1938","unstructured":"Robinson, G.: On representations of the symmetric group. American J. Math.\u00a060, 745\u2013760 (1938)","journal-title":"American J. Math."},{"key":"37_CR16","doi-asserted-by":"crossref","first-page":"179","DOI":"10.4153\/CJM-1961-015-3","volume":"13","author":"C. Schensted","year":"1961","unstructured":"Schensted, C.: Longest increasing and decreasing subsequences. Canadian J. Math.\u00a013, 179\u2013191 (1961)","journal-title":"Canadian J. Math."},{"issue":"3","key":"37_CR17","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1145\/3828.3835","volume":"32","author":"D. Sleator","year":"1985","unstructured":"Sleator, D., Tarjan, R.E.: Self-adjusting binary search trees. J. ACM\u00a032(3), 652\u2013686 (1985)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14031-0_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:16:30Z","timestamp":1619784990000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14031-0_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642140303","9783642140310"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14031-0_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}