github.com - ALPACA requires Celera Assembler 8.3 or later. It is recommended to build Celera Assembler from source. (Why? The pre-built binaries CA_8.3rc1 and CA8.3rc2 will work for any large data set.
Detail paper...
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 - PERGA - Paired End Reads Guided Assembler
PERGA is a novel sequence reads guided de novo assembly approach which adopts greedy-like prediction strategy for assembling reads to contigs and scaffolds. Instead of using single-end reads to construct...
faculty.cse.tamu.edu - With increased availability of de novo assembly algorithms, it is feasible to study entire transcriptomes of non-model organisms. While algorithms are available that are specifically designed for performing transcriptome assembly from...
Research Associate (RA) Two (2)
Ph.D. in Bioinformatics/ Agricultural Statistics/ Statistics/ Computer Science/ Computer Application or equivalent or Master’s in Bioinformatics/ Agricultural Statistics/ Statistics/ Computer Science/ Computer...
github.com - MEGAHIT is a single node assembler for large and complex metagenomics NGS reads, such as soil. It makes use of succinct de Bruijn graph (SdBG) to achieve low memory assembly. MEGAHIT can optionally utilize a CUDA-enabled GPU to...
github.com - TMAP - torrent mapping alignment program General Notes
TMAP is a fast and accurate alignment software for short and long nucleotide sequences produced by next-generation sequencing technologies.
The latest TMAP is unsupported. To use a...
github.com - NxRepair is a python module that automatically detects large structural errors in de novo assemblies using Nextera mate pair reads. The decector will break a contig at the site of an identified misassembly and will generate a new fasta file...
www.nature.com - Segmental Duplication Assembler (SDA; https://github.com/mvollger/SDA) constructs graphs in which paralogous sequence variants define the nodes and long-read sequences provide attraction and repulsion edges, enabling the partition and assembly of...