Thomas Krannich
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Thomas Krannich has a total of 120 co-authors. Here are the top co-authors by number of shared publications:
- Birte Kehr
Algorithmic Bioinformatics, Leibniz Institute for Immunotherapy, Regensburg, Germany
4 shared publications - Rayan Chikhi
Institut Pasteur, Université Paris Cité, CNRS UMR3525, Paris, France
3 shared publications Anastasija Maks
Institute of Virology, Freiburg University Medical Center, Faculty of Medicine, University of Freiburg, Freiburg, Germany
2 shared publications- Björn Grüning
University of Freiburg
2 shared publications - Broňa Brejová
Department of Computer Science, Faculty of Mathematics, Physics, and Informatics, Comenius University Bratislava , Mlynská dolina, 842 48 Bratislava
2 shared publications - Carina Wilhelm
Institute of Clinical Microbiology and Hygiene, National Consultant Laboratory for HAV and HEV, University Medical Center Regensburg, Regensburg, Germany
2 shared publications
Latest Publications
- Open Access
- 4 November 2026
- Published by Springer Nature in BMC Bioinformatics
MoleMap: fast alignment-free molecule mapping for long-read and linked-read sequencing data
Background: With sequencing costs continuing to decline, the computational expenses of read alignment in genome analysis are becoming an increasingly important consideration. When only portions of the genome are of interest – as in most clinical genome analyses – or base-pair precise alignment is not required, performing full read alignment on whole-genome sequencing (WGS) data imposes unnecessary computational costs. Alignment provides the base-by-base precision necessary to identify variants relative to a reference sequence. To improve efficiency, sequence reads can first be rapidly mapped to approximate chromosomal locations, allowing expensive alignment to be restricted to specified target regions subsequently. This mapping-first approach avoids performing base-pair precise alignment across the entire genome. Results: We introduce MoleMap , a “molecule mapping” method for long reads and linked-read molecules that pre-filters WGS data for downstream targeted analyses. MoleMap uses a minimized open-addressing k -mer index of the reference genome and a fast k -mer clustering procedure to assign reads or molecules to genomic regions. In our evaluation, MoleMap identifies the correct mapping location for a comparable number of reads as other mapping and standard alignment tools on simulated data and achieves high agreement with other tools on real data while running 3 − 8 × faster than other mappers and 10 − 60 × faster than full aligners on 32 threads. In addition, its low memory footprint allows whole-genome processing on a standard laptop computer. As proofs of concept, we use MoleMap to filter reads for local assembly of a known variant region that involves non-reference sequence and showcase its use in diagnosing a patient with a rare disease. Conclusions: MoleMap is a practical mapping tool for whole-genome data that accelerates targeted analyses by selecting reads from loci of interest before costly alignment. By identifying locus-specific reads, it decreases the volume of data passed to downstream processing steps. In a clinical sequencing setting, this can substantially reduce computational costs and diagnostic turnaround times.
- 4 November 2026
- Published by Springer Nature in BMC Bioinformatics
Open AccessMoleMap: fast alignment-free molecule mapping for long-read and linked-read sequencing data
Background: With sequencing costs continuing to decline, the computational expenses of read alignment in genome analysis are becoming an increasingly important consideration. When only portions of the genome are of interest – as in most clinical genome analyses – or base-pair precise alignment is not required, performing full read alignment on whole-genome sequencing (WGS) data imposes unnecessary computational costs. Alignment provides the base-by-base precision necessary to identify variants relative to a reference sequence. To improve efficiency, sequence reads can first be rapidly mapped to approximate chromosomal locations, allowing expensive alignment to be restricted to specified target regions subsequently. This mapping-first approach avoids performing base-pair precise alignment across the entire genome. Results: We introduce MoleMap , a “molecule mapping” method for long reads and linked-read molecules that pre-filters WGS data for downstream targeted analyses. MoleMap uses a minimized open-addressing k -mer index of the reference genome and a fast k -mer clustering procedure to assign reads or molecules to genomic regions. In our evaluation, MoleMap identifies the correct mapping location for a comparable number of reads as other mapping and standard alignment tools on simulated data and achieves high agreement with other tools on real data while running 3 − 8 × faster than other mappers and 10 − 60 × faster than full aligners on 32 threads. In addition, its low memory footprint allows whole-genome processing on a standard laptop computer. As proofs of concept, we use MoleMap to filter reads for local assembly of a known variant region that involves non-reference sequence and showcase its use in diagnosing a patient with a rare disease. Conclusions: MoleMap is a practical mapping tool for whole-genome data that accelerates targeted analyses by selecting reads from loci of interest before costly alignment. By identifying locus-specific reads, it decreases the volume of data passed to downstream processing steps. In a clinical sequencing setting, this can substantially reduce computational costs and diagnostic turnaround times.
- Open Access
- 28 May 2026
- Published by Peer Community In in Peer Community Journal
- Vol. 6
Consensus statement from the second RdRp Summit: towards a unified framework for RNA virus biology
RNA-dependent RNA polymerase, or RdRp, remains the central molecular hallmark of RNA viruses. It serves as both a universal anchor for virus detection and a critical target for understanding the functional and evolutionary properties of RNA viruses. Since the inaugural RdRp summit in 2023, there have been significant advances in sequencing, structural prediction and artificial intelligence, all of which have accelerated the pace of RNA virus discovery and taxonomic annotation, revealing unprecedented levels of viral diversity, including novel phyla and unique genome architectures. Recent advances include the discovery of novel viral phyla such as Ambiviricota and the application of AI-driven models like LucaProt, highlighting both the rapid expansion of viral diversity and the growing role of machine learning in RNA virus research. The second RdRp summit, which was held in Lisbon in May 2025, gathered a group of research scientists from diverse subfields of virology to address emerging challenges in RNA virus biology. These challenges ranged from standardising annotation and data sharing to harnessing structure-guided phylogenetics and petabyte-scale computational tools. Here, our consensus statement outlines key progress, current and future challenges and community-driven initiatives, including benchmarking, virus-host inference, and ongoing knowledge exchange efforts - all of which are designed to unify the field. Importantly, this statement reflects a clear community consensus and provides concrete recommendations to prioritize standardized benchmarking, structure-informed evolutionary analysis, and reproducible virus–host inference as foundational pillars for advancing RNA virus research. By fostering an environment of sustained collaboration, our efforts aim to build a coherent framework for modern RNA virus biology and to accelerate the exploration of the hidden RNA virosphere.
- 28 May 2026
- Published by Peer Community In in Peer Community Journal
- Vol. 6
Open AccessConsensus statement from the second RdRp Summit: towards a unified framework for RNA virus biology
RNA-dependent RNA polymerase, or RdRp, remains the central molecular hallmark of RNA viruses. It serves as both a universal anchor for virus detection and a critical target for understanding the functional and evolutionary properties of RNA viruses. Since the inaugural RdRp summit in 2023, there have been significant advances in sequencing, structural prediction and artificial intelligence, all of which have accelerated the pace of RNA virus discovery and taxonomic annotation, revealing unprecedented levels of viral diversity, including novel phyla and unique genome architectures. Recent advances include the discovery of novel viral phyla such as Ambiviricota and the application of AI-driven models like LucaProt, highlighting both the rapid expansion of viral diversity and the growing role of machine learning in RNA virus research. The second RdRp summit, which was held in Lisbon in May 2025, gathered a group of research scientists from diverse subfields of virology to address emerging challenges in RNA virus biology. These challenges ranged from standardising annotation and data sharing to harnessing structure-guided phylogenetics and petabyte-scale computational tools. Here, our consensus statement outlines key progress, current and future challenges and community-driven initiatives, including benchmarking, virus-host inference, and ongoing knowledge exchange efforts - all of which are designed to unify the field. Importantly, this statement reflects a clear community consensus and provides concrete recommendations to prioritize standardized benchmarking, structure-informed evolutionary analysis, and reproducible virus–host inference as foundational pillars for advancing RNA virus research. By fostering an environment of sustained collaboration, our efforts aim to build a coherent framework for modern RNA virus biology and to accelerate the exploration of the hidden RNA virosphere.
- Open Access
Anyone can be the best: Impact of diverse methodologies on the evaluation of structural variant callers
Structural variants (SVs) are medium and large-scale genomic alterations that shape phenotypic diversity and disease risk. Numerous methods have been proposed for discovering SVs, however their benchmarking has been inconsistent across studies, often resulting in contradictory findings. One of the main sources of conflicting evaluation re-sults is the lack of consistency in the SV callsets used as ground truth, ranging from curated callsets released by consortia to more recent approaches that construct callsets from high-quality telomere-to-telomere de novo haplotype assemblies. The discrepancies between benchmarks are further compounded by the choice of the reference genome ( GRCh37 , GRCh38 , and T2T-CHM13 ), where using T2T-CHM13 reveals a different deletion/insertion profile, indicating reduced reference bias. We evaluated the performance of several state-of-the-art SV discovery methods from long-read whole-genome sequencing data and observed substantial variation in their performance and rankings, depending on the choice of ground truth, reference genome, and genomic regions used for evaluation. Counter-intuitively, the more complete reference genome T2T-CHM13 does not inherently solve the problem of SV benchmarking; instead it reveals the limitations of each detection method in complex genomic regions. The substantial variation in detection accuracy across different genomic regions calls for additional caution in downstream analyses and in drawing conclusions based on predicted SVs. These findings underscore the complexity of evaluating SV detection methods and highlight the need for careful consideration and, ideally, field-standard best practices when reporting performance metrics.
Open AccessAnyone can be the best: Impact of diverse methodologies on the evaluation of structural variant callers
Structural variants (SVs) are medium and large-scale genomic alterations that shape phenotypic diversity and disease risk. Numerous methods have been proposed for discovering SVs, however their benchmarking has been inconsistent across studies, often resulting in contradictory findings. One of the main sources of conflicting evaluation re-sults is the lack of consistency in the SV callsets used as ground truth, ranging from curated callsets released by consortia to more recent approaches that construct callsets from high-quality telomere-to-telomere de novo haplotype assemblies. The discrepancies between benchmarks are further compounded by the choice of the reference genome ( GRCh37 , GRCh38 , and T2T-CHM13 ), where using T2T-CHM13 reveals a different deletion/insertion profile, indicating reduced reference bias. We evaluated the performance of several state-of-the-art SV discovery methods from long-read whole-genome sequencing data and observed substantial variation in their performance and rankings, depending on the choice of ground truth, reference genome, and genomic regions used for evaluation. Counter-intuitively, the more complete reference genome T2T-CHM13 does not inherently solve the problem of SV benchmarking; instead it reveals the limitations of each detection method in complex genomic regions. The substantial variation in detection accuracy across different genomic regions calls for additional caution in downstream analyses and in drawing conclusions based on predicted SVs. These findings underscore the complexity of evaluating SV detection methods and highlight the need for careful consideration and, ideally, field-standard best practices when reporting performance metrics.
- Open Access
- 31 May 2025
- Published by Springer Nature in Nature Communications
- Vol. 16 (1) , 1-19
varVAMP: degenerate primer design for tiled full genome sequencing and qPCR
Time- and cost-saving surveillance of viral pathogens is achieved by tiled sequencing in which a viral genome is amplified in overlapping PCR amplicons and qPCR. However, designing pan-specific primers for viral pathogens with high genomic variability represents a significant challenge. Here, we present a bioinformatics command-line tool, called varVAMP (variable virus amplicons), which addresses this issue. It relies on multiple sequence alignments of highly variable virus sequences and enables degenerate primer design for qPCR or tiled amplicon whole genome sequencing. We demonstrate the utility of varVAMP by designing and evaluating novel pan-specific primer schemes suitable for sequencing the genomes of SARS-CoV-2, Hepatitis E virus, rat Hepatitis E virus, Hepatitis A virus, Borna-disease-virus-1, and Poliovirus using clinical samples. Importantly, we also designed primers on the same input data using the software packages PrimalScheme and Olivar and showed that varVAMP minimizes primer mismatches most efficiently. Finally, we established highly sensitive and specific Poliovirus qPCR assays that could potentially simplify current Poliovirus surveillance. varVAMP is open-source and available through PyPI, UseGalaxy, Bioconda, and https://github.com/jonas-fuchs/varVAMP.
- 31 May 2025
- Published by Springer Nature in Nature Communications
- Vol. 16 (1) , 1-19
Open AccessvarVAMP: degenerate primer design for tiled full genome sequencing and qPCR
Time- and cost-saving surveillance of viral pathogens is achieved by tiled sequencing in which a viral genome is amplified in overlapping PCR amplicons and qPCR. However, designing pan-specific primers for viral pathogens with high genomic variability represents a significant challenge. Here, we present a bioinformatics command-line tool, called varVAMP (variable virus amplicons), which addresses this issue. It relies on multiple sequence alignments of highly variable virus sequences and enables degenerate primer design for qPCR or tiled amplicon whole genome sequencing. We demonstrate the utility of varVAMP by designing and evaluating novel pan-specific primer schemes suitable for sequencing the genomes of SARS-CoV-2, Hepatitis E virus, rat Hepatitis E virus, Hepatitis A virus, Borna-disease-virus-1, and Poliovirus using clinical samples. Importantly, we also designed primers on the same input data using the software packages PrimalScheme and Olivar and showed that varVAMP minimizes primer mismatches most efficiently. Finally, we established highly sensitive and specific Poliovirus qPCR assays that could potentially simplify current Poliovirus surveillance. varVAMP is open-source and available through PyPI, UseGalaxy, Bioconda, and https://github.com/jonas-fuchs/varVAMP.
- Open Access
Pangenome graph augmentation from unassembled long reads
Pangenomes are becoming increasingly popular data structures for genomics analyses due to their ability to compactly represent the genetic diversity within populations. Constructing a pangenome graph, however, is still a time-consuming and expensive process. A promising approach for pangenome construction consists of progressively augmenting a pangenome graph with additional high-quality assemblies. Currently, there is no method for augmenting a pangenome graph with unassembled reads from newly sequenced samples without first aligning the reads to a reference genome and performing variant calling and genotyping on the new individuals. In this work, we present the first assembly-free and mapping-free approach for augmenting an existing pangenome graph using unassembled long reads from an individual not already present in the pangenome. Our approach consists of finding sample specific sequences in reads using efficient indexes, clustering reads corresponding to the same novel variant(s), and then building a consensus sequence to be added to the pangenome graph for each variant separately. Using simulated reads based on Human Pangenome Reference Consortium (HPRC) assemblies, we demonstrate the effectiveness of the proposed approach for progressively augmenting the pangenome with long reads, without the need for de novo assembly or predicting genetic variants of the new sample. The software is freely available at https://github.com/ldenti/palss .
Open AccessPangenome graph augmentation from unassembled long reads
Pangenomes are becoming increasingly popular data structures for genomics analyses due to their ability to compactly represent the genetic diversity within populations. Constructing a pangenome graph, however, is still a time-consuming and expensive process. A promising approach for pangenome construction consists of progressively augmenting a pangenome graph with additional high-quality assemblies. Currently, there is no method for augmenting a pangenome graph with unassembled reads from newly sequenced samples without first aligning the reads to a reference genome and performing variant calling and genotyping on the new individuals. In this work, we present the first assembly-free and mapping-free approach for augmenting an existing pangenome graph using unassembled long reads from an individual not already present in the pangenome. Our approach consists of finding sample specific sequences in reads using efficient indexes, clustering reads corresponding to the same novel variant(s), and then building a consensus sequence to be added to the pangenome graph for each variant separately. Using simulated reads based on Human Pangenome Reference Consortium (HPRC) assemblies, we demonstrate the effectiveness of the proposed approach for progressively augmenting the pangenome with long reads, without the need for de novo assembly or predicting genetic variants of the new sample. The software is freely available at https://github.com/ldenti/palss .
- Open Access
CIEVaD: A Lightweight Workflow Collection for the Rapid and On-Demand Deployment of End-to-End Testing for Genomic Variant Detection
The identification of genomic variants has become a routine task in the age of genome sequencing. In particular, small genomic variants of a single or few nucleotides are routinely investigated for their impact on an organism’s phenotype. Hence, the precise and robust detection of the variants’ exact genomic locations and changes in nucleotide composition is vital in many biological applications. Although a plethora of methods exist for the many key steps of variant detection, thoroughly testing the detection process and evaluating its results is still a cumbersome procedure. In this work, we present a collection of easy-to-apply and highly modifiable workflows to facilitate the generation of synthetic test data, as well as to evaluate the accordance of a user-provided set of variants with the test data. The workflows are implemented in Nextflow and are open-source and freely available on Github under the GPL-3.0 license.
Open AccessCIEVaD: A Lightweight Workflow Collection for the Rapid and On-Demand Deployment of End-to-End Testing for Genomic Variant Detection
The identification of genomic variants has become a routine task in the age of genome sequencing. In particular, small genomic variants of a single or few nucleotides are routinely investigated for their impact on an organism’s phenotype. Hence, the precise and robust detection of the variants’ exact genomic locations and changes in nucleotide composition is vital in many biological applications. Although a plethora of methods exist for the many key steps of variant detection, thoroughly testing the detection process and evaluating its results is still a cumbersome procedure. In this work, we present a collection of easy-to-apply and highly modifiable workflows to facilitate the generation of synthetic test data, as well as to evaluate the accordance of a user-provided set of variants with the test data. The workflows are implemented in Nextflow and are open-source and freely available on Github under the GPL-3.0 license.
- Open Access
CIEVaD: a lightweight workflow collection for rapid and on demand deployment of end-to-end testing of genomic variant detection
The identification of genomic variants has become a routine task in the thriving age of genome sequencing. Particularly small genomic variants of single or few nucleotides are routinely investigated for their impact on an organism’s phenotype. Hence, precise and robust detection of the variants’ exact genomic location and change in nucleotide composition is vital in many biological applications. Although a plethora of methods exist for the many key steps of variant detection, thoroughly testing the detection process and evaluating its results is still a cumbersome procedure. In this work, we present a collection of trivial to apply and highly modifiable workflows to facilitate the generation of synthetic test data as well as to evaluate the accordance of a user-provided set of variants with the test data. Availability The workflows are implemented in Nextflow and are freely available and open-source at https://github.com/rki-mf1/cievad under the GPL-3.0 license.
Open AccessCIEVaD: a lightweight workflow collection for rapid and on demand deployment of end-to-end testing of genomic variant detection
The identification of genomic variants has become a routine task in the thriving age of genome sequencing. Particularly small genomic variants of single or few nucleotides are routinely investigated for their impact on an organism’s phenotype. Hence, precise and robust detection of the variants’ exact genomic location and change in nucleotide composition is vital in many biological applications. Although a plethora of methods exist for the many key steps of variant detection, thoroughly testing the detection process and evaluating its results is still a cumbersome procedure. In this work, we present a collection of trivial to apply and highly modifiable workflows to facilitate the generation of synthetic test data as well as to evaluate the accordance of a user-provided set of variants with the test data. Availability The workflows are implemented in Nextflow and are freely available and open-source at https://github.com/rki-mf1/cievad under the GPL-3.0 license.
- Open Access
varVAMP: automated pan-specific primer design for tiled full genome sequencing and qPCR of highly diverse viral pathogens
Time- and cost-saving surveillance of viral pathogens is achieved by tiled sequencing in which a viral genome is amplified in overlapping PCR amplicons and qPCR. However, designing pan-specific primers for viral pathogens that have high genomic variability represents a major challenge. Here, we present a bioinformatics command-line tool, called varVAMP ( var iable v irus amp licons). It relies on multiple sequence alignments of highly variable virus sequences and enables automatic pan-specific primer design for qPCR or tiled amplicon whole genome sequencing. The varVAMP software guarantees pan-specificity by two means: it designs primers in regions with minimal variability and introduces degenerate nucleotides into primer sequences to compensate for common sequence variations. We demonstrate varVAMP’s utility by designing and evaluating novel pan-specific primer schemes suitable for sequencing the genomes of SARS-CoV-2, Hepatitis E virus, rat Hepatitis E virus, Hepatitis A virus, Borna-disease-virus-1, and Poliovirus. Moreover, we established highly sensitive and specific Poliovirus qPCR assays that could potentially simplify current Poliovirus surveillance. Importantly, wet-lab and bioinformatic techniques established for SARS-CoV-2 tiled amplicon sequencing were readily transferable to these new primer schemes and will allow sequencing laboratories to extend their established methodology to other human pathogens.
Open AccessvarVAMP: automated pan-specific primer design for tiled full genome sequencing and qPCR of highly diverse viral pathogens
Time- and cost-saving surveillance of viral pathogens is achieved by tiled sequencing in which a viral genome is amplified in overlapping PCR amplicons and qPCR. However, designing pan-specific primers for viral pathogens that have high genomic variability represents a major challenge. Here, we present a bioinformatics command-line tool, called varVAMP ( var iable v irus amp licons). It relies on multiple sequence alignments of highly variable virus sequences and enables automatic pan-specific primer design for qPCR or tiled amplicon whole genome sequencing. The varVAMP software guarantees pan-specificity by two means: it designs primers in regions with minimal variability and introduces degenerate nucleotides into primer sequences to compensate for common sequence variations. We demonstrate varVAMP’s utility by designing and evaluating novel pan-specific primer schemes suitable for sequencing the genomes of SARS-CoV-2, Hepatitis E virus, rat Hepatitis E virus, Hepatitis A virus, Borna-disease-virus-1, and Poliovirus. Moreover, we established highly sensitive and specific Poliovirus qPCR assays that could potentially simplify current Poliovirus surveillance. Importantly, wet-lab and bioinformatic techniques established for SARS-CoV-2 tiled amplicon sequencing were readily transferable to these new primer schemes and will allow sequencing laboratories to extend their established methodology to other human pathogens.
- Open Access
MoleMap: fast alignment-free molecule mapping for long-read and linked-read sequencing data
Motivation: The bottleneck for genome analysis will soon shift from sequencing cost to computationally expensive read alignment. When only portions of the genome are of interest, read alignment on wholegenome sequencing (WGS) data can be replaced by a fast mapping step. Results: We propose an approach that can map both long reads or linked-read molecules, as a pre-processing step for downstream targeted analyses. Our 'molecule mapping' approach, implemented in the tool MoleMap, uses a minimized open-addressing k-mer index of the reference genome and a fast k-mer clustering procedure. We demonstrate that MoleMap's accuracy is competitive with standard alignment and mapping tools and its running time outperforms other mapping tools on 32 threads by a factor of 3 to 8 and read alignment tools by a factor of 10 to 60. Its low memory footprint allows us to analyze whole genomes on a standard laptop computer. As proofs of concept, we use MoleMap to filter reads for local assembly of a known variant region that involves non-reference sequence and showcase its use in diagnosing a patient with a rare disease. Our work contributes to more scalable genome analysis and promotes WGS for targeted analyses.
Open AccessMoleMap: fast alignment-free molecule mapping for long-read and linked-read sequencing data
Motivation: The bottleneck for genome analysis will soon shift from sequencing cost to computationally expensive read alignment. When only portions of the genome are of interest, read alignment on wholegenome sequencing (WGS) data can be replaced by a fast mapping step. Results: We propose an approach that can map both long reads or linked-read molecules, as a pre-processing step for downstream targeted analyses. Our 'molecule mapping' approach, implemented in the tool MoleMap, uses a minimized open-addressing k-mer index of the reference genome and a fast k-mer clustering procedure. We demonstrate that MoleMap's accuracy is competitive with standard alignment and mapping tools and its running time outperforms other mapping tools on 32 threads by a factor of 3 to 8 and read alignment tools by a factor of 10 to 60. Its low memory footprint allows us to analyze whole genomes on a standard laptop computer. As proofs of concept, we use MoleMap to filter reads for local assembly of a known variant region that involves non-reference sequence and showcase its use in diagnosing a patient with a rare disease. Our work contributes to more scalable genome analysis and promotes WGS for targeted analyses.
- Open Access
- 2 November 2021
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 38 (3) , 604-611
Population-scale detection of non-reference sequence variants using colored de Bruijn graphs
With the increasing throughput of sequencing technologies, structural variant (SV) detection has become possible across tens of thousands of genomes. Non-reference sequence (NRS) variants have drawn less attention compared with other types of SVs due to the computational complexity of detecting them. When using short-read data, the detection of NRS variants inevitably involves a de novo assembly which requires high-quality sequence data at high coverage. Previous studies have demonstrated how sequence data of multiple genomes can be combined for the reliable detection of NRS variants. However, the algorithms proposed in these studies have limited scalability to larger sets of genomes. We introduce PopIns2, a tool to discover and characterize NRS variants in many genomes, which scales to considerably larger numbers of genomes than its predecessor PopIns. In this article, we briefly outline the PopIns2 workflow and highlight our novel algorithmic contributions. We developed an entirely new approach for merging contig assemblies of unaligned reads from many genomes into a single set of NRS using a colored de Bruijn graph. Our tests on simulated data indicate that the new merging algorithm ranks among the best approaches in terms of quality and reliability and that PopIns2 shows the best precision for a growing number of genomes processed. Results on the Polaris Diversity Cohort and a set of 1000 Icelandic human genomes demonstrate unmatched scalability for the application on population-scale datasets. The source code of PopIns2 is available from https://github.com/kehrlab/PopIns2. Supplementary data are available at Bioinformatics online.
- 2 November 2021
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 38 (3) , 604-611
Open AccessPopulation-scale detection of non-reference sequence variants using colored de Bruijn graphs
With the increasing throughput of sequencing technologies, structural variant (SV) detection has become possible across tens of thousands of genomes. Non-reference sequence (NRS) variants have drawn less attention compared with other types of SVs due to the computational complexity of detecting them. When using short-read data, the detection of NRS variants inevitably involves a de novo assembly which requires high-quality sequence data at high coverage. Previous studies have demonstrated how sequence data of multiple genomes can be combined for the reliable detection of NRS variants. However, the algorithms proposed in these studies have limited scalability to larger sets of genomes. We introduce PopIns2, a tool to discover and characterize NRS variants in many genomes, which scales to considerably larger numbers of genomes than its predecessor PopIns. In this article, we briefly outline the PopIns2 workflow and highlight our novel algorithmic contributions. We developed an entirely new approach for merging contig assemblies of unaligned reads from many genomes into a single set of NRS using a colored de Bruijn graph. Our tests on simulated data indicate that the new merging algorithm ranks among the best approaches in terms of quality and reliability and that PopIns2 shows the best precision for a growing number of genomes processed. Results on the Polaris Diversity Cohort and a set of 1000 Icelandic human genomes demonstrate unmatched scalability for the application on population-scale datasets. The source code of PopIns2 is available from https://github.com/kehrlab/PopIns2. Supplementary data are available at Bioinformatics online.