BOL: Related items

Sample BINC question paper 2016 - part2

Radha Agarkar — Fri, 13 May 2016 03:42:56 -0500

Download the sample question paper for BINC 2016 - paer II

SATSUMA : Highly sensitive whole-genome synteny alignments.

Jit — Fri, 13 May 2016 05:25:26 -0500

Satsuma is a whole-genome synteny alignment program. It takes two genomes, computes alignments, and then keeps only the parts that are orthologous, i.e. following the conserved order and orientation of features, such as protein coding genes, non-coding genes, or neutral sequences. Satsuma does not require any pre-processing, such as repeat masking, since it will automatically detect ambiguous mappings.

Satsuma has parallelization built-in and is designed to run on multi-core architectures. The run-time for aligning two bird-size genomes (~1.2 Gb) is around two days on 24 CPUs.

You can find the manual here.
Download the latest source code from here.
Stable versions can also be downloaded from the Broad Institute's web site.

An incomplete list of questions and answers (yes, these have really been asked by our users! Please feel free to add your own by e-mailing us) is here.

If you use Satsuma in your research, please cite:
Grabherr, M. G., Russell, P., Meyer, M., Mauceli, E., Alföldi, J., Di Palma, F., & Lindblad-Toh, K. (2010). Genome-wide synteny through highly sensitive sequence alignment: Satsuma. Bioinformatics, 26(9), 1145-51.

Tutorial at http://evomics.org/learning/genomics/satsuma/

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

BLOSUM50 Matrix

Radha Agarkar — Sat, 21 May 2016 22:12:15 -0500

BioGPS

Anjana — Mon, 23 May 2016 03:15:46 -0500

A free extensible and customizable gene annotation portal, a complete resource for learning about gene and protein function.

http://biogps.org/#goto=welcome

Address of the bookmark: http://biogps.org/#goto=welcome

ClueGO

Jit — Thu, 02 Jun 2016 09:51:44 -0500

ClueGO is a Cytoscape plug-in that visualizes the non-redundant biological terms for large clusters of genes in a functionally grouped network and it can be used in combination with GOlorize.

Address of the bookmark: http://www.ici.upmc.fr/cluego/

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/

Projects opening at NBAGR

Wed, 24 Aug 2016 04:13:13 -0500

ICAR - NATIONAL BUREAU OF ANIMAL GENETIC RESOURCES

Karnal -132001 (Haryana)

A walk-in-Interview is proposed to be held at National Bureau of Animal Genetic Resources, Karnal (Haryana)-132001 at 10:30 AM on 05.09.2016 for the selection of Three Research Associate & One Young Professional - II as per details given below:

Name of the Scheme / Project: Center for Agricultural Bioinformatics. The post duration is Upto 31.032017 or earlier & Co-terminus with the project.

Research Associate (Three posts)

Date & Time of Interview: 10.30 A.M. on 05.09.2016

Essential Qualifications: PhD degree in any one of discipline/Subject Biotechnology/ Animal Genetics and Breeding/ Biochemistry/ Bioinformatics/Molecular Genetics OR Master’s degree in any one of above mentioned discipline/Subject with 4 years/5 years of Bachelor’s degree having 1st division or 60% marks or equivalent overall grade point average, with at least two years of research experience as evidenced from Fellowship/Associateship

Desirable Qualifications: Experience in Database/Next Generation Sequencing Data analysis for 02 RA posts or working experience in molecular biology, gene expression data analysis, SNP genotyping and sequence data analysis, functional gene characterization for 01 RA post.

Young Professionals II One position

Date & Time of Interview: 10.30 A.M. on 05.09.2016

Essential: B. Tech or M.Tech. in Bioinformatics / Computer Science / Computer Application.

Desirable: Experience in Linux, MySQL, Java, C++/ PHP/ PERL R based data analysis and application development in Bioinformatics.

More Info : http://14.139.252.116/ADvertisementforCabinScheme.pdf

Research Assistant Bioinformatics at Andhra University

Sat, 18 Jun 2016 18:39:09 -0500

Advt. No. AUMLR/BIF/ RA /6-2016
Research Assistant Job Position in Andhra University on temporary basis
No. of Post : 01
Eligibility : Applicants who have completed their Post Graduate degree in Bioinformatics.
Desirable : Undergone traineeship in BIF; at least one publication in Bioinformatics.
Stipend : A monthly stipend of Rs. 22,000/- + HRA (HRA is applicable only for NET qualified candidates)
How to apply
Applications on plain paper, stating the name, address, date of birth, educational qualifications and experiences, and Institute, along with attested photocopies of mark sheets and certificates, should be submitted to K. UMADEVI, Coordinator, BIF Programme, Department of Marine Living Resources, Andhra University, Visakhapatnam-530 003, Andhra Pradesh, on or before 15th July, 2016.

Candidates are required to appear for an interview, with all the necessary certificates in original along with a set of attested copies in the office of the Principal, AU College of Science & Technology, Andhra University, Visakhapatnam. Applications may be sent by Email to andhrauniv.btisnet@nic.in / katruumadevi@gmail.com.

SAM flags

Poonam Mahapatra — Wed, 29 Jun 2016 15:38:15 -0500

Decoding SAM flags

This utility makes it easy to identify what are the properties of a read based on its SAM flag value, or conversely, to find what the SAM Flag value would be for a given combination of properties.

To decode a given SAM flag value, just enter the number in the field below. The encoded properties will be listed under Summary below, to the right.

Address of the bookmark: https://broadinstitute.github.io/picard/explain-flags.html

Kaiju

Jit — Mon, 27 Jun 2016 11:23:04 -0500

Kaiju is a program for the taxonomic classification of metagenomic high-throughput sequencing reads. Each read is directly assigned to a taxon within the NCBI taxonomy by comparing it to a reference database containing microbial and viral protein sequences.

By default, Kaiju uses either the available complete genomes from NCBI RefSeq or the microbial subset of the non-redundant protein database nr used by NCBI BLAST, optionally also including fungi and microbial eukaryotes.

Kaiju translates reads into amino acid sequences, which are then searched in the database using a modified backward search on a memory-efficient implementation of the Burrows-Wheeler transform, which finds maximum exact matches (MEMs), optionally allowing mismatches in the protein alignment. The search can process up to millions of reads per minute using, for example, only 10 GB RAM with a protein database comprising 4821 microbial genomes. Kaiju can also be used for querying any other protein database without taxonomic classification, using either protein or nucleotide queries.

Kaiju is described in Menzel, P. et al. (2016) Fast and sensitive taxonomic classification for metagenomics with Kaiju. Nat. Commun. 7:11257 (open access).

Address of the bookmark: http://kaiju.binf.ku.dk/