{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:15:34Z","timestamp":1730272534839,"version":"3.28.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,5]]},"DOI":"10.1109\/iscas.2013.6572237","type":"proceedings-article","created":{"date-parts":[[2013,8,14]],"date-time":"2013-08-14T15:40:23Z","timestamp":1376494823000},"page":"1897-1900","source":"Crossref","is-referenced-by-count":1,"title":["A study of the partitioned dynamic programming algorithm for genome comparison in FPGA"],"prefix":"10.1109","author":[{"family":"Yuanqi Hu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pantelis","family":"Georgiou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/5.18626"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931"},{"key":"15","first-page":"1209","article-title":"On the economic construction of the transitive closure of a direct graph","volume":"194","author":"arlazarov","year":"1970","journal-title":"Doklady Akademii Nauk"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2012.6271545"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2006.13.296"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/18.3.440"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1145\/216585.216588"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2006.11.001"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1016\/j.tig.2007.12.006"},{"key":"2","article-title":"The race for the $ 1000 genome","volume":"311","author":"church","year":"2006","journal-title":"Science"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1038\/nbt1486"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/1562764.1562783"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/375360.375365"},{"journal-title":"Computability of Models for Sequence Assembly","year":"0","author":"medvedev","key":"6"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1038\/jhg.2011.62"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ygeno.2010.03.001"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1145\/1082036.1082039"},{"journal-title":"A block sorting lossless data compression algorithm","year":"1994","author":"burrows","key":"8"}],"event":{"name":"2013 IEEE International Symposium on Circuits and Systems (ISCAS)","start":{"date-parts":[[2013,5,19]]},"location":"Beijing","end":{"date-parts":[[2013,5,23]]}},"container-title":["2013 IEEE International Symposium on Circuits and Systems (ISCAS2013)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6560459\/6571764\/06572237.pdf?arnumber=6572237","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T21:05:27Z","timestamp":1490216727000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6572237\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/iscas.2013.6572237","relation":{},"subject":[],"published":{"date-parts":[[2013,5]]}}}