Javascript must be enabled to continue!
Cluster-efficient pangenome graph construction with nf-core/pangenome
View through CrossRef
Abstract
Motivation
Pangenome graphs offer a comprehensive way of capturing genomic variability across multiple genomes. However, current construction methods often introduce biases, excluding complex sequences or relying on references. The PanGenome Graph Builder (PGGB) addresses these issues. To date, though, there is no state-of-the-art pipeline allowing for easy deployment, efficient and dynamic use of available resources, and scalable usage at the same time.
Results
To overcome these limitations, we present nf-core/pangenome, a reference-unbiased approach implemented in Nextflow following nf-core’s best practices. Leveraging biocontainers ensures portability and seamless deployment in High-Performance Computing (HPC) environments. Unlike PGGB, nf-core/pangenome distributes alignments across cluster nodes, enabling scalability. Demonstrating its efficiency, we constructed pangenome graphs for 1000 human chromosome 19 haplotypes and 2146 Escherichia coli sequences, achieving a two to threefold speedup compared to PGGB without increasing greenhouse gas emissions.
Availability and implementation
nf-core/pangenome is released under the MIT open-source license, available on GitHub and Zenodo, with documentation accessible at https://nf-co.re/pangenome/docs/usage.
Oxford University Press (OUP)
Title: Cluster-efficient pangenome graph construction with nf-core/pangenome
Description:
Abstract
Motivation
Pangenome graphs offer a comprehensive way of capturing genomic variability across multiple genomes.
However, current construction methods often introduce biases, excluding complex sequences or relying on references.
The PanGenome Graph Builder (PGGB) addresses these issues.
To date, though, there is no state-of-the-art pipeline allowing for easy deployment, efficient and dynamic use of available resources, and scalable usage at the same time.
Results
To overcome these limitations, we present nf-core/pangenome, a reference-unbiased approach implemented in Nextflow following nf-core’s best practices.
Leveraging biocontainers ensures portability and seamless deployment in High-Performance Computing (HPC) environments.
Unlike PGGB, nf-core/pangenome distributes alignments across cluster nodes, enabling scalability.
Demonstrating its efficiency, we constructed pangenome graphs for 1000 human chromosome 19 haplotypes and 2146 Escherichia coli sequences, achieving a two to threefold speedup compared to PGGB without increasing greenhouse gas emissions.
Availability and implementation
nf-core/pangenome is released under the MIT open-source license, available on GitHub and Zenodo, with documentation accessible at https://nf-co.
re/pangenome/docs/usage.
Related Results
Cluster efficient pangenome graph construction with nf-core/pangenome
Cluster efficient pangenome graph construction with nf-core/pangenome
Abstract
Motivation
Pangenome graphs offer a comprehensive way of capturing genomic variability across multiple genomes. Howeve...
Constructing a VANET based on cluster chains
Constructing a VANET based on cluster chains
SUMMARYThe paper proposes a scheme on constructing a vehicular ad‐hoc network based on cluster chains. In the cluster construction algorithm, the distance from a potential cluster ...
Pangenome graph layout by Path-Guided Stochastic Gradient Descent
Pangenome graph layout by Path-Guided Stochastic Gradient Descent
Abstract
Motivation
The increasing availability of complete genomes demands for models to study genomic variability within enti...
Regional directions of the cluster development strategy in the field of tourism and hospitality
Regional directions of the cluster development strategy in the field of tourism and hospitality
The monograph consists of an introduction, 5 chapters, lists of used sources for each chapter separately; contains 31 tables and 37 figures. The monograph examines the theoretical ...
ODGI: understanding pangenome graphs
ODGI: understanding pangenome graphs
Abstract
Motivation
Pangenome graphs provide a complete representation of the mutual alignment of collections of genomes. These...
Haplotype Matching with GBWT for Pangenome Graphs
Haplotype Matching with GBWT for Pangenome Graphs
Traditionally, variations from a linear reference genome were used to represent large sets of haplotypes compactly. In the linear reference genome based paradigm, the positional Bu...
Abstract 902: Explainable AI: Graph machine learning for response prediction and biomarker discovery
Abstract 902: Explainable AI: Graph machine learning for response prediction and biomarker discovery
Abstract
Accurately predicting drug sensitivity and understanding what is driving it are major challenges in drug discovery. Graphs are a natural framework for captu...
Domination of Polynomial with Application
Domination of Polynomial with Application
In this paper, .We .initiate the study of domination. polynomial , consider G=(V,E) be a simple, finite, and directed graph without. isolated. vertex .We present a study of the Ira...

