{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T12:24:25Z","timestamp":1725625465459},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540097730"},{"type":"electronic","value":"9783642674853"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1979]]},"DOI":"10.1007\/978-3-642-67485-3_8","type":"book-chapter","created":{"date-parts":[[2011,10,26]],"date-time":"2011-10-26T21:50:01Z","timestamp":1319665801000},"page":"149-169","source":"Crossref","is-referenced-by-count":0,"title":["Methoden und Algorithmen zur automatischen Informationsverwaltung"],"prefix":"10.1007","author":[{"given":"B.","family":"Commentz-Walter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.-J.","family":"Schek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Aho, A. V.; Corasick, M.: Efficient String Matching: An Aid to Bibliographic Search. Com. ACM, Juni 1975, Vol. 18, Nr. 6.","DOI":"10.1145\/360825.360855"},{"issue":"3","key":"8_CR2","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1145\/361972.361996","volume":"16","author":"A Bockstein","year":"1973","unstructured":"Bockstein, A.: On Harrison\u2019s Substring Testing Technique. Com. of ACM, M\u00e4rz 1973, Vol. 16, Nr. 3, pp. 180\u2013181.","journal-title":"Com. of ACM"},{"issue":"10","key":"8_CR3","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/359842.359859","volume":"20","author":"RS Boyer","year":"1977","unstructured":"Boyer, R. S.; Moore, J. S.: A Fast String Searching Algorithm. Com. of the ACM, Vol. 20, Nr. 10, 1977, pp. 262\u2013272.","journal-title":"Com. of the ACM"},{"key":"8_CR4","unstructured":"Breyer, E.: Automatische Klassifikation von Nachrichten mit der Referenzstring Methode. Diplomarbeit Universit\u00e4t Darmstadt, M\u00e4rz 1979."},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Commentz-Walter, B.: A String Matching Algorithm Fast on the Average. To appear in Lecture Notes in Comp. Sc. Proc. on ICALP, 6th Call., Graz, July 1979.","DOI":"10.1007\/3-540-09510-1_10"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Erbe, R.; Walch, G.:A General interactive Guidance for Information Retrieval and Processing Systems. APL 76: Conference Proceedings.","DOI":"10.1145\/800114.803670"},{"issue":"12","key":"8_CR7","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1145\/362919.362934","volume":"14","author":"MC Harrison","year":"71","unstructured":"Harrison, M.C.: Implementation of Substring Test by Hashing. Comm. of ACM, Dec. 71, Vol. 14, No. 12, pp. 777\u2013779.","journal-title":"Comm. of ACM"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Lynch, M. F.: Variety Generation \u2014 A Reinterpretation of Shannon\u2019s Mathematical Theory of Communication, and its Implications for Information Science. Journal of ACM, Jan. 77, pp. 19\u201325.","DOI":"10.1002\/asi.4630280104"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Schuegraf, E.J.; Heaps, H. S.: Query Processing in a Retrospective Document Retrieval System that Uses Word Fragments as Language Elements. Information Processing and Management, Vol. 12, pp. 283\u2013292.","DOI":"10.1016\/0306-4573(76)90066-2"},{"key":"8_CR10","first-page":"432","volume-title":"Lecture Notes in Computer Science","author":"H-J Schek","year":"1978","unstructured":"Schek, H.-J.: The Reference String Indexing Method. Information System Methodology (ed. G. Bracchi, P. Lockemann). Lecture Notes in Computer Science, Vol. 65, Springer Heidelberg 1978, pp. 432\u2013459."},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Williams, P. W.: Criteria for Choosing Subsets to Obtain Maximum Relative Entropy. The Computer Journal, Vol. 21, No. 1, pp. 57\u201362.","DOI":"10.1093\/comjnl\/21.1.57"}],"container-title":["Informatik-Fachberichte","Formale Modelle f\u00fcr Informationssysteme"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-67485-3_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T21:44:14Z","timestamp":1606254254000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-67485-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979]]},"ISBN":["9783540097730","9783642674853"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-67485-3_8","relation":{},"ISSN":["0343-3005"],"issn-type":[{"type":"print","value":"0343-3005"}],"subject":[],"published":{"date-parts":[[1979]]}}}