{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T20:18:53Z","timestamp":1725913133053},"publisher-location":"Singapore","reference-count":11,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811064418"},{"type":"electronic","value":"9789811064425"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-981-10-6442-5_25","type":"book-chapter","created":{"date-parts":[[2017,10,5]],"date-time":"2017-10-05T01:54:47Z","timestamp":1507168487000},"page":"279-289","source":"Crossref","is-referenced-by-count":1,"title":["A Lightweight Algorithm for Computing BWT from Suffix Array in Disk"],"prefix":"10.1007","author":[{"given":"Jing Yi","family":"Xie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Lao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ge","family":"Nong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,6]]},"reference":[{"key":"25_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/978-3-319-02432-5_5","volume-title":"String Processing and Information Retrieval","author":"T Beller","year":"2013","unstructured":"Beller, T., Zwerger, M., Gog, S., Ohlebusch, E.: Space-efficient construction of the burrows-wheeler transform. In: Kurland, O., Lewenstein, M., Porat, E. (eds.) SPIRE 2013. LNCS, vol. 8214, pp. 5\u201316. Springer, Cham (2013). doi:\n10.1007\/978-3-319-02432-5_5"},{"key":"25_CR2","unstructured":"Burrows, M., Wheeler, D.J.: A block-sorting lossless data compression algorithm (1994)"},{"issue":"6","key":"25_CR3","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1002\/spe.844","volume":"38","author":"R Dementiev","year":"2008","unstructured":"Dementiev, R., Kettner, L., Sanders, P.: STXXL: standard template library for XXL data sets. Softw. Pract. Exp. 38(6), 589\u2013638 (2008)","journal-title":"Softw. Pract. Exp."},{"key":"25_CR4","unstructured":"K\u00e4rkk\u00e4inen, J., Kempa, D., et al.: Faster sparse suffix sorting. In: LIPIcs-Leibniz International Proceedings in Informatics, vol. 25. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2014)"},{"issue":"5","key":"25_CR5","doi-asserted-by":"crossref","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. 22(5), 935\u2013948 (1993)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"25_CR6","doi-asserted-by":"crossref","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. J. ACM 48(3), 407\u2013430 (2001)","journal-title":"J. ACM"},{"issue":"1","key":"25_CR7","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1145\/1216370.1216372","volume":"39","author":"G Navarro","year":"2007","unstructured":"Navarro, G., M\u00e4kinen, V.: Compressed full-text indexes. ACM Comput. Surv. 39(1), 2 (2007)","journal-title":"ACM Comput. Surv."},{"issue":"3","key":"25_CR8","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1145\/2699665","volume":"33","author":"G Nong","year":"2015","unstructured":"Nong, G., Chan, W.H., Hu, S.Q., Wu, Y.: Induced sorting suffixes in external memory. ACM Trans. Inf. Syst. 33(3), 12 (2015)","journal-title":"ACM Trans. Inf. Syst."},{"issue":"10","key":"25_CR9","doi-asserted-by":"crossref","first-page":"1471","DOI":"10.1109\/TC.2010.188","volume":"60","author":"G Nong","year":"2011","unstructured":"Nong, G., Zhang, S., Chan, W.H.: Two efficient algorithms for linear time suffix array construction. IEEE Trans. Comput. 60(10), 1471\u20131484 (2011)","journal-title":"IEEE Trans. Comput."},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Weiner, P.: Linear pattern matching algorithms. In: IEEE Conference Record of 14th Annual Symposium on Switching and Automata Theory, 1973. SWAT\u201908, pp. 1\u201311. IEEE (1973)","DOI":"10.1109\/SWAT.1973.13"},{"key":"25_CR11","first-page":"1","volume":"1","author":"Y Wu","year":"2017","unstructured":"Wu, Y., Nong, G., Chan, W.H., Han, L.B.: Checking big suffix and lcp arrays by probabilistic methods. IEEE Trans. Comput. 1, 1 (2017)","journal-title":"IEEE Trans. Comput."}],"container-title":["Communications in Computer and Information Science","Parallel Architecture, Algorithm and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-10-6442-5_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,10,5]],"date-time":"2017-10-05T02:02:13Z","timestamp":1507168933000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-10-6442-5_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9789811064418","9789811064425"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-981-10-6442-5_25","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2017]]}}}