BOL

www.khanacademy.org - Topics Displaying and describing data Modeling distributions of data Describing relationships in quantitative data Designing studies Probability Random variables Sampling distributions Confidence intervals (one sample) Significance tests...

onlinecourses.science.psu.edu - One of our primary focuses will be to develop an understanding of the various ways in which we can assign a probability to some chance event. We'll also learn the fundamental properties of probability, investigate how probability behaves,...

www.broadinstitute.org - Spines is a collection of software tools, developed and used by the Vertebrate Genome Biology Group at the Broad Institute. It provides basic data structures for efficient data manipulation (mostly genomic sequences, alignments, variation...

atifrahman.github.io - SWALO (scaffolding with assembly likelihood optimization) is a method for scaffolding based on likelihood of genome assemblies computed using generative models for sequencing. Download Git repository of SWALO is at...

cutadapt.readthedocs.io - Cutadapt finds and removes adapter sequences, primers, poly-A tails and other types of unwanted sequence from your high-throughput sequencing reads. Cutadapt helps with these trimming tasks by finding the adapter or primer sequences in an...

compbio.cs.toronto.edu - PRISM is a software for split read (reads which span across a structrual variant -- SV ) mapping and SV calling from the mapping result. PRISM is able to detect small insertions and abitrary size deletions, inversions and tandom duplications with...

alan.cs.gsu.edu - caffMatch is a novel scaffolding tool based on Maximum-Weight Matching able to produce high-quality scaffolds from NGS data (reads and contigs). The tool is written in Python 2.7. It also includes a bash script wrapper that calls aligner in case one...

www.csd.uwo.ca - E-MEM is a C++/OpenMP program designed to efficiently compute MEMs between large genomes. See the README file for instructions on how to use E-MEM. E-MEM source code The source code can be downloaded here. If you use E-MEM, please...

sco.h-its.org - PEAR is an ultrafast, memory-efficient and highly accurate pair-end read merger. It is fully parallelized and can run with as low as just a few kilobytes of memory. PEAR evaluates all possible paired-end read overlaps and without requiring the...

github.com - pyScaf orders contigs from genome assemblies utilising several types of information: paired-end (PE) and/or mate-pair libraries (NGS-based mode) long reads (NGS-based mode) synteny to the genome of some related species (reference-based...