BOL

training.galaxyproject.org - In this tutorial we assemble and annotate the genome of E. coli strain C-1. This strain is routinely used in experimental evolution studies involving bacteriophages. For instance, now classic works by Holly Wichman and Jim Bull (Bull 1997, Bull...

github.com - IVA (Iterative Virus Assembler) designed specifically for read pairs sequenced at highly variable depth from RNA virus samples. We tested IVA on datasets from 140 sequenced samples from human immunodeficiency virus-1 or influenza-virus-infected...

If we only had Illumina reads, we could also assemble these using the tool Spades. You can try this here, or try it later on your own data. Get data We will use the same Illumina data as we used above: illumina_R1.fastq.gz: the Illumina...

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

Metagenomics is rapidly moving beyond short-read sequencing. With the increasing adoption of long-read technologies, researchers can generate more contiguous assemblies—but converting these reads into reliable metagenome-assembled genomes (MAGs)...

http://busco.ezlab.org/ - Assessing genome assembly and annotation completeness with Benchmarking Universal Single-Copy Orthologs More at http://busco.ezlab.org/

www.vicbioinformatics.com - VAGUE is a vague acronym for "Velvet Assembler Graphical Front End", which means it is a GUI for the Velvet de novo assembler. The command line version of Velvet can be complicated for beginners to use, but VAGUE makes it clear and simple More...

github.com - This tutorial includes resources for learning more about PacBio data and bioinformatics analysis, and includes content suitable for both beginners and experts. Below are links to training modules (webinars and PowerPoint presentations) to help you...

github.com - SGA is a de novo genome assembler based on the concept of string graphs. The major goal of SGA is to be very memory efficient, which is achieved by using a compressed representation of DNA sequence reads. More at https://github.com/jts/sga SGA...

www.topcoder.com - Learning greedy algo for biologist.  https://www.topcoder.com/community/data-science/data-science-tutorials/greedy-is-good/ This webpage is also useful for the...