{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:59:09Z","timestamp":1725487149930},"reference-count":7,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,4]]},"DOI":"10.1109\/ddecs.2009.5012105","type":"proceedings-article","created":{"date-parts":[[2009,6,2]],"date-time":"2009-06-02T20:44:32Z","timestamp":1243975472000},"page":"90-95","source":"Crossref","is-referenced-by-count":0,"title":["Architecture model for approximate palindrome detection"],"prefix":"10.1109","author":[{"given":"Tomas","family":"Martinek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Vozenilek","sequence":"additional","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","article-title":"efficient parallel and serial approximate string matching","author":"landau","year":"1986","journal-title":"Tech Rep Computer Science Department Technical Report #221"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/FPT.2008.4762367"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/DDECS.2008.4538789"},{"key":"6","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":"Field Programmable Logic and Application (FPL 2004)"},{"key":"5","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/978-3-540-45234-8_37","article-title":"a smithwaterman systolic cell","author":"yu","year":"2003","journal-title":"Field Programmable Logic and Application (FPL 2003)"},{"key":"4","article-title":"finding approximate palindromes in strings quickly and simply","author":"allison","year":"2004","journal-title":"CoRR"}],"event":{"name":"2009 12th IEEE International Symposium on Design and Diagnostics of Electronic Circuits & Systems","start":{"date-parts":[[2009,4,15]]},"location":"Liberec","end":{"date-parts":[[2009,4,17]]}},"container-title":["2009 12th International Symposium on Design and Diagnostics of Electronic Circuits & Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4957849\/5012077\/05012105.pdf?arnumber=5012105","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,15]],"date-time":"2019-04-15T22:49:08Z","timestamp":1555368548000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/5012105\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,4]]},"references-count":7,"URL":"https:\/\/doi.org\/10.1109\/ddecs.2009.5012105","relation":{},"subject":[],"published":{"date-parts":[[2009,4]]}}}