BOL: Related items

PERGA: A Paired-End Read Guided De Novo Assembler for Extending Contigs Using SVM and Look Ahead Approach

Rahul Nayak — Tue, 05 Jun 2018 09:57:11 -0500

PERGA - Paired End Reads Guided Assembler PERGA is a novel sequence reads guided de novo assembly approach which adopts greedy-like prediction strategy for assembling reads to contigs and scaffolds. Instead of using single-end reads to construct contig, PERGA uses paired-end reads and different read overlap sizes from O ≥ Omax to Omin to resolve the gaps and branches. Moreover, by constructing a decision model using machine learning approach based on branch features, PERGA can determine the correct extension in 99.7% of cases. PERGA will try to extend the contigs by all feasible nucleotides and determine if these multiple extensions due to sequencing errors or repeats by using looking ahead technology, and it also try to separate the different repeats of nearby genomic regions to make the assembly result more longer and accurate. The simulated E.coli paired-end reads data are generated using GemSim (KE McElroy, F Luciani, T Thomas. Gemsim: General, Error-Model Based Simulator of Next-Generation Sequencing Data. BMC Genomics 2012, 13:74), with coverage 50x, 60x, 100x, read lengths 100-bp, and can be downloaded from https://github.com/zhuxiao/data_PERGA.

Address of the bookmark: https://github.com/hitbio/PERGA

CoverM: Read coverage calculator for metagenomics

Neel — Thu, 29 Apr 2021 23:39:14 -0500

CoverM aims to be a configurable, easy to use and fast DNA read coverage and relative abundance calculator focused on metagenomics applications.

CoverM calculates coverage of genomes/MAGs coverm genome (help) or individual contigs coverm contig (help). Calculating coverage by read mapping, its input can either be BAM files sorted by reference, or raw reads and reference genomes in various formats.

Address of the bookmark: https://github.com/wwood/CoverM

NanoSim: nanopore sequence read simulator based on statistical characterization.

Jit — Mon, 18 Dec 2017 04:16:31 -0600

NanoSim, a fast and scalable read simulator that captures the technology-specific features of ONT data and allows for adjustments upon improvement of nanopore sequencing technology. The first step of NanoSim is read characterization, which provides a comprehensive alignment-based analysis and generates a set of read profiles serving as the input to the next step, the simulation stage. The simulation stage uses the model built in the previous step to produce in silico reads for a given reference genome. NanoSim is written in Python and R. The source files and manual are available at the Genome Sciences Centre website: http://www.bcgsc.ca/platform/bioinfo/software/nanosim

https://github.com/bcgsc/NanoSim

Address of the bookmark: http://www.bcgsc.ca/platform/bioinfo/software/nanosim

HALC: High throughput algorithm for long read error correction

Jit — Fri, 08 Jun 2018 10:47:41 -0500

HALC, a high throughput algorithm for long read error correction. HALC aligns the long reads to short read contigs from the same species with a relatively low identity requirement so that a long read region can be aligned to at least one contig region, including its true genome region’s repeats in the contigs sufficiently similar to it (similar repeat based alignment approach) HALC was able to obtain 6.7-41.1% higher throughput than the existing algorithms while maintaining comparable accuracy. The HALC corrected long reads can thus result in 11.4-60.7% longer assembled contigs than the existing algorithms.

Address of the bookmark: https://github.com/lanl001/halc

Shasta long read assembler

Jit — Tue, 14 Jan 2020 06:47:07 -0600

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 a run-length representation of the read sequence. This makes the assembly process more resilient to errors in homopolymer repeat counts, which are the most common type of errors in Oxford Nanopore reads.
Using in some phases of the computation a representation of the read sequence based on markers, a fixed subset of short k-mers (k ≈ 10).

More at https://chanzuckerberg.github.io/shasta/index.html

Address of the bookmark: https://github.com/chanzuckerberg/shasta

World of Omics

Rahul Agarwal — Tue, 16 Jul 2013 17:11:48 -0500

How many variants of "omics" techniques presently in use ?

Should you get sequenced? Not all bad genes predict disease

Rahul Agarwal — Thu, 29 Aug 2013 15:10:53 -0500

“What we really don’t know yet is whether the predictive aspects of the genome are going to turn out to be beneficial or potentially harmful”

“As we roll out genomic medicine we are fighting against this society-wide misconception that having the bad gene means you’re going to get the disease. That’s only true in a very few cases.”

Source:Today Health

Address of the bookmark: http://www.today.com/health/should-you-get-sequenced-not-all-bad-genes-predict-disease-8C11017154

Comparison of Short Read De Novo Alignment Algorithms

Rahul Agarwal — Wed, 21 Aug 2013 07:56:01 -0500

Excellent article to introduce different sequencing methods along with tools for de novo assembly of sequencing reads and their relevant references.

Title: Comparison of Short Read De Novo Alignment Algorithms

Author: Nikhil Gopal

Address of the bookmark: http://biochem218.stanford.edu/Projects%202011/Gopal%202011.pdf

Latest paper on comparison of mapping tools

Rahul Agarwal — Tue, 03 Sep 2013 18:00:38 -0500

A. Hatem, D. Bozdag, A. E. Toland, U. V. Catalyurek "Benchmarking short sequence mapping tools" BMC Bioinformatics, 14(1):184, 2013.

http://bmi.osu.edu/hpc/software/benchmark/

http://bmi.osu.edu/hpc/software/pmap/pmap.html

Other similiar papers:

http://online.liebertpub.com/doi/pdf/10.1089/cmb.2012.0022

http://bioinformatics.oxfordjournals.org/content/28/24/3169

Some new Mapping tool links:

GSNAP

http://research-pub.gene.com/gmap/

RMAP

http://rulai.cshl.edu/rmap/

mrsFAST

http://mrsfast.sourceforge.net/Home

http://sourceforge.net/projects/mrsfast/files/mrsfast-ultra-3.1.0/

BFAST

http://sourceforge.net/apps/mediawiki/bfast/index.php?title=Main_Page

SHRiMP (for AB SOLiD color-space reads)

http://compbio.cs.toronto.edu/shrimp/

RazerA 3

http://www.seqan.de/projects/razers/

Address of the bookmark: http://www.biomedcentral.com/1471-2105/14/184

Largest Genome Sequenced

Rahul Agarwal — Fri, 21 Mar 2014 13:57:19 -0500

The enormous size of the loblolly pine genome having 22 billion base pairs compared to only 3 billion in the human genome. In other words, it is seven times larger than a human’s and also the largest and the most complete conifer genome ever sequenced.

Related Paper:

http://genomebiology.com/2014/15/3/R59/abstract

Address of the bookmark: http://www.news.ucdavis.edu/search/news_detail.lasso?id=10859