This package provides a phylogeny dating method using least-squares algorithms and criteria.

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

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

Build contrasts for models defined with formulaic.

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.

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.

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 new way of computing bootstrap supports in large phylogenies.

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.

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.

This package provides tools for rapid prokaryotic genome annotation.

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 provides the reference implementation of CGP workflow for CaVEMan SNV analysis.

diemPy is a computational tool designed to polarize genomic data for hybrid zone analysis. The package implements an expectation-maximization (EM) algorithm to determine the optimal polarization of genetic markers, enabling researchers to identify and analyze patterns of introgression and hybridization in genomic datasets.

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

Biosoup is a C++ collection of header-only data structures used for storage and logging in bioinformatics tools.

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.