github.com - Snippy finds SNPs between a haploid reference genome and your NGS sequence reads. It will find both substitutions (snps) and insertions/deletions (indels). It will use as many CPUs as you can give it on a single computer (tested to 64 cores). It is...
github.com - A simple, extensible, Perl script for producing figures of large phylogenetic trees.
While there are many other tree drawing programs, slacTree was originally written in 2009 to fill a need for producing publication quality figures of circular...
pypi.org - The Environment for Tree Exploration (ETE) is a Python programming toolkit that assists in the recontruction, manipulation, analysis and visualization of phylogenetic trees (although clustering trees or any other tree-like data structure are also...
christophergandrud.github.io - Mike Bostock’s D3.js is great for creating interactive network graphs with JavaScript. The d3Network package makes it easy to create these network graphs from R. The main idea is that you should able to take...
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...