Minimiser-based digital normalisation for long-read DNA sequence datasets
-
Updated
Jun 18, 2018 - Python
Minimiser-based digital normalisation for long-read DNA sequence datasets
A method for variant graph genotyping based on exact alignment of k-mers
Get Started with DNA Sequencing working with .FastQ and .FastA file formats and performing Pattern Matching Algorithms (Exact & Approximate).
Evaluation tools for "A performant bridge between fixed-size and variable-size seeding"
a molecular solutions toolbox for molecular biologists.
web application for DNA comparison, alignment and phylogenetic tree. Released on 2020.
An alignment-free method capable of processing and counting k-mers in a reasonable time, while evaluating multiple values of the k parameter concurrently.
Mutation table of COVID-19 virus genome with all possible substitution mutations and corresponding 20-mers for mutation identification
Investigating genome size variation with k-mers
simple virus DNA classification
Source files created during the Master's Thesis
ProphAsm – a rapid computation of simplitigs directly from k-mer sets
Projet GENOM master 2 BIM : 2022 - 2023 Projet de bio-informatique sur les k-mers codé en Python
Supplementary repository for "Efficient and robust search of microbial genomes via Phylogenetic Compression"
Bioinformatics 101 tool for counting unique k-length substrings in DNA
Project for the course of Bioinformatics - University of Padua.
ProPhex – an exact k-mer index using Burrows-Wheeler Transform
Fast and compact locality-preserving minimal perfect hashing for k-mer sets.
Client for downloading and a phylogenetic decompression of the BIGSIdata de Bruijn graphs
Add a description, image, and links to the k-mers topic page so that developers can more easily learn about it.
To associate your repository with the k-mers topic, visit your repo's landing page and select "manage topics."