{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T21:33:37Z","timestamp":1770845617755,"version":"3.50.1"},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,12,15]],"date-time":"2025-12-15T00:00:00Z","timestamp":1765756800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,12,15]],"date-time":"2025-12-15T00:00:00Z","timestamp":1765756800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key R&D Program of China","doi-asserted-by":"publisher","award":["2024YFF1206202,2024YFC3406303"],"award-info":[{"award-number":["2024YFF1206202,2024YFC3406303"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62472120,62402140"],"award-info":[{"award-number":["62472120,62402140"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,12,15]]},"DOI":"10.1109\/bibm66473.2025.11356559","type":"proceedings-article","created":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T21:19:40Z","timestamp":1769721580000},"page":"578-583","source":"Crossref","is-referenced-by-count":0,"title":["DNAMatch: An Ultra-Fast and Memory-Efficient Deep Learning Framework for Aligning Ultra-Long DNA Fragments"],"prefix":"10.1109","author":[{"given":"Yuansong","family":"Zhu","sequence":"first","affiliation":[{"name":"Harbin Institute of Technology,Faculty of Computing,Harbin,China"}]},{"given":"Chuanmin","family":"Wu","sequence":"additional","affiliation":[{"name":"Harbin Institute of Technology,Faculty of Computing,Harbin,China"}]},{"given":"Yadong","family":"Wang","sequence":"additional","affiliation":[{"name":"Harbin Institute of Technology,Faculty of Computing,Harbin,China"}]},{"given":"Tao","family":"Jiang","sequence":"additional","affiliation":[{"name":"Harbin Institute of Technology,Faculty of Computing,Harbin,China"}]},{"given":"Yadong","family":"Liu","sequence":"additional","affiliation":[{"name":"Harbin Institute of Technology,Faculty of Computing,Harbin,China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tig.2018.05.008"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bty191"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btaa435"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.1009078"},{"key":"ref5","article-title":"Long-read sequencing","author":"Resource","year":"2025","journal-title":"Research at Yale"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1146\/annurev-genom-101722-103045"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btae631"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.1011205"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-025-58439-5"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.findings-emnlp.414"},{"key":"ref11","article-title":"Dnabert2: Efficient foundation model and benchmark for multi-species genome","author":"Zhou","journal-title":"2023"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-024-4466-3"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btae557"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D18-2012"},{"key":"ref16","article-title":"Train short, test long: Attention with linear biases enables input length extrapolation","author":"Press","year":"2021","journal-title":"arXiv"},{"key":"ref17","article-title":"Glu variants improve transformer","author":"Shazeer","year":"2020","journal-title":"arXiv"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1706.03762"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.5555\/3045118.3045167"},{"issue":"1","key":"ref20","first-page":"1929","article-title":"Dropout: a simple way to prevent neural networks from overfitting","volume":"15","author":"Srivastava","year":"2014","journal-title":"J. Mach. Learn. Res."},{"key":"ref21","first-page":"23803","article-title":"Cross-entropy loss functions: Theoretical analysis and applications","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Mao","year":"2023"},{"key":"ref22","article-title":"Adam: A Method for Stochastic Optimization","author":"Kingma","year":"2014","journal-title":"arXiv"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btw286"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1186\/s13059-020-02107-y"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-0716-2293-3_9"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1186\/s13059-025-03642-2"}],"event":{"name":"2025 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","location":"Wuhan, China","start":{"date-parts":[[2025,12,15]]},"end":{"date-parts":[[2025,12,18]]}},"container-title":["2025 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11355913\/11355975\/11356559.pdf?arnumber=11356559","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T20:51:14Z","timestamp":1770843074000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11356559\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,15]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/bibm66473.2025.11356559","relation":{},"subject":[],"published":{"date-parts":[[2025,12,15]]}}}