ccb.jhu.edu - The program gffcompare can be used to compare, merge, annotate and estimate accuracy of one or more GFF files (the “query” files), when compared with a reference annotation (also provided as GFF).
shendurelab.github.io - LACHESIS is method that exploits contact probability map data (e.g. from Hi-C) for chromosome-scale de novo genome assembly.
Further information about LACHESIS, including source code, documentation and a user's guide are available...
sysomics.com - DeepHiC is a GAN-based model for enhancing Hi-C data resolution. We developed this server for helping researchers to enhance their own low-resolution data by a few steps of clicks. Ab initio training could be performed according to our published...
chagall.med.cornell.edu - Institute of computational biomedicine, Cornell University provide an NGS workshop tutorial at http://chagall.med.cornell.edu/NGScourse/
You can also add your favourite NGS educational material, or workshop tutorial by commenting on this...
http://busco.ezlab.org/ - Assessing genome assembly and annotation completeness with Benchmarking Universal Single-Copy Orthologs
More at http://busco.ezlab.org/
urgi.versailles.inra.fr - We advise to run first the TEdenovo pipeline but it is not compulsory. We suppose you begin by running the TEannot pipeline on the example provided in the directory "db/" rather than directly on your own genomic sequences. Thus, from now on, the...
github.com - #Running TULIP (The Uncorrected Long-read Integration Process), version 0.4 late 2016 (European eel)
TULIP currently consists of to Perl scripts, tulipseed.perl and tulipbulb.perl. These are very much intended as prototypes, and additional...
bitbucket.org - Some parts of a genome may have a very high degree of heterozygosity. This causes contigs for both haplotypes of that part of the genome to be assembled as separate primary contigs, rather than as a contig and an associated haplotig. This can be an...
omega.omicsbio.org - Omega found overlaps between reads using a prefix/suffix hash table. The overlap graph of reads was simplified by removing transitive edges and trimming short branches. Unitigs were generated based on minimum cost flow analysis of the overlap graph...