Bazel is a build and test tool similar to Make, Maven, and Gradle. It uses a human-readable, high-level build language. Bazel supports projects in multiple languages and builds outputs for multiple platforms. Bazel supports large codebases across multiple repositories, and large numbers of users.

Bazel is a build and test tool similar to Make, Maven, and Gradle. It uses a human-readable, high-level build language. Bazel supports projects in multiple languages and builds outputs for multiple platforms. Bazel supports large codebases across multiple repositories, and large numbers of users.

GPCNeT is a benchmark suite that includes simulated network congestion, allowing the benchmarking of network performance in closer-to-real-conditions in HPC networks.

mpiGraph is a MPI benchmark to generate network bandwidth images.

The benchmarks are derived from computational fluid dynamics (CFD) applications and consist of five kernels and three pseudo-applications in the original "pencil-and-paper" specification (NPB 1). The benchmark suite has been extended to include new benchmarks for unstructured adaptive meshes, parallel I/O, multi-zone applications, and computational grids. Problem sizes in NPB are predefined and indicated as different classes.

HPL is a software package that solves a (random) dense linear system in double precision (64 bits) arithmetic on distributed-memory computers. It can thus be regarded as a portable as well as freely available implementation of the High Performance Computing Linpack Benchmark.

The benchmarks are derived from computational fluid dynamics (CFD) applications and consist of five kernels and three pseudo-applications in the original "pencil-and-paper" specification (NPB 1). The benchmark suite has been extended to include new benchmarks for unstructured adaptive meshes, parallel I/O, multi-zone applications, and computational grids. Problem sizes in NPB are predefined and indicated as different classes.

This is an R package which interfaces with the OME Bio-Formats Java library to allow reading of proprietary microscopy image data and metadata.

Create an interactive Shiny-based graphical user interface for exploring data stored in SummarizedExperiment objects, including row- and column-level metadata. The interface supports transmission of selections between plots and tables, code tracking, interactive tours, interactive or programmatic initialization, preservation of app state, and extensibility to new panel types via S4 classes. Special attention is given to single-cell data in a SingleCellExperiment object with visualization of dimensionality reduction results.

The Spliced Transcripts Alignment to a Reference (STAR) software is based on a previously undescribed RNA-seq alignment algorithm that uses sequential maximum mappable seed search in uncompressed suffix arrays followed by seed clustering and stitching procedure. In addition to unbiased de novo detection of canonical junctions, STAR can discover non-canonical splices and chimeric (fusion) transcripts, and is also capable of mapping full-length RNA sequences.

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.

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.

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

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 contains a collection of bioinformatics data structures and algorithms. It provides I/O classes, bitio classes, text indexing classes and BAM sequence alignment functionality.

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.

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.

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

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

This package provides in uncompressed version of the gnomAD structural variant sites.

MMseqs2 (Many-against-Many sequence searching) is a software suite to search and cluster huge protein and nucleotide sequence sets.

This package computes metrics and generates Interactive QC plots from the sequencing summary report generated by Oxford Nanopore technologies basecaller.