Walk- in- Test cum Interview (based on test) for the selection of Research Associate

under the scheme “Distributed Information Sub Centre –DISC” & Research Assistant under scheme “Phytophthora, Fusarium and Ralstonia diseases of Horticultural and Field Crops” will be held at this Institute as per details indicated below.

WALK -IN- TEST CUM INTERVIEW

Name of the post : Research Associate

Date of Interview : 21-05-2014 at 10.00 AM

No. of posts : One

Qualifications : a)Essential

Ph.D Degree in Bioinformatics OR : Masters degree in Bioinformatics with a minimum of
60% marks or equivalent OGPA with at least two years research experience as evidenced from fellowship/ associateship/training/published papers etc.

b)Desirable: Experience in NGS data analysis.

Emoluments : Rs. 23,000/- per month + HRA (Masters Degree Holders)

Rs. 24,000/- per month + HRA (Ph.D Degree Holders)

Upper age limit : 40 years for Men & 45 years for Women as on date of Interview (Upper Age limits are relaxable for SC, ST and OBC candidates as per Govt. of India norms (at present 5 years for SC/ST and 3 years for OBC)

Duration of Project : Till 31-03-2017.

Title of Assigment : Research Assistant (on contract basis)

No. of vacancy : One

Qualification : Essential : Post Graduation in Bioinformatics and Minimum one year experience in NGS data analysis

Desirable : Experience in Perl/Python/R

Remuneration : Rs. 20,000/- per month (consolidated)

Scope of work :

1. Analysis of different file formats and their conversions.

2. Assessing the quality of data and filtering of raw reads.
3. Assembling the raw reads-de novo as well as reference mapping.
4. Compression of aligned reads using Jam tools
5. RNA-seq. Analysis
6. Differential expression testing involving Normalization, Statistical testing, heat map generation & hierarchical clustering
7. Annotating the assembled genome and geneet testing and their validation
8. Metabolic pathway analysis
9. Comparative genomics
10. Setting up of genome browsers.

Period of Assigment : Initially for six months.

Date & Venue of Interview : 21-05-2014 at IISR, Kozhikode at 10.00 AM

More at http://www.spices.res.in/pdf/disc-advtmnt.pdf

How to use TAREAN:

• Install a local instance of the pipeline using its source code available from bitbucket repository.
• Use  public Galaxy-based server at https://repeatexplorer-elixir.cerit-sc.cz/. The server is provided in frame of the Elixir CZ project and is maintained by CESNET and CERIT-SC. Simple registration is required to use this service.

Development of TAREAN was supported by ELIXIR CZ research infrastructure project (MEYS Grant No: LM2015047).

References

Novak, P., Avila Robledillo, L., Koblizkova, A., Vrbova, I., Neumann, P., Macas, J. (2017) – TAREAN: a computational tool for identification and characterization of satellite DNA from unassembled short reads. Nucleic Acids Res., doi:10.1093/nar/gkx257

Address of the bookmark: https://bitbucket.org/petrnovak/repex_tarean

http://www.broadinstitute.org/igv/

Address of the bookmark: https://wikis.utexas.edu/display/bioiteam/Integrative+Genomics+Viewer+%28IGV%29+tutorial

Annotation

https://bigd.big.ac.cn/ncov/variation/annotation

Genome wharehouse 

https://bigd.big.ac.cn/gwh/browse/index

Released Genome

https://bigd.big.ac.cn/ncov/release_genome

Download data 

ftp://download.big.ac.cn/Genome/Viruses/Coronaviridae/

Raw data

https://bigd.big.ac.cn/gsa/browse/run/?tag=Coronaviridae

Address of the bookmark: https://bigd.big.ac.cn/ncov/about

 http://cosmos.hms.harvard.edu/.

Address of the bookmark: https://cosmos.hms.harvard.edu/

Address of the bookmark: https://github.com/reubwn/hgt

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

Genome assembly projects typically run multiple algorithms in an attempt to find the single best assembly, although those assemblies often have complementary, if untapped, strengths and weaknesses. We present our metassembler algorithm that merges multiple assemblies of a genome into a single superior sequence. 

Address of the bookmark: https://sourceforge.net/projects/metassembler/?source=directory