{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T00:33:44Z","timestamp":1794357224179,"version":"4.9.0"},"publisher-location":"Boston, MA","reference-count":13,"publisher":"Springer US","isbn-type":[{"value":"9780387307701","type":"print"},{"value":"9780387301624","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_414","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T14:30:58Z","timestamp":1214490658000},"page":"925-928","source":"Crossref","is-referenced-by-count":0,"title":["Suffix Tree Construction in RAM"],"prefix":"10.1007","author":[{"given":"Jens","family":"Stoye","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"414_CR1_414","first-page":"67","volume-title":"Proceedings of the 12th International Symposium on String Processing and Information Retrieval, SPIRE 2005. LNCS, vol. 3772","author":"A. Amir","year":"2005","unstructured":"Amir, A., Kopelowitz, T., Lewenstein, M., Lewenstein, N.: Towards real-time\nsuffix tree construction. In: Proceedings of the 12th International Symposium on String Processing and Information Retrieval, SPIRE 2005. LNCS,\nvol.\u00a03772, pp. 67\u201378. Springer, Berlin (2005)"},{"key":"414_CR2_414","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-642-82456-2_6","volume-title":"Combinatorial Algorithms on Words. NATO ASI Series, vol. F12","author":"A. Apostolico","year":"1985","unstructured":"Apostolico, A.: The myriad virtues of subword trees. In: Apostolico, A., Galil,\nZ. (eds.) Combinatorial Algorithms on Words. NATO ASI Series, vol.\u00a0F12, pp. 85\u201396. Springer, Berlin (1985)"},{"key":"414_CR3_414","volume-title":"Combinatorial Algorithms on Words","author":"M.T. Chen","year":"1985","unstructured":"Chen, M.T., Seiferas, J.: Efficient and elegant subword tree construction. In:\nApostolico, A., Galil, Z. (eds.) Combinatorial Algorithms on Words. Springer, New York (1985)"},{"key":"414_CR4_414","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1109\/SFCS.1997.646102","volume-title":"Proc. 38th Annu. Symp. Found. Comput. Sci., FOCS 1997","author":"M. Farach","year":"1997","unstructured":"Farach, M.: Optimal suffix tree construction with large alphabets. In:\nProc. 38th Annu. Symp. Found. Comput. Sci., FOCS 1997, pp. 137\u2013143. IEEE Press, New York (1997)"},{"key":"414_CR5_414","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/S0304-3975(97)00243-0","volume":"201","author":"P. Ferragina","year":"1998","unstructured":"Ferragina, P., Grossi, R., Montangero, M.: A\u00a0note on updating suffix tree\nlabels. Theor. Comput. Sci. 201, 249\u2013262 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"414_CR6_414","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1145\/63334.63341","volume":"32","author":"E.R. Fiala","year":"1989","unstructured":"Fiala, E.R., Greene, D.H.: Data compression with finite windows. Commun. ACM\n32, 490\u2013505 (1989)","journal-title":"Commun. ACM"},{"key":"414_CR7_414","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1002\/spe.535","volume":"33","author":"R. Giegerich","year":"2003","unstructured":"Giegerich, R., Kurtz, S., Stoye, J.: Efficient implementation of lazy suffix\ntrees. Softw. Pract. Exp. 33, 1035\u20131049 (2003)","journal-title":"Softw. Pract. Exp."},{"key":"414_CR8_414","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences: Computer Science and\nComputational Biology. Cambridge University Press, New York (1997)"},{"key":"414_CR9_414","first-page":"943","volume-title":"Proceedings of the 30th International Colloquium on Automata, Languages, and Programming, ICALP 2003. LNCS, vol. 2719","author":"J. K\u00e4rkk\u00e4inen","year":"2003","unstructured":"K\u00e4rkk\u00e4inen, J., Sanders, P.: Simple linear work suffix array construction. In:\nProceedings of the 30th International Colloquium on Automata, Languages, and Programming, ICALP 2003. LNCS, vol.\u00a02719,\npp.\u00a0943\u2013955. Springer, Berlin (2003)"},{"key":"414_CR10_414","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 requirements of suffix\ntrees. Softw. Pract. Exp. 29, 1149\u20131171 (1999)","journal-title":"Softw. Pract. Exp."},{"key":"414_CR11_414","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E.M. McCreight","year":"1976","unstructured":"McCreight, E.M.: A\u00a0space-economical suffix tree construction\nalgorithm. J.\u00a0ACM 23, 262\u2013272 (1976)","journal-title":"J. ACM"},{"key":"414_CR12_414","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01206331","volume":"14","author":"E. Ukkonen","year":"1995","unstructured":"Ukkonen, E.: On-line construction of suffix trees. Algorithmica 14, 249\u2013260 (1995)","journal-title":"Algorithmica"},{"key":"414_CR13_414","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/SWAT.1973.13","volume-title":"Proc. of the 14th Annual IEEE Symposium on Switching and Automata Theory","author":"P. Weiner","year":"1973","unstructured":"Weiner, P.: Linear pattern matching algorithms. In: Proc. of the 14th Annual\nIEEE Symposium on Switching and Automata Theory, pp. 1\u201311. IEEE Press, New York (1973)"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_414","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,2]],"date-time":"2022-09-02T23:32:35Z","timestamp":1662161555000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_414"}},"subtitle":["1997; Farach-Colton"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_414","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2008]]}}}