Applications are invited from suitable candidates for six months ‘Training Fellowship' at National Institute of Plant Genome Research (NIPGR).
About National Institute Of Plant Genome Research (NIPGR) http://www.nipgr.res.in/
The National...
github.com - The goal of the Shasta long read assembler is to rapidly produce accurate assembled sequence using as input DNA reads generated by Oxford Nanopore flow cells.
Computational methods used by the Shasta assembler include:
Using...
github.com - genome simulation across a population with zeta-distributed allele frequency, snps, insertions, deletions, and multi-nucleotide polymorphisms
More at https://github.com/ekg/mutatrix
./mutatrix -S sample -P test/ -p 2 -n 10 reference.fasta
Applications are invited from eligible candidates for the following posts at Bioinformatics Centre (DIC), IT- BT Complex, College of Horticulture, Kerala Agricultural University, Vellanikkara, Thrissur.
1. Research Associate
Emoluments*:...
wego.genomics.org.cn - WEGO (Web Gene Ontology Annotation Plot) is a simple but useful tool for visualizing, comparing and plotting GO (Gene Ontology) annotation results. As the GO vocabulary became more and more popular, WEGO was widely adopted and used in many...
NIT, Rourkela, an institute of national importance under Ministry of HRD, Govt. of India invites applications from Indian nationals possessing excellent academic background along with commitment to quality teaching and research for faculty positions...
github.com - Create an interactive dot plot from mummer output OR PAF format
R script that makes a plotly interactive and/or static (png/pdf) dot plot.
Shiny app available for testing
pevsnerlab.kennedykrieger.org - DRAGON: Database Referencing of Array Genes Online
SNOMAD: Standardization and Normalization of Microarray Data
SNPduo: SNP Analysis Between Two Individuals
SNPtrio: Analyzing and Visualizing and Inheritance Patterns in Trios
SNPscan: Data...
ivory.idyll.org - DNA k-mers underlie much of our assembly work, and we (along with many others!) have spent a lot of time thinking about how to store k-mer graphs efficiently, discard redundant data, and count them efficiently.
More recently, we've...