github.com - v0.0 by Glenn Hickey (hickey@soe.ucsc.edu)
Progressive Cactus is a whole-genome alignment package.
Requirements
git
gcc 4.2 or newer
python 2.7
wget
64bit processor and build environment
150GB+ of memory on at least one machine when...
Advt. No. ACBR/BTBI/BIF/Manpower/ADV/16-17
Research Associate/ Studentship/ Traineeship Jobs opportunity in University of Delhi - Dr. B.R. Ambedkar Center for Biomedical Research (ACBR) on temporary basis
Studentship
No. of Post :...
github.com - Progressive Cactus is a whole-genome alignment package.
Distribution package for the Prgressive Cactus multiple genome aligner. Dependencies are linked as submodules
https://github.com/glennhickey/progressiveCactus
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...
hciweb.iwr.uni-heidelberg.de - This is the c++ implementation for SIMA - Simultaneous Multiple Alignment of LC/MS Peak Lists. The package contains C++ source code as well as two binary files. The latter were tested under various operating systems, including Windows XP SP3 32bit,...
Computational Biologists
Open to PhD-student and Post-doc candidates
We are looking for wet and computational biologists to work on an ERC funded project in our
laboratory located at the Department of Experimental Oncology of the European...
www.healthcare.uiowa.edu - Added Command line argument support.
Multi-stage execution modes.
Support for parallelization. Now execution proceeds in batches of long reads the size of which can be set by --long_read_batch_size N.
Better compressed intermediate files.
Added...
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...
github.com - Perform Alignment-free k-tuple frequency comparisons from sequences. This can be in the form of two input files (e.g. a reference and a query) or a single file for pairwise comparisons to be made.