{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T14:59:10Z","timestamp":1786978750893,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540676331","type":"print"},{"value":"9783540451235","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45123-4_31","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T14:59:14Z","timestamp":1194965954000},"page":"375-387","source":"Crossref","is-referenced-by-count":6,"title":["Exact and Efficient Computation of the Expected Number of Missing and Common Words in Random Texts"],"prefix":"10.1007","author":[{"given":"Sven","family":"Rahmann","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eric","family":"Rivals","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2002,11,7]]},"reference":[{"key":"31_CR1","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/S0022-2836(05)80360-2","volume":"215","author":"S. Altschul","year":"1990","unstructured":"S. Altschul, W. Gish, W. Miller, E. Myers, and D. Lipman. Basic Local Alignment Search Tool (BLAST). Journal of Molecular Biology, 215:403\u2013410, 1990.","journal-title":"Journal of Molecular Biology"},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"S. Burkhardt, A. Crauser, P. Ferragina, H.-P. Lenhof, E. Rivals, and M. Vingron. q-gram based Database Searching Using a Suffix Array (QUASAR). In S. Istrail, P. Pevzner, and M. Waterman, editors, Proceedings of The Third International Conference on Computational Molecular Biology, pages 77\u201383. ACM-Press, 1999.","DOI":"10.1145\/299432.299460"},{"issue":"2","key":"31_CR3","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1137\/0135034","volume":"35","author":"L. J. Guibas","year":"1981","unstructured":"L. J. Guibas and A. M. Odlyzko. Maximal Prefix-Synchronized Codes. SIAM Journal of Applied Mathematics, 35(2):401\u2013418, 1981.","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0097-3165(81)90038-8","volume":"30","author":"L. J. Guibas","year":"1981","unstructured":"L. J. Guibas and A. M. Odlyzko. Periods in Strings. Journal of Combinatorial Theory, Series A, 30:19\u201342, 1981.","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"31_CR5","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0097-3165(81)90005-4","volume":"30","author":"L. J. Guibas","year":"1981","unstructured":"L. J. Guibas and A. M. Odlyzko. String Overlaps, Pattern Matching, and Nontransitive Games. Journal of Combinatorial Theory, Series A, 30:183\u2013208, 1981.","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"31_CR6","first-page":"199","volume":"1","author":"W. Hide","year":"1994","unstructured":"W. Hide, J. Burke, and D. Davison. Biological evaluation of d2, an algorithm for high-performance sequence comparison. J. Biol., 1:199\u2013215, 1994.","journal-title":"J. Biol."},{"key":"31_CR7","volume-title":"Urn Models and Their Applications","author":"N. L. Johnson","year":"1977","unstructured":"N. L. Johnson and S. Kotz. Urn Models and Their Applications. Wiley, New York, 1977."},{"key":"31_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1007\/3-540-54345-7_67","volume-title":"Proceedings of the 16th symposium on Mathematical Foundations of Computer Science","author":"P. Jokinen","year":"1991","unstructured":"P. Jokinen and E. Ukkonen. Two algorithms for approximate string matching in static texts. In A. Tarlecki, editor, Proceedings of the 16th symposium on Mathematical Foundations of Computer Science, number 520 in Lecture Notes in Computer Science, pages 240\u2013248, Berlin, 1991. Springer-Verlag."},{"key":"31_CR9","volume-title":"volume 2 \/ Seminumerical Algorithms","author":"D. E. Knuth","year":"1998","unstructured":"D. E. Knuth. The Art of Computer Programming, volume 2 \/ Seminumerical Algorithms. Addison-Wesley, Reading, MA, third edition, 1998.","edition":"third edition"},{"issue":"9","key":"31_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0898-1221(93)90001-C","volume":"26","author":"G. Marsaglia","year":"1993","unstructured":"G. Marsaglia and A. Zaman. Monkey Tests for Random Number Generators. Computers and Mathematics with Applications, 26(9):1\u201310, 1993.","journal-title":"Computers and Mathematics with Applications"},{"issue":"11","key":"31_CR11","doi-asserted-by":"crossref","first-page":"5169","DOI":"10.1093\/nar\/16.11.5169","volume":"16","author":"A. A. Mironov","year":"1988","unstructured":"A. A. Mironov and N. N. Alexandrov. Statistical method for rapid homology search. Nucleic Acids Res, 16(11):5169\u201373, Jun 1988.","journal-title":"Nucleic Acids Res"},{"issue":"2","key":"31_CR12","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1145\/210330.210331","volume":"5","author":"O. E. Percus","year":"1995","unstructured":"O. E. Percus and P. A. Whitlock. Theory and Application of Marsaglia\u2019s Monkey Test for Pseudorandom Number Generators. ACM Transactions on Modeling and Computer Simulation, 5(2):87\u2013100, April 1995.","journal-title":"ACM Transactions on Modeling and Computer Simulation"},{"issue":"2","key":"31_CR13","first-page":"121","volume":"8","author":"P. A. Pevzner","year":"1992","unstructured":"P. A. Pevzner. Statistical distance between texts and filtration methods in sequence comparison. Appl. BioSci., 8(2):121\u2013127, 1992.","journal-title":"Appl. BioSci."},{"key":"31_CR14","volume-title":"Technical Report 99-229","author":"S. Rahmann","year":"1999","unstructured":"S. Rahmann and E. Rivals. The Expected Number of Missing Words in a Random Text. Technical Report 99-229, LIRMM, Montpellier, France, 1999."},{"key":"31_CR15","volume-title":"Technical Report 99-297","author":"E. Rivals","year":"1999","unstructured":"E. Rivals and S. Rahmann. Enumerating String Autocorrelations and Computing their Population Sizes. Technical Report 99-297, LIRMM, Montpellier, France, 1999."},{"key":"31_CR16","volume-title":"Analysis of Algorithms","author":"R. Sedgewick","year":"1996","unstructured":"R. Sedgewick and P. Flajolet. Analysis of Algorithms. Addison-Wesley, Reading, MA, 1996."},{"key":"31_CR17","doi-asserted-by":"crossref","unstructured":"D. C. Torney, C. Burks, D. Davison, and K. M. Sirotkin. Computation of d2: A measure of sequence dissimilarity. In G. Bell and R. Marr, editors, Computers and DNA, pages 109\u2013125, New York, 1990. Sante Fe Institute studies in the sciences of complexity, vol. VII, Addison-Wesley.","DOI":"10.4324\/9780429501463-11"},{"issue":"1","key":"31_CR18","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0304-3975(92)90143-4","volume":"92","author":"E. Ukkonen","year":"1992","unstructured":"E. Ukkonen. Approximate string-matching with q-grams and maximal matches. Theoretical Computer Science, 92(1):191\u2013211, Jan. 1992.","journal-title":"Theoretical Computer Science"},{"issue":"10","key":"31_CR19","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1145\/135239.135244","volume":"35","author":"S. Wu","year":"1992","unstructured":"S. Wu and U. Manber. Fast text searching allowing errors. Communications of the Association for Computing Machinery, 35(10):83\u201391, Oct. 1992.","journal-title":"Communications of the Association for Computing Machinery"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45123-4_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T06:38:34Z","timestamp":1556951914000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45123-4_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540676331","9783540451235"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-45123-4_31","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}