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...
github.com - LINKS is a genomics application for scaffolding genome assemblies with long reads, such as those produced by Oxford Nanopore Technologies Ltd. It can be used to scaffold high-quality draft genome assemblies with any long sequences (eg. ONT reads,...
github.com - SGA is a de novo genome assembler based on the concept of string graphs. The major goal of SGA is to be very memory efficient, which is achieved by using a compressed representation of DNA sequence reads.
More at
https://github.com/jts/sga
SGA...
Structural variants (SVs) such as deletions, insertions, duplications, inversions and translocations litter genomes and are often associated with gene expression changes and severe phenotypes (ie. genetic diseases in humans).
sb.nhri.org.tw - A plethora of algorithmic assemblers have been proposed for the de novo assembly of genomes, however, no individual assembler guarantees the optimal assembly for diverse species. Optimizing various parameters in an assembler is often performed in...
garm-meta-assem.sourceforge.net - The pipeline is based mainly implemented using Perl scripts and modules and third-party open source software like the AMOS (Myers et al., 2000) and MUMmer (Kurtz et al., 2004) packages. The pipeline was tested on Debian, Ubuntu, Fedora and BioLinux...
github.com - quickmerge uses a simple concept to improve contiguity of genome assemblies based on long molecule sequences, often with dramatic outcomes. The program uses information from assemblies made with illumina short reads and PacBio long reads to improve...
www.homolog.us - If genomes were completely random sequences in a statistical sense, 'overlap-consensus-layout' method would have been enough to assemble large genomes from Sanger reads. In contrast, real genomes often have long repetitive regions, and they are hard...
github.com - v0.0 by Glenn Hickey (hickey@soe.ucsc.edu)
Progressive Cactus is a whole-genome alignment package.
Requirements
git
gcc 4.2 or newer
python 2.7
wget
64bit processor and build environment
150GB+ of memory on at least one machine when...
www.biostat.wisc.edu - Our basic strategy in building homology maps is to use exons that are orthologous in multiple genomes as map "anchors." Given K genomes, the steps in the map construction are as follows:
For each genome, obtain a set of exon annotations. These...