ParBLiSS / kmerind
Parallel k-mer indexing for biological sequences
☆12Updated 6 years ago
Alternatives and similar repositories for kmerind:
Users that are interested in kmerind are comparing it to the libraries listed below
- HMM-guided metagenomic gene-targeted assembler using iterative de Bruijn graphs☆17Updated 8 years ago
- Self-contained, multi-threaded fasta/q parser☆43Updated 6 months ago
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 3 years ago
- This repo is deprecated. Please use gfatools instead.☆16Updated 6 years ago
- A fast constructor of the compressed de Bruijn graph from many genomes☆40Updated 2 months ago
- C implementation of the Landau-Vishkin algorithm☆35Updated 3 years ago
- VariantStore: A Large-Scale Genomic Variant Search Index☆39Updated 3 years ago
- C++ library for analysing and storing large-scale cohorts of sequence variant data☆17Updated 5 years ago
- SAPLING: Suffix Array Piecewise Linear INdex for Genomics☆25Updated 4 years ago
- Population-scale detection of novel sequence insertions☆27Updated 2 years ago
- ☆25Updated 4 years ago
- An experimental tool to find approximate max-cuts in a large graph☆11Updated 3 years ago
- Minimalistic aligner which uses Minimap for input mapping locations and Edlib for fast bitvector alignment.☆10Updated 7 years ago
- A efficient method to construct BWT index of a given DNA sequence, especially useful for gigantic and high similar genome.☆14Updated 8 years ago
- ☆28Updated 2 weeks ago
- Classify sequencing reads using MinHash.☆48Updated 5 years ago
- Parallel Sequence to Graph Alignment☆36Updated 2 years ago
- Contains the description of a file format to store kmers and associated values☆32Updated 2 years ago
- Johns Hopkins University student-led genomics paper discussion group☆13Updated 5 years ago
- A reimplementation of the WaveFront Alignment algorithm at low memory☆49Updated 11 months ago
- The Modular Aligner and The Modular SV Caller☆46Updated last year
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 3 years ago
- A pipeline for detecting mis-assemblies in metagenomic assemblies.☆14Updated 7 years ago
- A C++ library and utilities for manipulating the Graphical Fragment Assembly format.☆54Updated 2 years ago
- Toolkit for extracting SVs from long sequences and benchmarking variant callers☆13Updated 8 years ago
- An illumina paired-end and mate-pair short read simulator. This project attempts to model as many of the quirks that exist in Illumina da…☆66Updated 10 years ago
- Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.☆51Updated last year
- FQSqueezer - FASTQ compressor based on k-mer statistics☆16Updated last year
- Space-efficient pseudoalignment with a colored de Bruijn graph☆53Updated last month
- ☆14Updated 2 years ago