Motivation Graph pangenomics and long-read sequencing hold the promise of integrating read mapping with variant calling. A pangenome encodes a reference that incorporates evolutionary events in a population, such as recombinations among haplotypes. In particular variation graphs, a special class of graph pangenomes, are able to more accurately represent the variants across multiple genomes. On the other hand, a single long read can provide strong evidence for certain variants, not only single nucleotide variants (SNVs) but also larger or more complex variations that are difficult to detect with short reads [1]. To fully realize this potential, we need to extend classical sequence-to-graph alignment algorithms to account for recombination events among haplotypes in variation graphs while maintaining practical efficiency. Results By leveraging an A* approach, we develop RecAlign: an accurate and fast sequence-to-graph aligner against a variation graph that is able to manage efficiently two or more recombinations. When integrated into a chain-and-extend framework, RecAlign is currently the only recombination-aware tool that can be used to align long reads against chromosome-wide pangenome graphs in practice. Availability Our implementation is open source and available at https://github.com/AlgoLab/RecGraph/tree/a_star.

Monti, D., Riccardi, B., Sirén, J., Bonizzoni, P., Della Vedova, G., Rizzi, R. (2026). Faster and accurate recombination-aware sequence-to-graph aligner. BMC BIOINFORMATICS [10.1186/s12859-026-06640-8].

Faster and accurate recombination-aware sequence-to-graph aligner

Monti, Davide Cesare;Riccardi, Brian;Bonizzoni, Paola;Della Vedova, Gianluca;Rizzi, Raffaella
2026

Abstract

Motivation Graph pangenomics and long-read sequencing hold the promise of integrating read mapping with variant calling. A pangenome encodes a reference that incorporates evolutionary events in a population, such as recombinations among haplotypes. In particular variation graphs, a special class of graph pangenomes, are able to more accurately represent the variants across multiple genomes. On the other hand, a single long read can provide strong evidence for certain variants, not only single nucleotide variants (SNVs) but also larger or more complex variations that are difficult to detect with short reads [1]. To fully realize this potential, we need to extend classical sequence-to-graph alignment algorithms to account for recombination events among haplotypes in variation graphs while maintaining practical efficiency. Results By leveraging an A* approach, we develop RecAlign: an accurate and fast sequence-to-graph aligner against a variation graph that is able to manage efficiently two or more recombinations. When integrated into a chain-and-extend framework, RecAlign is currently the only recombination-aware tool that can be used to align long reads against chromosome-wide pangenome graphs in practice. Availability Our implementation is open source and available at https://github.com/AlgoLab/RecGraph/tree/a_star.
Articolo in rivista - Articolo scientifico
Computational graph pangenomics; Variation graphs; Sequence-to-graph alignment; A*; Recombinations
English
28-set-2026
2026
none
Monti, D., Riccardi, B., Sirén, J., Bonizzoni, P., Della Vedova, G., Rizzi, R. (2026). Faster and accurate recombination-aware sequence-to-graph aligner. BMC BIOINFORMATICS [10.1186/s12859-026-06640-8].
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10281/627405
Citazioni
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
Social impact