The Computational Biology Group of Interdisciplinary Center for
Clinical Research (IZKF) Aachen, RWTH Aachen University Hospital,
Aachen, invites applicants for PhD candidate or postdoctoral position
in computational biology in one of the...
github.com - ausarg/pipesnake is a bioinformatics best-practice analysis pipeline for phylogenomic reconstruction starting from short-read 'second-generation' sequencing data.
The pipeline is built using Nextflow, a workflow tool to run tasks across...
https://epiviz.github.io/ - Epiviz is an interactive visualization tool for functional genomics data. It supports genome navigation like other genome browsers, but allows multiple visualizations of data within genomic regions using scatterplots, heatmaps and other...
Dr. Jarvis’ laboratory studies the neurobiology of vocal communication. We want to know how the brain generates, perceives, and learns behavior. We use vocal communication as a model behavior. Emphasis is placed on the molecular pathways involved in...
Following are the list of In-silico Binding Site Prediction in Proteins tools
CASTp : http://sts.bioengr.uic.edu/castp/ Computed Atlas of Surface Topography of proteins (CASTp) provides an online resource for locating, delineating and...
Indian Institute of Information Technology, Allahabad
Devghat, Jhalwa, Allahabad – 211012, Uttar Pradesh, India
E-mail: contact@iiita.ac.in, faculty.applications@iiita.ac.in
Web: www.iiita.ac.in Phone : 0532-2922031/27/67
Applications are...
genomethreader.org - GenomeThreader is a software tool to compute gene structure predictions. The gene structure predictions are calculated using a similarity-based approach where additional cDNA/EST and/or protein sequences are used to predict gene structures via...
As bioinformatician I know the fact that we usually handle the large dataset and lost in the huge numbers of files and folders. In order to search the missing file a strong search command is required. The Linux Find Command is one of the most...
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...