BOL

www.cbcb.umd.edu - Metagenomics sequencing projects collect samples of DNA from uncharacterized environments that may contain hundreds or even thousands of species. One of the main challenges in analyzing a metagenome is phylogenetic classification of raw sequence...

www.ncbi.nlm.nih.gov - YAHA, a fast and flexible hash-based aligner. YAHA is as fast and accurate as BWA-SW at finding the single best alignment per query and is dramatically faster and more sensitive than both SSAHA2 and MegaBLAST at finding all possible alignments....

github.com - This project contains scripts and tutorials on how to assemble individual microbial genomes from metagenomes, as described in: Genome sequences of rare, uncultured bacteria obtained by differential coverage binning of multiple metagenomesMads...

www.atgc-montpellier.fr - LoRDEC is a program to correct sequencing errors in long reads from 3rd generation sequencing with high error rate, and is especially intended for PacBio reads. It uses a hybrid strategy, meaning that it uses two sets of reads: the reference read...

github.com - Jabba is a hybrid error correction tool to correct third generation (PacBio / ONT) sequencing data, using second generation (Illumina) data. Input Jabba takes as input a concatenated de Bruijn graph and a set of sequences: the de Bruijn graph...

github.com - NxRepair is a python module that automatically detects large structural errors in de novo assemblies using Nextera mate pair reads. The decector will break a contig at the site of an identified misassembly and will generate a new fasta file...

Mapping reads to a reference genome is an essential step in many types of genomic analysis, such as variant calling and gene expression analysis.

github.com - Next-gen sequence data such as Illumina HiSeq reads. Data must be sorted into folders by taxon (e.g. species or genus). Paired reads in fastq format must be specified by _R1 and _R2 in the (otherwise identical) filenames. Paired and unpaired reads...

Solved with perl http://rosalind.info/problems/1a/ #Find the most frequent k-mers in a string.#Given: A DNA string Text and an integer k.#Return: All most frequent k-mers in Text (in any order).use strict;use warnings;my...

The question at http://rosalind.info/problems/1d/ Script are moved to http://bioinformaticsonline.com/snippets/view/34633/clump-finding-problem-solved-with-perl