{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:19:55Z","timestamp":1742617195912,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540580942"},{"type":"electronic","value":"9783540484509"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58094-8_9","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:12:38Z","timestamp":1330269158000},"page":"102-112","source":"Crossref","is-referenced-by-count":4,"title":["A lossy data compression based on string matching: Preliminary analysis and suboptimal algorithms"],"prefix":"10.1007","author":[{"given":"Tomasz","family":"Luczak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojciech","family":"Szpankowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"9_CR1","first-page":"255","volume-title":"Handbook of Theoretical Computer Science. Volume A: Algorithms and Complexity","author":"A.V. Aho","year":"1990","unstructured":"A.V. Aho, Algorithms for Finding Patterns in Strings, in Handbook of Theoretical Computer Science. Volume A: Algorithms and Complexity (ed. J. van Leeuwen), 255\u2013300, The MIT Press, Cambridge (1990)."},{"key":"9_CR2","volume-title":"The Probabilistic Method","author":"N. Alon","year":"1992","unstructured":"N. Alon and J. Spencer, The Probabilistic Method, John Wiley&Sons, New York (1992)."},{"key":"9_CR3","first-page":"27","volume-title":"Lecture Notes in Computer Science, 644","author":"M. Atallah","year":"1992","unstructured":"M. Atallah, P. Jacquet and W. Szpankowski, Pattern matching with mismatches: A probabilistic analysis and a randomized algorithm, Proc. Combinatorial Pattern Matching, Tucson, Lecture Notes in Computer Science, 644, (eds. A. Apostolico, M. Crochemore, Z. Galil, U. Manber), pp. 27\u201340, Springer-Verlag 1992."},{"key":"9_CR4","doi-asserted-by":"crossref","first-page":"1152","DOI":"10.1214\/aop\/1176991262","volume":"17","author":"R. Arratia","year":"1989","unstructured":"R. Arratia and M. Waterman, The Erd\u00f6s-R\u00e9nyi Strong Law for Pattern Matching with Given Proportion of Mismatches, Annals of Probability, 17, 1152\u20131169 (1989).","journal-title":"Annals of Probability"},{"key":"9_CR5","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1214\/aos\/1176347615","volume":"18","author":"R. Arratia","year":"1990","unstructured":"R. Arratia, L. Gordon, and M. Waterman, The Erd\u00f6s-R\u00e9nyi Law in Distribution for Coin Tossing and Sequence Matching, Annals of Statistics, 18, 539\u2013570 (1990)","journal-title":"Annals of Statistics"},{"key":"9_CR6","volume-title":"Rate Distortion Theory: A Mathematical Basis for Data Compression","author":"T. Berger","year":"1971","unstructured":"T. Berger, Rate Distortion Theory: A Mathematical Basis for Data Compression, Englewood Cliffs, NJ: Prentice-Hall, 1971."},{"key":"9_CR7","volume-title":"Convergence of Probability Measure","author":"P. Billingsley","year":"1968","unstructured":"P. Billingsley, Convergence of Probability Measure, John Wiley & Sons, New York, 1968."},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"W. Chang, and E. Lawler, Approximate String Matching in Sublinear Expected Time, Proc. of 1990 FOCS, 116\u2013124 (1990).","DOI":"10.1109\/FSCS.1990.89530"},{"key":"9_CR9","doi-asserted-by":"crossref","DOI":"10.1002\/0471200611","volume-title":"Elements of Information Theory","author":"T.M. Cover","year":"1991","unstructured":"T.M. Cover and J.A. Thomas, Elements of Information Theory, John Wiley&Sons, New York (1991)."},{"key":"9_CR10","volume-title":"Information Theory: Coding Theorems for Discrete Memoryless Systems","author":"I. Csisz\u00e1r","year":"1981","unstructured":"I. Csisz\u00e1r and J. K\u00f6rner, Information Theory: Coding Theorems for Discrete Memoryless Systems, Academic Press, New York (1981)."},{"key":"9_CR11","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF02762054","volume":"36","author":"J. Feldman","year":"1980","unstructured":"J. Feldman, r-Entropy, Equipartition, and Ornstein's Isomorphism Theory in R n , Israel J. Math., 36, 321\u2013345 (1980).","journal-title":"Israel J. Math."},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"P. Jacquet and W. Szpankowski, Autocorrelation on Words and Its Applications. Analysis of Suffix Tree by String-Ruler Approach, J. Combinatorial Theory. Ser. A, (1994); to appear.","DOI":"10.1016\/0097-3165(94)90065-5"},{"key":"9_CR13","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1109\/18.75240","volume":"37","author":"J.C. Kieffer","year":"1991","unstructured":"J.C. Kieffer, Strong Converses in Source Coding Relative to a Fidelity Criterion, IEEE Trans. Information Theory, 37, 257\u2013262 (1991).","journal-title":"IEEE Trans. Information Theory"},{"key":"9_CR14","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1109\/18.75241","volume":"37","author":"J. C. Kieffer","year":"1991","unstructured":"J. C. Kieffer, Sample Converses in Source Coding Theory, IEEE Trans. Information Theory, 37, 263\u2013268 (1991).","journal-title":"IEEE Trans. Information Theory"},{"issue":"1","key":"9_CR15","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1109\/TIT.1976.1055501","volume":"22","author":"A. Lempel","year":"1976","unstructured":"A. Lempel and J. Ziv, On the Complexity of Finite Sequences, IEEE Information Theory 22, 1, 75\u201381 (1976).","journal-title":"IEEE Information Theory"},{"key":"9_CR16","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1109\/18.179344","volume":"39","author":"D. Ornstein","year":"1993","unstructured":"D. Ornstein and B. Weiss, Entropy and Data Compression Schemes, IEEE Information Theory, 39, 78\u201383 (1993).","journal-title":"IEEE Information Theory"},{"key":"9_CR17","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1214\/aop\/1176990840","volume":"18","author":"D. Ornstein","year":"1990","unstructured":"D. Ornstein and P. Shields, Universal Almost Sure Data Compression, Annals of Probability, 18, 441\u2013452 (1990).","journal-title":"Annals of Probability"},{"key":"9_CR18","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1214\/aop\/1176993000","volume":"13","author":"B. Pittel","year":"1985","unstructured":"B. Pittel, Asymptotic Growth of a Class of random Trees, Annals of Probability, 13, 414\u2013427 (1985).","journal-title":"Annals of Probability"},{"key":"9_CR19","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1109\/18.256495","volume":"39","author":"Y. Steinberg","year":"1993","unstructured":"Y. Steinberg and M. Gutman, An Algorithm for Source Coding Subject to a Fidelity Criterion, Based on String Matching, IEEE Trans. Information Theory, 39, 877\u2013886 (1993).","journal-title":"IEEE Trans. Information Theory"},{"key":"9_CR20","doi-asserted-by":"crossref","first-page":"1647","DOI":"10.1109\/18.259648","volume":"39","author":"W. Szpankowski","year":"1993","unstructured":"W. Szpankowski, Asymptotic Properties of Data Compression and Suffix Trees, IEEE Trans. Information Theory, 39, 1647\u20131659 (1993).","journal-title":"IEEE Trans. Information Theory"},{"key":"9_CR21","doi-asserted-by":"crossref","first-page":"1176","DOI":"10.1137\/0222070","volume":"22","author":"W. Szpankowski","year":"1993","unstructured":"W. Szpankowski, A Generalized Suffix Tree and Its (Un)Expected Asymptotic Behaviors, SIAM J. Computing, 22, 1176\u20131198 (1993).","journal-title":"SIAM J. Computing"},{"key":"9_CR22","doi-asserted-by":"crossref","first-page":"1250","DOI":"10.1109\/18.45281","volume":"35","author":"A. Wyner","year":"1989","unstructured":"A. Wyner and J. Ziv, Some Asymptotic Properties of the Entropy of a Stationary Ergodic Data Source with Applications to Data Compression, IEEE Trans. Information Theory, 35, 1250\u20131258 (1989).","journal-title":"IEEE Trans. Information Theory"},{"key":"9_CR23","unstructured":"Z. Zhang and V. Wei, An On-Line Universal Lossy Data Compression Algorithm via Continuous Codebook Refinement, submitted to a journal."},{"issue":"3","key":"9_CR24","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"23","author":"J. Ziv","year":"1977","unstructured":"J. Ziv and A. Lempel, A Universal Algorithm for Sequential Data Compression, IEEE Trans. Information Theory, 23, 3, 337\u2013343 (1977).","journal-title":"IEEE Trans. Information Theory"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58094-8_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:19:18Z","timestamp":1742595558000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58094-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540580942","9783540484509"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-58094-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}