No of vacancies: 01
Pay scale: Pay Band of Rs. 37400-67000 with AGP of Rs. 9000.
i. Educational Qualification: Good academic record with a Ph.D. Degree in the concerned/allied/relevant disciplines.
ii. A Master's Degree with at least 55%...
bitbucket.org - TAndem REpeat ANalyzer -TAREAN – is a computational pipeline for unsupervised identification of satellite repeats from unassembled sequence reads. The pipeline uses low-pass whole genome sequence reads and performs their...
doua.prabi.fr - One code to find them all is a set of perl scripts to extract useful information from RepeatMasker about transposable elements, retrieve their sequences and get some quantitative information.
Assemble RepeatMasker hits into complete TE copies,...
Applications are invited from highly motivated students (UGC-CSIR-JRF) with a background in Genomics/ Biotechnology/ Molecular Microbiology/ Biochemistry and Bioinformatics to pursue research leading to Ph.D. in the following areas;
1. Cancer...
github.com - This code is used to scaffold your assemblies using Hi-C data. This version implements some improvements in the original SALSA algorithm. If you want to use the old version, it can be found in the old_salsa branch.
To use the latest version,...
www.mrc-lmb.cam.ac.uk - This is about how to use a computer to find what is known about a gene of interest and also how to get new insights about it.
The tutorial is divided in three main parts:
In the Sequence part, you will see how to look efficiently for a...
ml.ssu.ac.kr - gSearch compares sequence variants in the Genome Variation Format (GVF) or Variant Call Format (VCF) with a pre-compiled annotation or with variants in other genomes. Its search algorithms are subsequently optimized and implemented in a...
NATIONAL INSTITUTE OF IMMUNOLOGY, NEW DELHI-110067
Applications are invited for the position of Senior Research Fellow for the following time-bound sponsored project as per the details given below:
1. BTIS project on, “Bioinformatics...
gite.lirmm.fr - An error correction method that uses long reads only. The method consists of two phases: first, we use an iterative alignment-free correction method based on de Bruijn graphs with increasing length of k-mers, and second, the corrected reads are...