Genome browsers are useful not only for showing final results but also for improving analysis protocols, testing data quality, and generating result drafts. Its integration in analysis pipelines allows the optimization of parameters, which...
github.com - MECAT is an ultra-fast Mapping, Error Correction and de novo Assembly Tools for single molecula sequencing (SMRT) reads. MECAT employs novel alignment and error correction algorithms that are much more efficient than the state of art of aligners and...
pevsnerlab.kennedykrieger.org - DRAGON: Database Referencing of Array Genes Online
SNOMAD: Standardization and Normalization of Microarray Data
SNPduo: SNP Analysis Between Two Individuals
SNPtrio: Analyzing and Visualizing and Inheritance Patterns in Trios
SNPscan: Data...
There are two methods for ancient WGD detection, one is collinearity analysis, and the other is based on the Ks distribution map. Among them, Ks is defined as the average number of synonymous substitutions at each synonymous site, and there is...
rosalind.info - Rosalind is a platform for learning bioinformatics and programming through problem solving. Take a tour to get the hang of how Rosalind works.
http://rosalind.info/problems/list-view/
github.com - MitoHiFi v3.2 is a python pipeline distributed under MIT License !
MitoHiFi was first developed to assemble the mitogenomes for a wide range of species in the Darwin Tree of Life Project...
sourceforge.net - Cerulean extends contigs assembled using short read datasets like Illumina paired-end reads using long reads like PacBio RS long reads.
Cerulean v0.1 has been implemented with bacterial genomes in mind.
The method is fully described in...
www.bx.psu.edu - LASTZ is a program for aligning DNA sequences, a pairwise aligner. Originally designed to handle sequences the size of human chromosomes and from different species, it is also useful for sequences produced by NGS sequencing technologies such as...
gite.lirmm.fr - An error correction method that uses long reads only. The method consists of two phases: first, we use an iterative alignment-free correction method based on de Bruijn graphs with increasing length of k-mers, and second, the corrected reads are...