{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:46:21Z","timestamp":1725493581695},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405610"},{"type":"electronic","value":"9783540450894"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45089-0_12","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T03:27:35Z","timestamp":1193455655000},"page":"120-130","source":"Crossref","is-referenced-by-count":0,"title":["Ternary Directed Acyclic Word Graphs"],"prefix":"10.1007","author":[{"given":"Satoru","family":"Miyamoto","sequence":"first","affiliation":[]},{"given":"Shunsuke","family":"Inenaga","sequence":"additional","affiliation":[]},{"given":"Masayuki","family":"Takeda","sequence":"additional","affiliation":[]},{"given":"Ayumi","family":"Shinohara","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"12_CR1","first-page":"1259","volume":"3","author":"G. M. Andelson-Velskii","year":"1962","unstructured":"G. M. Andelson-Velskii and E. M. Landis. An algorithm for the organisation of information. Soviet. Math., 3:1259\u20131262, 1962.","journal-title":"Soviet. Math."},{"key":"12_CR2","unstructured":"J. Bentley and B. Sedgewick. Ternary search trees. Dr. Dobb\u2019s Journal, 1998. \n                    http:\/\/www.ddj.com\/\n                    \n                  ."},{"key":"12_CR3","unstructured":"J. Bentley and R. Sedgewick. Fast algorithms for sorting and searching strings. In Proc. 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201997), pages 360\u2013369. ACM\/SIAM, 1997."},{"key":"12_CR4","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, D. Haussler, A. Ehrenfeucht, M. T. Chen, and J. Seiferas. The smallest automaton recognizing the subwords of a text. Theoretical Computer Science, 40:31\u201355, 1985.","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"12_CR5","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1145\/28869.28873","volume":"34","author":"A. Blumer","year":"1987","unstructured":"A. Blumer, J. Blumer, D. Haussler, R. McConnell, and A. Ehrenfeucht. Complete inverted files for efficient text retrieval and analysis. J. ACM, 34(3):578\u2013595, 1987.","journal-title":"J. ACM"},{"key":"12_CR6","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. Theoretical Computer Science, 45:63\u201386, 1986.","journal-title":"Theoretical Computer Science"},{"key":"12_CR7","volume-title":"Text Algorithms","author":"M. Crochemore","year":"1994","unstructured":"M. Crochemore and W. Rytter. Text Algorithms. Oxford University Press, New York, 1994."},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"M. Crochemore and W. Rytter. Jewels of Stringology. World Scientific, 2002.","DOI":"10.1142\/4838"},{"key":"12_CR9","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 Structures in Logic and Computer Science, volume 1261 of LNCS, pages 192\u2013211. Springer-Verlag, 1997."},{"key":"12_CR10","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences","author":"D. Gusfield","year":"1997","unstructured":"D. Gusfield. Algorithms on Strings, Trees, and Sequences. Cambridge University Press, New York, 1997."},{"key":"12_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/3-540-48194-X_16","volume-title":"Proc. 12th Annual Symposium on Combinatorial Pattern Matching (CPM\u201901)","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 A. Amir and G. M. Landau, editors, Proc. 12th Annual Symposium on Combinatorial Pattern Matching (CPM\u201901), volume 2089 of LNCS, pages 169\u2013180. Springer-Verlag, 2001."},{"issue":"2","key":"12_CR12","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E. M. McCreight","year":"1976","unstructured":"E. M. McCreight. A space-economical suffix tree construction algorithm. J. ACM, 23(2):262\u2013272, 1976.","journal-title":"J. ACM"},{"issue":"1","key":"12_CR13","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0304-3975(92)90142-3","volume":"92","author":"D. Revuz","year":"1992","unstructured":"D. Revuz. Minimization of acyclic deterministic automata in linear time. Theoretical Computer Science, 92(1):181\u2013189, 1992.","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"12_CR14","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01206331","volume":"14","author":"E. Ukkonen","year":"1995","unstructured":"E. Ukkonen. On-line construction of suffix trees. Algorithmica, 14(3):249\u2013260, 1995.","journal-title":"Algorithmica"},{"issue":"5","key":"12_CR15","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/BF01769703","volume":"10","author":"E. Ukkonen","year":"1993","unstructured":"E. Ukkonen and D. Wood. Approximate string matching with suffix automata. Algorithmica, 10(5):353\u2013364, 1993.","journal-title":"Algorithmica"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"P. Weiner. Linear pattern matching algorithms. In Proc. 14th Annual Symposium on Switching and Automata Theory, pages 1\u201311, 1973.","DOI":"10.1109\/SWAT.1973.13"}],"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-45089-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T10:50:16Z","timestamp":1551005416000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45089-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405610","9783540450894"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-45089-0_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}