BOL

bioinf.spbau.ru - Ultimate tool for resolving repeats in genome assemblies. Though the specific implementation of the idea of the rectangle graph approach is already included into the current SPAdes distribution, we're also releasing the Rectangle Graph Module...

github.com - MARVEL consists of a set of tools that facilitate the overlapping, patching, correction and assembly of noisy (not so noisy ones as well) long reads. The assembly process can be summarized as follows: overlap patch reads overlap...

www.animalgenome.org - The Blast Extension and Assembly Program (BEAP) is a computer program that uses a short starting DNA fragment, often a EST or partial gene segment, as "primer", to recursively blast nucleotide databases in an attempt to obtain all sequences that...

www.zhanyuwang.xin - BAUM, breaks the whole genome into regions by adaptive unique mapping; then the local OLC is used to assemble each region in parallel. BAUM can: (1) perform reference-assisted assembly based on the genome of a close species; (2) or improve the...

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

ucdavis-bioinformatics-training.github.io - Our team offers custom bioinformatics services to academic and private organizations. We have a strong academic background with a focus on cutting edge, open source software. We replicate standard analysis pipelines (best practices) when...

github.com - Just import the assembly, bam and ALE scores. You can convert the .ale file to a set of .wig files with ale2wiggle.py and IGV can read those directly.  Depending on your genome size you may want to convert the .wig files to the BigWig format.

mummer4.github.io - MUMmer4, a substantially improved version of MUMmer that addresses genome size constraints by changing the 32-bit suffix tree data structure at the core of MUMmer to a 48-bit suffix array, and that offers improved speed through parallel processing...

github.com - chromeister: An ultra fast, heuristic approach to detect conserved signals in extremely large pairwise genome comparisons. USAGE: -query: sequence A in fasta format -db: sequence B in fasta format -out: output matrix -kmer Integer: k>1...

sourceforge.net - Sept. 20, 2017 Version 3.1 released. Major upgrade. Version 3.1 fixes the problems with SNP annotation that arose when NCBI discontinued use of GI numbers. Please read carefully the Preface (page 3) and the File of annotated genomes section (pages...