{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T17:20:49Z","timestamp":1730222449381,"version":"3.28.0"},"reference-count":10,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,12]]},"DOI":"10.1109\/fpt.2008.4762367","type":"proceedings-article","created":{"date-parts":[[2009,1,29]],"date-time":"2009-01-29T16:34:59Z","timestamp":1233246899000},"page":"65-72","source":"Crossref","is-referenced-by-count":1,"title":["Hardware Acceleration of Approximate Palindromes Searching"],"prefix":"10.1109","author":[{"given":"Tomas","family":"Martinek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matej","family":"Lexa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"3","first-page":"210","article-title":"a modification of the landau-vishkin algorithm computing longest common extensions via suffix arrays","author":"de castro miranda","year":"2005","journal-title":"BSB"},{"key":"2","doi-asserted-by":"crossref","first-page":"1080","DOI":"10.1007\/978-3-540-30117-2_131","article-title":"processing repetitive sequence structures with mismatches at streaming rate","author":"conti","year":"2004","journal-title":"Lecture Notes in Computer Science"},{"key":"10","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/978-3-540-45234-8_37","article-title":"a smith-waterman systolic cell","author":"yu","year":"2003","journal-title":"Field Programmable Logic and Application (FPL 2003)"},{"key":"1","article-title":"finding approximate palindromes in strings quickly and simply","author":"allison","year":"2004","journal-title":"CoRR abs\/cs\/0412004"},{"key":"7","article-title":"efficient parallel and serial approximate string matching","author":"landau","year":"0","journal-title":"Technical Report Computer Science Department Technical"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/29.22.4633"},{"key":"5","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1145\/270563.571472","article-title":"algorithms on stings, trees, and sequences: computer science and computational biology","volume":"28","author":"gusfield","year":"1997","journal-title":"Sigact News"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1145\/800057.808675"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1016\/S0031-3203(01)00179-0"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1007\/s10142-007-0047-6"}],"event":{"name":"2008 International Conference on Field-Programmable Technology","start":{"date-parts":[[2008,12,8]]},"location":"Taipei","end":{"date-parts":[[2008,12,10]]}},"container-title":["2008 International Conference on Field-Programmable Technology"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4740372\/4762340\/04762367.pdf?arnumber=4762367","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,28]],"date-time":"2019-01-28T22:42:19Z","timestamp":1548715339000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/4762367\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,12]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/fpt.2008.4762367","relation":{},"subject":[],"published":{"date-parts":[[2008,12]]}}}