{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:57:25Z","timestamp":1725573445619},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540309352"},{"type":"electronic","value":"9783540324263"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11602613_114","type":"book-chapter","created":{"date-parts":[[2005,12,2]],"date-time":"2005-12-02T08:24:24Z","timestamp":1133511864000},"page":"1153-1162","source":"Crossref","is-referenced-by-count":2,"title":["Longest Increasing Subsequences in Windows Based on Canonical Antichain Partition"],"prefix":"10.1007","author":[{"given":"Erdong","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hao","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Linji","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2-3","key":"114_CR1","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.tcs.2004.03.057","volume":"321","author":"M.H. Albert","year":"2004","unstructured":"Albert, M.H., Golynski, A., Hamel, A.M., L\u00f3pez-Ortiz, A., Rao, S.S., Safari, M.A.: Longest increasing subsequences in sliding windows. Theor. Comput. Sci.\u00a0321(2-3), 405\u2013414 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"114_CR2","doi-asserted-by":"crossref","unstructured":"Schensted, C.: Longest increasing and decreasing subsequences. Canadian Journal of Mathematics (1961)","DOI":"10.4153\/CJM-1961-015-3"},{"issue":"1-2","key":"114_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."},{"issue":"2","key":"114_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-218X(92)90200-T","volume":"36","author":"A. Apostolico","year":"1992","unstructured":"Apostolico, A., Atallah, M.J., Hambrusch, S.E.: New clique and independent set algorithms for circle graphs (discrete applied mathematics. \u00a036, 1\u201324 (1992); Discrete Applied Mathematics\u00a041(2), 179\u2013180 (1993)","journal-title":"Discrete Applied Mathematics"},{"key":"114_CR5","volume-title":"The Art of Computer Programming, Sorting and Searching","author":"D.E. Knuth","year":"1998","unstructured":"Knuth, D.E.: The Art of Computer Programming, Sorting and Searching, 2nd edn., vol.\u00a03. Addison-Wesley, Reading (1998)","edition":"2"},{"key":"114_CR6","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, 29\u201335 (1975)","journal-title":"Discrete Mathematics"},{"issue":"3","key":"114_CR7","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/0020-0190(77)90031-X","volume":"6","author":"P.E. Boas van","year":"1977","unstructured":"van Boas, P.E.: Preserving order in a forest in less than logarithmic time and linear space. Inf. Process. Lett.\u00a06(3), 80\u201382 (1977)","journal-title":"Inf. Process. Lett."},{"key":"114_CR8","unstructured":"Liben-Nowell, E.V.D., Zhu, A.: Finding longest increasing and common subsequences in streaming data. Technical Report MIT-LCS-931, Cambridge, MA 02139 (November 2003)"},{"key":"114_CR9","unstructured":"Raghavan, P., Henzinger, M.R., Rajagopalon, S.: Computing on data streams. Technical Report 1998-011, Digital Equipment Corporation, Systems Research Center (May 1998)"},{"key":"114_CR10","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1016\/0196-8858(81)90046-4","volume":"2","author":"T.F. Smith","year":"1981","unstructured":"Smith, T.F., Waterman, M.S.: Comparison of biosequences. Adv. in Appl. Math.\u00a02, 482\u2013489 (1981)","journal-title":"Adv. in Appl. Math."},{"issue":"11","key":"114_CR11","doi-asserted-by":"publisher","first-page":"1391","DOI":"10.1093\/bioinformatics\/btg168","volume":"19","author":"H. Zhang","year":"2003","unstructured":"Zhang, H.: Alignment of blast high-scoring segment pairs based on the longest increasing subsequence algorithm. Bioinformatics\u00a019(11), 1391\u20131396 (2003)","journal-title":"Bioinformatics"},{"issue":"1","key":"114_CR12","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1137\/S0097539794266171","volume":"28","author":"S. Felsner","year":"1998","unstructured":"Felsner, S., Wernisch, L.: Maximum k-chains in planar point sets: Combinatorial structure and algorithms. SIAM J. Comput.\u00a028(1), 192\u2013209 (1998)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11602613_114.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:02:35Z","timestamp":1619506955000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11602613_114"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540309352","9783540324263"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11602613_114","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}