github.com - A program for unsupervised binning of metagenomic contigs by using nucleotide composition, coverage data in multiple samples and linkage data from paired end reads.
Warning! This software is to be considered under development. Functionality and the...
sourceforge.net - Contiguity preserving transposition and sequencing (CPT-seq) is an entirely in vitro means of generating libraries comprised of 9216 indexed pools, each of which contains thousands of sparsely sequenced long fragments ranging from 5 kilobases to...
www.yandell-lab.org - MAKER is a portable and easily configurable genome annotation pipeline.Its purpose is to allow smaller eukaryotic and prokaryotic genome projects to independently annotate their genomes and to create genome databases. MAKER identifies repeats,...
minia.genouest.org - Minia is a short-read assembler based on a de Bruijn graph, capable of assembling a human genome on a desktop computer in a day. The output of Minia is a set of contigs. Minia produces results of similar contiguity and accuracy to other de Bruijn...
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...
http://busco.ezlab.org/ - Assessing genome assembly and annotation completeness with Benchmarking Universal Single-Copy Orthologs
More at http://busco.ezlab.org/
www.ncbi.nlm.nih.gov - Background. Next-generation sequencing technologies are now producing multiple times the genome size in total reads from a single experiment. This is enough information to reconstruct at least some of the differences between the individual genome...
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...
www.topcoder.com - Learning greedy algo for biologist.
https://www.topcoder.com/community/data-science/data-science-tutorials/greedy-is-good/
This webpage is also useful for the...