EUVIMEDEUVIMED entdecken
Crossref

Optimizing Sequence-to-Graph Alignment

Gao, Andrew, Ma, Justin, Liu, Justin, Chab, Bobby, Li, Fei

Journal of Student-Scientists' Research · 12.09.2025

DOI: 10.13021/jssr2025.5222 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Student-Scientists' Research, erschienen am 12.09.2025. Verfasst von Gao und 9 weiteren Autor:innen.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Graph‑based reference genomes preserve population‑level variation that linear references cannot, yet the combinatorial expansion of candidate paths grows exponentially (2k for k variant nodes) with each additional variant node making sequence‑to‑graph alignment computationally demanding. We evaluate four alignment strategies, a greedy heuristic, dynamic programming (DP), exhaustive search, and exhaustive search with early stopping, on synthetic directed acyclic graphs (DAGs) containing 10-20 nodes with a 10% branching probability and simulated short reads. The greedy heuristic completes in

Schlagwörter

directed acyclic graphsdynamic programminggreedy algorithmexhaustive searchearly stoppingspeed-accuracy trade-offheuristic pruningpopulation variationshort reads

Zitieren

APA

Gao, Andrew, Ma, Justin, Liu, Justin, Chab, Bobby, Li, & Fei (2025). Optimizing Sequence-to-Graph Alignment. Journal of Student-Scientists' Research. https://doi.org/10.13021/jssr2025.5222

Vancouver

Gao, Andrew, Ma, Justin, Liu, Justin, et al. Optimizing Sequence-to-Graph Alignment. Journal of Student-Scientists' Research. 2025. doi:10.13021/jssr2025.5222

BibTeX
@article{Gao2025,
  author = {Gao and Andrew and Ma and Justin and Liu and Justin and Chab and Bobby and Li and Fei},
  title = {Optimizing Sequence-to-Graph Alignment},
  journal = {Journal of Student-Scientists' Research},
  year = {2025},
  doi = {10.13021/jssr2025.5222}
}
Kostenlos starten →