github.com - ContigExtender, was developed to extend contigs, complementing de novo assembly. ContigExtender employs a novel recursive Overlap Layout Candidates (r-OLC) strategy that explores multiple extending paths to achieve longer and highly accurate...
www.csd.uwo.ca - E-MEM is a C++/OpenMP program designed to efficiently compute MEMs between large genomes. See the README file for instructions on how to use E-MEM. E-MEM source code
The source code can be downloaded here. If you use E-MEM, please...
github.com - MIKE (MinHash-based k-mer algorithm). This algorithm is designed for the swift calculation of the Jaccard coefficient directly from raw sequencing reads and enables the construction of phylogenetic trees based on the resultant Jaccard...
We are using a comparative genomics approach to better understand the structure, function and evolution of the human genome. Our group is one of the pioneers in the field of comparative genomics. We proposed the compact genome of the fugu (Takifugu...
engr.case.edu - In this report we provide an overview of known techniques for discovery of patterns of biological sequences (DNA and proteins). We also provide biological motivation, and methods of biological verification of such patterns. Finally we list publicly...
http://prodigal.ornl.gov/ - Prodigal (Prokaryotic Dynamic Programming Genefinding Algorithm) is a microbial (bacterial and archaeal) gene finding program developed at Oak Ridge National Laboratory and the University of Tennessee. Key features of Prodigal...
School of Life Sciences
Jawaharlal Nehru University
New Delhi 110067
Positions available
Applications were invited from for the following posts in an industry sponsored project. The project entitled "OsHK3b technology and Know How", valid...
http://itol.embl.de/ - Interactive Tree Of Life is an online tool for the display and manipulation of phylogenetic trees. It provides most of the features available in other tree viewers, and offers a novel circular tree layout, which makes it easy to visualize...
www.biostat.wisc.edu - Our basic strategy in building homology maps is to use exons that are orthologous in multiple genomes as map "anchors." Given K genomes, the steps in the map construction are as follows:
For each genome, obtain a set of exon annotations. These...
As part of the PhD program in Computer Science at University of Essex, I am looking for a PhD student in computational and synthetic biology.
The ideal candidate is interested in designing new biological design automation methods for genome scale...