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...
github.com - Miniasm is a very fast OLC-based de novo assembler for noisy long reads. It takes all-vs-all read self-mappings (typically by minimap) as input and outputs an assembly graph in the GFA format. Different from mainstream...
hpcugent.github.io - EasyBuild is a software build and installation framework that allows you to manage (scientific) software on High Performance Computing (HPC) systems in an efficient way.A full list of supported software packages is available here.
www.ncbi.nlm.nih.gov - RGFA, an implementation of the proposed GFA specification in Ruby. It allows the user to conveniently parse, edit and write GFA files. Complex operations such as the separation of the implicit instances of repeats and the merging of linear paths can...
Memo No. DoRD/CSE/SSS/20-295/112-A Date: 01/02/2017
Project Title : “Integrating genome scale metabolic analysis of model plant pathogen Ralstonia solanacearum with RNAseq and fluxomics”
Essential qualification : M.Tech. in CSE/IT (With...
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...
The lab of Immunobiology of Neurological Disorders has a main interest in the biological processes associated with multiple sclerosis, an inflammatory disorder of the central nervous system. The projects of interest for this application involve...
github.com - Here is the command to run the tool:
python finisherSC.py destinedFolder mummerPath
If you are running on server computer and would like to use multiple threads, then the following commands can generate 20 threads to run FinisherSC.
python...