{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:22:29Z","timestamp":1743049349514,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540664277"},{"type":"electronic","value":"9783540483182"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"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":[[1999]]},"DOI":"10.1007\/3-540-48318-7_5","type":"book-chapter","created":{"date-parts":[[2007,10,25]],"date-time":"2007-10-25T20:20:56Z","timestamp":1193343656000},"page":"30-42","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Efficient Implementation of Lazy Suffix Trees"],"prefix":"10.1007","author":[{"given":"Robert","family":"Giegerich","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Kurtz","sequence":"additional","affiliation":[]},{"given":"Jens","family":"Stoye","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,27]]},"reference":[{"issue":"2","key":"5_CR1","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1002\/spe.4380250203","volume":"25","author":"A. Andersson","year":"1995","unstructured":"A. Andersson and S. Nilsson. Efficient Implementation of Suffix Trees. Software\u2014Practice and Experience, 25(2):129\u2013141, 1995.","journal-title":"Software\u2014Practice and Experience"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"A. Apostolico. The Myriad Virtues of Subword Trees. In Combinatorial Algorithms on Words, pages 85\u201396. Springer Verlag, 1985.","DOI":"10.1007\/978-3-642-82456-2_6"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/BF01762122","volume":"3","author":"A. Apostolico","year":"1988","unstructured":"A. Apostolico, C. Iliopoulos, G. M. Landau, B. Schieber, and U. Vishkin. Parallel Construction of a Suffix Tree with Applications. Algorithmica, 3:347\u2013365, 1988.","journal-title":"Algorithmica"},{"key":"5_CR4","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1990","unstructured":"T.H. Cormen, C.E. Leiserson, and R.L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, MA, 1990."},{"key":"5_CR5","unstructured":"M. Farach. Optimal Suffix Tree Construction with Large Alphabets. InProc. of the 38th Annual Symposium on the Foundations of Computer Science (FOCS), 1997."},{"issue":"2-3","key":"5_CR6","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0167-6423(95)00003-8","volume":"25","author":"R. Giegerich","year":"1995","unstructured":"R. Giegerich and S. Kurtz. A Comparison of Imperative and Purely Functional Suffix Tree Constructions. Science of Computer Programming, 25(2-3):187\u2013218, 1995.","journal-title":"Science of Computer Programming"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/PL00009177","volume":"19","author":"R. Giegerich","year":"1997","unstructured":"R. Giegerich and S. Kurtz. From Ukkonen to McCreight and Weiner: A Unifying View of Linear-Time Suffix Tree Constructions. Algorithmica, 19:331\u2013353, 1997.","journal-title":"Algorithmica"},{"key":"5_CR8","series-title":"Report","volume-title":"An \u201cIncrement-by-one\u201d Approach to Suffix Arrays and Trees","author":"D. Gusfield","year":"1990","unstructured":"D. Gusfield. An \u201cIncrement-by-one\u201d Approach to Suffix Arrays and Trees. Report CSE-90-39, Computer Science Division, University of California, Davis, 1990."},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"D. Gusfield. Algorithms on Strings, Trees, and Sequences. Cambridge University Press, 1997.","DOI":"10.1017\/CBO9780511574931"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/B978-0-12-417750-5.50022-1","volume-title":"Proceedings of an International Symposium on the Theory of Machines and Computations","author":"J. Hopcroft","year":"1971","unstructured":"J. Hopcroft. An O(n log n) Algorithmfor Minimizing States in a Finite Automaton. In Proceedings of an International Symposium on the Theory of Machines and Computations, pages 189\u2013196. Academic Press, New York, 1971."},{"issue":"6","key":"5_CR11","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1002\/spe.4380100608","volume":"10","author":"R.N. Horspool","year":"1980","unstructured":"R.N. Horspool. Practical Fast Searching in Strings. Software\u2014Practice and Experience, 10(6):501\u2013506, 1980.","journal-title":"Software\u2014Practice and Experience"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"S. Kurtz. Reducing the Space Requirement of Suffix Trees. Software\u2014Practice and Experience, 1999. Accepted for publication.","DOI":"10.1002\/(SICI)1097-024X(199911)29:13<1149::AID-SPE274>3.0.CO;2-O"},{"issue":"5","key":"5_CR13","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U. Manber","year":"1993","unstructured":"U. Manber and E.W. Myers. Suffix Arrays: A New Method for On-Line String Searches. SIAM Journal on Computing, 22(5):935\u2013948, 1993.","journal-title":"SIAM Journal on Computing"},{"issue":"13","key":"5_CR14","doi-asserted-by":"publisher","first-page":"4629","DOI":"10.1093\/nar\/11.13.4629","volume":"11","author":"H.M. Martinez","year":"1983","unstructured":"H.M. Martinez. An Efficient Method for Finding Repeats in Molecular Sequences. Nucleic Acids Res., 11(13):4629\u20134634, 1983.","journal-title":"Nucleic Acids Res."},{"issue":"2","key":"5_CR15","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E.M. McCreight","year":"1976","unstructured":"E.M. McCreight. A Space-Economical Suffix Tree Construction Algorithm. Journal of the ACM, 23(2):262\u2013272, 1976.","journal-title":"Journal of the ACM"},{"key":"5_CR16","unstructured":"S. S. Skiena. Who is Interested in Algorithms and Why? Lessons from the Stony Brook Algorithms Repository. In Proceedings of the 2nd Workshop on Algorithm Engineering (WAE), pages 204\u2013212, 1998."},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"E. Ukkonen. On-line Construction of Suffix-Trees. Algorithmica, 14(3), 1995.","DOI":"10.1007\/BF01206331"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"P. Weiner. Linear Pattern Matching Algorithms. In Proceedings of the 14th IEEE Annual Symposium on Switching and Automata Theory, pages 1\u201311, The University of Iowa, 1973.","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Lecture Notes in Computer Science","Algorithm Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48318-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T09:04:54Z","timestamp":1587805494000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48318-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540664277","9783540483182"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-48318-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"27 July 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}