<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-06-03T20:35:50Z</responseDate><request verb="GetRecord" identifier="oai:riuma.uma.es:10630/36202" metadataPrefix="qdc">https://riuma.uma.es/rest/oai/request</request><GetRecord><record><header><identifier>oai:riuma.uma.es:10630/36202</identifier><datestamp>2026-02-03T10:57:27Z</datestamp><setSpec>com_10630_2254</setSpec><setSpec>col_10630_37953</setSpec></header><metadata><qdc:qualifieddc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:doc="http://www.lyncode.com/xoai" xmlns:qdc="http://dspace.org/qualifieddc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://purl.org/dc/elements/1.1/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dc.xsd http://purl.org/dc/terms/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dcterms.xsd http://dspace.org/qualifieddc/ http://www.ukoln.ac.uk/metadata/dcmi/xmlschema/qualifieddc.xsd">
   <dc:title>SeqMatcher: efficient genome sequence matching with AVX-512 extensions</dc:title>
   <dc:creator>Espinosa, Elena</dc:creator>
   <dc:creator>Quislant-del-Barrio, Ricardo</dc:creator>
   <dc:creator>Larrosa-Jiménez, Rafael</dc:creator>
   <dc:creator>Plata-González, Óscar Guillermo</dc:creator>
   <dc:subject>Algoritmos computacionales</dc:subject>
   <dc:subject>Arquitectura de ordenadores</dc:subject>
   <dcterms:abstract>The recent emergence of long-read sequencing technologies has enabled substan-&#xd;
tial improvements in accuracy and reduced computational costs. Nonetheless, pair-&#xd;
wise sequence alignment remains a time-consuming step in common bioinformat-&#xd;
ics pipelines, becoming a bottleneck in de novo whole-genome assembly. Speeding&#xd;
up this step requires heuristics and the development of memory-frugal and efficient&#xd;
implementations. A promising candidate for all of the above is Myers’ algorithm.&#xd;
However, the state-of-the-art implementations face scalability challenges when deal-&#xd;
ing with longer reads and large datasets. To address these challenges, we propose&#xd;
SeqMatcher, a fast and memory-frugal genomics sequence aligner. By leveraging&#xd;
the long registers of AVX-512, SeqMatcher reduces the data movement and memory&#xd;
footprint. In a comprehensive performance evaluation, SeqMatcher achieves speed-&#xd;
ups of up to 12.32x for the unbanded version and 26.70x for the banded version&#xd;
compared to the non-vectorized implementation, along with energy footprint reduc-&#xd;
tions of up to 2.59x. It also outperforms state-of-the-art implementations by factors&#xd;
of up to 29.21x, 17.56x, 13.47x, 9.12x, and 8.81x compared to Edlib, WFA2-lib,&#xd;
SeqAn, BSAlign, and QuickEd, while improving energy consumption with reduc-&#xd;
tions of up to 6.78x</dcterms:abstract>
   <dcterms:dateAccepted>2025-01-13T11:31:14Z</dcterms:dateAccepted>
   <dcterms:available>2025-01-13T11:31:14Z</dcterms:available>
   <dcterms:created>2025-01-13T11:31:14Z</dcterms:created>
   <dcterms:issued>2024-12</dcterms:issued>
   <dc:type>journal article</dc:type>
   <dc:identifier>Espinosa, E., Quislant, R., Larrosa, R. et al. SeqMatcher: efficient genome sequence matching with AVX-512 extensions. J Supercomput 81, 355 (2025). https://doi.org/10.1007/s11227-024-06789-0</dc:identifier>
   <dc:identifier>https://hdl.handle.net/10630/36202</dc:identifier>
   <dc:identifier>10.1007/s11227-024-06789-0</dc:identifier>
   <dc:language>eng</dc:language>
   <dc:rights>http://creativecommons.org/licenses/by/4.0/</dc:rights>
   <dc:rights>open access</dc:rights>
   <dc:rights>Atribución 4.0 Internacional</dc:rights>
   <dc:publisher>Springer Nature</dc:publisher>
</qdc:qualifieddc>
</metadata></record></GetRecord></OAI-PMH>