{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T16:31:32Z","timestamp":1742401892888,"version":"3.37.3"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.2969038","type":"journal-article","created":{"date-parts":[[2020,1,23]],"date-time":"2020-01-23T21:16:00Z","timestamp":1579814160000},"page":"23838-23846","source":"Crossref","is-referenced-by-count":24,"title":["Simple and Efficient Pattern Matching Algorithms for Biological Sequences"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0216-9876","authenticated-orcid":false,"given":"Peyman","family":"Neamatollahi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0365-5104","authenticated-orcid":false,"given":"Montassir","family":"Hadi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5550-5565","authenticated-orcid":false,"given":"Mahmoud","family":"Naghibzadeh","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btu678"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2018.05.002"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1109\/TSMCC.2009.2037824","article-title":"Synthesis of structurally simple supervisors enforcing generalized mutual exclusion constraints in Petri Nets","volume":"40","author":"li","year":"2010","journal-title":"IEEE Trans Syst Man Cybern C Appl Rev"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btq364"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0200912"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0163535"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0139301"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1186\/s12859-014-0404-0"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2017.03.005"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-16-S9-S4"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF01185427","article-title":"Speeding up two string-matching algorithms","volume":"12","author":"crochemore","year":"1992","journal-title":"Algorithmica"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2017.03.026"},{"journal-title":"Introduction to Algorithms","year":"2009","author":"cormen","key":"ref27"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2431211.2431212"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2347583.2347591"},{"journal-title":"National Center for Biotechnology Information","year":"2019","key":"ref29"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2914071"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2013.2297113"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2018.2885296"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btt429"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3301295"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2595582"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1186\/s12859-016-1320-2"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s40745-017-0124-1"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/0206024"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/0215007"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/359842.359859"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btp698"},{"journal-title":"Handbook of exact string matching algorithms","year":"2004","author":"charras","key":"ref25"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/08967097.pdf?arnumber=8967097","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:51:10Z","timestamp":1639770670000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8967097\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/access.2020.2969038","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2020]]}}}