{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:45:57Z","timestamp":1742928357791,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642172977"},{"type":"electronic","value":"9783642172984"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17298-4_80","type":"book-chapter","created":{"date-parts":[[2010,11,22]],"date-time":"2010-11-22T10:06:28Z","timestamp":1290420388000},"page":"711-715","source":"Crossref","is-referenced-by-count":0,"title":["Toward Optimal Disk Layout of Genome Scale Suffix Trees"],"prefix":"10.1007","author":[{"given":"Vikas K.","family":"Garg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"80_CR1","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 Computational Biology. Cambridge University Press, Cambridge (1997)"},{"key":"80_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/11602569_8","volume-title":"High Performance Computing \u2013 HiPC 2005","author":"S.J. Bedathur","year":"2005","unstructured":"Bedathur, S.J., Haritsa, J.R.: Search- Optimized Suffix- Tree Storage for Biological Applications. In: Bader, D.A., Parashar, M., Sridhar, V., Prasanna, V.K. (eds.) HiPC 2005. LNCS, vol.\u00a03769, pp. 29\u201339. Springer, Heidelberg (2005)"},{"key":"80_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-540-75530-2_17","volume-title":"String Processing and Information Retrieval","author":"P. Ko","year":"2007","unstructured":"Ko, P., Aluru, S.: Optimal self-adjusting trees for dynamic string data in secondary storage. In: Ziviani, N., Baeza-Yates, R. (eds.) SPIRE 2007. LNCS, vol.\u00a04726, pp. 184\u2013194. Springer, Heidelberg (2007)"},{"issue":"6","key":"80_CR4","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1145\/1217856.1217858","volume":"53","author":"J. K\u00e4rkk\u00e4inen","year":"2006","unstructured":"K\u00e4rkk\u00e4inen, J., Sanders, P., Burkhardt, S.: Linear work suffix array construction. JACM\u00a053(6), 918\u2013936 (2006)","journal-title":"JACM"},{"issue":"1","key":"80_CR5","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S1570-8667(03)00065-0","volume":"2","author":"M.I. Abouelhoda","year":"2004","unstructured":"Abouelhoda, M.I., Kurtz, S., Ohlebusch, E.: Replacing suffix trees with enhanced suffix arrays. J. Discrete Algorithms\u00a02(1), 53\u201386 (2004)","journal-title":"J. Discrete Algorithms"},{"key":"80_CR6","first-page":"12","volume":"3.4","author":"R. Dementiev","year":"2008","unstructured":"Dementiev, R., K\u00e4rkk\u00e4inen, J., Mehnert, J., Sanders, P.: Better external memory suffix array construction. ACM Journal of Experimental Algorithmics\u00a03.4, 12 (2008)","journal-title":"ACM Journal of Experimental Algorithmics"}],"container-title":["Lecture Notes in Computer Science","Simulated Evolution and Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17298-4_80","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T19:16:24Z","timestamp":1558293384000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17298-4_80"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642172977","9783642172984"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17298-4_80","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}