BOL

Our section develops and applies computational methods for the analysis of massive genomics datasets, focusing on the challenges of genome sequencing and comparative genomics. We aim to improve such foundational processes and translate emerging...

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

FASTA VALIDATOR + SEQKIT RMDUP: FASTA validation GENOMETOOLS GT GFF3VALIDATOR: GFF3 validation ASSEMBLATHON STATS: Assembly statistics GENOMETOOLS GT STAT: Annotation statistics NCBI FCS ADAPTOR: Adaptor contamination pass/fail NCBI...

github.com - Miniasm is a very fast OLC-based de novo assembler for noisy long reads. It takes all-vs-all read self-mappings (typically by minimap) as input and outputs an assembly graph in the GFA format. Different from mainstream...

code.google.com - lideSort-BPR ( b reak p oint r eads) is based on a fast algorithm for all-against-all comparisons of short reads and theoretical analyses of the number of neighboring reads. When applied to a dataset with a sequencing...