BOL: Related items

Statistics and probability

Jit — Tue, 08 Nov 2016 07:34:25 -0600

Topics

Displaying and describing data

Modeling distributions of data

Describing relationships in quantitative data

Designing studies

Probability

Random variables

Sampling distributions

Confidence intervals (one sample)

Significance tests (one sample)

Significance tests and confidence intervals (two samples)

Inference for categorical data (chi-square tests)

Advanced regression (inference and tran

Address of the bookmark: https://www.khanacademy.org/math/statistics-probability

Bioistats Online course

Abhimanyu Singh — Thu, 10 Nov 2016 04:22:51 -0600

One of our primary focuses will be to develop an understanding of the various ways in which we can assign a probability to some chance event. We'll also learn the fundamental properties of probability, investigate how probability behaves, and learn how to calculate the probability of a new chance event.

This book is handy understanding basic concepts.

Address of the bookmark: https://onlinecourses.science.psu.edu/stat414/node/287

Research Officer at National Tea Research Foundation

Fri, 18 Nov 2016 04:19:24 -0600

National Tea Research Foundation (NTRF) a registered body, requires qualified and experienced agricultural research scientist for contractual appointment as per details below :

Post Research Officer, NTRF, Kolkata

Essential Post Graduate degree in Life Science having special paper in Bioinformatics. Post Graduate degree in Bioinformatics.

Desirable Ph. D. in the area of computational biology or bioinformatics.

Job Experience Work experience on database development, capable to work independently and efficient in bioinformatics related project.

Job Responsibility

To develop database on various aspects of tea research.

Screening of the In-house projects of NTRF at the preliminary level.

Review and evaluation of In-house projects of NTRF. Technical monitoring of the In-house projects of NTRF.

Reviewing the final technical report of the In-house projects of NTRF.

Putting-up of same proposals for taking approval and sanction of the competent authority.

Physical and technical verification of the In-house projects of NTRF.

To assist in organizing seminars / workshops / meetings etc.

Interested candidate may appear for walk-in Interview on 17 th November, 2016

More Info :

http://www.teaboard.gov.in/pdf/Recruitment_for_the_post_of_Research_Officer_pdf7538.pdf

Spines

Jit — Mon, 28 Nov 2016 05:33:26 -0600

Spines is a collection of software tools, developed and used by the Vertebrate Genome Biology Group at the Broad Institute. It provides basic data structures for efficient data manipulation (mostly genomic sequences, alignments, variation etc.), as well as specialized tool sets for various analyses. It also features three sequence alignment packages: Satsuma, a highly parallelized program for high-sensitivity, genome-wide synteny; Papaya, an all-purpose alignment tool for less diverged sequences; and SLAP, a context-sensitive local aligner for diverged sequences with large gaps.

Access Spines here.

Address of the bookmark: https://www.broadinstitute.org/genome-sequencing-and-analysis/spines

SWALO

Jit — Wed, 30 Nov 2016 05:06:05 -0600

SWALO (scaffolding with assembly likelihood optimization) is a method for scaffolding based on likelihood of genome assemblies computed using generative models for sequencing.

Download

Git repository of SWALO is at https://github.com/atifrahman/SWALO.

Address of the bookmark: https://atifrahman.github.io/SWALO/

DBT India

Jit — Sun, 04 Dec 2016 22:30:37 -0600

Latest announcement on DBT India.

Calls

Events

Projects

Jobs

Address of the bookmark: http://www.dbtindia.nic.in/out-reach/latest-announcements/

Cutadapt

Bulbul — Wed, 14 Dec 2016 09:59:52 -0600

Cutadapt finds and removes adapter sequences, primers, poly-A tails and other types of unwanted sequence from your high-throughput sequencing reads.

Cutadapt helps with these trimming tasks by finding the adapter or primer sequences in an error-tolerant way. It can also modify and filter reads in various ways. Adapter sequences can contain IUPAC wildcard characters. Also, paired-end reads and even colorspace data is supported. If you want, you can also just demultiplex your input data, without removing adapter sequences at all.

Cutadapt comes with an extensive suite of automated tests and is available under the terms of the MIT license.

If you use cutadapt, please cite DOI:10.14806/ej.17.1.200 .

More at https://github.com/marcelm/cutadapt

Address of the bookmark: http://cutadapt.readthedocs.io/en/stable/guide.html

PRISM

Jit — Sat, 10 Dec 2016 15:19:40 -0600

PRISM is a software for split read (reads which span across a structrual variant -- SV ) mapping and SV calling from the mapping result. PRISM is able to detect small insertions and abitrary size deletions, inversions and tandom duplications with the direction of discordant read pairs. PRISM_CTX is a tool for detecting inter-chromosome trans-location events.

PRISM and PRISM_CTX were originally designed and written by Michael Brudno and Yue Jiang, The original PRISM publication can be found here.

The authors may be contacted via e-mail at: prism at cs.toronto.edu.

Additional information is available in the PRISM README file and PRISM_CTX README file.

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

Address of the bookmark: http://compbio.cs.toronto.edu/prism/

ScaffMatch

Jit — Tue, 13 Dec 2016 10:23:56 -0600

caffMatch is a novel scaffolding tool based on Maximum-Weight Matching able to produce high-quality scaffolds from NGS data (reads and contigs). The tool is written in Python 2.7. It also includes a bash script wrapper that calls aligner in case one needs to first map reads to contigs (instead of providing .sam files).

The arguments accepted by ScaffMatch are:

-w) Working directory -- this is the directory where ScaffMatch files are stored. These are .sam files produced after mapping reads to contigs and the resulting scaffolds file `scaffolds.fa` fasta file;

-c) Contig fasta file;

-m) Command line argument with no options. It is used when .sam files are used instead of reads .fastq files. Do not use this option if you provide reads files;

-1) (Comma separated list of) either .fastq or .sam file(s) corresponding to the first read of the read pair;

-2) (Comma separated list of) either .fastq or .sam file(s) corresponding to the second read of the read pair;

-i) (Comma separated list of) insert size(s) of the library(-ies);

-s) (Comma separated list of) library(-ies) standard deviation(s) of insert size(s);

-t) Bundle threshold. Pairs of contigs supported by number of read pairs less than the value of this argument are discarded. Optional argument, by default it is equal to 5;

-g) Matching heuristics: use `max_weight` for Maximum Weight Matching heuristics with the Insertion step, use `backbone` for Maximum Weight Matching heuristics without the Insertion step, use `greedy` for Greedy Matching heuristics;

-l) Log file - where to store the logs. Optional argument. By default, stdout is used.

Address of the bookmark: http://alan.cs.gsu.edu/NGS/?q=content/scaffmatch

E-MEM: Efficient computation of Maximal Exact Matches

Jit — Thu, 15 Dec 2016 09:30:43 -0600

E-MEM is a C++/OpenMP program designed to efficiently compute MEMs between large genomes. See the README file for instructions on how to use E-MEM.

E-MEM source code

The source code can be downloaded here.

If you use E-MEM, please cite:

N. Khiste, L. Ilie, E-MEM: Efficient computation of Maximal Exact Matches for very large genomes, Bioinformatics 31(4) (2015) 509 -- 514.

For any questions, please contact Lucian Ilie: ilie@uwo.ca

Address of the bookmark: http://www.csd.uwo.ca/~ilie/E-MEM/