Address of the bookmark: https://github.com/broadinstitute/VariantBam

Address of the bookmark: https://github.com/bergmanlab/mcclintock

Variant calling and/or genotyping

• DiscoSNP++ and discoSnpRAD: Reference-free small variant discovery (SNPs and indels)
• MindTheGap: Detection and assembly of large insertion variants
• TakeABreak: reference-free inversion discovery tool
• SVJedi: Structural Variant genotyper with long read data
• SVJedi-graph: Structural Variant genotyper with long read data using a variation graph

Sequence assembly

• MinYS: reference-guided genome assembly in metagenomics data
• MTG-link: local assembly tool for linked-read data
• Minia: De novo short read assembler
• de-novo pipeline: de-novo assembly pipeline (error correction / contigs / scaffolding) for genomes and meta-genomes
• Mapsembler2: Targeted assembly (not maintained)

Managing k-mers & indexation

• findere: simple strategy for speeding up queries and for reducing false positive calls from any Approximate Membership Query data structure.
  • fimpera extends findere adding the abundance information.
• kmtricks: modular tool suite for counting kmers, and constructing Bloom filters or kmer matrices, for large collections of sequencing data.
• kmindex is a tool for indexing and querying sequencing samples. It is built on top of kmtricks.
• back to sequences: Find sequences (reads, unitigs, genes) related to a set of kmers in large datasets, in a matter of seconds.
• Backpack Quotient Filter: k-mer indexing data structure with abundance
• short read connector: Detect similar reads from potentially large read set
• DSK: Count K-mer in sequences

Pangenome graph manipulation

• Pancat: Pangenome Comparison and Analysis Toolkit
• GFAGraphs: a Python library to handle pangenome graph files in GFA format.

Comparative metagenomics with k-mers

• Simka and SimkaMin: Comparative metagenomics for large-scale datasets
• Comparead & Commet: comparison of metagenomic datasets

Species and bacterial strains identification

• ORI: software using long nanopore reads to identify bacteria present in a sample at the strain level
• StrainFLAIR: STRAIN-level proFiLing using vArIation gRaph

General-purpose sequencing data manipulation

• GASSST: long read mapper
• Leon: short read compressor (now included in GATB-core)
• Bloocoo: short read corrector
• BCALM: Construct compacted de Bruijn graphs (unitigs)

 Protein Structure

• A_Purva: Contact Map Overlap solver
• MD-Jeep: Distance Geometry solver
• CSA: Comparative Structural Alignment

Workflow

• SLICEE: parallel execution of bioinformatics workflows

Comparative Genomics

• CASSIS: detection of rearrangement breakpoints
• PLAST: intensive bank-to-bank sequence comparison
• DRJBreakpointFinder: detection and precise localization of excision sites in proviral segments

lordFAST, a novel long-read mapper that is specifically designed to align reads generated by PacBio and potentially other SMS technologies to a reference. lordFAST not only has higher sensitivity than the available alternatives, it is also among the fastest and has a very low memory footprint.

Address of the bookmark: https://github.com/vpc-ccg/lordfast

A recent study published in Genome Biology (https://link.springer.com/article/10.1186/s13059-026-04280-y) addressed this challenge by introducing dicast (https://github.com/burgshrimps/dicast), a machine-learning approach for detecting structural variants in short-read sequencing data. Structural variants, such as large deletions, insertions, duplications, and inversions, can have significant biological and clinical implications, yet they are challenging to identify with short-read technologies. Because different detection methods frequently yield divergent results, researchers commonly employ consensus calling, considering a variant valid only if multiple tools detect it. While this approach reduces false positives, it relies on the potentially flawed assumption that the majority is always correct.

The researchers explored the impact of evaluating the supporting evidence for each variant, rather than simply tallying the number of algorithms that identified it. To establish a ground truth, they analyzed nine genomes using multiple sequencing technologies and 15 detection methods, initially identifying approximately 35 million potential variants. Through extensive filtering, evidence integration, and manual review of over 11,500 variants, they developed a robust benchmark comprising more than 236,000 structural variants. The findings underscored the complexity of the problem: short-read methods detected fewer than half of deletions and less than 10 percent of insertions, with performance declining markedly in repetitive genomic regions. In contrast, long-read technologies demonstrated superior detection capabilities. However, replacing the substantial volume of existing short-read data in clinical and research settings is not immediately feasible. Consequently, the researchers questioned whether short-read data might harbor more information than conventional analytical pipelines currently extract.

This line of inquiry led to the development of dicast. Rather than merely confirming agreement among multiple tools, dicast identifies patterns in sequencing data, including split and clipped reads, discordant read pairs, alignment characteristics, and the surrounding genomic context. An XGBoost machine-learning model evaluates which combinations of these signals are indicative of genuine structural variants. Thus, the approach shifts from tallying algorithmic consensus to interpreting the underlying evidence.

The researchers subsequently conducted a targeted evaluation by examining structural variants detected by only a single short-read tool, which are typically missed by consensus-based approaches. dicast successfully recovered approximately 81% of these single-caller deletions, insertions, and duplications. The signals for these variants were present in the data, but conventional filtering methods failed to integrate them effectively.

The utility of dicast was further demonstrated in cohorts with rare diseases, including congenital limb malformations, atrial fibrillation, and neuromuscular disorders. In one instance, dicast achieved a deletion recall rate of approximately 0.96, compared to 0.74 using consensus calling. The median number of variants requiring manual review was 29 per sample. Among 31 experimentally validated variants that standard filters would have missed, dicast identified 12, whereas consensus calling detected only one.

Overall, dicast identified approximately 20 percent more potential disease-causing deletions than consensus-based methods. While a 20 percent increase may appear modest, in clinical genomics such improvements can have significant practical implications. Missing a deletion may leave a case unresolved, whereas detecting a structural variant can provide critical diagnostic insights.

The study does not claim that machine learning has rendered short-read sequencing superior to long-read approaches. Instead, the results underscore the effectiveness of long-read sequencing for structural variant detection. However, dicast highlights a more nuanced perspective: substantial biological information may still be recoverable from the extensive short-read datasets already available.

The principal lesson extends beyond the detection of structural variants. For many years, bioinformatics pipelines have relied on threshold-based criteria, such as minimum coverage, quality scores, or support from multiple tools. While these rules are useful, biological phenomena do not always conform to rigid checklists; multiple weak signals, when considered collectively, can provide compelling evidence.

This perspective prompts consideration of the solitary variant: one algorithm identifies it, while several others do not. Traditional consensus techniques might have dismissed it, yet machine learning approaches evaluate the available evidence to determine whether the variant is plausible.

Occasionally, the most significant variant within a genome is the one that is almost universally overlooked.

Read more at https://link.springer.com/article/10.1186/s13059-026-04280-y

Toolkit for Automated and Rapid DIscovery of Structural variants

Requirements

zlib (http://www.zlib.net)
mrfast (https://github.com/BilkentCompGen/mrfast)
htslib (included as submodule; http://htslib.org/)
Fetching tardis

git clone https://github.com/BilkentCompGen/tardis.git --recursive

https://github.com/BilkentCompGen/tardis

Address of the bookmark: https://github.com/BilkentCompGen/tardis

Address of the bookmark: https://bernatgel.github.io/karyoploter_tutorial/

Address of the bookmark: https://github.com/reubwn/hgt

https://bioconductor.org/packages/release/bioc/html/epivizr.html

https://github.com/epiviz

https://github.com/epiviz/epiviz

Address of the bookmark: https://epiviz.github.io/

java -mx512m -jar BamView.jar

and extra command line options are given when '-h' is used:

java -jar BamView.jar -h

BAM files can be specified on the command line with the '-a' option:

java -mx512m -jar BamView.jar -a pathToFile/sorted.bam

If a BAM filename is not given on the command line BamView will prompt for a file to be entered. The BAM index file should have the same name as the BAM file but with a '.bai' suffix. Multiple BAM files can be loaded and overlaid in the viewer. To make this easier BamView will read in files that contain a list of filenames.

Address of the bookmark: http://bamview.sourceforge.net/