{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:17:32Z","timestamp":1760203052069,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319460482"},{"type":"electronic","value":"9783319460499"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","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-3-319-46049-9_10","type":"book-chapter","created":{"date-parts":[[2016,9,20]],"date-time":"2016-09-20T11:02:06Z","timestamp":1474369326000},"page":"97-109","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fragmented BWT: An Extended BWT for Full-Text Indexing"],"prefix":"10.1007","author":[{"given":"Masaru","family":"Ito","sequence":"first","affiliation":[]},{"given":"Hiroshi","family":"Inoue","sequence":"additional","affiliation":[]},{"given":"Kenjiro","family":"Taura","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,21]]},"reference":[{"key":"10_CR1","unstructured":"Burrows, M., Wheeler, D.: A block-sorting lossless data compression algorithm. Algorithm Data Compression (124), p. 18 (1994)"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Claude, F., Navarro, G.: The wavelet matrix. In: SPIRE, pp. 167\u2013179 (2012)","DOI":"10.1007\/978-3-642-34109-0_18"},{"issue":"4","key":"10_CR3","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1145\/1082036.1082039","volume":"52","author":"P Ferragina","year":"2000","unstructured":"Ferragina, P., Manzini, G.: Indexing compressed text. J. ACM 52(4), 552\u2013581 (2000)","journal-title":"J. ACM"},{"issue":"2","key":"10_CR4","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/1240233.1240243","volume":"3","author":"P Ferragina","year":"2007","unstructured":"Ferragina, P., Manzini, G., M\u00e4kinen, V., Navarro, G.: Compressed representations of sequences and full-text indexes. ACM Trans. Algorithms 3(2), 20 (2007)","journal-title":"ACM Trans. Algorithms"},{"key":"10_CR5","unstructured":"Grossi, R., Gupta, A., Vitter, S.: High-order entropy-compressed text indexes. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 841\u2013850 (2003)"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Hayashi, S., Taura, K.: Parallel and memory-efficient Burrows-Wheeler transform. In: Proceedings - 2013 IEEE International Conference on Big Data, pp. 43\u201350 (2013)","DOI":"10.1109\/BigData.2013.6691757"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"K\u00e4rkk\u00e4inen, J., Sanders, P.: Simple linear work suffix array construction. In: Colloquium on Automata, Languages and Programming, pp. 943\u2013955 (2003)","DOI":"10.1007\/3-540-45061-0_73"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"K\u00e4rkk\u00e4inen, J., K.D., S., P.: Parallel external memory suffix sorting. In: CPM 2015, pp. 329\u2013342 (2015)","DOI":"10.1007\/978-3-319-19929-0_28"},{"issue":"3","key":"10_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/gb-2009-10-3-r25","volume":"10","author":"B Langmead","year":"2009","unstructured":"Langmead, B., Trapnell, C., Pop, M., Salzberg, S.: Ultrafast and memory-efficient alignment of short DNA sequences to the human genome. Genome Biol. 10(3), 1 (2009)","journal-title":"Genome Biol."},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"1754","DOI":"10.1093\/bioinformatics\/btp324","volume":"25","author":"H Li","year":"2009","unstructured":"Li, H., Durbin, R.: Fast and accurate short read alignment with Burrows-Wheeler transform. Bioinformatics 25, 1754\u20131760 (2009)","journal-title":"Bioinformatics"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"1966","DOI":"10.1093\/bioinformatics\/btp336","volume":"25","author":"R Li","year":"2009","unstructured":"Li, R., Yu, C., Li, Y., Lam, W., Yiu, M., Kristiansen, K., Wang, J.: SOAP2: an improved ultrafast tool for short read alignment. Bioinformatics 25, 1966\u20131967 (2009)","journal-title":"Bioinformatics"},{"key":"10_CR12","unstructured":"Manber, U., Myers, G.: Suffix string arrays: a new searches method for on-line. In: Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 319\u2013327 (1990)"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Nong, G., Zhang, S., Chan, H.: Linear suffix array construction by almost pure induced-sorting. In: 2009 Data Compression Conference, pp. 193\u2013202 (2009)","DOI":"10.1109\/DCC.2009.42"},{"issue":"2","key":"10_CR14","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. J. Algorithms 48(2), 294\u2013313 (2003)","journal-title":"J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-46049-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T01:12:34Z","timestamp":1558314754000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-46049-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319460482","9783319460499"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-46049-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"21 September 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SPIRE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on String Processing and Information Retrieval","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beppu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 October 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 October 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spire2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}