Pesho Ivanov

This paper introduces an exact global alignment algorithm using A* with chaining seed heuristic and match pruning, achieving near-linear runtime and significant speedups over existing methods.

This paper introduces a novel A[*] seed heuristic for sequence-to-graph alignment, achieving faster and optimal alignment by skipping most dynamic programming table cells.

AStarix provides a fast and optimal algorithm for aligning sequences to genome graphs, outperforming existing methods by 1-2 orders of magnitude.