BOL

it.informatik.uni-tuebingen.de - The number of completely sequenced genomes is continuously rising, allowing for comparative analyses of genomic variation. Such analyses are often based on whole-genome alignments to elucidate structural differences arising from insertions,...

http://www.hiveplot.com/ - The hive plot is a rational visualization method for drawing networks. Nodes are mapped to and positioned on radially distributed linear axes — this mapping is based on network structural properties. Edges are drawn as curved links....

www.bx.psu.edu - A computational pipeline for identifying single-base substitutions between two closely related genomes without the help of a reference genome. DIAL works even when the depth of coverage is insufficient for de novo assembly, and it can be extended to...

code.google.com - splitbam splits a BAM by chromosomes. Using the reference sequence dictionary (*.dict), it also creates some empty BAM files if no sam record was found for a chromosome. A pair of 'mock' SAM-Records can also be added to those empty BAMs to...

George Chao is an undergraduate senior studying Genetics and Computer Science at the University of Minnesota. Having started genetics research as soon as he entered the university, he has worked in labs spanning multiple disciplines as well as in...

chunlab.wordpress.com - CLgenomics is a standalone desktop software specifically designed for bacterial genome analysis. This program has a powerful multi-genome browser, which enables rapid and responsive exploration of bacterial genomes. To use CLgenomics, individual...

downloads.jbei.org - MaxBin is software for binning assembled metagenomic sequences based on an Expectation-Maximization algorithm. Users can understand the underlying bins (genomes) of the microbes in their metagenomes by simply providing assembled metagenomic...

github.com - GroopM is a metagenomic binning toolset. It leverages spatio-temoraldynamics (differential coverage) to accurately (and almost automatically)extract population genomes from multi-sample metagenomic datasets. GroopM is largely parameter-free. Use:...

An algorithm is a procedure for solving a problem in terms of the actions to be executed and the order in which those actions are to be executed. An algorithm is merely the sequence of steps taken to solve a problem. The steps are normally...

github.com - This project contains scripts and tutorials on how to assemble individual microbial genomes from metagenomes, as described in: Genome sequences of rare, uncultured bacteria obtained by differential coverage binning of multiple metagenomes Mads...