EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

PVGA: a precise viral genome assembler using an iterative alignment graph

Zhi Song iD, Dehan Cai iD, Yanni Sun iD, Lusheng Wang iD

GigaScience · 06.01.2025 · 14

DOI: 10.1093/gigascience/giaf063 ↗

Kurz gefasst

Fachartikel in der Zeitschrift GigaScience, online erschienen am 24.06.2025. Verfasst von Zhi Song und 3 weiteren Autor:innen. Beteiligte Einrichtung: Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong SAR (HKG), China. Hauptthemen laut MEDLINE: Genome, Viral, SARS-CoV-2, Software. Die Arbeit wurde bisher 4-mal zitiert (Crossref) und nennt 35 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Science Foundation, GRF.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Background

Viral genome analysis is crucial for understanding virus evolution and mutation. Investigations into viral evolutionary dynamics and mutation patterns have garnered significant research attention since the outbreak of COVID-19. The basic structure of many virus genomes is highly conserved [1]. RNA viruses have high mutation rates, and single-nucleotide variations may induce substantial phenotypic alterations in terms of viral function and pathogenicity. Thus, special assembly methods are required for viral genome analysis.

Result

PVGA starts with a reference genome and the sequencing reads. The first step in PVGA involves constructing an alignment graph based on a reference genome and the set of input sequencing reads. Then the optimal genomic path is determined through dynamic programming, maximizing the cumulative edge weights that reflect read support density across the alignment graph. The obtained path corresponds to a refined genome. Finally, we repeat the process by using the new reference genomes until no further improvement is possible. We evaluate PVGA’s performance across both assembly and polishing tasks using simulated and real datasets, including both long reads and short reads. The experiments demonstrate that PVGA always outperforms popular existing programs in terms of the quality of assembly results, while the running time of our method is compatible to others. In particular, simulated Nanopore datasets show that our method can correctly report the true genomes with 0 mismatches and 0 indels.

Conclusions

PVGA is a novel viral genome assembler that seamlessly integrates assembly and polishing into a unified workflow. Its design prioritizes high accuracy, enabling the detection of subtle genomic variations that can impact viral function and pathogenicity. By addressing the unique challenges of viral genome assembly, PVGA provides a reliable and precise solution for advancing our understanding of viral evolution and behavior.

Schlagwörter

MeSH-Schlagwörter (MEDLINE)

Genome, ViralSARS-CoV-2SoftwareHumansCOVID-19AlgorithmsGenomicsSequence AlignmentComputational Biology

Stichwörter der Autor:innen

alignment graphgenome assembleriterative methodmaximum total weight pathvirus genome

Autor:innen und Institutionen

  • Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong SAR (HKG), China.
  • Department of Electrical Engineering, City University of Hong Kong, Kowloon, Hong Kong SAR (HKG), China.
  • City University of Hong Kong Shenzhen Research Institute, Shenzhen, Guangdong Province, China.

ORCID-Profile: Zhi Song, Dehan Cai, Yanni Sun, Lusheng Wang

Förderung

  • National Science Foundation
  • GRF

Zitieren

APA

Song, Z., Cai, D., Sun, Y., & Wang, L. (2025). PVGA: a precise viral genome assembler using an iterative alignment graph. GigaScience, 14. https://doi.org/10.1093/gigascience/giaf063

Vancouver

Song Z, Cai D, Sun Y, Wang L. PVGA: a precise viral genome assembler using an iterative alignment graph. GigaScience. 2025;14. doi:10.1093/gigascience/giaf063

BibTeX
@article{Song2025,
  author = {Song, Zhi and Cai, Dehan and Sun, Yanni and Wang, Lusheng},
  title = {PVGA: a precise viral genome assembler using an iterative alignment graph},
  journal = {GigaScience},
  year = {2025},
  volume = {14},
  doi = {10.1093/gigascience/giaf063}
}
Kostenlos starten →