BOL

schneebergerlab.github.io - SyRI is a comprehensive tool for predicting genomic differences between related genomes using whole-genome assemblies (WGA). The assemblies are aligned using whole-genome alignment tools, and these alignments are then used as input to SyRI. SyRI...

In this protocol, we address and describe the de novo assembly method for small to medium-sized genomes.

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

Ongoing research in the group of Karine Van Doninck involves topics at the core of evolutionary biology, including the evolution of sex, genome maintenance, recombination and extreme stress resistance on different eukaryotic systems, including...

Bioinformatics tools

github.com - Perform Alignment-free k-tuple frequency comparisons from sequences. This can be in the form of two input files (e.g. a reference and a query) or a single file for pairwise comparisons to be made.

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.

To find repeats in a genome from 2 to 9 length using a Perl script, you can use the RepeatMasker tool with the "--length" option[0]. Here's a step-by-step guide: Install RepeatMasker: First, you need to install RepeatMasker on your system. You...

hciweb.iwr.uni-heidelberg.de - This is the c++ implementation for SIMA - Simultaneous Multiple Alignment of LC/MS Peak Lists. The package contains C++ source code as well as two binary files. The latter were tested under various operating systems, including Windows XP SP3 32bit,...

github.com - Mix is a tool that combines two or more draft assemblies, without relying on a reference genome and has the goal to reduce contig fragmentation and thus speed-up genome finishing. The proposed algorithm builds an extension graph where vertices...