BOL

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

In our lab, we seek to characterize and to compare genomes in order to better understand genetic and evolutionary processes linking genotypes to phenotypes. Sequencing and decoding plant genomes have been integral in our approaches. The...

sourceforge.net - Opera (Optimal Paired-End Read Assembler) is a sequence assembly program (http://en.wikipedia.org/wiki/Sequence_assembly ). It uses information from paired-end or long reads to optimally order and orient contigs assembled from...

github.com - Scripts for the analysis of HGT in genome sequence data

Genome browsers are useful not only for showing final results but also for improving analysis protocols, testing data quality, and generating result drafts. Its integration in analysis pipelines allows the optimization of parameters, which...

crossmap.sourceforge.net - CrossMap is a program for convenient conversion of genome coordinates (or annotation files) between different assemblies (such as Human hg18 (NCBI36) <> hg19 (GRCh37), Mouse mm9 (MGSCv37) <> mm10 (GRCm38)). It supports most commonly...

SSPACE_longread complain for getopts.pl file. To resolve this, download and have in SSPACED-Longreads folder. Cheers :)

github.com - KAT is a suite of tools that analyse jellyfish hashes or sequence files (fasta or fastq) using kmer counts. The following tools are currently available in KAT: hist: Create an histogram of k-mer occurrences from a sequence file. Adds metadata in...

eugi.bi.up.ac.za - swgis v2.0 is the modified version of the seqword genomic island sniffer. this version is specifically optimized for predicting genomic islands in eukaryotic genomes. swgis v2.0 was tested on several eukaryotic species of different lineages....

github.com - NovoGraph: building whole genome graphs from long-read-based de novo assemblies An algorithmically novel approach to construct a genome graph representation of long-read-based de novo sequence assemblies. We then provide a proof of...