Fast sequence to graph alignment based on graph folding

Sequence-to-graph alignment is a critical component of pan-genome-based read alignment and represents the most computationally intensive step in this process. To address this challenge, we have introduced a sequence-to-graph alignment algorithm based on graph folding, which minimizes the size of the graph structure and enhances alignment efficiency while identifying the optimal path. Experiments on both simulated and real datasets demonstrate that our algorithm significantly improves the speed of sequence-to-graph alignment. The source code is available at Github: https://github.com/zzzerd/fgpoa