{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:26:41Z","timestamp":1725492401686},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540403913"},{"type":"electronic","value":"9783540449775"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44977-9_23","type":"book-chapter","created":{"date-parts":[[2007,10,16]],"date-time":"2007-10-16T10:20:28Z","timestamp":1192530028000},"page":"233-238","source":"Crossref","is-referenced-by-count":2,"title":["DAWG versus Suffix Array"],"prefix":"10.1007","author":[{"given":"Miroslav","family":"Bal\u00edk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1002\/spe.4380250203","volume":"25","author":"A. Anderson","year":"1995","unstructured":"Anderson A, Nilson S. Efficient implementation of suffix trees. Software-Practice and Experience, 25(1995); 129\u2013141.","journal-title":"Software-Practice and Experience"},{"key":"23_CR2","unstructured":"Bal\u00edk M. String Matching in a Text. Diploma Thesis, CTU, Dept. of Computer Science amp; Engineering, Prague, 1998."},{"key":"23_CR3","volume-title":"Text Algorithms","author":"M. Crochemore","year":"1994","unstructured":"Crochemore M, Rytter W. Text Algorithms. Oxford University Press, New York, 1994."},{"key":"23_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1007\/3-540-63220-4_55","volume-title":"CPM97","author":"M. Crochemore","year":"1997","unstructured":"Crochemore M, V\u00e9rin R. Direct Construction Of Compact Directed Acyclic Word Graphs. CPM97, A. Apostolico and J. Hein, eds., LNCS 1264, Springer-Verlag, 1997; 116\u2013129."},{"key":"23_CR5","volume-title":"Handbook of Algorithms and Data Structures-In Pascal and C","author":"G.H. Gonnet","year":"1991","unstructured":"Gonnet G.H, Baeza-Yates R. Handbook of Algorithms and Data Structures-In Pascal and C. Addison-Wesley, Wokingham, UK, 1991."},{"issue":"2","key":"23_CR6","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/S0304-3975(00)00064-5","volume":"249","author":"J. Holub","year":"2000","unstructured":"Holub J., Melichar B.: Approximate String Matching using Factor Automata. Theoretical Computer Science, Vol. 249 (2), Elsevier Science, 2000, pp. 305\u2013311.","journal-title":"Theoretical Computer Science"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Huffman, D.A. A method for construction of minimum redundancy codes. Proceedings of IRE, Vol.40, No.9, Sept.1952; 1098\u20131101.","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"23_CR8","unstructured":"Irving R.W. Suffix binary search trees. Technical report TR-1995-7, Computing science Department, University of Glasgow, Apr.95."},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"K\u00e4rkk\u00e4inen J. Suffix cactus: A cross between suffix tree and suffix array. in Proc. 6th Symposium on combinatorial Pattern Matching, CPM95, 1995; 191\u2013204.","DOI":"10.1007\/3-540-60044-2_43"},{"issue":"13","key":"23_CR10","doi-asserted-by":"publisher","first-page":"1149","DOI":"10.1002\/(SICI)1097-024X(199911)29:13<1149::AID-SPE274>3.0.CO;2-O","volume":"29","author":"S. Kurtz","year":"1999","unstructured":"Kurtz S. Reducing the Space Requirement of Suffix Trees. Software-Practice and Experience, 29(13), 1999; 1149\u20131171.","journal-title":"Software-Practice and Experience"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44977-9_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T16:23:29Z","timestamp":1556900609000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44977-9_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540403913","9783540449775"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-44977-9_23","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}