gwct.github.io - Modern genome sequencing technologies provide a succint measure of quality at each position in every read, however all of this information is lost in the assembly process. Referee summarizes the quality information from the reads that map to a site...
Project Assistant Position (@ Rs.10,000/pm Fixed) is available for one year ina research project funded by the Department of Science and Technology entitled, "Folding and stability of naturally truncated photosynthetic pigment,C- phycoerythrin from...
JAMIA HAMDARD
(Deemed University)
Hamdard Nagar, New Delhi – 110 062
R E C R U I T M E N T
(Advertisement No. 5/2014)
Applications on prescribed form are invited for filling up the following teaching positions in the Department of...
github.com - Welcome to kevlar, software for predicting de novo genetic variants without mapping reads to a reference genome! kevlar's k-mer abundance based method calls single nucleotide variants (SNVs), multinucleotide variants (MNVs),...
Ageing has a profound impact on human society and modern medicine, yet it remains a major puzzle of biology. The goal of my work is to help understand the genetic, cellular, and molecular mechanisms of ageing. In the long term, I would like my work...
github.com - Shovill is a pipeline which uses SPAdes at its core, but alters the steps before and after the primary assembly step to get similar results in less time. Shovill also supports other assemblers like SKESA, Velvet and Megahit, so you can take...
The Department of Biotechnology, group “Genome Bioinformatics” is currently seeking a Postgraduate Research Associate Bioinformatics / Computational Biology (Reference code: 59)
Extent of employment: 30 Hours per Week
Duration of employment: 1st...
ftp.genomics.org.cn - An efficient tool called Connecting Overlapped Pair-End (COPE) reads, to connect overlapping pair-end reads using k-mer frequencies. We evaluated our tool on 30× simulated pair-end reads from Arabidopsis thaliana with 1% base error. COPE...
code.google.com - lideSort-BPR ( b reak p oint r eads) is based on a fast algorithm for all-against-all comparisons of short reads and theoretical analyses of the number of neighboring reads. When applied to a dataset with a sequencing...