BOL: Related items

SRF and JRF Bioinformatics at Tezpur University, Napaam

Wed, 03 Aug 2016 03:47:38 -0500

Applications are invited for the following temporary positions unde MHRD sponsored Centre of Excellence
in the Department of Computer Science and Engineering (CSE), Tezpur University

Qualification
and Experience : Senior Research Fellow (SRF) and JRF : First Class in M.E/M.Tech in CSE/IT/ECE with research
experience in relevant fields of research (Candidates having valid GATE/NET Score would be preferred).

Fellowship: Rs. 18,000/- per month (fixed)

Duration : 2 (Two) years and may be extended
depending on status of the project

Age Limit: Candidates should not be more than 32 years of
age in case of SRF and 28 years of age in case of JRF and TA. Upper age limit may be relaxed up to 5
years in the case of candidate belonging to SC/ ST/ OBC/ Women/ Differently abled.

How to Apply:
Interested candidates may send their application on plain paper by post along with his/her educational
qualifications, research experience certificates (for SRF), 02 copies of recent passport/stamp size photographs
and contact phone number to Professor D.K Bhattacharyya, Principal Investigator, Department of Computer
Science & Engineering, Tezpur University, Napaam – 784 028, or mail it to dkb@tezu.ernet.in
(or to smh@tezu.ernet.in) within 15 days of publication of this advertisement.

No TA/DA shall
be paid for attending the interview.

For more details: http://www.tezu.ernet.in/ProjectWalkin/Advt-DoRD-CSE-DKB-20-225-6779-A.pdf

VAGUE:Velvet Assembler Graphical Front End

Jit — Fri, 24 Feb 2017 08:56:49 -0600

VAGUE is a vague acronym for "Velvet Assembler Graphical Front End", which means it is a GUI for the Velvet de novo assembler. The command line version of Velvet can be complicated for beginners to use, but VAGUE makes it clear and simple

More at http://www.vicbioinformatics.com/software.vague.shtml

Address of the bookmark: http://www.vicbioinformatics.com/software.vague.shtml

Bambus

Jit — Tue, 16 Aug 2016 08:09:15 -0500

Bambus 2.0, the second generation Bambus scaffolder available as an open source package. While most other scaffolders are closely tied to a specific assembly program, Bambus accepts the output from most current assemblers and provides the user with great flexibility in choosing the scaffolding parameters. In particular, Bambus is able to accept contig linking data other than specified by mate-pairs. Such sources of information include alignment to a reference genome (Bambus can directly use the output of MUMmer), physical mapping data, or information about gene synteny.

Home Page:

http://sourceforge.net/apps/mediawiki/amos/index.php?title=Bambus2

Address of the bookmark: https://www.cbcb.umd.edu/software/bambus2

JRF Bioinformatics at MANIT, India

Thu, 18 Aug 2016 02:48:53 -0500

Advt. No.: Maths./577/2016 Date: 12/08/2016
JRF Bioinformatics Job Position in Maulana Azad National Institute of Technology (MANIT) purely temporary basis
Project Title : “Computational Approach to Study Complex Biological Network of Diseases using Molecular Data”
Essential Qualifications & experience: M.Tech in Bioinformatics/ Computational System biology/Computer Science or M.Sc. in Bio informatics/Biotechnology/Mathematics/Statistics from recognized University/ Institute. Preference will be given to GATE/NET qualified candidates.
No. of Post : 01
Fellowship: INR 12000

How to apply
The duly completed application on prescribed format along with copies of supporting documents must reach to: office of the Dr. Usha Chouhan, Principal Investigator, Department of Mathematics, Bioinformatics & Computer Applications, Maulana Azad National Institute of Technology, Bhopal-462003 on or before 31/08/2016. A soft copy of the application should also be sent to ycchouhan@gmail.com email address of Principal Investigator.

More at http://www.web.manit.ac.in/Year%202016/JRF/walk%20in.pdf

vcfR

Archana Malhotra — Fri, 19 Aug 2016 07:38:24 -0500

Most variant calling pipelines result in files containing large quantities of variant information. The variant call format (vcf) is an increasingly popular format for this data. The format of these files and their content is discussed in the vignette ‘vcf data.’ These files are typically intended to be post-processed (i.e., filtered) as an attempt to remove false positives or otherwise problematic sites. The R package vcfR provides tools to facilitate this filtering as well as to visualize the effects of choices made during this process.

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

LUMPY

Shruti Paniwala — Thu, 25 Aug 2016 08:05:02 -0500

A probabilistic framework for structural variant discovery.

Ryan M Layer, Colby Chiang, Aaron R Quinlan, and Ira M Hall. 2014. "LUMPY: a Probabilistic Framework for Structural Variant Discovery." Genome Biology 15 (6): R84. doi:10.1186/gb-2014-15-6-r84.

More at https://github.com/arq5x/lumpy-sv

Address of the bookmark: https://github.com/arq5x/lumpy-sv

Ka, Ks and Ka/Ks calculations

Poonam Mahapatra — Mon, 29 Aug 2016 11:44:11 -0500

gKaKs is a codon-based genome-level Ka/Ks computation pipeline developed and based on programs from four widely used packages: BLAT, BLASTALL (including bl2seq, formatdb and fastacmd), PAML (including codeml and yn00) and KaKs_Calculator (including 10 substitution rate estimation methods). gKaKs can automatically detect and eliminate frameshift mutations and premature stop codons to compute the substitution rates (Ka, Ks and Ka/Ks) between a well-annotated genome and a non-annotated genome or even a poorly assembled scaffold dataset. It is especially useful for newly sequenced genomes that have not been well annotated.

Look for KaKs calculation:

https://github.com/fumba/kaks-calculator

http://longlab.uchicago.edu/?q=gKaKs

http://www.ncbi.nlm.nih.gov/pubmed/23314322

Address of the bookmark: http://longlab.uchicago.edu/?q=gKaKs

Redundans

Jit — Thu, 01 Sep 2016 08:28:11 -0500

Redundans pipeline assists an assembly of heterozygous genomes.
Program takes as input assembled contigs, paired-end and/or mate pairs sequencing libraries and returns scaffolded homozygous genome assembly, that should be less fragmented and with total size smaller than the input contigs. In addition, Redundans will automatically close the gaps resulting from genome assembly or scaffolding more details.

The pipeline consists of three steps/modules:

redundancy reduction: detection and selectively removal of redundant contigs from an initial de novo assembly
scaffolding: joining of genome fragments using paired-end and/or mate-pairs reads
gap closing

Redundans is:

fast & lightweight, multi-core support and memory-optimised, so it can be run even on the laptop for small-to-medium size genomes
flexible toward many sequencing technologies (Illumina, 454 or Sanger) and library types (paired-end, mate pairs, fosmids)
modular: every step can be ommited or replaced by another tools

Address of the bookmark: https://github.com/Gabaldonlab/redundans

NGS Tutorial

Jit — Mon, 05 Sep 2016 09:50:46 -0500

These tutorials are written for hundreds of bioinformaticians trying to cope with large volume of next-generation sequencing (NGS) data. NGS technologies brought a dramatic shift in the world of sequencing. Merely five years back, genome sequencing of higher eukaryotes used to be very expensive endeavor. To get a genome of interest sequenced, hundreds of scientists had to raise funds together by writing a joint white-paper and petitioning to various government agencies. The tasks of sequencing and assembly were handled by dedicated sequencing facilities, of which only a few existed around the globe. Naturally, the capacities at those sequencing facilities were significantly constrained from high volume of requests

Address of the bookmark: http://www.homolog.us/Tutorials/index.php

GAGE : Genome Assembly Gold-standard Evaluation

Jit — Wed, 07 Sep 2016 07:35:49 -0500

GAGE is an evaluation of the very latest large-scale genome assembly algorithms. We have organized this "bake-off" as an attempt to produce a realistic assessment of genome assembly software in a rapidly changing field of next-generation sequencing. The main results of GAGE have now been published in the journal Genome Research: GAGE: A critical evaluation of genome assemblies and assembly algorithms.

http://genome.cshlp.org/content/early/2012/01/12/gr.131383.111

Address of the bookmark: http://gage.cbcb.umd.edu/index.html