What can we learn from people with the genetics to get sick — who don't? With most inherited diseases, only some family members will develop the disease, while others who carry the same genetic risks dodge it. Stephen Friend suggests we start...
Ministry of Science and Technology, Department of Science and Technology
7th ADVERTISEMENT – 2014 (2)
INSPIRE Faculty Scheme: a component of “Assured Opportunity for Research Career (AORC)” under INSPIRE.
The Department of Science and...
github.com - A tool for converting for recovering synteny blocks from multiple alignment (in MAF fromat)
This tool is a standalone version of Ragout module [http://fenderglass.github./Ragout]
The research group of Dr. Michele Trabucchi at the Centre Méditerranéen de Médecine Moléculaire (C3M) at INSERM U1065 (University of Nice Sophia-Antipolis, France) is seeking candidates for a Postdoctoral fellow position to start on October 2014 for...
www.atgc.org - PhyloGrapher is a program designed to visualize and study evolutionary relationships within families of homologous genes or proteins (elements). PhyloGrapher is a drawing tool that generates custom graphs for a given set of elements....
www.gigasciencejournal.com - Bioinformatics software varies greatly in quality. In terms of usability, the command line interface is the first experience a user will have of a tool. Unfortunately, this is often also the last time a tool will be used. Here I present ten...
synvisio.github.io - SynVisio lets you explore the results of McScanX a popular synteny and collinearity detection toolkit and generate publication ready images.
SynVisio requires two files to run:
The simplified gff file that was used as an...
www.homolog.us - Useful bioinformatics tutorial, such as
De Bruijn Graphs for NGS AssemblyAlgorithms for PacBio ReadsSoftware and Hardware Concepts for BioinformaticsFinding us in Homolog.us (Search Algorithms)NGS Genome and RNAseq Assembly - a Hands on...
github.com - panacus is a tool for calculating statistics for GFA files. It supports GFA files with P and W lines, but requires that the graph is blunt, i.e., nodes do not overlap and consequently, each link (L) points...