metagraph.ethz.ch - The MetaGraph framework is designed to work with a wide range of input data sets, indexing from a few samples up to the contents of entire archives with hundreds of thousands of records. The indexing workflow always follows the same principle,...
github.com - RNA-Bloom is a fast and memory-efficient de novo transcript sequence assembler. It is designed for the following sequencing data types:
single-end/paired-end bulk RNA-seq (strand-specific/agnostic)
paired-end single-cell RNA-seq...
platanus.bio.titech.ac.jp - Platanus is a novel de novo sequence assembler that can reconstruct genomic sequences of highly heterozygous diploids from massively parallel shotgun sequencing data.
The latest version is 1.2.4.
To cite Platanus, please use the...
www.ncbi.nlm.nih.gov - We describe a new algorithm, meraculous, for whole genome assembly of deep paired-end short reads, and apply it to the assembly of a dataset of paired 75-bp Illumina reads derived from the 15.4 megabase genome of the haploid yeast Pichia...
www.melbournebioinformatics.org.au - Written and maintained by Simon Gladman - Melbourne Bioinformatics (formerly VLSCI)
Protocol Overview / Introduction
In this protocol we discuss and outline the process of de novo assembly for small to medium sized...
Research Topics:
High Throughput Sequencing Analysis
Comparative Genomics
Identification and Annotation of Non-coding RNAs
Bioinformatic Analysis and System Biology of Viruses
Coevolution of Proteins and RNAs
Algorithmic...
github.com - Choosing whether to use second or third generation sequencing platforms can lead to trade-offs between accuracy and read length. Several studies require long and accurate reads including de novo assembly, fusion and structural variation detection....
hdock.phys.hust.edu.cn - HDOCK SERVER
Protein-protein and protein-DNA/RNA docking based on a hybrid algorithm of template-based modeling and ab initio free docking.
The HDOCK server distinguishes itself from similar docking servers in its ability to support...
github.com - GRASS (GeneRic ASsembly Scaffolder)-a novel algorithm for scaffolding second-generation sequencing assemblies capable of using diverse information sources. GRASS offers a mixed-integer programming formulation of the contig scaffolding problem, which...