Search arXiv⌕ Search

arXiv · 2609.38651

Fragment Path Complex Networks for Viral Genome Classification

Abstract

Accurate classification of viral families is essential to understanding genomic diversity, but rapid evolution and heterogeneous genome structure complicate reliable assignment. Newly discovered viruses, particularly those from underrepresented ecosystems, expand the known diversity of viral genomes. This growing diversity poses challenges for classification methods that rely on similarity to existing references. We present Fragment Path Complex Networks (FPCN), a framework that represents viral genomes as sequences of ordered fragments at various scales. FPCN captures contextual sequence information within each fragment and uses path complexes to model complex relationships between neighboring fragments. We evaluated FPCN on well-established NCBI benchmarks, and FPCN achieved higher classification accuracy than competing methods. Further evaluations on newly released datasets revealed FPCN's ability to generalize to genomes that were not presented in the training. Together, these results position FPCN as an effective tool for classifying viral genomes within known families across benchmark datasets and newly released genomes.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alice Wachira, Xiang Liu, Guo-Wei Wei. 2026-09-29. Fragment Path Complex Networks for Viral Genome Classification. https://arxiv.org/abs/2609.38651

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

GenoBERT: A Language Model for Accurate Genotype Imputation

Genotype imputation enables dense variant coverage for genome-wide association and risk-prediction studies, yet conventional reference-panel methods remain limited by ancestry bias and reduced rare-variant accuracy. We present Genotype Bidirectional Encoder Representations from Transformers (GenoBERT), a transformer-based, reference-free framework that tokenizes phased genotypes and uses a self-attention mechanism to capture both short- and long-range linkage disequilibrium (LD) dependencies. Benchmarking on two independent datasets including the Louisiana Osteoporosis Study (LOS) and the 1000 Genomes Project (1KGP) across ancestry groups and multiple genotype missingness levels (5-50%) shows that GenoBERT achieves the highest overall accuracy compared to four baseline methods (Beagle5.4, SCDA, BiU-Net, and STICI). At practical sparsity levels (up to 25% missing), GenoBERT attains high overall imputation accuracy ($r^2 approx 0.98$) across datasets, and maintains robust performance ($r^2 > 0.90$) even at 50% missingness. Experimental results across different ancestries confirm consistent gains across datasets, with resilience to small sample sizes and weak LD. A 128-SNP (single-nucleotide polymorphism) context window (approximately 100 Kb) is validated through LD-decay analyses as sufficient to capture local correlation structures. By eliminating reference-panel dependence while preserving high accuracy, GenoBERT provides a scalable and robust solution for genotype imputation and a foundation for downstream genomic modeling.

q-bio.GN↗

Adaptive Allele-Haplotype Incidence Indexing for Pangenome Queries: Representation, Reconstruction, and Benchmarking

Population-scale analysis of phased genetic variants requires both allele-carrier retrieval and ordered haplotype context. We examine H1, an adaptive allele-haplotype incidence-row index, and H2, a canonical edge-path representation derived from a fixed, nonoverlapping variant catalog. We prove conditional reconstruction of abstract H2 walks and distinguish this property from unrestricted equivalence to genomic variation graphs. A completed local notebook experiment used a chromosome 1 interval (20-22 Mb), 200 diploid individuals, 24,921 SNV/indel records, and 45 SVTYPE-annotated records. For 24,966 extracted nonreference rows across 400 haplotypes, the serialized H1 incidence-row files occupied 0.872 MiB with a simple adaptive layout and 1.126 MiB with a custom Roaring-like layout, versus 1.190 MiB for a bitmap-payload baseline; a whole-file Zstandard archive of the adaptive layout occupied 0.207 MiB. For a separately constructed nonoverlapping SNV projection containing 22,727 sites, indexed H2 edge sequences occupied 75,130,882 bytes in a raw format and 5,156,418 bytes with context-Huffman encoding (14.57-fold reduction). Carrier-equivalence and graph-adjacency assertions passed in the notebook, but full crosscallset phasing, nucleotide-level SV reconstruction, and comparison with production indexes remain unresolved. The measurements establish a restricted implementation feasibility result, not superior end-to-end pangenome compression.

q-bio.GN↗

pyTransRate: reference-free quality assessment of de novo transcriptome assemblies with current aligners and quantifiers

Summary: The original software TransRate scores a de novo transcriptome assembly by mapping the reads it was built from back to it, with no reference required. Its last release (1.0.3) depends on Ruby 2.2 and on aligner and quantifier versions that can no longer be installed on most systems. pyTransRate is a Python reimplementation of the TransRate method built on snap-aligner 2.0.5 and salmon 2.7.0. In 5,031 paired comparisons (39 assembly-level metrics on each of 129 public assemblies), it reproduces the original sequence metrics and read counts exactly and ranks assemblies consistently with 1.0.3 (Spearman rho = 0.94 for assembly score, 0.98 for good-mapping rate), although its read-based scores are not numerically interchangeable with the original. It also reads gzip- and bgzip-compressed input directly. Availability and Implementation: pyTransRate is implemented in Python 3 and is freely available under the MIT license at https://github.com/macmanes-lab/pytransrate. It runs on Linux and macOS; snap-aligner and salmon are installed from Bioconda. Supplementary information: Supplementary data are available online. Supplementary Table S1 lists the assembly and read accessions for every assembly analyzed; Supplementary Table S2 gives per-assembly values from both implementations.

q-bio.GN↗