{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:29:00Z","timestamp":1761611340360},"reference-count":22,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1109\/bigdata.2013.6691757","type":"proceedings-article","created":{"date-parts":[[2014,1,3]],"date-time":"2014-01-03T14:11:49Z","timestamp":1388758309000},"page":"43-50","source":"Crossref","is-referenced-by-count":6,"title":["Parallel and memory-efficient Burrows-Wheeler transform"],"prefix":"10.1109","author":[{"given":"Shinya","family":"Hayashi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenjiro","family":"Taura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44471-9_10"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40450-4_15"},{"key":"17","first-page":"1209","article-title":"On economic construction of the transitive closure of a directed graph","author":"arlazarov","year":"1975","journal-title":"Sov Math Dokl"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1996.0107"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00080-6"},{"key":"16","first-page":"360","article-title":"Fast algorithms for sorting and searching strings","author":"bentley","year":"1997","journal-title":"Proc 5th ACM-SIAM Sympos Discrete Algorithms"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-36183-1_39"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1145\/1217856.1217858"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2009.42"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/1996092.1996104"},{"year":"0","key":"21"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.07.018"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324234"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2000.892127"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1137\/0222058"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-006-1228-8"},{"key":"7","article-title":"A block sorting lossless data compression algorithm","author":"burrows","year":"1994","journal-title":"Tech Rep"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/1216370.1216372"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-011-9535-0"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03784-9_9"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2005.12.943"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34109-0_18"}],"event":{"name":"2013 IEEE International Conference on Big Data","start":{"date-parts":[[2013,10,6]]},"location":"Silicon Valley, CA, USA","end":{"date-parts":[[2013,10,9]]}},"container-title":["2013 IEEE International Conference on Big Data"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6679357\/6690588\/06691757.pdf?arnumber=6691757","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T20:44:48Z","timestamp":1490215488000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6691757\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/bigdata.2013.6691757","relation":{},"subject":[],"published":{"date-parts":[[2013,10]]}}}