{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:25:00Z","timestamp":1759638300884},"publisher-location":"Berlin, Heidelberg","reference-count":11,"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_31","type":"book-chapter","created":{"date-parts":[[2007,10,16]],"date-time":"2007-10-16T10:20:28Z","timestamp":1192530028000},"page":"289-294","source":"Crossref","is-referenced-by-count":3,"title":["On the Implementation of Compact DAWG\u2019s"],"prefix":"10.1007","author":[{"given":"Jan","family":"Holub","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maxime","family":"Crochemore","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"31_CR1","unstructured":"M. Bal\u00edk. Implementation of DAWG. In J. Holub and M. \u015cim\u00e1nek, editors, Proceedings of the Prague Stringology Club Workshop\u2019 98, pages 26\u201335, Czech Technical University, Prague, Czech Republic, 1998. Collaborative Report DC-98-06."},{"issue":"1","key":"31_CR2","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0304-3975(85)90157-4","volume":"40","author":"A. Blumer","year":"1985","unstructured":"A. Blumer, J. Blumer, A. Ehrenfeucht, D. Haussler, M. T. Chen, and J. Seiferas. The smallest automaton recognizing the subwords of a text. Theor. Comput. Sci.,40(1):31\u201355, 1985.","journal-title":"Theor. Comput. Sci"},{"issue":"3","key":"31_CR3","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1145\/28869.28873","volume":"34","author":"A. Blumer","year":"1987","unstructured":"A. Blumer, J. Blumer, A. Ehrenfeucht, D. Haussler, and R. McConnel. Complete inverted files for effcient text retrieval and analysis. J. Assoc. Comput. Mach., 34(3):578\u2013595, 1987.","journal-title":"J. Assoc. Comput. Mach."},{"issue":"1","key":"31_CR4","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0304-3975(86)90041-1","volume":"45","author":"M. Crochemore","year":"1986","unstructured":"M. Crochemore. Transducers and repetitions. Theor. Comput. Sci., 45(1):63\u201386, 1986.","journal-title":"Theor. Comput. Sci."},{"key":"31_CR5","unstructured":"M. Crochemore, C. Hancart, and T. Lecroq. Algorithmique du texte. Vuibert, 2001. 347 pages."},{"key":"31_CR6","unstructured":"M. Crochemore and W. Rytter. Text algorithms. Oxford University Press, 1994."},{"key":"31_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1007\/3-540-63220-4_55","volume-title":"Direct construction of compact directed acyclic word graphs","author":"M. Crochemore","year":"1997","unstructured":"M. Crochemore and R. V\u00e9rin. Direct construction of compact directed acyclic word graphs. In A. Apostolico and J. Hein, editors, Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching, number 1264 in Lecture Notes in Computer Science, pages 116\u2013129, Aarhus, Denmark, 1997. Springer-Verlag, Berlin."},{"key":"31_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1007\/3-540-63246-8_12","volume-title":"Structures in Logic and Computer Science","author":"M. Crochemore","year":"1997","unstructured":"M. Crochemore and R. V\u00e9rin. On compact directed acyclic word graphs. In J. Mycielski, G. Rozenberg, and A. Salomaa, editors, Structures in Logic and Computer Science, number 1261 in Lecture Notes in Computer Science, pages 192\u2013211. Springer-Verlag, Berlin, 1997."},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"D. Gusfield. Algorithms on strings, trees and sequences: computer science and computational biology. Cambridge University Press, Cambridge, 1997.","DOI":"10.1017\/CBO9780511574931"},{"key":"31_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/3-540-48194-X_16","volume-title":"On-line construction of compact directed acyclic word graphs","author":"S. Inenaga","year":"2001","unstructured":"S. Inenaga, H. Hoshino, A. Shinohara, M. Takeda, S. Arikawa, G. Mauri, and G. Pavesi. On-line construction of compact directed acyclic word graphs. In Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching, number 2087 in Lecture Notes in Computer Science, pages 169\u2013180. Springer-Verlag, Berlin, 2001."},{"issue":"13","key":"31_CR11","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":"S. Kurtz. Reducing the space requirements of suffix trees. Softw. Pract. Exp., 29(13):1149\u20131171, 1999.","journal-title":"Softw. Pract. Exp."}],"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_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T02:22:13Z","timestamp":1550974933000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44977-9_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540403913","9783540449775"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-44977-9_31","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}