BOL

www.melbournebioinformatics.org.au - Written and maintained by Simon Gladman - Melbourne Bioinformatics (formerly VLSCI) Protocol Overview / Introduction In this protocol we discuss and outline the process of de novo assembly for small to medium sized...

https://dfast.nig.ac.jp/ - We developed a prokaryotic genome annotation pipeline, DFAST, that also supports genome submission to public sequence databases. DFAST was originally started as an on-line annotation server, and to date, over 7,000 jobs have been processed since its...

github.com - JBrowse is a fast, embeddable genome browser built completely with JavaScript and HTML5, with optional run-once data formatting tools written in Perl. Headline Features: Fast, smooth scrolling and zooming. Explore your genome with unparalleled...

github.com - The goal of the Shasta long read assembler is to rapidly produce accurate assembled sequence using as input DNA reads generated by Oxford Nanopore flow cells. Computational methods used by the Shasta assembler include: Using...

Mitochondrial genome assembly tools are specialized software and algorithms designed to accurately reconstruct the mitochondrial genome (mitogenome) from sequencing data, typically obtained through techniques like next-generation sequencing (NGS)....

User-friendly tools for the normalization and visualization of deep-sequencing data

molbiol-tools.ca - Collections of few handy tools for bioinformatician http://molbiol-tools.ca/Convert.htm

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...

List of generic simulation software/tools/resource with brief description and homepage ALF A Simulation Framework for Genome Evolution http://www.cbrg.ethz.ch/alfBayesian Serial SimCoal Bayesian Serial SimCoal, (BayeSSC) is a modification of...

github.com - Mix is a tool that combines two or more draft assemblies, without relying on a reference genome and has the goal to reduce contig fragmentation and thus speed-up genome finishing. The proposed algorithm builds an extension graph where vertices...