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...
When you're just starting out with biological programming, it's easy to run into complex problems that make you wonder how anyone has ever managed to write a program.
github.com - MECAT is an ultra-fast Mapping, Error Correction and de novo Assembly Tools for single molecula sequencing (SMRT) reads. MECAT employs novel alignment and error correction algorithms that are much more efficient than the state of art of aligners and...
PhD opportunity at Université de Liège - Belgium
The Bioinformatics and Systems Biology Unit of Université de Liège (Belgium) is looking for a highly motivated master student with programming skills for a PhD thesis project (4 years, fully...
bix.ucsd.edu - BLASR (Basic Local Alignment with Successive Refinement) for mapping Single Molecule Sequencing (SMS) reads that are thousands to tens of thousands of bases long with divergence between the read and genome dominated by insertion and deletion...
bioinformatics.oxfordjournals.org - An ultra–high-performance protein–protein docking software for heterogeneous supercomputers
Summary: The application of protein–protein docking in large-scale interactome analysis is a major challenge in structural bioinformatics...
sourceforge.net - Cerulean extends contigs assembled using short read datasets like Illumina paired-end reads using long reads like PacBio RS long reads.
Cerulean v0.1 has been implemented with bacterial genomes in mind.
The method is fully described in...
github.com - JBrowse is a fast, embeddable genome browser built completely with JavaScript and HTML5, with optional run-once data formatting tools written in Perl.
Headline Features:
Fast, smooth scrolling and zooming. Explore your genome with unparalleled...