Cover Image

Multiple Genome Analytics Framework: The Case of All SARS-CoV-2 Complete Variants

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Xylogiannopoulos, Konstantinos
Format:	Preprint
Published:	2022
Subjects:	Genomics Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Hecate: A Modular Genomic Compressor
by: Szewczyk, Kamila, et al.
Published: (2026)

A Graph-based Approach to Variant Extraction from Sequences
by: Santcroos, Mark A., et al.
Published: (2025)

Genome-on-Diet: Taming Large-Scale Genomic Analyses via Sparsified Genomics
by: Alser, Mohammed, et al.
Published: (2022)

Fast Iteration of Spaced k-mers
by: Czech, Lucas
Published: (2026)

The TAG array of a multiple sequence alignment
by: Olbrich, Jannik, et al.
Published: (2025)

Popping Bubbles in Pangenome Graphs
by: Mwaniki, Njagi, et al.
Published: (2024)

Enabling Fast, Accurate, and Efficient Real-Time Genome Analysis via New Algorithms and Techniques
by: Firtina, Can
Published: (2025)

Safe Sequences via Dominators in DAGs for Path-Covering Problems
by: Sena, Francisco, et al.
Published: (2024)

Fast and Flexible Flow Decompositions in General Graphs via Dominators
by: Sena, Francisco, et al.
Published: (2025)

Taxonomic classification with maximal exact matches in KATKA kernels and minimizer digests
by: Draesslerová, Dominika, et al.
Published: (2024)

Btrim: A fast, lightweight adapter and quality trimming program for next-generation sequencing technologies
by: Kong, Yong
Published: (2014)

A Linear Time Quantum Algorithm for Pairwise Sequence Alignment
by: Khan, Md. Rabiul Islam, et al.
Published: (2023)

GVAtlas: Pioneering Genomic Variant Analysis and Visualization for SARS CoV 2 and Beyond
by: Tahir, Bhatti, et al.
Published: (2025)

SARS-CoV-2 Wastewater Genomic Surveillance: Approaches, Challenges, and Opportunities
by: Munteanu, Viorel, et al.
Published: (2023)

Classification of SARS-CoV-2 Variants through The Epistatical Circos Plots with Convolutional Neural Networks
by: Jing, Bo, et al.
Published: (2026)

Approximating Prize-Collecting Variants of TSP
by: Alimi, Morteza, et al.
Published: (2024)

Fully-Dynamic All-Pairs Shortest Paths: Likely Optimal Worst-Case Update Time
by: Mao, Xiao
Published: (2023)

Hardness, Tractability and Density Thresholds of finite Pinwheel Scheduling Variants
by: Kanellopoulos, Sotiris, et al.
Published: (2026)

Finding Small Complete Subgraphs Efficiently
by: Chen, Ke, et al.
Published: (2023)

Adaptive BSTs for Single-Source and All-to-All Requests: Algorithms and Lower Bounds
by: Shiran, Maryam
Published: (2025)

Parameterized Complexity of Dominating Set Variants in Almost Cluster and Split Graphs
by: Goyal, Dishant, et al.
Published: (2024)

Comparative Performance of the AVL Tree and Three Variants of the Red-Black Tree
by: Brown, Russell A.
Published: (2024)

Local Enumeration: The Not-All-Equal Case
by: Gurumukhani, Mohit, et al.
Published: (2025)

Total Completion Time Scheduling Under Scenarios
by: Bosman, Thomas, et al.
Published: (2024)

Greedy Completion for Weighted $(α,β)$-Spanners
by: Tzalik, Elad
Published: (2026)

Parameterized dynamic data structure for Split Completion
by: Majewski, Konrad, et al.
Published: (2024)

Equivalences between Non-trivial Variants of 3LDT and Conv3LDT
by: Dudek, Bartłomiej, et al.
Published: (2020)

All-Hops Shortest Paths
by: Williams, Virginia Vassilevska, et al.
Published: (2024)

Improved Dominance Filtering for Unions and Minkowski Sums of Pareto Sets
by: Karathanasis, Konstantinos, et al.
Published: (2025)

Approximation Algorithms for Packing Cycles and Paths in Complete Graphs
by: Zhao, Jingyang, et al.
Published: (2023)

NP-Completeness for the Space-Optimality of Double-Array Tries
by: Bannai, Hideo, et al.
Published: (2024)

Temporal Routing in Static Networks: The Schedule Completion Problem
by: Döring, Michelle, et al.
Published: (2026)

Matrix Multiplication Reductions
by: Gola, Ashish, et al.
Published: (2024)

DNA Probe Computing System for Solving NP-Complete Problems
by: Xu, Jin, et al.
Published: (2025)

Faster Minimization of Total Weighted Completion Time on Parallel Machines
by: Hermelin, Danny, et al.
Published: (2025)

Polynomial Kernel and Incompressibility for Prison-Free Edge Deletion and Completion
by: Houari-Durand, Séhane Bel, et al.
Published: (2025)

A Little Clairvoyance Is All You Need
by: Gupta, Anupam, et al.
Published: (2025)

Learning Multiple Secrets in Mastermind
by: Prabhu, Milind, et al.
Published: (2024)

Last Truck Scheduling for Middle-mile Next-day Delivery Coverage
by: Benidis, Konstantinos, et al.
Published: (2023)

Computing All Restricted Skyline Probabilities on Uncertain Datasets
by: Gao, Xiangyu, et al.
Published: (2023)