{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,25]],"date-time":"2023-04-25T22:10:47Z","timestamp":1682460647162},"reference-count":23,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3730,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0304-3975(02)00571-6","type":"journal-article","created":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T01:37:28Z","timestamp":1051753048000},"page":"103-117","source":"Crossref","is-referenced-by-count":6,"title":["Optimal insertion in deterministic DAWGs"],"prefix":"10.1016","volume":"301","author":[{"given":"Kyriakos N.","family":"Sgarbas","sequence":"first","affiliation":[]},{"given":"Nikos D.","family":"Fakotakis","sequence":"additional","affiliation":[]},{"given":"George K.","family":"Kokkinakis","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(02)00571-6_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/S0304-3975(02)00571-6_BIB2","series-title":"Compilers: Principles, Techniques and Tools","author":"Aho","year":"1988"},{"key":"10.1016\/S0304-3975(02)00571-6_BIB3","unstructured":"J. Aoe, K. Morimoto, M. Hase, An algorithm for compressing common suffixes used in trie structures, Systems and Computers in Japan, 24(12) (1993) 31\u201342 (translated from Trans. IEICE J75-D-II(4) (1992) 770\u2013779)."},{"issue":"3","key":"10.1016\/S0304-3975(02)00571-6_BIB4","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1109\/69.506713","article-title":"A trie compaction algorithm for a large set of keys","volume":"8","author":"Aoe","year":"1996","journal-title":"IEEE Trans. Knowledge Data Eng."},{"key":"10.1016\/S0304-3975(02)00571-6_BIB5","first-page":"109","article-title":"Building the minimal DFA for the set of all subwords of a word online in linear time","volume":"Vol. 172","author":"Blumer","year":"1984"},{"key":"10.1016\/S0304-3975(02)00571-6_BIB6","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0166-218X(92)90270-K","article-title":"Average sizes of suffix trees and DAWGs","volume":"24","author":"Blumer","year":"1989","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(02)00571-6_BIB7","doi-asserted-by":"crossref","unstructured":"M. Ciura, S. Deorowicz, Experimental study of finite automata storing static lexicons, Report BW-453\/RAu-2\/99, 1999, also at http:\/\/www-zo.iinf.polsl.gliwice.pl\/~sdeor\/pub.htm","DOI":"10.1142\/9789812815675_0003"},{"issue":"11","key":"10.1016\/S0304-3975(02)00571-6_BIB8","doi-asserted-by":"crossref","first-page":"1077","DOI":"10.1002\/spe.402","volume":"31","author":"Ciura","year":"2001","journal-title":"How to squeeze a lexicon, Software - Practice & Experience"},{"key":"10.1016\/S0304-3975(02)00571-6_BIB9","doi-asserted-by":"crossref","unstructured":"M. Crochemore, R. Verin, Direct construction of compact directed acyclic word graphs, Proc. Eighth Annual Symp. CPM 97, Aarhus, Denmark, June 30\u2013July 2, 1997, pp. 116\u2013129.","DOI":"10.1007\/3-540-63220-4_55"},{"issue":"1","key":"10.1016\/S0304-3975(02)00571-6_BIB10","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1162\/089120100561601","article-title":"Incremental construction of minimal acyclic finite state automata","volume":"26","author":"Daciuk","year":"2000","journal-title":"Computational Linguistics"},{"key":"10.1016\/S0304-3975(02)00571-6_BIB11","doi-asserted-by":"crossref","unstructured":"J. Daciuk, R.E. Watson, B.W. Watson, Incremental construction of acyclic finite-state automata and transducers, Proc. Finite State Methods in Natural Language Processing, Bilkent University, Ankara, Turkey, June 29\u2013July 1, 1998.","DOI":"10.3115\/1611533.1611538"},{"key":"10.1016\/S0304-3975(02)00571-6_BIB12","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0304-3975(02)00571-6_BIB13","doi-asserted-by":"crossref","unstructured":"R. Lacouture, R. De Mori, Lexical tree compression, EuroSpeech \u201991, Proc. 2nd European Conf. on Speech Communications and Techniques, Genova, Italy, September 24\u201326, 1991, pp. 581\u2013584.","DOI":"10.21437\/Eurospeech.1991-149"},{"key":"10.1016\/S0304-3975(02)00571-6_BIB14","unstructured":"S. Mihov, Direct Building of Minimal Automaton for a Given List, Annuaire de l\u2019 Universite de Sofia 'St. Kl. Ohridski\u2019, Vol. 91, livre 1, Faculte de Mathematique et Informatique, Sofia, Bulgaria, 1998."},{"key":"10.1016\/S0304-3975(02)00571-6_BIB15","unstructured":"S. Mihov, Direct Construction of Minimal Acyclic Finite States Automata, Annuaire de l\u2019 Universite de Sofia 'St. Kl. Ohridski\u2019, Vol. 92, livre 2, Faculte de Mathematique et Informatique, Sofia, Bulgaria, 1998."},{"key":"10.1016\/S0304-3975(02)00571-6_BIB16","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1080\/00207169408804348","article-title":"An algorithm for dynamic processing of DAWG's","volume":"54","author":"Park","year":"1994","journal-title":"International J. Comput. Math."},{"key":"10.1016\/S0304-3975(02)00571-6_BIB17","first-page":"3","article-title":"Finite automata","volume":"Vol. A","author":"Perrin","year":"1990"},{"key":"10.1016\/S0304-3975(02)00571-6_BIB18","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0304-3975(92)90142-3","article-title":"Minimization of acyclic deterministic automata in linear time","volume":"92","author":"Revuz","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00571-6_BIB19","unstructured":"D. Revuz, Dynamic acyclic minimal automaton, CIAA 2000, Proc. 5th Internat. Conf. on Implementation and Application of Automata, London, Canada, 2000, pp. 226\u2013232."},{"issue":"3","key":"10.1016\/S0304-3975(02)00571-6_BIB20","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1142\/S0218213095000188","article-title":"Two algorithms for incremental construction of directed acyclic word graphs","volume":"4","author":"Sgarbas","year":"1995","journal-title":"Internat. J. Artificial Intelligence Tools"},{"key":"10.1016\/S0304-3975(02)00571-6_BIB21","unstructured":"K. Sgarbas, N. Fakotakis, G. Kokkinakis, WATCHER: an intelligent agent for automatic extraction of language resources from the Internet, Proc. ELSNET, in Wonderland. The Netherlands, March 25\u201327, 1998, pp. 100\u2013104."},{"key":"10.1016\/S0304-3975(02)00571-6_BIB22","unstructured":"K. Sgarbas, N. Fakotakis, G. Kokkinakis, A straightforward approach to morphological analysis and synthesis, Proc. COMLEX 2000, workshop on Computational Lexicography and Multimedia Dictionaries, Kato Achaia, Greece, September 22\u201323, 2000, pp. 31\u201334, also at http:\/\/slt.wcl.ee.upatras.gr\/Sgarbas\/PublAbsEN.htm"},{"key":"10.1016\/S0304-3975(02)00571-6_BIB23","series-title":"Data Structures, Algorithms, and Performance","author":"Wood","year":"1993"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502005716?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502005716?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,25]],"date-time":"2023-04-25T21:37:27Z","timestamp":1682458647000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502005716"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":23,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0304397502005716"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00571-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}