BOL: Related items

Grinder / Biogrinder - A versatile omics shotgun and amplicon sequencing read simulator

Jit — Wed, 24 May 2017 08:41:41 -0500

Grinder is a versatile program to create random shotgun and amplicon sequence libraries based on DNA, RNA or proteic reference sequences provided in a FASTA file.

Grinder can produce genomic, metagenomic, transcriptomic, metatranscriptomic, proteomic, metaproteomic shotgun and amplicon datasets from current sequencing technologies such as Sanger, 454, Illumina. These simulated datasets can be used to test the accuracy of bioinformatic tools under specific hypothesis, e.g. with or without sequencing errors, or with low or high community diversity. Grinder may also be used to help decide between alternative sequencing methods for a sequence-based project, e.g. should the library be paired-end or not, how many reads should be sequenced.

Address of the bookmark: https://sourceforge.net/projects/biogrinder/files/biogrinder/

SISRS: Site Identification from Short Read Sequences

Abhimanyu Singh — Wed, 28 Nov 2018 08:56:03 -0600

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 must have a fastq file extension.

Address of the bookmark: https://github.com/rachelss/SISRS

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

URMAP, an ultra-fast read mapper

Jit — Thu, 29 Oct 2020 23:03:54 -0500

URMAP, a new read mapping algorithm. URMAP is an order of magnitude faster than BWA with comparable accuracy on several validation tests. On a Genome in a Bottle (GIAB) variant calling test with 30× coverage 2×150 reads, URMAP achieves high accuracy (precision 0.998, sensitivity 0.982 and F-measure 0.990) with the strelka2 caller. However, GIAB reference variants are shown to be biased against repetitive regions which are difficult to map and may therefore pose an unrealistically easy challenge to read mappers and variant callers.

More at https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7320720/

Address of the bookmark: https://github.com/rcedgar/urmap

Darwin-WGA: A Co-processor Provides Increased Sensitivity in Whole Genome Alignments with High Speedup

Jit — Sat, 13 Apr 2019 08:55:31 -0500

Darwin-WGA, is the first hardware accelerator for whole genome alignment and accelerates the gapped filtering stage. Darwin-WGA also employs GACT-X, a novel algorithm used in the extension stage to align arbitrarily long genome sequences using a small on-chip memory, that provides better quality alignments at 2× improvement in memory and speed over the previously published GACT algorithm. Implemented on an FPGA, Darwin-WGA provides up to 24× improvement (performance/$) in WGA over iso-sensitive software.

https://stanford.edu/~yatisht/pubs/darwin-wga.pdf

Address of the bookmark: https://github.com/gsneha26/Darwin-WGA

Easyfig

Poonam Mahapatra — Fri, 29 Apr 2016 05:49:39 -0500

Easyfig has moved to github, for newer releases of Easyfig please visit our new webpage - https://mjsull.github.io/Easyfig. Easyfig is a Python application for creating linear comparison figures of multiple genomic loci with an easy-to-use graphical user interface (GUI).

More at http://easyfig.sourceforge.net/

Address of the bookmark: http://easyfig.sourceforge.net/

Release Notes for Genome Workbench 2.10.5

Jit — Thu, 12 May 2016 13:49:41 -0500

New Features in latest release

New ProSplign tool integrated with Genome Workbench (Tutorial, Video)
New export function for BAM/cSRA coverage graphs (Tutorial)
New export function for alignments GFF3 format ((Tutorial))
Tree View: implemented new export mode based on selections (tutorial coming)
Tree View: added support for distance based circular trees
Tree View: new rooting mode (Midpoint Root) results in more balanced trees (Tutorial)
Tree View: added possibility to right-click on an edge between two nodes and "Place Root at Middle of Branch" – to re-root at mid-branch (Tutorial)

GKNO

Neel — Fri, 20 May 2016 18:56:37 -0500

gkno opens the world of complex bioinformatic analysis to people of all level of computational expertise. This site contains documentation, tutorials and information on all the tools that comprise gkno.

http://gkno.me/how-to/install.html

http://gkno.me/software.html

Address of the bookmark: http://gkno.me/

CovCal: Coverage / Read Count Calculator

Jit — Wed, 15 Jun 2016 18:08:13 -0500

Coverage / Read Count Calculator

Calculate how much sequencing you need to hit a target depth of coverage (or vice versa).

Instructions: set the read length/configuration and genome size, then select what you want to calculate.

Written by Stephen Turner, based on the Lander-Waterman formula, inspired by a similar calculator written by James Hadfield. Coverage is calculated as C=LN/G and reads as N=CG/L where C = Coverage (X),L = Read length (bp), G = Haploid genome size (bp), and N = Number of reads. Source code on GitHub.

Address of the bookmark: http://apps.bioconnector.virginia.edu/covcalc/

HivePlot

Jit — Thu, 16 Feb 2017 11:39:34 -0600

The hive plot is a rational visualization method for drawing networks. Nodes are mapped to and positioned on radially distributed linear axes — this mapping is based on network structural properties. Edges are drawn as curved links. Simple and interpretable.

The purpose of the hive plot is to establish a new baseline for visualization of large networks — a method that is both general and tunable and useful as a starting point in visually exploring network structure.

More at http://www.hiveplot.com/

Address of the bookmark: http://www.hiveplot.com/