github.com - GIGGLE is a genomics search engine that identifies and ranks the significance of genomic loci shared between query features and thousands of genome interval files. GIGGLE (https://github.com/ryanlayer/giggle) scales to billions of intervals and is...
mesquiteproject.org - Mesquite is modular, extendible software for evolutionary biology, designed to help biologists organize and analyze comparative data about organisms. Its emphasis is on phylogenetic analysis, but some of its modules concern population genetics,...
github.com - snakePipes are flexible and powerful workflows built using snakemake that simplify the analysis of NGS data.
DNA-mapping*
ChIP-seq*
RNA-seq*
ATAC-seq*
scRNA-seq
Hi-C
Whole Genome Bisulfite Seq/WGBS
(*Also available in...
github.com - Dahak is a software suite that integrates state-of-the-art open source tools for metagenomic analyses. Tools in the dahak software suite will perform various steps in metagenomic analysis workflows including data pre-processing, metagenome assembly,...
http://genometools.org/ - The GenomeTools genome analysis system is a free collection of bioinformatics tools (in the realm of genome informatics) combined into a single binary named gt. It is based on a C library named...
https://r-graphics.org/ - R is powerful tool for data analysis, visualization, and machine learning. And it costs $0 to use! Here are six FREE books you can use to learn R...
bioinformatics.uconn.edu - This section explains some of the commonly used file formats in bioinformatics. The information provided here is basic and designed to help users to distinguish the difference between different formats. Please refer user manual or other information...
github.com - It is designed to work with patterned data. Famous examples of problems related to patterned data are:
recovering signals in networks after a stimulation (cascade network reverse engineering),
analysing periodic signals.
ivory.idyll.org - DNA k-mers underlie much of our assembly work, and we (along with many others!) have spent a lot of time thinking about how to store k-mer graphs efficiently, discard redundant data, and count them efficiently.
More recently, we've...