{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:27:02Z","timestamp":1740101222078,"version":"3.37.3"},"reference-count":13,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,12,6]],"date-time":"2022-12-06T00:00:00Z","timestamp":1670284800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,12,6]],"date-time":"2022-12-06T00:00:00Z","timestamp":1670284800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,12,6]]},"DOI":"10.1109\/bibm55620.2022.9995057","type":"proceedings-article","created":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T19:09:24Z","timestamp":1672686564000},"page":"736-739","source":"Crossref","is-referenced-by-count":1,"title":["Memory\u2013Efficient FM-Index Construction for Reference Genomes"],"prefix":"10.1109","author":[{"given":"Arghya Kusum","family":"Das","sequence":"first","affiliation":[{"name":"University of Alaska Fairbanks,Dept. of Computer Science,Fairbanks,AK,USA"}]},{"given":"M. Oguzhan","family":"Kulekci","sequence":"additional","affiliation":[{"name":"Indiana University Bloomington,Dept. of Computer Science,Bloomington,IN,USA"}]},{"given":"Sharma V.","family":"Thankachan","sequence":"additional","affiliation":[{"name":"North Carolina State University,Dept. of Computer Science,Raleigh,NC,USA"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1038\/nmeth.1923"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btp324"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1038\/s41587-019-0201-4"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bts635"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2000.892127"},{"key":"ref6","article-title":"A block-sorting lossless data compression algorithm","volume-title":"Digital SRC Research Report","author":"Burrows","year":"1994"},{"key":"ref7","first-page":"13:1","article-title":"Fm-index reveals the reverse suffix array","volume-title":"31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020","volume":"161","author":"Ganguly"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2017.04.001"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-011-9535-0"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45061-0_73"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2013.07.004"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03784-9_1"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07959-2_28"}],"event":{"name":"2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","start":{"date-parts":[[2022,12,6]]},"location":"Las Vegas, NV, USA","end":{"date-parts":[[2022,12,8]]}},"container-title":["2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9994793\/9994847\/09995057.pdf?arnumber=9995057","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T12:40:02Z","timestamp":1706791202000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9995057\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,6]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/bibm55620.2022.9995057","relation":{},"subject":[],"published":{"date-parts":[[2022,12,6]]}}}