DBT-Junior Research Fellowship (DBT-JRF) in Biotechnology (2020)

BIOTECHNOLOGY ELIGIBILITY TEST (BET) 2020

Applications are invited from bonafide Indian citizens, residing in India for award of “DBT-Junior Research Fellowship” (DBT-JRF) for pursuing research in frontier areas of Biotechnology and Life Sciences. The candidates will be selected through “Biotechnology Eligibility Test (BET)”. Based on the performance in BET, two categories of merit list will be prepared (Category-I and Category-II). Government of India norms for reservation will be followed for selection. Candidates selected under category-I will be eligible to avail fellowship under the programme. These will be tenable at any University/Institute in India where the selected candidate registers for PhD Programme. Candidates selected under Category-II will be eligible to be appointed in any DBT sponsored project and avail fellowship from the project equivalent to NET/GATE, subject to selection through institutional selection process. There will be no binding on Principal Investigators of DBT sponsored projects to select JRF for their project from category-II list. Selection in category-II will not entitle student for any fellowship from DBT-JRF programme.

ELIGIBILITY

Qualification: M.Sc./ M.Tech./ M.V.Sc. or equivalent degree/ Integrated BS-MS/ B.E./ B.Tech. in any discipline of Biotechnology, M.Sc./ M.Tech. Bioinformatics/ Computational Biology, students admitted under DBT supported Postgraduate Teaching Programs. M.Sc. Life Science/ Bioscience/ Zoology/ Botany/ Microbiology/ Biochemistry/ Biophysics and Masters in Allied areas of Biology/Life Sciences. Candidates appearing in the final year examination are also eligible to apply.

Marks: Minimum 60% marks for General, EWS & OBC category and 55% for SC/ ST/ Differently abled in aggregate (or equivalent grade).

Age Limit: Upto 28 years as on the last date of application for General & EWS category. Age relaxation of up to 5 years (33 years) for SC/ ST/ Differently Abled/ women candidates and upto 3 years (31 years) for OBC (Non-Creamy Layer) candidates.

For detailed procedure for filling the application form, payment of application fee and uploading of required documents/ certificates in the prescribed format, please visit: http://rcb.res.in/BET2020. A non-refundable and non-transferable application fee of Rs. 1000/-is payable online by General/ OBC/ EWS candidates and Rs 250/- by SC/ ST/ Differently abled candidates.

IMPORTANT DATES

More at https://www.sydney.edu.au/science/about/our-people/academic-staff/kathy-belov.html

Ant / bacteria co-evolution, landscape genomics, and population genomics
Vertebrate and/or invertebrate genome evolution

If you might be interested in joining our research group, send an email with your intent and why this group would potentially be a good fit for your future goals along with a CV / Resume to jdmanthey (at) gmail (dot) com

More at https://mantheylab.org/

Main mission:

Develop and implement strategies for whole-genome sequencing of non-model
species
Generate high-quality de novo genome assemblies using short- and long-read
sequencing technologies
Perform genome annotation and structural/functional characterization
Conduct comparative genomic analyses across related species or populations
Design and implement genome-wide association studies (GWAS) to identify
loci associated with phenotypic or adaptive traits
Integrate genomic, phenotypic, and environmental datasets
Contribute to the development of reproducible bioinformatics pipelines

Activités (Activities):

Lead the genomic component of the research project
High-molecular-weight DNA extraction optimization
Long-read genome assembly (PacBio HiFi / ONT)
Genome polishing and quality assessment (BUSCO, QUAST)
Structural and functional annotation
Variant discovery (SNPs, indels, SVs)
Population genomic analyses (FST, demographic inference)
Mixed-model GWAS accounting for structure
Workflow development (Snakemake/Nextflow)
HPC-based pipeline implementation
Publish results in peer-reviewed journals
Present findings at international conferences
Collaborate with experimental and computational team members
Contribute to project development
Mentor graduate students when appropriate

More at https://evol.mcmaster.ca/brian/evoldir/PostDocs//MontpellierU.ComparativeGenomics

BioCoder features:

• Novel therapeutic discovery strategies
• Hardware such as low-cost lab equipment or diagnostics
• Open or low­-cost bioinformatics tools
• Engineered organisms for the production of small molecules, biologics, or other products
• Research projects at a community labspace or projects for science education or public engagement
• Hardware or software for lab automation
• Citizen science or DIY research projects
• Science policy
• Tools to increase reproducibility in research, or anything related

Address of the bookmark: https://www.oreilly.com/biocoder/

During the first phase of ENCODE, published in 2007, microarray-based technologies were used to detect regions associated with transcription factors, certain histone modifications and open chromatin within a pre-specified 1% of the human genome.

ENCODE’s second phase saw a switch to sequencing-based technologies, the addition of new assay types and the analysis of functional elements genome-wide, described in a collection of research articles in 2012.

The Encyclopedia paper of ENCODE 3, published in Nature, gives an overview of the various assays that were performed in human and mouse cell lines and tissues and describes a Registry of human and mouse candidate cis-regulatory elements (cCREs).

More at https://www.nature.com/immersive/d42859-020-00027-2/index.html

https://bioalgorithms.ucsd.edu/research4.html

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

Again, running spades.py will show you the options:

spades.py

This produces:

SPAdes genome assembler v3.10.1

Usage: /usr/local/SPAdes-3.10.1-Linux/bin/spades.py [options] -o <output_dir>

Basic options:
-o      <output_dir>    directory to store all the resulting files (required)
--sc                    this flag is required for MDA (single-cell) data
--meta                  this flag is required for metagenomic sample data
--rna                   this flag is required for RNA-Seq data
--plasmid               runs plasmidSPAdes pipeline for plasmid detection
--iontorrent            this flag is required for IonTorrent data
--test                  runs SPAdes on toy dataset
-h/--help               prints this usage message
-v/--version            prints version

Input data:
--12    <filename>      file with interlaced forward and reverse paired-end reads
-1      <filename>      file with forward paired-end reads
-2      <filename>      file with reverse paired-end reads
-s      <filename>      file with unpaired reads
--pe<#>-12      <filename>      file with interlaced reads for paired-end library number <#> (<#> = 1,2,..,9)
--pe<#>-1       <filename>      file with forward reads for paired-end library number <#> (<#> = 1,2,..,9)
--pe<#>-2       <filename>      file with reverse reads for paired-end library number <#> (<#> = 1,2,..,9)
--pe<#>-s       <filename>      file with unpaired reads for paired-end library number <#> (<#> = 1,2,..,9)
--pe<#>-<or>    orientation of reads for paired-end library number <#> (<#> = 1,2,..,9; <or> = fr, rf, ff)
--s<#>          <filename>      file with unpaired reads for single reads library number <#> (<#> = 1,2,..,9)
--mp<#>-12      <filename>      file with interlaced reads for mate-pair library number <#> (<#> = 1,2,..,9)
--mp<#>-1       <filename>      file with forward reads for mate-pair library number <#> (<#> = 1,2,..,9)
--mp<#>-2       <filename>      file with reverse reads for mate-pair library number <#> (<#> = 1,2,..,9)
--mp<#>-s       <filename>      file with unpaired reads for mate-pair library number <#> (<#> = 1,2,..,9)
--mp<#>-<or>    orientation of reads for mate-pair library number <#> (<#> = 1,2,..,9; <or> = fr, rf, ff)
--hqmp<#>-12    <filename>      file with interlaced reads for high-quality mate-pair library number <#> (<#> = 1,2,..,9)
--hqmp<#>-1     <filename>      file with forward reads for high-quality mate-pair library number <#> (<#> = 1,2,..,9)
--hqmp<#>-2     <filename>      file with reverse reads for high-quality mate-pair library number <#> (<#> = 1,2,..,9)
--hqmp<#>-s     <filename>      file with unpaired reads for high-quality mate-pair library number <#> (<#> = 1,2,..,9)
--hqmp<#>-<or>  orientation of reads for high-quality mate-pair library number <#> (<#> = 1,2,..,9; <or> = fr, rf, ff)
--nxmate<#>-1   <filename>      file with forward reads for Lucigen NxMate library number <#> (<#> = 1,2,..,9)
--nxmate<#>-2   <filename>      file with reverse reads for Lucigen NxMate library number <#> (<#> = 1,2,..,9)
--sanger        <filename>      file with Sanger reads
--pacbio        <filename>      file with PacBio reads
--nanopore      <filename>      file with Nanopore reads
--tslr  <filename>      file with TSLR-contigs
--trusted-contigs       <filename>      file with trusted contigs
--untrusted-contigs     <filename>      file with untrusted contigs

Pipeline options:
--only-error-correction runs only read error correction (without assembling)
--only-assembler        runs only assembling (without read error correction)
--careful               tries to reduce number of mismatches and short indels
--continue              continue run from the last available check-point
--restart-from  <cp>    restart run with updated options and from the specified check-point ('ec', 'as', 'k<int>', 'mc')
--disable-gzip-output   forces error correction not to compress the corrected reads
--disable-rr            disables repeat resolution stage of assembling

Advanced options:
--dataset       <filename>      file with dataset description in YAML format
-t/--threads    <int>           number of threads
                                [default: 16]
-m/--memory     <int>           RAM limit for SPAdes in Gb (terminates if exceeded)
                                [default: 250]
--tmp-dir       <dirname>       directory for temporary files
                                [default: <output_dir>/tmp]
-k              <int,int,...>   comma-separated list of k-mer sizes (must be odd and
                                less than 128) [default: 'auto']
--cov-cutoff    <float>         coverage cutoff value (a positive float number, or 'auto', or 'off') [default: 'off']
--phred-offset  <33 or 64>      PHRED quality offset in the input reads (33 or 64)
                                [default: auto-detect]

As you can see this is also a “pipeline” of tools that can be switched on or off. SPAdes takes quite a long time, so for the purposes of this practical, something like this may suffice:

spades.py -t 4 \
          -m 32 \
          -k 31,51,71 \
          --only-assembler \
          -1 miseq.1.fastq -2 miseq.2.fastq \
          --nanopore minion.fastq \
          -o hybrid_assembly

In turn, these parameters mean

• use 4 threads
• max memory is 32Gb
• use 3 kmer values to build the de bruijn graph(s) - 31, 51 and 71
• only run the assembler, not the correction algorithm (for speed)
• read 1 and read 2 of the MiSeq data
• the nanopore data
• put the output in folder “hybrid_assembly”

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