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.

This package provides a tool to extract assembly statistics from FASTA and FASTQ files.

Primer3 is a widely used program for designing PCR primers. PCR is an essential and ubiquitous tool in genetics and molecular biology. Primer3 can also design hybridization probes and sequencing primers.

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

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

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.

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.

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.

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 3.

scvi-tools (single-cell variational inference tools) is a package for probabilistic modeling and analysis of single-cell omics data, built on top of PyTorch and AnnData.

Easel is an ANSI C code library developed by the Eddy/Rivas laboratory at Harvard. Easel supports our work on computational analysis of biological sequences using probabilistic models. Easel is used by HMMER, the profile hidden Markov model software that underlies several protein and DNA sequence family databases such as Pfam, and by Infernal, the profile stochastic context-free grammar software that underlies the Rfam RNA family database. Easel aims to make similar applications more robust and easier to develop, by providing a set of reusable, documented, and well-tested functions.

This package provides the reference implementation of CGP workflow for CaVEMan SNV analysis.

Bioparser is a C++ header only parsing library for several bioinformatics formats (FASTA/Q, MHAP/PAF/SAM), with support for zlib compressed files.

hiddenDomains is a suite of programs used to identify significant enrichment of ChIP-seq reads that span large domains, like HK27me3. The input data can be in BAM format, or in a tab-delimited 'reads per bin' format described below. The output is a BED formatted file the lists the enriched domains and their posterior probabilities.

The CodeMin minimization library provides a set of lightweight minimization functions originally developed for the CodeAxe phylogenetic analysis package.

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.

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.

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

Framework for analyzing low-depth NGS data in heterogeneous/structured populations using PCA. Population structure is inferred by estimating individual allele frequencies in an iterative approach using a truncated SVD model. The covariance matrix is estimated using the estimated individual allele frequencies as prior information for the unobserved genotypes in low-depth NGS data.

The estimated individual allele frequencies can further be used to account for population structure in other probabilistic methods. pcangsd can be used for the following analyses:

• Covariance matrix

• Admixture estimation

• Inbreeding coefficients (both per-sample and per-site)

• HWE test

• Genome-wide selection scans

• Genotype calling

• Estimate NJ tree of samples

This module provides code coverage metrics for Perl. Code coverage metrics describe how thoroughly tests exercise code. By using Devel::Cover you can discover areas of code not exercised by your tests and determine which tests to create to increase coverage.