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...
As the cost of DNA sequencing has dropped, the volume of data produced has risen into the petabytes. Google is working with the genomics community to define a standard API for working with big genomic data sets in the cloud. Building on Google Cloud...
FYI, I've found it useful to use MUMmer to extract the specific changes that Racon makes, so I can evaluate them individually:
minimap -t 24 assembly.fasta long_reads.fastq.gz | racon -t 24 long_reads.fastq.gz - assembly.fasta...
Applications for Pre-selection of candidates under ‘Institutions Mode’ for DST-ISPIRE Faculty in Computational Biology/ Systems Biology/ Bioinformatics
Applications are invited for pre-selection of candidates for Ministry of Science and...
github.com - HM2 can process any diploid assemblies, but it is especially suitable for diploid assemblies with high heterozygosity (≥3%), which can be difficult for other tools. This pipeline also implements flexible and sensitive assembly error detection, a...
The IPython Notebook is a web-based interactive computational environment where you can combine code execution, text, mathematics, plots and rich media into a single document
cab.spbu.ru - QUAST-LG-a tool that compares large genomic de novo assemblies against reference sequences and computes relevant quality metrics. Since genomes generally cannot be reconstructed completely due to complex repeat patterns and low coverage regions, we...
github.com - pyGenomeTracks aims to produce high-quality genome browser tracks that are highly customizable. Currently, it is possible to plot:
bigwig
bed (many options)
bedgraph
links (represented as arcs)
Hi-C matrices (if HiCExplorer is...
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...