Skip to main navigation Skip to search Skip to main content

KegAlign: optimizing pairwise alignments with diagonal partitioning

Research output: Contribution to journalArticlepeer-review

Abstract

Advances in sequencing and assembly allow the creation of thousands of genome assemblies. However, producing multiple alignments required for their analysis lags behind due to the time-consuming process of pairwise alignment, typically performed by the slow but sensitive tool lastZ. Here, we develop KegAlign, an optimized GPU-enabled pairwise aligner. KegAlign employs a novel diagonal partitioning parallelization strategy and leverages advanced GPU features. It can compute a human/mouse alignment in under 6 h on a GPU-containing node without pre-partitioning, maintaining lastZ-level sensitivity crucial for divergent genomes. KegAlign is available as source code, a Conda package, and a user-friendly Galaxy workflow.

Original languageEnglish (US)
Article number389
JournalGenome biology
Volume26
Issue number1
DOIs
StatePublished - Dec 2025

All Science Journal Classification (ASJC) codes

  • Ecology, Evolution, Behavior and Systematics
  • Genetics
  • Cell Biology

Fingerprint

Dive into the research topics of 'KegAlign: optimizing pairwise alignments with diagonal partitioning'. Together they form a unique fingerprint.

Cite this