tinglab / DACE
DACE: A Scalable DP-means Algorithm for Clustering Extremely Large Sequence Data
☆10Updated 8 years ago
Alternatives and similar repositories for DACE:
Users that are interested in DACE are comparing it to the libraries listed below
- Software accompanying "HINGE: Long-Read Assembly Achieves Optimal Repeat Resolution"☆64Updated 4 years ago
- Fast FASTA/Q parser and writer (C++ re-implementation of kseq library)☆47Updated last year
- A fuzzy Bruijn graph approach to long noisy reads assembly☆39Updated 7 years ago
- Self-contained, multi-threaded fasta/q parser☆43Updated 5 months ago
- Parallel Sequence to Graph Alignment☆35Updated 2 years ago
- ☆14Updated 6 years ago
- Adaptive semi-global banded alignment on string graphs☆65Updated 6 years ago
- C implementation of the Landau-Vishkin algorithm☆35Updated 2 years ago
- Read alignment with a multi-genome reference☆22Updated 5 years ago
- genome sized sequences clustering☆13Updated 4 years ago
- ☆28Updated last year
- Dashing 2 is a fast toolkit for k-mer and minimizer encoding, sketching, comparison, and indexing.☆63Updated 8 months ago
- Sensitive and Fast Alignment Search Tool for Long Read sequencing Data.☆41Updated 5 years ago
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 2 years ago
- Create Bloom filters for a given reference and then use it to categorize sequences☆76Updated 3 months ago
- COCACOLA: a general framework for binning contigs in metagenomic studies incorporating read COverage, CorrelAtion, sequence COmposition a…☆18Updated 7 years ago
- A reimplementation of the WaveFront Alignment algorithm at low memory☆49Updated 9 months ago
- Pacbio sequence alignment tool, please use "git clone" to copy and use the repository☆18Updated 6 years ago
- K-mer substring space decomposition☆39Updated 9 months ago
- Streaming algorithm for computing kmer statistics for massive genomics datasets☆54Updated 5 years ago
- Estimating k-mer coverage histogram of genomics data☆77Updated last year
- A genome assembler that reduces the computational time of human genome assembly from 400,000 CPU hours to 2,000 CPU hours, utilizing long…☆66Updated 4 years ago
- A fast constructor of the compressed de Bruijn graph from many genomes☆40Updated last month
- Efficient, parallel compression for terabyte-scale data☆40Updated last month
- Core library of the Genome Analysis Toolbox with de-Bruijn graph☆63Updated last month
- Pan-Genomic Matching Statistics☆50Updated 11 months ago
- SIMD C/C++ library for massive optimal sequence alignment (local/SW, infix, overlap, global)☆36Updated last year
- A tool for Racon polishing of miniasm assemblies☆73Updated 3 years ago
- A tool for merging large BWTs☆26Updated 4 years ago
- memory efficient, fast & precise taxnomomic classification system for metagenomic read mapping☆57Updated last week