Control-FREEC automatically computes, normalizes, segments copy number and beta allele frequency (BAF) profiles, then calls copy number alterations and LOH. The control (matched normal) sample is optional for whole genome sequencing data but mandatory for whole exome or targeted sequencing data. For whole genome sequencing data analysis, the program can also use mappability data (files created by GEM).

The IQ-TREE software was created as the successor of IQPNNI and TREE-PUZZLE (thus the name IQ-TREE). IQ-TREE was motivated by the rapid accumulation of phylogenomic data, leading to a need for efficient phylogenomic software that can handle a large amount of data and provide more complex models of sequence evolution. To this end, IQ-TREE can utilize multicore computers and distributed parallel computing to speed up the analysis. IQ-TREE automatically performs checkpointing to resume an interrupted analysis.

As input IQ-TREE accepts all common sequence alignment formats including PHYLIP, FASTA, Nexus, Clustal and MSF. As output IQ-TREE will write a self-readable report file (name suffix .iqtree), a NEWICK tree file (.treefile) which can be visualized by tree viewer programs such as FigTree, Dendroscope or iTOL.

Key features of IQ-TREE:

• Fast and effective stochastic algorithm to reconstruct phylogenetic trees by maximum likelihood;

• An ultrafast bootstrap approximation (UFBoot) to assess branch supports;

• An ultrafast and automatic model selection (ModelFinder);

• A flexible simulator (AliSim) which can simulate sequence alignments under more realistic models than Seq-Gen and INDELible;

• Several fast branch tests like SH-aLRT and aBayes test and tree topology tests like the approximately unbiased (AU) test.

This package provides IQ-TREE version 2.

SHARC is a pipeline for somatic SV calling and filtering from tumor-only Nanopore sequencing data. It performs mapping, SV calling, SV filtering, random forest classification, blacklist filtering and SV prioritization, followed by automated primer design for PCR amplicons of 80-120 bp that are useful to track cancer ctDNA molecules in liquid biopsies.

Scriabin aims to provide a comprehensive view of cell-cell communication (CCC). It achieves this without requiring subsampling or aggregation.

Spoa (SIMD POA) is a c++ implementation of the partial order alignment (POA) algorithm, which is used to generate consensus sequences. It supports three alignment modes: local (Smith-Waterman), global (Needleman-Wunsch) and semi-global alignment (overlap), and three gap modes: linear, affine and convex (piecewise affine).

Anvi’o is a comprehensive platform that brings together many aspects of today’s computational strategies of data-enabled microbiology, including genomics, metagenomics, metatranscriptomics, pangenomics, metapangenomics, phylogenomics, and microbial population genetics in an integrated and easy-to-use fashion through extensive interactive visualization capabilities.

CMAPLE is a C++ reimplementation of MAPLE - a novel likelihood-based phylogenetic inference method for pandemic-scale epidemiological genomic data.

FastQC aims to provide a QC report which can spot problems which originate either in the sequencer or in the starting library material. It can either run as a stand alone interactive application for the immediate analysis of small numbers of FastQ files, or it can be run in a non-interactive mode where it would be suitable for integrating into a larger analysis pipeline for the systematic processing of large numbers of files.

This package contains the following programs: bamcollate2, bammarkduplicates, bammaskflags, bamrecompress, bamsort, bamtofastq.

This package provides a subset of the Regulatory Sequence Analysis Tools (RSAT).

SeqAn is a C++ library of efficient algorithms and data structures for the analysis of sequences with the focus on biological data. It contains algorithms and data structures for string representation and their manipulation, online and indexed string search, efficient I/O of bioinformatics file formats, sequence alignment, and more.

Build contrasts for models defined with formulaic.

This package provides an implementation of the CaVEMan program. It uses an expectation maximisation approach to calling single base substitutions in paired data. It is designed for use with a compute cluster. Most steps in the program make use of an index parameter. The split step is designed to divide the genome into chunks of adjustable size to optimise for runtime/memory usage requirements.

MCView creates a Shiny app facilitating interactive exploration and annotation of Metacell models.

This package contains a set of common Perl utilities for generating consistent Vcf headers. It primarily exists to prevent code duplication between some other projects.

This package provides a component of the Trinity Cancer Transcriptome Analysis Toolkit (CTAT). It uses the STAR aligner to identify candidate fusion transcripts supported by Illumina reads. It further processes the output generated by the STAR aligner to map junction reads and spanning reads to a reference annotation set.

This package is designed to help the scientist, engineer, statistician, etc., to construct appropriate experimental designs.

This package is designed to help the scientist, engineer, statistician, etc., to construct appropriate experimental designs.

The carputils framework will be the optimal way to access openCARP for most users. This Python framework was developed to provide the means to easily encode in silico experiments including pre- and postprocessing. carputils will call the openCARP simulator.

BLT is a streamlined CMake-based foundation for Building, Linking and Testing large-scale high performance computing (HPC) application.

This package provides bsc and libbsc, a program and a library for lossless, block-sorting data compression. bsc is a high performance file compressor based on lossless, block-sorting data compression algorithms. libbsc is a library based on bsc, it uses the same algorithms as bsc and enables you to compress memory blocks.

zfp is a compressed number format for multi-dimensional arrays. zfp provides compressed-array classes (e.g., for in-memory storage) and high-speed, parallel data compression (e.g., for offline storage). zfp supports both lossy and lossless compression and fine-grained user control over accuracy and storage size.