{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:01:34Z","timestamp":1761292894842},"publisher-location":"Berlin, Heidelberg","reference-count":3,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540577850"},{"type":"electronic","value":"9783540483328"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57785-8_180","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T08:21:07Z","timestamp":1330244467000},"page":"669-678","source":"Crossref","is-referenced-by-count":4,"title":["Upper bounds for the expected length of a longest common subsequence of two binary sequences"],"prefix":"10.1007","author":[{"given":"Vlado","family":"Dan\u010d\u00edk","sequence":"first","affiliation":[]},{"given":"Mike","family":"Paterson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"54_CR1","doi-asserted-by":"crossref","first-page":"306","DOI":"10.2307\/3212444","volume":"12","author":"V. Chv\u00e1tal","year":"1975","unstructured":"V\u00e1clav Chv\u00e1tal and David Sankoff. Longest common subsequence of two random sequences. Journal of Applied Probability, 12:306\u2013315, 1975.","journal-title":"Journal of Applied Probability"},{"key":"54_CR2","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0012-365X(79)90057-8","volume":"26","author":"J. G. Deken","year":"1979","unstructured":"Joseph G. Deken. Some limit results for longest common subsequences. Discrete Mathematics, 26:17\u201331, 1979.","journal-title":"Discrete Mathematics"},{"key":"54_CR3","first-page":"359","volume-title":"Time Warps, String Edits, and Macromolecules: The theory and practice of sequence comparison","author":"J. G. Deken","year":"1983","unstructured":"Joseph G. Deken. Probabilistic behavior of longest-common-subsequence length. In D. Sankoff and J. B. Kruskal, editors, Time Warps, String Edits, and Macromolecules: The theory and practice of sequence comparison, chapter 16, pages 359\u2013362. Addison-Wesley, Reading, Mass, 1983."}],"container-title":["Lecture Notes in Computer Science","STACS 94"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57785-8_180.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:08:08Z","timestamp":1619557688000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57785-8_180"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540577850","9783540483328"],"references-count":3,"URL":"https:\/\/doi.org\/10.1007\/3-540-57785-8_180","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}