github.com - Ktrim is written in C++ for GNU Linux/Unix platforms. After uncompressing the source package, you can find an executable file ktrim under bin/ directory compiled using g++ v4.8.5 and linked with libz...
github.com - ReMILO, a reference assisted misassembly detection algorithm that uses both short reads and PacBio SMRT long reads. ReMILO aligns the initial short reads to both the contigs and reference genome, and then constructs a novel data structure called...
github.com - FLAS, a wrapper algorithm of MECAT, to achieve high throughput long read self-correction while keeping MECAT's fast speed. FLAS finds additional alignments from MECAT prealigned long reads to improve the correction throughput, and removes...
It is enormous, billions of letters long. Some of those letters are easy to understand because they contain instructions for building proteins, the tiny machines that keep our cells alive.
sourceforge.net - SuRankCo is a machine learning based software to score and rank contigs from de novo assemblies of next generation sequencing data. It trains with alignments of contigs with known reference genomes and predicts scores and ranking for contigs which...
rrwick.github.io - Bandage (a Bioinformatics Application for Navigating De novo Assembly Graphs Easily) is a tool for visualizing assembly graphs with connections. Users can zoom in to specific areas of the graph and interact with it by moving nodes,...
academic.oup.com - GMcloser uses likelihood-based classifiers calculated from the alignment statistics between scaffolds, contigs and paired-end reads to correctly assign contigs or long reads to gap regions of scaffolds, thereby achieving accurate and efficient gap...
gfinisher.sourceforge.net - GFinisher is an application tools for refinement and finalization of prokaryotic genomes assemblies using the bias of GC Skew to identify assembly errors and organizes the contigs/scaffolds with genomes references.
java -Xms2G -Xmx4G -jar...
github.com - NovoGraph: building whole genome graphs from long-read-based de novo assemblies
An algorithmically novel approach to construct a genome graph representation of long-read-based de novo sequence assemblies. We then provide a proof of...