{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:21:19Z","timestamp":1742952079600,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":15,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387355443"},{"type":"electronic","value":"9780387399409"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-0-387-39940-9_1142","type":"book-chapter","created":{"date-parts":[[2009,9,16]],"date-time":"2009-09-16T08:05:42Z","timestamp":1253088342000},"page":"2876-2880","source":"Crossref","is-referenced-by-count":1,"title":["Suffix Tree"],"prefix":"10.1007","author":[{"given":"Maxime","family":"Crochemore","sequence":"first","affiliation":[]},{"given":"Thierry","family":"Lecroq","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"1142_CR1_1142","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0304-3975(85)90157-4","volume":"40","author":"A. Blumer","year":"1985","unstructured":"Blumer A., Blumer J., Ehrenfeucht A., Haussler D., Chen M.T., and Seiferas J. The smallest automaton recognizing the subwords of a text. Theor. Comput. Sci. 40(1):31\u201355, 1985.","journal-title":"Theor. Comput. Sci"},{"issue":"1","key":"1142_CR2_1142","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0304-3975(86)90041-1","volume":"45","author":"M. Crochemore","year":"1986","unstructured":"Crochemore M. Transducers and repetitions. Theor. Comput. Sci. 45(1):63\u201386, 1986.","journal-title":"Theor. Comput. Sci"},{"key":"1142_CR3_1142","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546853","volume-title":"Algorithms on Strings","author":"M. Crochemore","year":"2007","unstructured":"Crochemore M., Hancart C., and Lecroq T. Algorithms on Strings. Cambridge University Press, Cambridge, UK, 2007."},{"key":"1142_CR4_1142","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1007\/3-540-63246-8_12","volume":"1261","author":"M. Crochemore","year":"1997","unstructured":"Crochemore M. and V\u00e9rin R. On compact directed acyclic word graphs. In Structures in Logic et Computer Science, LNCS 1261: 192\u2013211, 1997.","journal-title":"In Structures in Logic et Computer Science, LNCS"},{"doi-asserted-by":"crossref","unstructured":"Farach M. Optimal suffix tree construction with large alphabets. In Proc. 38th IEEE Annual Symp. on Foundations of Computer Science, 1997, pp. 137\u2013143.","key":"1142_CR5_1142","DOI":"10.1109\/SFCS.1997.646102"},{"key":"1142_CR6_1142","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1145\/301970.301973","volume":"46","author":"P. Ferragina","year":"1999","unstructured":"Ferragina P. and Grossi R. The string B-tree: A new data structure for string search in external memory et its applications. J. Assoc. Comput. Mach., 46:236\u2013280, 1999.","journal-title":"J. Assoc. Comput. Mach."},{"key":"1142_CR7_1142","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on strings, trees and sequences","author":"D. Gusfield","year":"1997","unstructured":"Gusfield D. Algorithms on strings, trees and sequences. Cambridge University Press, Cambridge, UK, 1997."},{"unstructured":"K\u00e4rkk\u00e4inen J. and Sanders P. 2003, Simple linear work suffix array construction. In Proc. 30th Int. Colloquium on Automata, Languages, and Programming, pp. 943\u2013955.","key":"1142_CR8_1142"},{"unstructured":"Kim D.K., Sim J.S., Park H., and Park K. 2003, Linear-time construction of suffix arrays. In Proc. 14th Annual Symp. Combinatorical Pattern Matching, pp. 186\u2013199.","key":"1142_CR9_1142"},{"unstructured":"Ko P. and Aluru S. 2003, Space efficient linear time construction of suffix arrays. In Proc. 14th Annual Symp. Combinatorical Pattern Matching, pp. 200\u2013210.","key":"1142_CR10_1142"},{"issue":"13","key":"1142_CR11_1142","doi-asserted-by":"crossref","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 requirement of suffix trees. Softw., Pract. Exp. 29(13):1149\u20131171, 1999.","journal-title":"Softw., Pract. Exp"},{"issue":"5","key":"1142_CR12_1142","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U. Manber","year":"1993","unstructured":"Manber U. and Myers G. Suffix arrays: a new method for on-line string searches. SIAM J. Comput. 22(5):935\u2013948, 1993.","journal-title":"SIAM J. Comput"},{"issue":"2","key":"1142_CR13_1142","first-page":"262","volume":"23","author":"E.M. McCreight","year":"1976","unstructured":"McCreight E.M. A space-economical suffix tree construction algorithm. J. Algorithms 23(2):262\u2013272, 1976.","journal-title":"J. Algorithms"},{"issue":"3","key":"1142_CR14_1142","doi-asserted-by":"crossref","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(3):249\u2013260, 1995.","journal-title":"Algorithmica"},{"doi-asserted-by":"crossref","unstructured":"Weiner P. Linear pattern matching algorithm. In Proc. 14th Annual IEEE Symp. on Switching et Automata Theory. Washington, DC, 1973, pp. 1\u201311.","key":"1142_CR15_1142","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Encyclopedia of Database Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-39940-9_1142","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T05:26:21Z","timestamp":1739337981000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-39940-9_1142"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9780387355443","9780387399409"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-39940-9_1142","relation":{},"subject":[],"published":{"date-parts":[[2009]]}}}