{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T06:59:59Z","timestamp":1766127599970,"version":"3.48.0"},"reference-count":34,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100000646","name":"Japan Society for the Promotion of Science (JSPS) KAKENHI","doi-asserted-by":"publisher","award":["22H00532"],"award-info":[{"award-number":["22H00532"]}],"id":[{"id":"10.13039\/501100000646","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000646","name":"Japan Society for the Promotion of Science (JSPS) KAKENHI","doi-asserted-by":"publisher","award":["22K19830"],"award-info":[{"award-number":["22K19830"]}],"id":[{"id":"10.13039\/501100000646","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/access.2025.3639297","type":"journal-article","created":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T18:49:26Z","timestamp":1764701366000},"page":"210089-210101","source":"Crossref","is-referenced-by-count":0,"title":["Computing Hamming Distance and Levenshtein Distance Using ReLU Neural Networks"],"prefix":"10.1109","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-7354-4816","authenticated-orcid":false,"given":"Masahiro","family":"Ohtomo","sequence":"first","affiliation":[{"name":"Bioinformatics Center, Institute for Chemical Research, Kyoto University, Kyoto, Japan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9061-7949","authenticated-orcid":false,"given":"Atsuhiro","family":"Takasu","sequence":"additional","affiliation":[{"name":"National Institute of Informatics, Tokyo, Japan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9763-797X","authenticated-orcid":false,"given":"Tatsuya","family":"Akutsu","sequence":"additional","affiliation":[{"name":"Bioinformatics Center, Institute for Chemical Research, Kyoto University, Kyoto, Japan"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1950.tb00463.x"},{"issue":"8","key":"ref2","first-page":"707","article-title":"Binary codes capable of correcting deletions, insertions, and reversals","volume":"10","author":"Levenshtein","year":"1966","journal-title":"Sov. Phys. Dokl"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/321796.321811"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2836(70)90057-4"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2836(81)90087-5"},{"key":"ref6","article-title":"Differentiable dynamic programming for structured prediction and attention","author":"Mensch","year":"2018","journal-title":"arXiv:1802.03676"},{"key":"ref7","article-title":"Neural string edit distance","author":"Libovick\u00fc","year":"2021","journal-title":"arXiv:2104.08388"},{"key":"ref8","article-title":"Protein structural alignment from sequence","author":"Morton","year":"2020","journal-title":"BioRxiv"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1038\/s41592-022-01700-2"},{"key":"ref10","article-title":"Learning protein sequence embeddings using information from structure","author":"Bepler","year":"2019","journal-title":"arXiv:1902.08661"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1706.03762"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btac724"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401045"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/15m1053128"},{"key":"ref15","first-page":"315","article-title":"Deep sparse rectifier neural networks","volume-title":"Proc. AISTATS","author":"Glorot"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2022.06.111"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1162\/neco_a_01486"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-003-1028-3"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/367766.368168"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/321105.321107"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS57990.2023.00135"},{"key":"ref22","article-title":"Adam: A method for stochastic optimization","author":"Kingma","year":"2014","journal-title":"arXiv:1412.6980"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-023-28639-4"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.3390\/en16031434"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330701"},{"key":"ref26","first-page":"155","article-title":"Support vector regression machine","volume-title":"Proc. NIPS","author":"Harris"},{"issue":"1","key":"ref27","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","article-title":"Regression shrinkage and selection via the lasso","volume":"58","author":"Rovert","year":"1996","journal-title":"J. Roy. Stat. Soc. Ser. B, Stat. Methodol."},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1038\/323533a0"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"key":"ref30","first-page":"501","article-title":"Ann models optimized using swarm intelligence algorithms","volume":"13","author":"Kayarbizhy","year":"2014","journal-title":"WSEAS Trans. Comput."},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.3390\/s20195609"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.11114\/aef.v8i3.5195"},{"volume-title":"ChatGPT-3.5 Turbo","year":"2023","key":"ref33"},{"volume-title":"ChatGPT-5","year":"2025","key":"ref34"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10820123\/11272136.pdf?arnumber=11272136","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T06:57:21Z","timestamp":1766127441000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11272136\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/access.2025.3639297","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2025]]}}}