BOL

github.com - MIKE (MinHash-based k-mer algorithm). This algorithm is designed for the swift calculation of the Jaccard coefficient directly from raw sequencing reads and enables the construction of phylogenetic trees based on the resultant Jaccard...

bioinformatics.oxfordjournals.org - QUAST evaluates genome assemblies. For metagenomes, please see MetaQUAST project.It can works both with and without a given reference genome.The tool accepts multiple assemblies, thus is suitable for comparison. More...

ocw.mit.edu - https://ocw.mit.edu/courses/biology/7-91j-foundations-of-computational-and-systems-biology-spring-2014/lecture-slides/MIT7_91JS14_Lecture6.pdf

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

mitra.stanford.edu - https://www.nature.com/articles/s41467-020-17155-yServer Infrastructure: File Server: dhara: Synology 3614 Storage Appliance 4 Core Xeon 108TB disk storage 10Gb ethernet to SCG3 Access atx: dhara:5000 Has btsync server (try it - its much...

rrwick.github.io - Bandage (a Bioinformatics Application for Navigating De novo Assembly Graphs Easily) is a tool for visualizing assembly graphs with connections. Users can zoom in to specific areas of the graph and interact with it by moving nodes,...

RAST – Web tool (upload contigs), uses the subsystems in the SEED database and provides detailed annotation and pathway analysis. Takes several hours per genome but I think this is the best way to get a high quality annotation...

github.com - GIGGLE is a genomics search engine that identifies and ranks the significance of genomic loci shared between query features and thousands of genome interval files. GIGGLE (https://github.com/ryanlayer/giggle) scales to billions of intervals and is...

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