BOL: Related items

poRe: an R package for the visualization and analysis of nanopore sequencing data

Jit — Thu, 23 Nov 2017 09:55:57 -0600

Motivation: The Oxford Nanopore MinION device represents a unique sequencing technology. As a mobile sequencing device powered by the USB port of a laptop, the MinION has huge potential applications. To enable these applications, the bioinformatics community will need to design and build a suite of tools specifically for MinION data.

Results: Here we present poRe, a package for R that enables users to manipulate, organize, summarize and visualize MinION nanopore sequencing data. As a package for R, poRe has been tested on Windows, Linux and MacOSX. Crucially, the Windows version allows users to analyse MinION data on the Windows laptop attached to the device.

Availability and implementation: poRe is released as a package for R at http://sourceforge.net/projects/rpore/ . A tutorial and further information are available at https://sourceforge.net/p/rpore/wiki/Home/

Contact:mick.watson@roslin.ed.ac.uk

Address of the bookmark: https://academic.oup.com/bioinformatics/article/31/1/114/2365693

How to sequence the human genome - Mark J. Kiel

Fri, 30 May 2014 13:24:11 -0500

View full lesson: http://ed.ted.com/lessons/how-to-sequence-the-human-genome-mark-j-kiel Your genome, every human's genome, consists of a unique DNA sequence of A's, T's, C's and G's that tell your cells how to operate. Thanks to technological advances, scientists are now able to know the sequence of letters that makes up an individual genome relatively quickly and inexpensively. Mark J. Kiel takes an in-depth look at the science behind the sequence. Lesson by Mark J. Kiel, animation by Marc Christoforidis.

GAM-NGS: genomic assemblies merger for next generation sequencing

Jit — Fri, 19 May 2017 07:44:14 -0500

GAM-NGS is a tool able to merge two or more assemblies in order to improve contiguity and correctness. It can be used on all NGS-based assembly projects and it shows its full potential with multi-library Illumina-based projects. With more than 20 available assemblers it is hard to select the best tool. In this context we propose a tool that improves assemblies (and, as a by-product, perhaps even assemblers) by merging them and selecting the generating that is most likely to be correct.

Address of the bookmark: https://github.com/vice87/gam-ngs

Jvarkit : Java utilities for Bioinformatics

Jit — Fri, 08 Jun 2018 09:31:55 -0500

Collection of Java tool kits for bioinformatics works: Jvarkit : Java utilities for Bioinformatics

Address of the bookmark: http://lindenb.github.io/jvarkit/

nQuire: a statistical framework for ploidy estimation using next generation sequencing

Jit — Thu, 04 Oct 2018 05:23:59 -0500

nQuire provides a statistical framework to study organisms with intraspecific variation in ploidy. nQuire is likely to be useful in epidemiological studies of pathogens, artificial selection experiments, and for historical or ancient samples where intact nuclei are not preserved. It is implemented as a stand-alone Linux command line tool in the C programming language and is available at https://github.com/clwgg/nQuireunder the MIT license.

Address of the bookmark: https://github.com/clwgg/nQuireunder

AMStat: display statistics of large sequence files from next generation sequencing projects

Neel — Fri, 09 Nov 2018 13:34:56 -0600

SAMStat is an efficient C program to quickly display statistics of large sequence files from next generation sequencing projects. When applied to SAM/BAM files all statistics are reported for unmapped, poorly and accurately mapped reads separately. This allows for identification of a variety of problems, such as remaining linker and adaptor sequences, causing poor mapping. Apart from this SAMStat can be used to verify individual processing steps in large analysis pipelines.

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

Scientist Bioinformatics Positions

Thu, 30 Jan 2020 06:53:40 -0600

Bioinformatics-Multi_Omics_Integration

https://www.researchgate.net/job/939073_Senior_Scientist_Bioinformatics-Multi_Omics_Integration

Senior_Scientist_Bioinformatics-Transcriptomics_Analysis

https://www.researchgate.net/job/939075_Senior_Scientist_Bioinformatics-Transcriptomics_Analysis-Belgium_France_Switzerland_The_Netherlands

Senior Scientist Bioinformatics - Network Analytics

https://www.researchgate.net/job/939070_Senior_Scientist_Bioinformatics-Network_Analytics_Belgium_France_Switzerland_the_Netherlands

Team Leader Bioinformatics Data Sciences - Mechelen, Belgium

https://www.researchgate.net/job/938787_Team_Leader_Bioinformatics_Data_Sciences-Mechelen_Belgium

Parliament2: Runs a combination of tools to generate structural variant calls on whole-genome sequencing data

Jit — Thu, 28 May 2020 21:57:03 -0500

Parliament2 identifies structural variants in a given sample relative to a reference genome. These structural variants cover large deletion events that are called as Deletions of a region, Insertions of a sequence into a region, Duplications of a region, Inversions of a region, or Translocations between two regions in the genome.

Parliament2 runs a combination of tools to generate structural variant calls on whole-genome sequencing data. It can run the following callers: Breakdancer, Breakseq2, CNVnator, Delly2, Manta, and Lumpy. Because of synergies in how the programs use computational resources, these are all run in parallel. Parliament2 will produce the outputs of each of the tools for subsequent investigation.

Address of the bookmark: https://github.com/dnanexus/parliament2

BFC: a standalone high-performance tool for correcting sequencing errors from Illumina sequencing data

Jit — Thu, 31 May 2018 09:35:23 -0500

BFC is a standalone high-performance tool for correcting sequencing errors from Illumina sequencing data. It is specifically designed for high-coverage whole-genome human data, though also performs well for small genomes. The BFC algorithm is a variant of the classical spectrum alignment algorithm introduced by Pevzner et al (2001). It uses an exhaustive search to find a k-mer path through a read that minimizes a heuristic objective function jointly considering penalties on correction, quality and k-mer support. This algorithm was first implemented in my fermi assembler and then refined a few times in fermi, fermi2 and now in BFC. In the k-mer counting phase, BFC uses a blocked bloom filter to filter out most singleton k-mers and keeps the rest in a hash table (Melsted and Pritchard, 2011). The use of bloom filter is how BFC is named, though other correctors such as Lighter and Bless actually rely more on bloom filter than BFC. https://github.com/lh3/bfc

Address of the bookmark: https://github.com/lh3/bfc

Will MinION Nanopore sequencing increase the number of Next Generation Sequencing projects?

Strand — Tue, 04 Aug 2015 05:14:07 -0500

Will MinION Nanopore sequencing increase the number of Next Generation Sequencing projects?