BOL: Related items

Bioinformatics JRF/RA/SRF position at PANJAB UNIVERSITY

Wed, 19 Nov 2014 20:19:49 -0600

CENTRE FOR SYSTEMS BIOLOGY & BIOINFORMATICS
UIEAST, PANJAB UNIVERSITY, CHANDIGARH

Applications are invited along with complete bio-data and attested copies of certificates of qualifications, experience etc. for the one post of Research Fellow and one post of Program Assistant under PURSE Grant of the University in Centre for Systems Biology & Bioinformatics, UIEAST, Panjab University, Chandigarh which is tenable till the period of
the project.

Essential Qualification

For Research Fellow:-

M.Sc. in Systems Biology and Bioinformatics / Life Sciences with minimum 55% marks.

Preference will be given to NET/GATE/ICMR qualified candidates without fellowship however, candidates who have cleared the Panjab University Ph.D. entrance test in Systems Biology & Bioinformatics will also be eligible.

For Program Assistant:-

The candidate must have M.Sc./M.Tech/MCA/PGDCA in Computer Science and must be able to handle LAN, Linex. Preference will be given to the candidate having experience in
System Administration.

Emoluments

For Research Fellow Rs. 12,500/- per month (Fixed)
For Program Assistant Rs. 12,500/- per month (Fixed)

Applications should be reach on or before 19-11-2014 in the office of the undersigned.

Interview will be held on 21-11-2014 in the office of the Coordinator, Centre for Systems Biology & Bioinformatics, South Campus, Block-3, Sector-25, Panjab University, Chandigarh. No TA/DA will be paid.

http://jobs.puchd.ac.in/includes/jobs/2014/20141110143634-Advertisement.pdf

Quick next generation sequencing (NGS) terms definition

Neel — Fri, 09 Jun 2017 04:52:26 -0500

fragment size: the Illumina WGS protocol generates paired-end reads from both ends of longer fragments. The lengths of these fragments are assumed to be sampled from a normal distribution. Therefore, in the absence of structural variants, mapping locations of the paired ends span within an interval [δmin,δmax]. Most (>90%) of paired-end reads are sampled from no-SV regions, therefore the fragment size distribution can be learned empirically for each WGS data set separately.

concordant reads: a read pair is called concordant if they can be mapped to the reference genome as “expected”: (a) mapped to opposing strands where the upstream read is mapped to the forward strand and the downstream read is mapped to the reverse strand2, (b) the distance between ends is between the minimum and maximum expected fragment size.

discordant reads: briefly, any non-concordant read pair is considered discordant. Note that, by definition, the discordant read pairs signal potential SVs. The sequence signature produced by these type of reads is known as read-pair signature.

split reads: a read that can only be mapped to the reference genome by breaking into two sub-reads is called a split-read. These types of reads also indicate a potential SV or a short insertion or deletion (indel).

read depth: number of reads that map within a region of the genome. Overall genome-wide read depth is also referred to as depth of coverage. It is expected that the number of reads that “cover” each base-pair to follow a Poisson distribution. Therefore, if the read depth over a certain region deviates significantly from this distribution, it signals for a potential copy number variation (CNV).

Bioinformatics SUB DIC (DIC)

Fri, 12 Dec 2014 21:14:57 -0600

Project Title BIOINFORMATICS SUB DIC (DIC)

Reference Number IIT/SRIC/R/DIC/2014/314, DATED 28thNovember, 2014

Temporary Position(s)

i) Junior/ Senior Project Officer (1)
ii) Junior Project Assistant (2)

Consolidated Compensation

i) Rs.16,000/- to Rs.18,000/- p.m. (depending on qualification & experience)
ii) Rs.8,000/- to Rs.10,000/- p.m. (depending on qualification & experience)

Coordinator / PI Dr. Sudip K. Ghosh, Dept of Biotechnology.

Department / Centre / School Dept of Biotechnology

Qualifications & Experience

(i) M. Sc in any branch of Life Sciences with experience in Molecular Biology/Genetics/Biochemistry preferably a Post Graduate diploma in Bioinformatics or two years working experience in bioinformatics (Minimum 60% marks starting from matriculation examination).

(ii) B. Sc. /B.A. /B. Com/Diploma in Management or Computer Science. Knowledge in computer software will be preferred (minimum 50% marks starting from matriculation examination).

More Information

Interested eligible persons may apply on plain paper, giving full bio-data along with attested copies of testimonials to the undersigned on or before 11thDecember, 2014.

Sponsor DBT, NEW DELHI

Last Date 11 Dec 2014

Application Fee Demand Draft for Rs.50/- (Not for female candidates) drawn in favour of IIT Kharagpur payable at Kharagpur

Advertisement: www.iitkgp.ac.in/topfiles/sric_job_details.php?serial=2826

MeDuSa: a multi-draft based scaffolder

Abhimanyu Singh — Wed, 14 Feb 2018 02:49:00 -0600

MeDuSa (Multi-Draft based Scaffolder), an algorithm for genome scaffolding. MeDuSa exploits information obtained from a set of (draft or closed) genomes from related organisms to determine the correct order and orientation of the contigs. MeDuSa formalises the scaffolding problem by means of a combinatorial optimisation formulation on graphs and implements an efficient constant factor approximation algorithm to solve it. In contrast to currently used scaffolders, it does not require either prior knowledge on the microrganisms dataset under analysis (e.g. their phylogenetic relationships) or the availability of paired end read libraries.

Address of the bookmark: https://github.com/combogenomics/medusa

Ranbow: a haplotype assembler for polyploid genomes

Jit — Fri, 01 Jun 2018 07:21:54 -0500

Ranbow is a haplotype assembler for polyploid genomes. It has been developed for the haplotype assembly of the hexaploid sweet potato genome, which is highly heterozygous. Ranbow can also be applied to other polyploid genomes. After a first phasing, Ranbow utilizes the assembled haplotypes to improve the accuracy of variant calling results and to infer the evolutionary history of the organism´s genome. Ranbow has three main modes of function: ranbow hap: for haplotyping ranbow eval: for evaluating of the assemble haplotypes by gold standard (long) reads ranbow phylo: for the phylogenetic analysis

Address of the bookmark: https://www.molgen.mpg.de/ranbow

Internship Program for Bioinformatics / Biotechnology / MBA / MCA (No. Of Vacancy: 5)

Mon, 15 Dec 2014 08:11:02 -0600

ArrayGen is offering an Internship Program for Post graduate Bioinformatics / Biotechnology / MBA / MCA students and professionals. ArrayGen Technologies provide an excellent opportunity to gain research experience and explore if a scientific career is right for you. Currently we offer positions to outstanding students interested in Next Generation Sequencing (NGS) data analysis or marketing or software development. Applications are accepted throughout the year. Accepted students will be notified through email.

KAT: a K-mer analysis toolkit to quality control NGS datasets and genome assemblies

Jit — Fri, 06 Jul 2018 03:36:45 -0500

KAT is a suite of tools that analyse jellyfish hashes or sequence files (fasta or fastq) using kmer counts. The following tools are currently available in KAT:

hist: Create an histogram of k-mer occurrences from a sequence file. Adds metadata in output for easy plotting.
gcp: K-mer GC Processor. Creates a matrix of the number of K-mers found given a GC count and a K-mer count.
comp: K-mer comparison tool. Creates a matrix of shared K-mers between two (or three) sequence files or hashes.
sect: SEquence Coverage estimator Tool. Estimates the coverage of each sequence in a file using K-mers from another sequence file.
blob: Given, reads and an assembly, calculates both the read and assembly K-mer coverage along with GC% for each sequence in the assembly.SEquence Coverage estimator Tool.
filter: Filtering tools. Contains tools for filtering k-mer hashes and FastQ/A files:
- kmer: Produces a k-mer hash containing only k-mers within specified coverage and GC tolerances.
- seq: Filters a sequence file based on whether or not the sequences contain k-mers within a provided hash.
plot: Plotting tools. Contains several plotting tools to visualise K-mer and compare distributions. The following plot tools are available:
- density: Creates a density plot from a matrix created with the "comp" tool. Typically this is used to compare two K-mer hashes produced by different NGS reads.
- profile: Creates a K-mer coverage plot for a single sequence. Takes in fasta coverage output coverage from the "sect" tool
- spectra-cn: Creates a stacked histogram using a matrix created with the "comp" tool. Typically this is used to compare a jellyfish hash produced from a read set to a jellyfish hash produced from an assembly. The plot shows the amount of distinct K-mers absent, as well as the copy number variation present within the assembly.
- spectra-hist: Creates a K-mer spectra plot for a set of K-mer histograms produced either by jellyfish-histo or kat-histo.
- spectra-mx: Creates a K-mer spectra plot for a set of K-mer histograms that are derived from selected rows or columns in a matrix produced by the "comp".

In addition, KAT contains a python script for analysing the mathematical distributions present in the K-mer spectra in order to determine how much content is present in each peak.

This README only contains some brief details of how to install and use KAT. For more extensive documentation please visit: https://kat.readthedocs.org/en/latest/

https://academic.oup.com/bioinformatics/article/33/4/574/2664339

Address of the bookmark: https://github.com/TGAC/KAT

List of non-commercial NGS genotype-calling software

Jit — Thu, 09 Aug 2018 04:21:32 -0500

Meaningful analysis of next-generation sequencing (NGS) data, which are produced extensively by genetics and genomics studies, relies crucially on the accurate calling of SNPs and genotypes. Recently developed statistical methods both improve and quantify the considerable uncertainty associated with genotype calling, and will especially benefit the growing number of studies using low- to medium-coverage data.

A list of programs for genotype and SNP calling :

SOAP2 http://soap.genomics.org.cn/index.html

Single-sample High-quality variant database (for example, dbSNP) Package for NGS data analysis, which includes a single individual genotype caller (SOAPsnp)

realSFS http://128.32.118.212/thorfinn/realSFS/

Single-sample Aligned reads Software for SNP and genotype calling using single individuals and allele frequencies. Site frequency spectrum (SFS) estimation

Samtools http://samtools.sourceforge.net/

Multi-sample Aligned reads Package for manipulation of NGS alignments, which includes a computation of genotype likelihoods (samtools) and SNP and genotype calling (bcftools)

GATK http://www.broadinstitute.org/gsa/wiki/index.php/The_Genome_Analysis_Toolkit Multi-sample Aligned reads Package for aligned NGS data analysis, which includes a SNP and genotype caller (Unifed Genotyper), SNP filtering (Variant Filtration) and SNP quality recalibration (Variant Recalibrator)

Beagle http://faculty.washington.edu/browning/beagle/beagle.html

Multi-sample LD Candidate SNPs, genotype likelihoods Software for imputation, phasing and association that includes a mode for genotype calling

IMPUTE2 http://mathgen.stats.ox.ac.uk/impute/impute_v2.html

Multi-sample LD Candidate SNPs, genotype likelihoods Software for imputation and phasing, including a mode for genotype calling. Requires fine-scale linkage map

QCall ftp://ftp.sanger.ac.uk/pub/rd/QCALL

Multi-sample LD ‘Feasible’ genealogies at a dense set of loci, genotype likelihoods Software for SNP and genotype calling, including a method for generating candidate SNPs without LD information (NLDA) and a method for incorporating LD information (LDA). The ‘feasible’ genealogies can be generated using Margarita (http://www.sanger.ac.uk/resources/software/margarita)

MaCH http://genome.sph.umich.edu/wiki/Thunder

Multi-sample LD Genotype likelihoods Software for SNP and genotype calling, including a method (GPT_Freq) for generating candidate SNPs without LD information and a method (thunder_glf_freq) for incorporating LD information

Teaching Assistant at SVIMS

Fri, 31 Jul 2015 10:15:16 -0500

Eligible candidates are invited for a walk-in-interview for recruitment of Teaching Assistant in the Department of Bioinformatics on 8.08.2015 at 10 A.M. in the Committee Hall, SVIMS, Tirupati. The candidates have to attend with all original certificates of qualification, experience on the date of interview. The engagement will be made purely on adhoc basis for a period of 6 months and it can be terminated at any time without notice or without assigning any reason thereof. This is purely an adhoc appointment and the candidate will not have any right to claim permanent benefits of any kind.

1. Remuneration : Rs. 12000/- per month (consolidated)

2. Qualification : M.Sc./M.Tech. Bioinformatics (preference will be given to the candidates with BINC / NET / GATE / Bioinformatics DBT-Traineeship / Studentship and teaching experience)

3. Place of work : Department of Bioinformatics, SVIMS, Tirupati

4. No. of Position : One

Terms and conditions:

1. Candidates are required to submit the Biodata, attested copies of relevant certificates in support of their age, educational qualification, experience etc., before the interview committee, SVIMS University, Tirupati.
2. No TA / DA will be paid for attending the interview.
3. Interim enquiries will not be entertained.
4. The maximum age limit for Teaching Assistant is 34 years as on 8th August, 2015.
5. The tenure of will be further extended subject to performance of the incumbent.

Advertisement: http://svimsbic.org/Teaching_Assistant_B.I._2015.pdf

BASE: a practical de novo assembler for large genomes using long NGS reads

Rahul Nayak — Fri, 19 Oct 2018 07:25:21 -0500

new de novo assembler called BASE. It enhances the classic seed-extension approach by indexing the reads efficiently to generate adaptive seeds that have high probability to appear uniquely in the genome. Such seeds form the basis for BASE to build extension trees and then to use reverse validation to remove the branches based on read coverage and paired-end information, resulting in high-quality consensus sequences of reads sharing the seeds. Such consensus sequences are then extended to contigs.

Address of the bookmark: https://github.com/dhlbh/BASE