tinglab / DACELinks
DACE: A Scalable DP-means Algorithm for Clustering Extremely Large Sequence Data
☆10Updated 9 years ago
Alternatives and similar repositories for DACE
Users that are interested in DACE are comparing it to the libraries listed below
Sorting:
- Implementation of Positional Burrows-Wheeler Transform for genetic data☆110Updated 6 months ago
- Global alignment and alignment extension☆136Updated 2 years ago
- Fast FASTA/Q parser and writer (C++ re-implementation of kseq library)☆53Updated last year
- Adaptive semi-global banded alignment on string graphs☆67Updated 7 years ago
- Core library of the Genome Analysis Toolbox with de-Bruijn graph☆64Updated 8 months ago
- BWT-based index for graphs☆73Updated 7 months ago
- A C/C++ library for fast interval overlap queries (with a "bedtools coverage" example)☆168Updated last year
- Self-contained, multi-threaded fasta/q parser☆48Updated last year
- Substring index for paths in a graph☆60Updated 5 months ago
- A repository for generating strobemers and evalaution☆78Updated last year
- abPOA: an SIMD-based C library for fast partial order alignment using adaptive band☆129Updated last week
- SIMD partial order alignment tool/library☆170Updated 3 weeks ago
- Building the compacted de Bruijn graph efficiently from references or reads.☆89Updated 5 months ago
- A tool for merging large BWTs☆25Updated 4 years ago
- Code examples of fast and simple k-mer counters for tutorial purposes☆170Updated 5 years ago
- A C++ header-only library for reading Oxford Nanopore Fast5 files☆53Updated 3 years ago
- Squeakr: An Exact and Approximate k -mer Counting System☆85Updated 7 months ago
- Incremental construction of FM-index for DNA sequences☆72Updated last year
- utilities for indexing and sequence extraction from FASTA files☆59Updated 4 years ago
- Bidirectional WFA (Paper)☆47Updated last year
- Compressing next-generation sequencing data with extreme prejudice.☆83Updated 3 years ago
- A fuzzy Bruijn graph approach to long noisy reads assembly☆39Updated 8 years ago
- Software accompanying "HINGE: Long-Read Assembly Achieves Optimal Repeat Resolution"☆63Updated 5 years ago
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Updated last year
- Read alignment with a multi-genome reference☆22Updated 5 years ago
- A fast K-mer counter for high-fidelity shotgun datasets☆131Updated last month
- A fast constructor of the compressed de Bruijn graph from many genomes☆42Updated 8 months ago
- compacted de Bruijn graph construction in low memory☆99Updated last year
- SIMD C/C++ library for massive optimal sequence alignment (local/SW, infix, overlap, global)☆39Updated last year
- BELLA: a Computationally-Efficient and Highly-Accurate Long-Read to Long-Read Aligner and Overlapper☆50Updated 3 years ago