Project: Indo-UK Centre for improvement of Nitrogen use efficiency in wheat Dr. Soma S. Marla, Pr. Scientist (Bioinformatics), Division of Genomic Resources, ICAR, NBPGR, ND.

Qualification: Ph.D. Degree in Computer Sciences/Bioinformatics OR 1. First class Master’s degree in any discipline of Plant Sciences with specialization in Computer Sciences/ Bioinformatics having 1st division or 60% marks or equivalent overall grade point average with at least two years of research experience as evidenced from Fellowship/ Associate ship. 2. NET qualification is essential for the candidates with 3+2 years B.Sc.+ M.Sc. Desirable: Demonstrated experience & skills in database design, management, UNIX OS, in NGS data analysis. Experience substantiated by publications of high quality will be preferred.

No.of Post: 1

Pay Scale: Rs. 40,000 (Ph.D)/ Rs + 30 % HRA; Rs.38,000 ( Masters Degree 0 + 30 % HRA).

Age Limit : below 40 years for RA position
How to apply
Applicants for RA post should send their complete CV (Advance copy of the application may be sent by email to :soma.marla@icar.gov.in or ssmarl@yahoo.com, should enclose the copy of the research publications; one page summary of their achievement relevant to the post applied for; and should enclose two reference letters (one must be from the person with whom worked latest). Shortlisted candidate will be intimated for interview by email.

The candidates who wish to attend the walk-in interview are requested to bring with them five copies of the CV (one copy with photograph) as per the format given below. Also, the candidates should bring the original documents such as degree certificates, marks sheets, publications, thesis, experience certificate etc. for verification.

Date of Interview: 17.8.2016.

More at http://www.nbpgr.ernet.in/Downloadfile.aspx?EntryId=7133

Applications are invited on plain paper from eligible candidates along with biodata and copies of certificates in support of age, qualification and experience for the following position:

Particulars Description

1. Position & No. JRF (Junior Research Fellow) 01

2. Title of the Project Molecular modeling and docking studies on Deguelin and its derivatives with cell cycle arrest, apoptosis and anti-angiogenesis pathway proteins in cancer cell signaling pathway

3. Tenure 3 years

4. Investigator Dr. K. V.Swamy

5. Institute Dr. D. Y. Patil Biotechnology and Bioinformatics Institute, Tathawade, Pune 411033.

5. Qualifications/Eligibility

Essential: NET (National Eligibility Test) qualified M. Sc Bioinformatics/ M. Tech Bioinformatics/M. Sc Biotechnology/M. Tech Biotechnology or Graduate degree in Professional course with NET qualification or Post graduation degree in professional course

The following examinations conducted by various Central Government Departments/Agencies are considered as National Eligibility Test (NET).

1. CSIR-UGC-LS
2. GATE (Graduate Aptitude Test in Engineering)
3. JAM (Joint Admission Test)
4. GPAT (Graduate Pharmacy Aptitude Test)
5. BET(Biotechnology Eligibility Test)
6. BINC(Bioinformatics National Consortium)
7. JEST( Joint Entrance Screening Test)
8. JGEEBILS(Joint Graduate Entrance Examination for Biology & Interdisciplinary Life Sciences)
9. NBHM Ph.D scholarship Screening Test
10. ICMR- JRF Entrance Examination
11. AICE (ICAR-All India competitive Examination )
(For all above examinations valid score considered at the time of interview)

Desirable: Knowledge and skills in Bioinformatics tools/ softwares

6. Monthly Emoluments Rs.25,000/ (As per DST-SERB rules)

7. Last date for submission of prescribed application 20/08/2016

Kindly send your applications to “Dr. K. V. Swamy, Asst.Professor, Dr. D. Y. Patil Biotechnology & Bioinformatics Institute, Survey No. 87/88, Mumbai-Pune Express Way, Tathawade, Pune - 411033, Maharashtra, India”. Highlight the envelope with “Application for post of JRF (Junior Research Fellow)”.

Note: No TA/DA will be paid for attending the interview.

Advertisement: http://careers.dpu.edu.in/Biotech.aspx

Project :“Genetic Transformation and Development of Elite Transgenic Maize (Zea mays L.) for Biotic and Abiotic Stresses Tolerance”.

Qualification: Ph.D. degree in:Biotechnology/Bioinformatics/Biochemistry/Plant Molecular Biology/Plant Physiology/Botany or any related area with evidence of prior experience in maize transformation.

Additional experience in plant transformation of any cereal crop would be preferable.

The appointment would initially be for one year.

How to apply
Interested applicants should send their detailed CV including brief synopsis regarding the previous research experience (along withcontact email address by email) to: Dr. Tanushri Kaul (tanushri@icgeb.res.in). Group Leader, Nutritional Improvement of Crops Group, International Centre for Genetic Engineering and Biotechnology, Aruna Asaf Ali Marg, New Delhi-110 067.

Closing date for applications: 22 August 2016.

More at http://www.icgeb.org/vacancies.html

• single-end/paired-end bulk RNA-seq (strand-specific/agnostic)
• paired-end single-cell RNA-seq (strand-specific/agnostic)
• nanopore RNA-seq (PCR cDNA/direct cDNA/direct RNA)

Written by Ka Ming Nip ✉️

Address of the bookmark: https://github.com/bcgsc/RNA-Bloom

Senior Manager (Bioinformatics Operations)
No. of posts: 01 (General)
Pay Scale: PB-3 15600-39100 + Grade Pay Rs.6600/-
Min. Qualification: PhD in Bioinformatics, , Life Sciences or Computer Science applied to biological questions.
A Min. 5 years of experience
Age limit: 40 years as on August 01, 2016

More at http://www.rgcb.res.in/positions.php

Address of the bookmark: https://github.com/rrwick/Unicycler

Following are the genome assembly tools based on string graph:

1.SGA (String Graph Assembler) https://github.com/jts/sga

Assembles large genomes from high coverage short read data. SGA is designed as a modular set of programs, which are used to form an assembly pipeline. SGA implements a set of assembly algorithms based on the FM-index. As the FM-index is a compressed data structure, the algorithms are very memory efficient. The SGA assembly has three distinct phases. The first phase corrects base calling errors in the reads. The second phase assembles contigs from the corrected reads. The third phase uses paired end and/or mate pair data to build scaffolds from the contigs. The output of this software is a PDF report that allows the properties of the genome and data quality to be visually explored. By providing more information to the user at the start of an assembly project, this software will help increase awareness of the factors that make a given assembly easy or difficult, assist in the selection of software and parameters and help to troubleshoot an assembly if it runs into problems.

2. SAGE: String-overlap Assembly of GEnomes https://github.com/lucian-ilie/SAGE2

SAGE, for de novo genome assembly. As opposed to most assemblers, which are de Bruijn graph based, SAGE uses the string-overlap graph. SAGE builds upon great existing work on string-overlap graph and maximum likelihood assembly, bringing an important number of new ideas, such as the efficient computation of the transitive reduction of the string overlap graph, the use of (generalized) edge multiplicity statistics for more accurate estimation of read copy counts, and the improved use of mate pairs and min-cost flow for supporting edge merging. The assemblies produced by SAGE for several short and medium-size genomes compared favourably with those of existing leading assemblers.

3. FSG: Fast String Graph

The new integrated assembler has been assessed on a standard benchmark, showing that fast string graph (FSG) is significantly faster than SGA while maintaining a moderate use of main memory, and showing practical advantages in running FSG on multiple threads. Moreover, we have studied the effect of coverage rates on the running times.

4.  BASE https://github.com/dhlbh/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. BASE is a practically efficient tool for constructing contig, with significant improvement in quality for long NGS reads. It is relatively easy to extend BASE to include scaffolding.

5. Fermi https://github.com/lh3/fermi/

Fermi is a de novo assembler with a particular focus on assembling Illumina short sequence reads from a mammal-sized genome. In addition to the role of a typical assembler, fermi also aims to preserve heterozygotes which are often collapsed by other assemblers. Its ultimate goal is to find a minimal set of unitigs to represent all the information in raw reads.

If you want to learn about String Graph assembler, please read the following papers -

i) The Fragment Assembly String Graph - E. W. Myers

This paper describes the String Graph concept.

ii) Efficient construction of an assembly string graph using the FM-index - Jared T. Simpson and Richard Durbin

This earlier paper from Simpson and Durbin

iii) Efficient de novo assembly of large genomes using compressed data structures - Jared T. Simpson and Richard Durbin

Using AlignGraph

AlignGraph --read1 reads_1.fa --read2 reads_2.fa --contig contigs.fa --genome genome.fa --distanceLow distanceLow --distanceHigh distancehigh --extendedContig extendedContigs.fa --remainingContig remainingContigs.fa [--kMer k --insertVariation insertVariation --coverage coverage --part p --fastMap --ratioCheck --iterativeMap --misassemblyRemoval --resume]

Address of the bookmark: https://github.com/baoe/AlignGraph

http://www.boseinst.ernet.in/advertisement.html