{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:26:15Z","timestamp":1750307175625,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,2,22]],"date-time":"2012-02-22T00:00:00Z","timestamp":1329868800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,2,22]]},"DOI":"10.1145\/2145694.2145740","type":"proceedings-article","created":{"date-parts":[[2012,2,22]],"date-time":"2012-02-22T18:42:35Z","timestamp":1329936155000},"page":"265-265","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Accelerating short read mapping on an FPGA (abstract only)"],"prefix":"10.1145","author":[{"given":"Yupeng","family":"Chen","sequence":"first","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bertil","family":"Schmidt","sequence":"additional","affiliation":[{"name":"Johannes Gutenberg University Mainz, Mainz, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Douglas Leslie","family":"Maskell","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,2,22]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"On economic construction of the transitive closure of a directed graph,\" Dokl Acad Nauk SSSR","author":"Alzarov V. L.","year":"1970","unstructured":"V. L. Alzarov , E. A. Dinic , M. A. Kronrod , and I. A. Faradzev , \" On economic construction of the transitive closure of a directed graph,\" Dokl Acad Nauk SSSR , 1970 . V. L. Alzarov, E. A. Dinic, M. A. Kronrod, and I. A. Faradzev, \"On economic construction of the transitive closure of a directed graph,\" Dokl Acad Nauk SSSR, 1970."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btr151"},{"key":"e_1_3_2_1_3_1","volume-title":"Palo Alto","author":"Burrows M.","year":"1994","unstructured":"M. Burrows , D. J. Wheeler , \" A block sorting lossless data compression algorithm,\" Technical Report 124 , Palo Alto , CA : Digital Equipment Corporation , 1994 . M. Burrows, D. J. Wheeler, \"A block sorting lossless data compression algorithm,\" Technical Report 124, Palo Alto, CA: Digital Equipment Corporation, 1994."},{"key":"e_1_3_2_1_4_1","volume-title":"Opportunistic data structures with applications,\" Proceedings of the 41st Annual Symposium on Foundations of Computer Science","author":"Ferragina P.","year":"2000","unstructured":"P. Ferragina , and G. Manzini , \" Opportunistic data structures with applications,\" Proceedings of the 41st Annual Symposium on Foundations of Computer Science , 2000 . P. Ferragina, and G. Manzini, \"Opportunistic data structures with applications,\" Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000."},{"key":"e_1_3_2_1_5_1","volume-title":"BFast: An alignment tool for large scale genome resequencing,\" PLoS ONE","author":"Homer N.","year":"2009","unstructured":"N. Homer , B. Merriman , and S. F. Nelson , \" BFast: An alignment tool for large scale genome resequencing,\" PLoS ONE , 2009 . N. Homer, B. Merriman, and S. F. Nelson, \"BFast: An alignment tool for large scale genome resequencing,\" PLoS ONE, 2009."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1186\/gb-2009-10-3-r25"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btp352"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1101\/gr.078212.108"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btp324"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btn025"},{"key":"e_1_3_2_1_11_1","volume-title":"an improved ultrafast tool for short read alignment,\" Bioinformatics","author":"Li R.","year":"2009","unstructured":"R. Li , C. Yu , Y. Li , and etc., \"SOAP2 : an improved ultrafast tool for short read alignment,\" Bioinformatics , 2009 . R. Li, C. Yu, Y. Li, and etc., \"SOAP2: an improved ultrafast tool for short read alignment,\" Bioinformatics, 2009."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989370"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btn416"},{"key":"e_1_3_2_1_14_1","first-page":"2011","article-title":"SOAP3: GPU-based compressed indexing and ultra-fast parallel alignment of short reads","author":"Liu C.","year":"2011","unstructured":"C. Liu , TW Lam , T. Wong , and etc. , \" SOAP3: GPU-based compressed indexing and ultra-fast parallel alignment of short reads ,\" MASSIVE 2011 , 2011 . C. Liu, TW Lam, T. Wong, and etc., \"SOAP3: GPU-based compressed indexing and ultra-fast parallel alignment of short reads,\" MASSIVE 2011, 2011.","journal-title":"MASSIVE"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2836(70)90057-4"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btq485"},{"key":"e_1_3_2_1_17_1","volume-title":"SHRiMP: Accurate Mapping of short Color-space Reads,\" PLoS Computational Biology","author":"Rumble S.","year":"2009","unstructured":"S. Rumble , P. Lacroute , A. Dalca , M. Fiume , A. Sidow , and M. Brudno , \" SHRiMP: Accurate Mapping of short Color-space Reads,\" PLoS Computational Biology , 2009 . S. Rumble, P. Lacroute, A. Dalca, M. Fiume, A. Sidow, and M. Brudno, \"SHRiMP: Accurate Mapping of short Color-space Reads,\" PLoS Computational Biology, 2009."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2836(81)90087-5"},{"key":"e_1_3_2_1_19_1","volume-title":"http:\/\/www.illumina.com\/technology\/solexa_technology.ilmn","author":"Illumina","year":"2011","unstructured":"Illumina sequencing-by-synthesis (SBS) technology , http:\/\/www.illumina.com\/technology\/solexa_technology.ilmn , 2011 . Illumina sequencing-by-synthesis (SBS) technology, http:\/\/www.illumina.com\/technology\/solexa_technology.ilmn, 2011."},{"key":"e_1_3_2_1_20_1","unstructured":"High performance computing - supercomputing with Tesla GPUs http:\/\/www.nvidia.com\/object\/tesla_computing_solutions.html.  High performance computing - supercomputing with Tesla GPUs http:\/\/www.nvidia.com\/object\/tesla_computing_solutions.html."},{"key":"e_1_3_2_1_21_1","unstructured":"CUSHAW CUDA compatible short read aligner http:\/\/cushaw.sourceforge.net.  CUSHAW CUDA compatible short read aligner http:\/\/cushaw.sourceforge.net."}],"event":{"name":"FPGA '12: ACM\/SIGDA International Symposium on Field Programmable Gate Arrays","sponsor":["SIGDA ACM Special Interest Group on Design Automation"],"location":"Monterey California USA","acronym":"FPGA '12"},"container-title":["Proceedings of the ACM\/SIGDA international symposium on Field Programmable Gate Arrays"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2145694.2145740","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:54:51Z","timestamp":1750240491000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2145694.2145740"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,22]]},"references-count":21,"alternative-id":["10.1145\/2145694.2145740","10.1145\/2145694"],"URL":"https:\/\/doi.org\/10.1145\/2145694.2145740","relation":{},"subject":[],"published":{"date-parts":[[2012,2,22]]},"assertion":[{"value":"2012-02-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}