{"id":4168,"date":"2026-03-11T13:37:57","date_gmt":"2026-03-11T11:37:57","guid":{"rendered":"https:\/\/gaz.i3a.es\/?p=4168"},"modified":"2026-03-11T14:06:34","modified_gmt":"2026-03-11T12:06:34","slug":"singletrack","status":"publish","type":"post","link":"https:\/\/gaz.i3a.es\/es\/singletrack\/","title":{"rendered":"Singletrack"},"content":{"rendered":"
\t\t\t\t
\n\t\t\t\t\t\t\t
  • \n\t\t\t\t\t
    \n\t\t\t
    \n\t\t\t\t

    Repositorios<\/a><\/h3>\n

    Singletrack<\/h1>\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t<\/li>\n\t\t<\/ul>\t\t\t\t
      \n\t\t\t\t\t\t\t\t\t\t\t
    1. <\/a><\/li>\n\t\t\t\t\t\t\t\t\t<\/ol>\n\n\t\t\t\t
      \n\t\t\t\t\t\n\t\t\t\t\t\t<\/em>\n\t\t\t\t\t<\/a>\n\t\t\t\t<\/div>\n\n\t\t\t\t
      \n\t\t\t\t\t\n\t\t\t\t\t\t<\/em>\n\t\t\t\t\t<\/a>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div><\/div><\/div><\/div><\/div><\/div><\/div>\n\n
      \n\t\n\t
      \n\n\t\t
      \n\t\t\t\t\t\t\t

      \n\t\t\t\t\tGo to repository\t\t\t\t<\/h4>\n\t\t\t\n\t\t\t\t\t<\/div>\n\n\t\t
      \n\t\t\t\n\t\t\n\t\t\t\t\t\t\t
      <\/div>\n\t\t\t\t\n\t\t\tGo\t\t<\/span>\n\t\t\t<\/a>\n\t<\/div>\n<\/div>\n\t<\/div>\n\n\t<\/div>\n<\/div><\/div><\/div>
      \n
      \n\t

      This repository contains different implementations of Singletrack, a general technique to reduce memory consumption and improve the performance of gap-affine and dual gap-affine sequence alignment algorithms. This technique was presented on DOI:<\/strong> 10.1101\/2025.10.31.68562<\/a><\/p>\n

       <\/p>\n<\/div>\n<\/div><\/div><\/div><\/div>

      \n
      \n\t

      Advances in DNA sequencing have outpaced advances in computation, making sequence alignment a major bottleneck in genome data analyses. Classical dynamic programming (DP) algorithms are particularly memory-intensive, especially when computing gap-affine and dual gap-affine alignments. Existing strategies to reduce memory consumption often sacrifice speed or alignment accuracy.
      \nWe present Singletrack, an efficient algorithm for backtrace gap-affine and dual gap-affine alignments that requires storing a single DP matrix while preserving optimal alignment results. Compared to classical DP algorithms, Singletrack removes the need to store additional matrices (i.e., 2 for gap-affine and 4 for dual gap-affine), significantly reducing memory consumption and, in turn, reducing pressure on the memory hierarchy and improving overall performance. Most importantly, Singletrack is a general backtrace method compatible with state-of-the-art DP-based algorithms and heuristics, such as the Suzuki-Kasahara (SK) and the Wavefront Alignment (WFA) algorithms. We demonstrate that Singletrack reduces memory consumption for both SK and WFA algorithms, lowering SK usage by 2x and 4x and WFA usage by 3x and 5x for gap-affine and dual gap-affine alignments, respectively. Moreover, replacing KSW2’s memory-reduction technique with Singletrack accelerates its SK implementation by up to 1.4x at the cost of doubling memory consumption, while Singletrack increases the performance of the WFA implementation in WFA2-lib by 1.2–2.1x. Compared to the efficient linear-memory BiWFA algorithm, the Singletrack-accelerated version of WFA trades a practical increase in memory usage for up to 5.2x higher performance.<\/p>\n

      BibTex citation<\/em><\/p>\n

      \n
      \n
      @article{LpezVillellas2025,\n    title = {Singletrack: An Algorithm for Improving Memory Consumption and Performance of Gap-Affine Sequence Alignment},\n    url = {http:\/\/dx.doi.org\/10.1101\/2025.10.31.685625},\n    DOI = {10.1101\/2025.10.31.685625},\n    publisher = {openRxiv},\n    author = {L\u00f3pez-Villellas,  Lori\u00e9n and I\u00f1iguez,  Cristian and Jim\u00e9nez-Blanco,  Albert and Aguado-Puig,  Quim and Moret\u00f3,  Miquel and Alastruey-Bened\u00e9,  Jes\u00fas and Ib\u00e1\u00f1ez,  Pablo and Marco-Sola,  Santiago},\n    year = {2025},\n    month = nov \n}<\/code><\/pre>\n<\/div>\n<\/blockquote>\n<\/div>\n<\/div><\/div><\/div><\/div><\/div>\n\n\n
      <\/p>","protected":false},"excerpt":{"rendered":"","protected":false},"author":3,"featured_media":3636,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[241],"tags":[],"class_list":["post-4168","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-repositories"],"_links":{"self":[{"href":"https:\/\/gaz.i3a.es\/es\/wp-json\/wp\/v2\/posts\/4168","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/gaz.i3a.es\/es\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/gaz.i3a.es\/es\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/gaz.i3a.es\/es\/wp-json\/wp\/v2\/users\/3"}],"replies":[{"embeddable":true,"href":"https:\/\/gaz.i3a.es\/es\/wp-json\/wp\/v2\/comments?post=4168"}],"version-history":[{"count":4,"href":"https:\/\/gaz.i3a.es\/es\/wp-json\/wp\/v2\/posts\/4168\/revisions"}],"predecessor-version":[{"id":4175,"href":"https:\/\/gaz.i3a.es\/es\/wp-json\/wp\/v2\/posts\/4168\/revisions\/4175"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/gaz.i3a.es\/es\/wp-json\/wp\/v2\/media\/3636"}],"wp:attachment":[{"href":"https:\/\/gaz.i3a.es\/es\/wp-json\/wp\/v2\/media?parent=4168"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/gaz.i3a.es\/es\/wp-json\/wp\/v2\/categories?post=4168"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/gaz.i3a.es\/es\/wp-json\/wp\/v2\/tags?post=4168"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}