{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,12]],"date-time":"2026-11-12T20:52:33Z","timestamp":1794516753043,"version":"4.9.1"},"publisher-location":"New York, NY","reference-count":15,"publisher":"Springer New York","isbn-type":[{"value":"9781493928637","type":"print"},{"value":"9781493928644","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-1-4939-2864-4_414","type":"book-chapter","created":{"date-parts":[[2016,4,21]],"date-time":"2016-04-21T20:03:20Z","timestamp":1461269000000},"page":"2144-2149","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Suffix Tree Construction"],"prefix":"10.1007","author":[{"given":"Jens","family":"Stoye","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"key":"414_CR191016","first-page":"67","volume-title":"LNCS, vol 3772","author":"Amir A, Kopelowitz T, Lewenstein M, Lewenstein N (2005) Towards real-time suffix tree construction. In: Proceedings of the 12th international symposium on string processing and information retrieval (SPIRE","year":"2005","unstructured":"Amir A, Kopelowitz T, Lewenstein M, Lewenstein N (2005) Towards real-time suffix tree construction. In: Proceedings of the 12th international symposium on string processing and information retrieval (SPIRE 2005). LNCS, vol\u00a03772. Springer, Berlin, pp\u00a067\u201378"},{"key":"414_CR191017","series-title":"NATO ASI Series","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-642-82456-2_6","volume-title":"Combinatorial algorithms on words","author":"A Apostolico","year":"1985","unstructured":"Apostolico A (1985) The myriad virtues of subword trees. In: Apostolico A, Galil Z (eds) Combinatorial algorithms on words. NATO ASI Series, vol\u00a0F12. Springer, Berlin, pp\u00a085\u201396"},{"key":"414_CR191018","volume-title":"Combinatorial algorithms on words","author":"MT Chen","year":"1985","unstructured":"Chen MT, Seiferas J (1985) Efficient and elegant subword tree construction. In: Apostolico A, Galil Z (eds) Combinatorial algorithms on words. Springer, New York"},{"issue":"6","key":"414_CR191019","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1145\/355541.355547","volume":"47","author":"M Farach-Colton","year":"2000","unstructured":"Farach-Colton M, Ferragina P, Muthukrishnan S (2000) On the sorting-complexity of suffix tree construction. J ACM 47(6):987\u20131011","journal-title":"J ACM"},{"key":"414_CR191020","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 (1998) A note on updating suffix tree labels. Theor Comput Sci 201:249\u2013262","journal-title":"Theor Comput Sci"},{"key":"414_CR191021","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1145\/63334.63341","volume":"32","author":"ER Fiala","year":"1989","unstructured":"Fiala ER, Greene DH (1989) Data compression with finite windows. Commun ACM 32:490\u2013505","journal-title":"Commun ACM"},{"key":"414_CR191022","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 (2003) Efficient implementation of lazy suffix trees. Softw Pract Exp 33:1035\u20131049","journal-title":"Softw Pract Exp"},{"key":"414_CR191023","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 (1997) Algorithms on strings, trees, and sequences: computer science and computational biology. Cambridge University Press, New York"},{"key":"414_CR191024","first-page":"943","volume-title":"LNCS, vol 2719","author":"K\u00e4rkk\u00e4inen J, Sanders P (2003) Simple linear work suffix array construction. In: Proceedings of the 30th international colloquium on automata, languages, and programming (ICALP","year":"2003","unstructured":"K\u00e4rkk\u00e4inen J, Sanders P (2003) Simple linear work suffix array construction. In: Proceedings of the 30th international colloquium on automata, languages, and programming (ICALP 2003). LNCS, vol\u00a02719. Springer, Berlin, pp\u00a0943\u2013955"},{"key":"414_CR191025","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 (1999) Reducing the space requirements of suffix trees. Softw Pract Exp 29:1149\u20131171","journal-title":"Softw Pract Exp"},{"key":"414_CR191026","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"EM McCreight","year":"1976","unstructured":"McCreight EM (1976) A space-economical suffix tree construction algorithm. J ACM 23:262\u2013272","journal-title":"J ACM"},{"key":"414_CR191027","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01206331","volume":"14","author":"E Ukkonen","year":"1995","unstructured":"Ukkonen E (1995) On-line construction of suffix trees. Algorithmica 14:249\u2013260","journal-title":"Algorithmica"},{"key":"414_CR191028","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/SWAT.1973.13","volume-title":"Proceedings of the 14th annual IEEE symposium on switching and automata theory","author":"P Weiner","year":"1973","unstructured":"Weiner P (1973) Linear pattern matching algorithms. In: Proceedings of the 14th annual IEEE symposium on switching and automata theory. IEEE Press, New York, pp\u00a01\u201311"},{"key":"414_CR191029","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1109\/TKDE.2005.3","volume":"17","author":"C-F Cheung","year":"2005","unstructured":"Cheung C-F, Yu JX, Lu H (2005) Constructing suffix tree for gigabyte sequences with megabyte memory. IEEE Trans Knowl. Data Eng. 17:90\u2013105","journal-title":"IEEE Trans Knowl. Data Eng."},{"key":"414_CR191030","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s00778-005-0154-8","volume":"14","author":"Y Tian","year":"2005","unstructured":"Tian Y, Tata S, Hankins RA, Patel JM (2005) Practical methods for constructing suffix trees. VLDB J 14:281\u2013299","journal-title":"VLDB J"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_414","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T23:54:16Z","timestamp":1792108456000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/chapter\/10.1007\/978-1-4939-2864-4_414"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_414","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}