{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T05:48:17Z","timestamp":1763790497946,"version":"3.45.0"},"reference-count":15,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T00:00:00Z","timestamp":1761523200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T00:00:00Z","timestamp":1761523200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,10,27]]},"DOI":"10.1109\/isncc66965.2025.11250379","type":"proceedings-article","created":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T18:39:45Z","timestamp":1763750385000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["Benchmarking Motif Discovery Algorithms"],"prefix":"10.1109","author":[{"given":"Yudeep","family":"Rajbhandari","sequence":"first","affiliation":[{"name":"Baylor University,Department of Computer Science,Waco,TX,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sakshi","family":"Shrestha","sequence":"additional","affiliation":[{"name":"Tennessee State University,Department of Computing East,Johnson City,TN,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rokin","family":"Maharjan","sequence":"additional","affiliation":[{"name":"Baylor University,Department of Computer Science,Waco,TX,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shehenaz","family":"Shaik","sequence":"additional","affiliation":[{"name":"Tennessee State University,Department of Computing East,Johnson City,TN,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1093\/bioinformatics\/17.suppl_1.S207"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1093\/nar\/gkl198"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1093\/bioinformatics\/btr189"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1093\/bioinformatics\/btab203"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1038\/nbt1053"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1186\/gb-2007-8-2-r24"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1186\/1471-2105-8-S7-S21"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1016\/j.gpb.2013.05.001"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1093\/nar\/gkab1113"},{"key":"ref10","first-page":"130","article-title":"Review of different sequence motif finding algorithms","volume":"11","author":"Hashim","year":"2019","journal-title":"Avicenna Journal of Medical Biotechnology"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1109\/SoutheastCon52093.2024.10500205"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1093\/bioinformatics\/btu093"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1093\/bioinformatics\/btr261"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1093\/bioinformatics\/btq033"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1093\/bioinformatics\/btp163"}],"event":{"name":"2025 International Symposium on Networks, Computers and Communications (ISNCC)","start":{"date-parts":[[2025,10,27]]},"location":"Paris, France","end":{"date-parts":[[2025,10,29]]}},"container-title":["2025 International Symposium on Networks, Computers and Communications (ISNCC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11250373\/11250375\/11250379.pdf?arnumber=11250379","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T05:43:28Z","timestamp":1763790208000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11250379\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,27]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isncc66965.2025.11250379","relation":{},"subject":[],"published":{"date-parts":[[2025,10,27]]}}}