{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:09:56Z","timestamp":1760202596263,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642020070"},{"type":"electronic","value":"9783642020087"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02008-7_9","type":"book-chapter","created":{"date-parts":[[2009,5,13]],"date-time":"2009-05-13T17:28:14Z","timestamp":1242235694000},"page":"121-137","source":"Crossref","is-referenced-by-count":23,"title":["Storage and Retrieval of Individual Genomes"],"prefix":"10.1007","author":[{"given":"Veli","family":"M\u00e4kinen","sequence":"first","affiliation":[]},{"given":"Gonzalo","family":"Navarro","sequence":"additional","affiliation":[]},{"given":"Jouni","family":"Sir\u00e9n","sequence":"additional","affiliation":[]},{"given":"Niko","family":"V\u00e4lim\u00e4ki","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"Blanford, D., Blelloch, G.: Compact representations of ordered sets. In: Proc. 15th SODA, pp. 11\u201319 (2004)"},{"key":"9_CR2","unstructured":"Burrows, M., Wheeler, D.: A block sorting lossless data compression algorithm. Technical Report Technical Report 124, Digital Equipment Corporation (1994)"},{"issue":"1","key":"9_CR3","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1038\/scientificamerican0106-46","volume":"294","author":"G.M. Church","year":"2006","unstructured":"Church, G.M.: Genomes for all. Scientific American\u00a0294(1), 47\u201354 (2006)","journal-title":"Scientific American"},{"issue":"4","key":"9_CR4","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1145\/1082036.1082039","volume":"52","author":"P. Ferragina","year":"2005","unstructured":"Ferragina, P., Manzini, G.: Indexing compressed texts. Journal of the ACM\u00a052(4), 552\u2013581 (2005)","journal-title":"Journal of the ACM"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Ferragina, P., Manzini, G., M\u00e4kinen, V., Navarro, G.: Compressed representations of sequences and full-text indexes. ACM Transactions on Algorithms (TALG)\u00a03(2) article 20 (2007)","DOI":"10.1145\/1240233.1240243"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-540-69068-9_16","volume-title":"Combinatorial Pattern Matching","author":"J. Fischer","year":"2008","unstructured":"Fischer, J., M\u00e4kinen, V., Navarro, G.: An(other) entropy-bounded compressed suffix tree. In: Ferragina, P., Landau, G.M. (eds.) CPM 2008. LNCS, vol.\u00a05029, pp. 152\u2013165. Springer, Heidelberg (2008)"},{"issue":"2","key":"9_CR7","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1137\/S0097539702402354","volume":"35","author":"R. Grossi","year":"2006","unstructured":"Grossi, R., Vitter, J.: Compressed suffix arrays and suffix trees with applications to text indexing and string matching. SIAM Journal on Computing\u00a035(2), 378\u2013407 (2006)","journal-title":"SIAM Journal on Computing"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Gupta, A., Hon, W.-K., Shah, R., Vitter, J.S.: Compressed data structures: Dictionaries and data-aware measures. In: DCC 2006: Proceedings of the Data Compression Conference (DCC 2006), pp. 213\u2013222 (2006)","DOI":"10.1109\/DCC.2006.12"},{"key":"9_CR9","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":"9_CR10","doi-asserted-by":"publisher","first-page":"1518","DOI":"10.1242\/jeb.001370","volume":"209","author":"N. Hall","year":"2007","unstructured":"Hall, N.: Advanced sequencing technologies and their wider impact in microbiology. The Journal of Experimental Biology\u00a0209, 1518\u20131525 (2007)","journal-title":"The Journal of Experimental Biology"},{"key":"9_CR11","volume-title":"Handbook of Data Structures and Applications","author":"H. Kaplan","year":"2005","unstructured":"Kaplan, H.: Persistent Data Structures. In: Mehta, D.P., Sahni, S. (eds.) Handbook of Data Structures and Applications, vol.\u00a031. Chapman & Hall, Boca Raton (2005)"},{"issue":"1","key":"9_CR12","first-page":"40","volume":"12","author":"V. M\u00e4kinen","year":"2005","unstructured":"M\u00e4kinen, V., Navarro, G.: Succinct suffix arrays based on run-length encoding. Nordic Journal of Computing\u00a012(1), 40\u201366 (2005)","journal-title":"Nordic Journal of Computing"},{"issue":"5","key":"9_CR13","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U. Manber","year":"1993","unstructured":"Manber, U., Myers, G.: Suffix arrays: a new method for on-line string searches. SIAM J. Comput.\u00a022(5), 935\u2013948 (1993)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"9_CR14","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1145\/382780.382782","volume":"48","author":"G. Manzini","year":"2001","unstructured":"Manzini, G.: An analysis of the Burrows-Wheeler transform. Journal of the ACM\u00a048(3), 407\u2013430 (2001)","journal-title":"Journal of the ACM"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Navarro, G., M\u00e4kinen, V.: Compressed full-text indexes. ACM Computing Surveys\u00a039(1) article 2 (2007)","DOI":"10.1145\/1216370.1216372"},{"key":"9_CR16","unstructured":"Overmars, M.H.: Searching in the past, i. Technical Report Technical Report RUU-CS-81-7, Department of Computer Science, University of Utrecht, Utrecht, Netherlands (1981)"},{"key":"9_CR17","doi-asserted-by":"publisher","first-page":"1842","DOI":"10.1126\/science.318.5858.1842","volume":"21","author":"E. Pennisi","year":"2007","unstructured":"Pennisi, E.: Breakthrough of the year: Human genetic variation. Science\u00a021, 1842\u20131843 (2007)","journal-title":"Science"},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-540-69068-9_19","volume-title":"Combinatorial Pattern Matching","author":"L. Russo","year":"2008","unstructured":"Russo, L., Navarro, G., Oliveira, A.: Dynamic fully-compressed suffix trees. In: Ferragina, P., Landau, G.M. (eds.) CPM 2008. LNCS, vol.\u00a05029, pp. 191\u2013203. Springer, Heidelberg (2008)"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/978-3-540-78773-0_32","volume-title":"LATIN 2008: Theoretical Informatics","author":"L. Russo","year":"2008","unstructured":"Russo, L., Navarro, G., Oliveira, A.: Fully-compressed suffix trees. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol.\u00a04957, pp. 362\u2013373. Springer, Heidelberg (2008)"},{"issue":"2","key":"9_CR20","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1016\/S0196-6774(03)00087-7","volume":"48","author":"K. Sadakane","year":"2003","unstructured":"Sadakane, K.: New text indexing functionalities of the compressed suffix arrays. Journal of Algorithms\u00a048(2), 294\u2013313 (2003)","journal-title":"Journal of Algorithms"},{"issue":"4","key":"9_CR21","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/s00224-006-1198-x","volume":"41","author":"K. Sadakane","year":"2007","unstructured":"Sadakane, K.: Compressed suffix trees with full functionality. Theory of Computing Systems\u00a041(4), 589\u2013607 (2007)","journal-title":"Theory of Computing Systems"},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1007\/978-3-540-89097-3_17","volume-title":"SPIRE 2008","author":"J. Sir\u00e9n","year":"2008","unstructured":"Sir\u00e9n, J., V\u00e4lim\u00e4ki, N., M\u00e4kinen, V., Navarro, G.: Run-length compressed indexes are superior for highly repetitive sequence collections. In: Amir, A., Turpin, A., Moffat, A. (eds.) SPIRE 2008. LNCS, vol.\u00a05280, pp. 164\u2013175. Springer, Heidelberg (2008)"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Waterman, M.S.: Introduction to Computational Biology. Chapman & Hall, University Press (1995)","DOI":"10.1007\/978-1-4899-6846-3_1"}],"container-title":["Lecture Notes in Computer Science","Research in Computational Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02008-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,9]],"date-time":"2025-02-09T11:33:59Z","timestamp":1739100839000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02008-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642020070","9783642020087"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02008-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}