For additional information visit http://www.cancerquest.org/joel-saltz-interview.
Dr. Joel Saltz is a Professor in the Departments of Pathology, Biostatistics and Bioinformatics, and Mathematics and Computer Science at
Emory University. Dr. Saltz's...
Air date: Wednesday, January 04, 2012, 3:00:00 PM
Time displayed is Eastern Time, Washington DC Local
Category: Wednesday Afternoon Lectures
Description: There is a broad consensus that cancer is the result of somatic cells having serially...
sourceforge.net - Opera (Optimal Paired-End Read Assembler) is a sequence assembly program (http://en.wikipedia.org/wiki/Sequence_assembly ). It uses information from paired-end or long reads to optimally order and orient contigs assembled from...
University of Padova (URL: http://protein.bio.unipd.it/)
A research fellowship is available at the BioComputing Laboratory, University of Padova (URL: http://protein.bio.unipd.it/). A highly motivated and creative candidate is sought to work on...
When you have both Illumina and Nanopore data, then SPAdes remains a good option for hybrid assembly - SPAdes was used to produce the B fragilis assembly by Mick Watson’s group.
Again, running spades.py will show you the...
Contract Faculty-Bioinformatics at Maulana Azad National Institute of Technology
Job Description:F.No.11/10(1)/929 Qualifications: Candidates should have Ph.D. degree. If Ph.D. candidates are not available at least Post Graduate degree with...
github.com - evolverSimControl (eSC) can be used to simulate multi-chromosome genome evolution on an arbitrary phylogeny (Newick format). In addition to simply running evolver, eSC also automatically creates statistical summaries of the simulation...
Yau Group are a new research group based at the Wellcome Trust Centre for Human Genetics and the Department of Statistics at the University of Oxford.
Yau Group develops statistical and computational methods for the analysis of genomic datasets...
In graph theory, a string graph is an intersection graph of curves in the plane; each curve is called a "string". String graphs were first proposed by E. W. Myers in a 2005 publication.