{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:52:31Z","timestamp":1725663151466},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540514657"},{"type":"electronic","value":"9783540481409"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51465-1_1","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:57:17Z","timestamp":1330203437000},"page":"1-16","source":"Crossref","is-referenced-by-count":0,"title":["Data compression with substitution"],"prefix":"10.1007","author":[{"given":"Maxime","family":"Crochemore","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"issue":"6","key":"1_CR1","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"A.V. Aho","year":"1975","unstructured":"A.V. Aho, M.J. Corasick, Efficient string matching: An aid to bibliographic research, Commun. ACM18,6 (1975), 333\u2013340.","journal-title":"Commun. ACM"},{"issue":"4","key":"1_CR2","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1145\/5684.5688","volume":"29","author":"J.L. Bentley","year":"1986","unstructured":"J.L. Bentley, D.D. Sleator, R.E. Tarjan, V.K. Wei, A locally adaptive data compression scheme, Commun. ACM29,4 (1986), 320\u2013330.","journal-title":"Commun. ACM"},{"key":"1_CR3","unstructured":"J.Berstel, D.Perrin, Theory of codes, Academic Press (1985)."},{"key":"1_CR4","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0304-3975(86)90041-1","volume":"45","author":"M. Crochemore","year":"1986","unstructured":"M. Crochemore, Transducers and Repetitions, Theoret. Comput. Sci.45 (1986), 63\u201386.","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"1_CR5","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1109\/TIT.1975.1055349","volume":"IT 21","author":"P. Elias","year":"1975","unstructured":"P. Elias, Universal Codeword Sets and Representation of the Integers, I.E.E.E. Trans. Inform. TheoryIT 21,2 (1975), 194\u2013203.","journal-title":"I.E.E.E. Trans. Inform. Theory"},{"key":"1_CR6","unstructured":"N.Faller, An adaptive system for data compression, in Record of the 7th Asilomar Conference on Circuits, Systems, and Computers (1973), 593\u2013597."},{"key":"1_CR7","unstructured":"R.G.Gallager, Information Theory and Reliable Communication, Wiley (1968)."},{"issue":"6","key":"1_CR8","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1109\/TIT.1978.1055959","volume":"IT 24","author":"R.G. Gallager","year":"1978","unstructured":"R.G. Gallager, Variations on a theme by Huffman, I.E.E.E. Trans. Inform. TheoryIT 24,6 (1978), 668\u2013674.","journal-title":"I.E.E.E. Trans. Inform. Theory"},{"issue":"2","key":"1_CR9","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1109\/TIT.1982.1056465","volume":"IT 28","author":"E.N. Gilbert","year":"1982","unstructured":"E.N. Gilbert, C.L. Monma, Multigram Codes, I.E.E.E. Trans. Inform. TheoryIT 28,2 (1982), 346\u2013348.","journal-title":"I.E.E.E. Trans. Inform. Theory"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"A.Hartman, M.Rodeh, Optimal Parsing of Strings, in (Combinatorial Algorithms on Words, Apostolico & Galil ed., Springer-Verlag (1985)) 155\u2013167.","DOI":"10.1007\/978-3-642-82456-2_11"},{"key":"1_CR11","unstructured":"R.W.Hamming, Coding and Information Theory, Prentice-Hall (1980)."},{"key":"1_CR12","unstructured":"G.Held, La compression des donn\u00e9es, m\u00e9thodes et applications, Masson (1987)."},{"key":"1_CR13","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","volume":"40","author":"D.A. Huffman","year":"1951","unstructured":"D.A. Huffman, A method for the construction of minimum redundancy codes, Proc. IRE40 (1951), 1098\u20131101.","journal-title":"Proc. IRE"},{"key":"1_CR14","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1007\/BF01936138","volume":"25","author":"M. Jakobsson","year":"1985","unstructured":"M. Jakobsson, Compression of character strings by an adaptive dictionary, BIT25 (1985), 593\u2013603.","journal-title":"BIT"},{"key":"1_CR15","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0196-6774(85)90036-7","volume":"6","author":"D.E. Knuth","year":"1985","unstructured":"D.E. Knuth, Dynamic Huffman Coding, J. Algorithms6 (1985), 163\u2013180.","journal-title":"J. Algorithms"},{"issue":"2","key":"1_CR16","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1109\/TIT.1983.1056645","volume":"IT 29","author":"G.G. Langdon Jr.","year":"1983","unstructured":"G.G. Langdon Jr., A Note on the Ziv-Lempel Model for Compressing Individual Sequences, I.E.E.E. Trans. Inform.TheoryIT 29,2 (1983), 284\u2013287.","journal-title":"I.E.E.E. Trans. Inform.Theory"},{"issue":"1","key":"1_CR17","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1109\/TIT.1976.1055501","volume":"IT 22","author":"A. Lempel","year":"1976","unstructured":"A. Lempel, J. Ziv, On the Complexity of Finite Sequences, I.E.E.E. Trans. Inform.TheoryIT 22,1 (1976), 75\u201381.","journal-title":"I.E.E.E. Trans. Inform.Theory"},{"issue":"2","key":"1_CR18","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1093\/comjnl\/30.2.149","volume":"30","author":"J.A. Llewellyn","year":"1987","unstructured":"J.A. Llewellyn, Data Compression for a Source with Markov Charateristics, Comput. J.30,2 (1987), 149\u2013156.","journal-title":"Comput. J."},{"issue":"1","key":"1_CR19","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1109\/TCOM.1982.1095395","volume":"COM 30","author":"M.D. McIlroy","year":"1982","unstructured":"M.D. McIlroy, Development of a Spelling List, I.E.E.E. Trans. Commun.COM 30,1 (1982), 91\u201399.","journal-title":"I.E.E.E. Trans. Commun."},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"V.S.Miller, M.N.Wegman, Variations on a Theme by Ziv and Lempel, in (Combinatorial Algorithms on Words, Apostolico & Galil ed., Springer-Verlag (1985), 131\u2013140.","DOI":"10.1007\/978-3-642-82456-2_9"},{"issue":"2","key":"1_CR21","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1147\/rd.232.0149","volume":"23","author":"J. Rissanen","year":"1979","unstructured":"J. Rissanen, G.G. Langdon Jr., Arithmetic Coding, IBM J. Res. Dev.23,2 (1979), 149\u2013162.","journal-title":"IBM J. Res. Dev."},{"issue":"1","key":"1_CR22","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1109\/TIT.1981.1056282","volume":"IT 27","author":"J. Rissanen","year":"1981","unstructured":"J. Rissanen, G.G. Langdon Jr., Universal Modeling and Coding, I.E.E.E. Trans. Inform.TheoryIT 27,1 (1981), 12\u201323.","journal-title":"I.E.E.E. Trans. Inform.Theory"},{"issue":"1","key":"1_CR23","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1145\/322234.322237","volume":"28","author":"M. Rodeh","year":"1981","unstructured":"M. Rodeh, V.R. Pratt, S. Even, Linear Algorithm for Data Compression via String Matching, J. Assoc. Comput. Mach.28,1 (1981), 16\u201324.","journal-title":"J. Assoc. Comput. Mach."},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"J.A.Storer, Textual Substitution Techniques for Data Compression, in (Combinatorial Algorithms on Words, Apostolico & Galil ed., Springer-Verlag (1985)) 111\u2013129.","DOI":"10.1007\/978-3-642-82456-2_8"},{"issue":"4","key":"1_CR25","doi-asserted-by":"crossref","first-page":"928","DOI":"10.1145\/322344.322346","volume":"29","author":"J.A. Storer","year":"1982","unstructured":"J.A. Storer, T.G. Szymanski, Data Compression via Textual Substitution, J. Assoc. Comput. Mach.29,4 (1982), 928\u2013951.","journal-title":"J. Assoc. Comput. Mach."},{"issue":"4","key":"1_CR26","doi-asserted-by":"crossref","first-page":"825","DOI":"10.1145\/31846.42227","volume":"34","author":"J.S. Vitter","year":"1987","unstructured":"J.S. Vitter, Design and Analysis of Dynamic Huffman Codes, J. Assoc. Comput. Mach.34,4 (1987), 825\u2013845.","journal-title":"J. Assoc. Comput. Mach."},{"issue":"6","key":"1_CR27","first-page":"8","volume":"17","author":"T.A. Welch","year":"1984","unstructured":"T.A. Welch, A Technique for High-Performance Data Compression, I.E.E.E. Computer17,6 (1984), 8\u201319.","journal-title":"I.E.E.E. Computer"},{"issue":"6","key":"1_CR28","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1145\/214762.214771","volume":"30","author":"I.H. Witten","year":"1987","unstructured":"I.H. Witten, R.M. Neal, J.G. Cleary, Arithmetic coding for data compression, Commun. ACM30,6 (1987), 520\u2013540.","journal-title":"Commun. ACM"},{"issue":"3","key":"1_CR29","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"IT 23","author":"J. Ziv","year":"1977","unstructured":"J. Ziv, A. Lempel, A Universal Algorithm for Sequential Data Compression, I.E.E.E. Trans. Inform.TheoryIT 23,3 (1977), 337\u2013343.","journal-title":"I.E.E.E. Trans. Inform.Theory"},{"issue":"5","key":"1_CR30","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","volume":"IT 24","author":"J. Ziv","year":"1978","unstructured":"J. Ziv, A. Lempel, Compression of Individual Sequences via Variable-rate Coding, I.E.E.E. Trans. Inform.TheoryIT 24,5 (1978), 530\u2013536.","journal-title":"I.E.E.E. Trans. Inform.Theory"}],"container-title":["Lecture Notes in Computer Science","Electronic Dictionaries and Automata in Computational Linguistics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51465-1_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:21:16Z","timestamp":1605648076000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51465-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540514657","9783540481409"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/3-540-51465-1_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}