{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T09:05:57Z","timestamp":1780477557437,"version":"3.54.1"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1995,9,1]],"date-time":"1995-09-01T00:00:00Z","timestamp":809913600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1995,9]]},"DOI":"10.1007\/bf01206331","type":"journal-article","created":{"date-parts":[[2005,2,25]],"date-time":"2005-02-25T13:24:38Z","timestamp":1109337878000},"page":"249-260","source":"Crossref","is-referenced-by-count":1010,"title":["On-line construction of suffix trees"],"prefix":"10.1007","volume":"14","author":[{"given":"E.","family":"Ukkonen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"A. Aho","year":"1975","unstructured":"A. Aho and M. Corasick, Efficient string matching: an aid to bibliographic search,Comm. ACM,18 (1975), 333?340.","journal-title":"Comm. ACM"},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"A. Amir and M.Farach, Adaptive dictionary matching,Proc. 32nd IEEE Ann. Symp. on Foundations of Computer Science, 1991, pp. 760?766.","DOI":"10.1109\/SFCS.1991.185445"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-3-642-82456-2_6","volume-title":"Combinatorial Algorithms on Words","author":"A. Apostolico","year":"1985","unstructured":"A. Apostolico, The myriad virtues of subword trees, inCombinatorial Algorithms on Words (A. Apostolico and Z. Galil, eds.), Springer-Verlag, New York, 1985, pp. 85?95."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0304-3975(85)90157-4","volume":"40","author":"A. Blumer","year":"1985","unstructured":"A. Blumer, J. Blumer, D. Haussier, A. Ehrenfeucht, M. T. Chen, and J. Seiferas, The smallest automaton recognizing the subwords of a text,Theoret. Comput. Sci.,40 (1985), 31?55.","journal-title":"Theoret. Comput. Sci."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0304-3975(86)90041-1","volume":"45","author":"M. Crochemore","year":"1986","unstructured":"M. Crochemore, Transducers and repetitions,Theoret. Comput. Sci.,45 (1986), 63?86.","journal-title":"Theoret. Comput. Sci."},{"key":"CR6","series-title":"Lecture Notes in Computer Science, vol. 324","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1007\/BFb0017130","volume-title":"Mathematical Foundations of Computer Science 1988","author":"M. Crochemore","year":"1988","unstructured":"M. Crochemore, String matching with constraints, inMathematical Foundations of Computer Science 1988 (M. P. Chytil, L. Janiga and V. Koubek, eds.), Lecture Notes in Computer Science, vol. 324, Springer-Verlag, Berlin, 1988, pp. 44?58."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0885-064X(88)90008-8","volume":"4","author":"Z. Galil","year":"1988","unstructured":"Z. Galil and R. Giancarlo, Data structures and algorithms for approximate string matching,J. Complexity,4 (1988), 33?72.","journal-title":"J. Complexity"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/BF00292114","volume":"24","author":"M. Kempf","year":"1987","unstructured":"M. Kempf, R. Bayer, and U. G\u00fcntzer, Time optimal left to right construction of position trees,Acta Inform.,24 (1987), 461?474.","journal-title":"Acta Inform."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E. McCreight","year":"1976","unstructured":"E. McCreight, A space-economical suffix tree construction algorithm,J. Assoc. Comput. Mach.,23 (1976), 262?272.","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR10","first-page":"484","volume-title":"Algorithms, Software, Architecture. Information Processing 92, vol. I","author":"E. Ukkonen","year":"1992","unstructured":"E. Ukkonen, Constructing suffix trees on-line in linear time, inAlgorithms, Software, Architecture. Information Processing 92, vol. I (J. van Leeuwen, ed.), Elsevier, Amsterdam, 1992, pp. 484?492."},{"key":"CR11","series-title":"Lecture Notes in Computer Science, vol. 684","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1007\/BFb0029808","volume-title":"Combinatorial Pattern Matching, CPM '93","author":"E. Ukkonen","year":"1993","unstructured":"E. Ukkonen, Approximate string-matching over suffix trees, inCombinatorial Pattern Matching, CPM '93 (A. Apostolico, M. Crochemore, Z. Galil, and U. Manber, eds.), Lecture Notes in Computer Science, vol. 684, Springer-Verlag, Berlin 1993, pp. 228?242."},{"key":"CR12","doi-asserted-by":"crossref","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 (1993), 353?364.","journal-title":"Algorithmica"},{"key":"CR13","doi-asserted-by":"crossref","unstructured":"P. Weiner, Linear pattern matching algorithms,Proc. IEEE 14th Ann. Symp. on Switching and Automata Theory, 1973, pp. 1?11.","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01206331.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01206331\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01206331","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T17:10:11Z","timestamp":1556730611000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01206331"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,9]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1995,9]]}},"alternative-id":["BF01206331"],"URL":"https:\/\/doi.org\/10.1007\/bf01206331","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,9]]}}}