BOL

github.com - new de novo assembler called BASE. It enhances the classic seed-extension approach by indexing the reads efficiently to generate adaptive seeds that have high probability to appear uniquely in the genome. Such seeds form the basis for BASE...

github.com - TULIP currently consists of two Perl scripts, tulipseed.perl and tulipbulb.perl. These are very much intended as prototypes, and additional components and/or implementations are likely to follow. Tulipseed takes as input alignments files of long...

github.com - lordFAST is a sensitive tool for mapping long reads with high error rates. lordFAST is specially designed for aligning reads from PacBio sequencing technology but provides the user the ability to change alignment parameters depending on the reads...

github.com - Flye is a de novo assembler for long and noisy reads, such as those produced by PacBio and Oxford Nanopore Technologies. The algorithm uses an A-Bruijn graph to find the overlaps between reads and does not require them to be error-corrected. After...

github.com - Software package for signal-level analysis of Oxford Nanopore sequencing data. Nanopolish can calculate an improved consensus sequence for a draft genome assembly, detect base modifications, call SNPs and indels with respect to a reference genome...

lindenb.github.io - Collection of Java tool kits for bioinformatics works: Jvarkit : Java utilities for Bioinformatics

Diploid Assembly of a Puerto Rican Female Adds a Rich Resource to Population-Specific Reference Genomes

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...

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 - Apollo is an assembly polishing algorithm that attempts to correct the errors in an assembly. It can take multiple set of reads in a single run and polish the assemblies of genomes of any size. Described by Firtina et al. (preliminary version...