ECE358 Exercise - Finding Maximal Matches in Genome Sequences
-
Updated
Sep 20, 2014 - C++
ECE358 Exercise - Finding Maximal Matches in Genome Sequences
Identification of organisms from a stream of DNA sequences
G-PhoCS is a software package for inferring ancestral population sizes, population divergence times, and migration rates from individual genome sequences.
Fast Bayesian Hidden Markov Model with Wavelet Compression
a genome alignment library built around seed-and-extend algorithms for maximal exact and unique matches
PRAWNS: A fast and scalable bioinformatics tool that generates an efficient pan-genome representation of closely related whole genomes to provide a concise list of genomic features
A multithreaded tool for maximal exact matches (MEM) computation (in genomes).
Common bioinformatic tools in C/C++
Multiple sequence alignment tool that builds on the concept of seed-and-extend algorithms
Add a description, image, and links to the genome-analysis topic page so that developers can more easily learn about it.
To associate your repository with the genome-analysis topic, visit your repo's landing page and select "manage topics."