4dgenome.research.chop.edu - Records in 4DGenome are compiled through comprehensive literature curation of experimentally-derived and computationally-predicted interactions. The current release contains 4,433,071 experimentally-derived and 3,605,176 computationally-predicted...
We have made changes the nr version 5 database, (nr_v5), to facilitate better search results and improved performance by reducing the number of redundant titles in the nr_v5 database used by webBLAST, which is also available for BLAST+ users.
http://www.ub.edu/dnasp/ - DnaSP, DNA Sequence Polymorphism, is a software package for the analysis of DNA polymorphisms using data from a single locus (a multiple sequence aligned -MSA data), or from several loci (a Multiple-MSA data, such as formats generated by some...
sanger-pathogens.github.io - A tool to circularize genome assemblies. The algorithm and benchmarks are described in the Genome Biology manuscript.
Citation: "Circlator: automated circularization of genome assemblies using long sequencing reads", Hunt et al, Genome Biology...
www.fishbrowser.org - P_RNA_scaffolder is a novel scaffolding tool using Pair-end RNA-seq to scaffold genome fragments. The method is suitable for most genomes. The program could utilize Illumina Paired-end RNA-sequencing reads from target speciesies. Our method provides...
hgdownload.cse.ucsc.edu - This directory contains Genome Browser and Blat application binaries built for standalone command-line use on various supported Linux and UNIX platforms. To determine which set of binaries to download, type "uname -a" on the command line to display...
bioinformatics.oxfordjournals.org - Summary: Mate pair library sequencing is an effective and economical method for detecting genomic structural variants and chromosomal abnormalities. Unfortunately, the mapping and alignment of mate pair read pairs to a reference genome is a...
When you have both Illumina and Nanopore data, then SPAdes remains a good option for hybrid assembly - SPAdes was used to produce the B fragilis assembly by Mick Watson’s group.
Again, running spades.py will show you the...
In graph theory, a string graph is an intersection graph of curves in the plane; each curve is called a "string". String graphs were first proposed by E. W. Myers in a 2005 publication.