BOL: All site bookmarks

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

Biological file format tutorial

Jit — Sun, 17 Dec 2017 18:13:03 -0600

This section explains some of the commonly used file formats in bioinformatics. The information provided here is basic and designed to help users to distinguish the difference between different formats. Please refer user manual or other information resources on web for more details.

Address of the bookmark: https://bioinformatics.uconn.edu/resources-and-events/tutorials/file-formats-tutorial/

SVfinder: Tool for detecting genomic rearrangement form DNA-seq data

Robert M Willioms — Thu, 14 Dec 2017 15:51:40 -0600

SVfinder provides genome-wide detection of structural variants from next generation paired-end sequencing reads.

Address of the bookmark: https://github.com/cauyrd/SVfinder

TeachEnG: Teaching Engine for Genomics

Jit — Wed, 13 Dec 2017 17:55:23 -0600

TeachEnG (pronounced “teaching”), a Teaching Engine for Genomics, provides educational games to help students and researchers understand key bioinformatics concepts. The current version includes interactive modules for sequence alignment and phylogenetic tree reconstruction algorithms, with accompanying video tutorials.

Please contact us via email (knoweng@illinois.edu) if you have any questions or suggestions.

Address of the bookmark: http://teacheng.illinois.edu/

Mash: fast genome and metagenome distance estimation using MinHash

Jit — Tue, 12 Dec 2017 17:30:12 -0600

Mash is normally distributed as a dependency-free binary for Linux or OSX (see https://github.com/marbl/Mash/releases). This source distribution is intended for other operating systems or for development. Mash requires c++11 to build, which is available in and GCC >= 4.8 and OSX >= 10.7.

See http://mash.readthedocs.org for more information.

Address of the bookmark: https://github.com/marbl/Mash/releases

MashMap: a fast and approximate software for mapping long reads (PacBio/ONT) or assembly to reference genome(s)

Jit — Tue, 12 Dec 2017 17:23:31 -0600

MashMap is a fast and approximate software for mapping long reads (PacBio/ONT) or assembly to reference genome(s). It maps a query sequence against a reference region if and only if its estimated alignment identity is above a specified threshold. It does not compute the alignments explicitly, but rather estimates a k-mer based Jaccard similarity using a combination of Winnowing and MinHash. This is then converted to an estimate of sequence identity using the Mash distance. An appropriate k-mer sampling rate is automatically determined given minimum local alignment length and identity thresholds. The efficiency of the algorithm improves as both of these thresholds are increased.

Address of the bookmark: https://github.com/marbl/MashMap

BBTools User Guide

Neel — Mon, 11 Dec 2017 06:37:48 -0600

The guides describe the function, syntax, and typical use-cases of the tools; for a complete list of parameters, run the tool’s shellscript or open it with a text editor. Most tools do not currently have a guide, but each has shellscripts with basic usage information. The “General Usage Guide” gives shared background information covering usage of all tools.

Installation

General Usage Guide

Data Preprocessing Guide

Specific Tool Guides:

https://jgi.doe.gov/data-and-tools/bbtools/bb-tools-user-guide/

Address of the bookmark: https://jgi.doe.gov/data-and-tools/bbtools/bb-tools-user-guide/

Synima: Synteny Imaging tool

Jit — Sun, 10 Dec 2017 17:03:48 -0600

Synteny Imaging tool (Synima) written in Perl, which uses the graphical features of R. Synima takes orthologues computed from reciprocal best BLAST hits or OrthoMCL, and DAGchainer, and outputs an overview of genome-wide synteny in PDF. Each of these programs are included with the Synima package, and a pipeline for their use. Synima has a range of graphical parameters including size, colours, order, and labels, which are specified in a config file generated by the first run of Synima – and can be subsequently edited. Synima runs quickly on a command line to generate informative and publication quality figures. Synima is open source and freely available from https://github.com/rhysf/Synima under the MIT License.

Address of the bookmark: https://github.com/rhysf/Synima

R googleVis examples

Rahul Nayak — Sun, 10 Dec 2017 06:13:42 -0600

It may take a little while to load all charts. Please be patient. All charts require an Internet connection.

These examples are taken from the googleVis demo. You can execute the demo via

library(googleVis)
demo(googleVis)

For more details about the charts and further examples see the helpfiles of the individual googleVis function and review the Google Charts API documentation and Terms of Service.

Address of the bookmark: https://cran.r-project.org/web/packages/googleVis/vignettes/googleVis_examples.html

MOSS: A System for Detecting Software Similarity

Jit — Sat, 09 Dec 2017 08:59:07 -0600

Moss (for a Measure Of Software Similarity) is an automatic system for determining the similarity of programs. To date, the main application of Moss has been in detecting plagiarism in programming classes. Since its development in 1994, Moss has been very effective in this role. The algorithm behind moss is a significant improvement over other cheating detection algorithms (at least, over those known to us).

Moss can currently analyze code written in the following languages:

C, C++, Java, C#, Python, Visual Basic, Javascript, FORTRAN, ML, Haskell, Lisp, Scheme, Pascal, Modula2, Ada, Perl, TCL, Matlab, VHDL, Verilog, Spice, MIPS assembly, a8086 assembly, a8086 assembly, MIPS assembly, HCL2.

Address of the bookmark: https://theory.stanford.edu/~aiken/moss/