{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T14:10:55Z","timestamp":1585923055876},"reference-count":19,"publisher":"Association for Computing Machinery (ACM)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. ACM"],"published-print":{"date-parts":[[2009,5]]},"DOI":"10.1145\/1516512.1516519","type":"journal-article","created":{"date-parts":[[2009,5,19]],"date-time":"2009-05-19T16:47:42Z","timestamp":1242751662000},"page":"1-38","source":"Crossref","is-referenced-by-count":8,"title":["Improved bounds on the average length of longest common subsequences"],"prefix":"10.1145","volume":"56","author":[{"given":"George S.","family":"Lueker","sequence":"first","affiliation":[{"name":"University of California, Irvine, California"}]}],"member":"320","reference":[{"key":"e_1_2_1_1_1","DOI":"10.1214\/aoap\/1177004903","doi-asserted-by":"publisher"},{"key":"e_1_2_1_2_1","DOI":"10.1007\/BF01840365","doi-asserted-by":"publisher"},{"key":"e_1_2_1_3_1","DOI":"10.1007\/s002240000125","doi-asserted-by":"publisher"},{"key":"e_1_2_1_4_1","DOI":"10.2307\/3212444","doi-asserted-by":"publisher"},{"key":"e_1_2_1_5_1","unstructured":"Dan\u010d\u00edk V. 1994. Expected length of longest common subsequences. Ph.D. dissertation Department of Computer Science University of Warwick. Dan\u010d\u00edk V. 1994. Expected length of longest common subsequences. Ph.D. dissertation Department of Computer Science University of Warwick."},{"key":"e_1_2_1_6_1","DOI":"10.1002\/rsa.3240060408","doi-asserted-by":"publisher"},{"key":"e_1_2_1_7_1","unstructured":"Gosling J. Joy B. Steele G. and Bracha G. 2005. The JavaTM Language Specification Third ed. Addison-Wesley Reading MA. Gosling J. Joy B. Steele G. and Bracha G. 2005. The Java TM Language Specification Third ed. Addison-Wesley Reading MA."},{"key":"e_1_2_1_8_1","DOI":"10.1145\/322033.322044","doi-asserted-by":"publisher"},{"key":"e_1_2_1_9_1","unstructured":"Janson S. Luczak T. and Rucinski A. 2000. Random Graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley New York. Janson S. Luczak T. and Rucinski A. 2000. Random Graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley New York.","DOI":"10.1002\/9781118032718","doi-asserted-by":"crossref"},{"key":"e_1_2_1_10_1","DOI":"10.1137\/S009753979223842X","doi-asserted-by":"publisher"},{"key":"e_1_2_1_11_1","DOI":"10.1016\/j.aim.2004.10.012","doi-asserted-by":"publisher"},{"key":"e_1_2_1_12_1","unstructured":"Kiwi M. and Soto J. 2008. On a speculated relation between Chv\u00e1tal-Sankoff constants of several sequences. Combinatorics Probability and Computing. To appear. Available on-line at http:\/\/arxiv.org\/abs\/0810.1066. 10.1017\/S0963548309009900 Kiwi M. and Soto J. 2008. On a speculated relation between Chv\u00e1tal-Sankoff constants of several sequences. Combinatorics Probability and Computing. To appear. Available on-line at http:\/\/arxiv.org\/abs\/0810.1066. 10.1017\/S0963548309009900"},{"key":"e_1_2_1_13_1","DOI":"10.1137\/S0036144599359449","doi-asserted-by":"publisher"},{"key":"e_1_2_1_14_1","unstructured":"Motwani R. and Rahgavan P. 1995. Randomized Algorithms. Cambridge University Press Cambridge MA. Motwani R. and Rahgavan P. 1995. Randomized Algorithms. Cambridge University Press Cambridge MA.","DOI":"10.1017\/CBO9780511814075","doi-asserted-by":"crossref"},{"key":"e_1_2_1_15_1","unstructured":"Overton M. L. 2001. Numerical Computing with IEEE Floating Point Arithmetic. Society for Industrial and Applied Mathematics Philadelphia PA. Overton M. L. 2001. Numerical Computing with IEEE Floating Point Arithmetic. Society for Industrial and Applied Mathematics Philadelphia PA.","DOI":"10.1137\/1.9780898718072","doi-asserted-by":"crossref"},{"key":"e_1_2_1_16_1","author":"Paterson M.","year":"1994","volume-title":"MFCS'94"},{"key":"e_1_2_1_17_1","unstructured":"Pevzner P. A. 2000. Computational Molecular Biology: An Algorithmic Approach. The MIT Press Cambridge MA. Pevzner P. A. 2000. Computational Molecular Biology: An Algorithmic Approach. The MIT Press Cambridge MA.","DOI":"10.7551\/mitpress\/2022.001.0001","doi-asserted-by":"crossref"},{"key":"e_1_2_1_18_1","unstructured":"Seneta E. 1981. Non-negative Matrices and Markov Chains 2nd ed. Springer Series in Statistics. Springer-Verlag New York. Seneta E. 1981. Non-negative Matrices and Markov Chains 2nd ed. Springer Series in Statistics. Springer-Verlag New York.","DOI":"10.1007\/0-387-32792-4","doi-asserted-by":"crossref"},{"key":"e_1_2_1_19_1","author":"Steele J. M.","year":"1997","volume-title":"Probability Theory and Combinatorial Optimization. CBMS-NSF Regional Conference Series in Applied Mathematics. Society for Industrial and Applied Mathematics"}],"container-title":["Journal of the ACM"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=1516519&ftid=639125&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T13:39:31Z","timestamp":1585921171000},"score":1.0,"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5]]},"references-count":19,"journal-issue":{"published-print":{"date-parts":[[2009,5]]},"issue":"3"},"alternative-id":["10.1145\/1516512.1516519"],"URL":"http:\/\/dx.doi.org\/10.1145\/1516512.1516519","relation":{"cites":[]},"ISSN":["0004-5411","1557-735X"],"issn-type":[{"value":"0004-5411","type":"print"},{"value":"1557-735X","type":"electronic"}],"subject":["Control and Systems Engineering","Hardware and Architecture","Software","Artificial Intelligence","Information Systems"]}}