{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:48:32Z","timestamp":1725662912003},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540133452"},{"type":"electronic","value":"9783540388869"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1984]]},"DOI":"10.1007\/3-540-13345-3_9","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:04:22Z","timestamp":1330193062000},"page":"109-118","source":"Crossref","is-referenced-by-count":11,"title":["Building the minimal DFA for the set of all subwords of a word on-line in linear time"],"prefix":"10.1007","author":[{"given":"A.","family":"Blumer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Blumer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Ehrenfeucht","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Haussler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"McConnell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"issue":"6","key":"9_CR1","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"Alfred V. V. Aho","year":"1975","unstructured":"Aho, Alfred V. and Margaret J. Corasick; \"Efficient string matching: an aid to bibliographic research,\" CACM, v. 18, no. 6, June 1975, 333\u2013340.","journal-title":"CACM"},{"key":"9_CR2","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0304-3975(83)90109-3","volume":"22","author":"A. Apostolico","year":"1983","unstructured":"Apostolico, A. and F. P. Preparata: \"Optimal off-line detection of repetitions in a string,\" Theoretical Computer Science, v. 22, 1983, 297\u2013315.","journal-title":"Theoretical Computer Science"},{"key":"9_CR3","first-page":"12","volume":"21","author":"A. Blumer","year":"1983","unstructured":"Blumer, A., J. Blumer, A. Ehrenfeucht, D. Haussler, R. McConnell; \"Linear Size Finite Automata for the Set of all Subwords of a Word: An Outline of Results,\" Bul. Euro. Asso. Theor. Comp. Sci., 21, (1983), 12\u201320.","journal-title":"Bul. Euro. Asso. Theor. Comp. Sci."},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Blumer, A., J. Blumer, A. Ehrenfeucht, D. Haussler, R. McConnell: \"Building a Complete Inverted File for a Set of Text Files in Linear Time,\" Proc. 16th ACM Symp. Theo. Comp., May 1984, to appear.","DOI":"10.1145\/800057.808700"},{"issue":"10","key":"9_CR5","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1145\/359842.359859","volume":"20","author":"R. S. Boyer","year":"1977","unstructured":"Boyer, R.S. and J.S. Moore; \"A fast string searching algorithm,\" CACM, v. 20, no. 10, Oct. 1977, 762\u2013772.","journal-title":"CACM"},{"issue":"2","key":"9_CR6","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"Donald E. E. Knuth","year":"1977","unstructured":"Knuth, Donald E., James H. Morris, and Vaughan R. Pratt; \"Fast pattern matching in strings,\" SIAM J. Comput., v. 6, no. 2, June 1977, 323\u2013350.","journal-title":"SIAM J. Comput."},{"issue":"4","key":"9_CR7","doi-asserted-by":"crossref","first-page":"785","DOI":"10.1137\/0209061","volume":"9","author":"M. E. Majster","year":"1980","unstructured":"Majster, M. E. and Angelika Reiser; \"Efficient on-line construction and correction of position trees,\" SIAM J. Comput., v. 9, no. 4, Nov. 1980, 785\u2013807.","journal-title":"SIAM J. Comput."},{"issue":"2","key":"9_CR8","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"Edward M. M. McCreight","year":"1976","unstructured":"McCreight, Edward M.; \"A space-economical suffix tree construction algorithm,\" JACM, v. 23, no. 2, April 1976, 262\u2013272.","journal-title":"JACM"},{"issue":"4","key":"9_CR9","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1145\/321479.321481","volume":"15","author":"Donald R. R. Morrison","year":"1968","unstructured":"Morrison, Donald R.; \"PATRICIA \u2014 Practical Algorithm To Retrieve Information Coded In Alphanumeric,\" JACM, v. 15, no. 4, October 1968, 514\u2013534.","journal-title":"JACM"},{"key":"9_CR10","unstructured":"Pratt, V. R., \"Improvements and applications for the Weiner repetition finder,\" unpublished manuscript, May 1973 (revised Oct. 1973, March 1975)."},{"key":"9_CR11","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"M. O. Rabin","year":"1959","unstructured":"Rabin, M. O. and D. Scott; \"Finite automata and their decision problems,\" IBM J. Res. Dev. (3) 1959, 114\u2013125.","journal-title":"IBM J. Res. Dev."},{"issue":"1","key":"9_CR12","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1145\/322234.322237","volume":"28","author":"M. Rodeh","year":"1981","unstructured":"Rodeh, Michael, Vaughan R. Pratt, and Shimon Even; \"Linear algorithm for data compression via string matching,\" JACM, v. 28, no. 1, Jan. 1981, 16\u201324.","journal-title":"JACM"},{"key":"9_CR13","unstructured":"Seiferas, J. and M.T.Chen; \"Efficient and elegant subword-tree construction,\" Univ. of Rochester 1983\u201384 C.S. and C.E. Research Review, 10\u201314."},{"issue":"3","key":"9_CR14","doi-asserted-by":"crossref","first-page":"1316","DOI":"10.1007\/BF01084395","volume":"22","author":"A. O. Slisenko","year":"1983","unstructured":"Slisenko, A. O., \"Detection of periodicities and string matching in real time,\" (English translation) J. Sov. Math., 22 (3) (1983) 1316\u20131387. (originally published 1980).","journal-title":"J. Sov. Math."},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Weiner, P.; \"Linear pattern matching algorithms,\" IEEE 14th Annual Symposium on Switching and Automata Theory, 1973, 1\u201311.","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-13345-3_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:52:51Z","timestamp":1619556771000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-13345-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"ISBN":["9783540133452","9783540388869"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-13345-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1984]]}}}