BOL

github.com - GFAffix identifies walk-preserving shared affixes in variation graphs and collapses them into a non-redundant graph structure.  

dgenies.toulouse.inra.fr - D-GENIES – for Dotplot large Genomes in an Interactive, Efficient and Simple way – is an online tool designed to compare two genomes. It supports large genome and you can interact with the dot plot to improve the visualisation. We use minimap...

www.ici.upmc.fr - ClueGO is a Cytoscape plug-in that visualizes the non-redundant biological terms for large clusters of genes in a functionally grouped network and it can be used in combination with GOlorize. The identifiers can be uploaded from a text file or...

www.landesbioscience.com - Related latest article: http://www.nature.com/nature/journal/v509/n7502/pdf/nature13377.pdf

github.com - Sunbeam is a pipeline written in snakemake that simplifies and automates many of the steps in metagenomic sequencing analysis. It uses conda to manage dependencies, so it doesn't have pre-existing dependencies or admin...

github.com - Lorikeet is a within-species variant analysis pipeline for metagenomic communities that utilizes both long and short reads. Lorikeet utilizes a re-implementaion of the GATK HaplotypeCaller algorithm, performing local re-assembly of potentially...

http://shinyheatmap.com/ - Background: Transcriptomics, metabolomics, metagenomics, and other various next-generation sequencing (-omics) fields are known for their production of large datasets. Visualizing such big data has posed technical challenges in biology, both in...

Solved with perl http://rosalind.info/problems/1a/ #Find the most frequent k-mers in a string.#Given: A DNA string Text and an integer k.#Return: All most frequent k-mers in Text (in any order).use strict;use warnings;my...

The question at http://rosalind.info/problems/1d/ Script are moved to http://bioinformaticsonline.com/snippets/view/34633/clump-finding-problem-solved-with-perl

github.com - With the EGAD (Extending ‘Guilt-by-Association’ by Degree) package, we present a series of highly efficient tools to calculate functional properties in networks based on the guilt-by-association principle. These allow rapid controlled...