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

https://genome10k.soe.ucsc.edu The Genome 10K project aims to assemble a genomic zoo—a collection of DNA sequences representing the genomes of 10,000 vertebrate species, approximately one for every vertebrate genus. The trajectory of cost reduction...

broadinstitute.github.io - Picard is a set of command line tools for manipulating high-throughput sequencing (HTS) data and formats such as SAM/BAM/CRAM and VCF. These file formats are defined in the Hts-specs repository. See especially the SAM specification and the VCF...

mira-assembler.sourceforge.net - MIRA is a multi-pass DNA sequence data assembler/mapper for whole genome and EST/RNASeq projects. MIRA assembles/maps reads gained by electrophoresis sequencing (aka Sanger sequencing) 454 pyro-sequencing (GS20, FLX or Titanium) Ion...

www.bioinformatics.babraham.ac.uk - Understanding Following table and graphs Duplication level kmer profile per base GC content per base N content per base quality per base sequence content per sequence GC content per sequence quality sequence length distribution More at...

sc932.github.io - Assembly Likelihood Evaluation (ALE) framework that overcomes these limitations, systematically evaluating the accuracy of an assembly in a reference-independent manner using rigorous statistical methods. This framework is comprehensive, and...

www.cbcb.umd.edu - Bambus 2.0, the second generation Bambus scaffolder available as an open source package. While most other scaffolders are closely tied to a specific assembly program, Bambus accepts the output from most current assemblers and provides the user with...

www.ncbi.nlm.nih.gov - Background. Next-generation sequencing technologies are now producing multiple times the genome size in total reads from a single experiment. This is enough information to reconstruct at least some of the differences between the individual genome...

github.com - SGA is a de novo genome assembler based on the concept of string graphs. The major goal of SGA is to be very memory efficient, which is achieved by using a compressed representation of DNA sequence reads. More at https://github.com/jts/sga SGA...

www.topcoder.com - Learning greedy algo for biologist.  https://www.topcoder.com/community/data-science/data-science-tutorials/greedy-is-good/ This webpage is also useful for the...