ADVERTISEMENT NO. 01/2015
PRINCIPAL SCIENTIST Pay Band: Minimum pay of `43,000 in the PB-4 of `37400-67000/- + RGP of `10,000/-.
Age: The candidates must not have attained the age of 52 years as on 24.03.2015. There shall be no age limit for...
github.com - Heap, that enables robustly sensitive and accurate calling of SNPs, particularly with a low coverage NGS data, which must be aligned to the reference genome sequences in advance. To reduce false positive SNPs, Heap determines genotypes and calls...
Walk-in interview will be held on 24-03-2015 at 10:00 AM at NRCPB, New Delhi for filling Research Associate and Senior Research Fellow positions as mentioned below. The positions are temporary and are initially offered for a period of one year....
github.com - BFC is a standalone high-performance tool for correcting sequencing errors from Illumina sequencing data. It is specifically designed for high-coverage whole-genome human data, though also performs well for small genomes.
The BFC algorithm is a...
Postdoctoral Fellowship in Bioinformatics and Evolutionary Genomics
Organization
National Human Genome Research Institute, National Institutes of Health
http://genome.gov/Staff/Baxevanis
Job Location
Bethesda, MD
Job Description
A...
http://higlass.io/ - HiGlass is a tool for exploring genomic contact matrices and tracks. Please take a look at the examples and documentation for a description of the ways that it can be configured to explore and compare contact matrices. To load private data, HiGlass...
Bose Institute, Kolkata, invites online applications from Indian Citizens for recruitment of Research Associate (05 posts) under Institute Plan Programmes : Improvement of Plants : Biotechnological, Genomic and Proteomic Approaches (programme No. –...
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...
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...