niemasd / CompactTree
Lightweight header-only C++ library for loading and traversing trees
☆11Updated 2 months ago
Alternatives and similar repositories for CompactTree:
Users that are interested in CompactTree are comparing it to the libraries listed below
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 3 years ago
- ProphAsm – a rapid computation of simplitigs directly from k-mer sets☆26Updated 2 years ago
- Fulgor is a fast and space-efficient colored de Bruijn graph index.☆49Updated this week
- De Bruijn graph representation in low memory☆36Updated 7 months ago
- A Rust library providing fully dynamic sets of k-mers with high locality☆44Updated 5 months ago
- Classify sequencing reads using MinHash.☆48Updated 4 years ago
- distance based phylogenetic placement☆26Updated last year
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Updated last year
- Iterate over minimizers of a DNA sequence☆28Updated 7 months ago
- ☆25Updated 3 years ago
- Optimal distance lower bound k-mer sampling.☆12Updated 8 months ago
- ☆15Updated 4 years ago
- Layout module for raw de novo genome assembly of long uncorrected reads.☆21Updated 4 years ago
- ☆25Updated 3 years ago
- Alignment-free Phylogenetic Placement using filtered SPAced word Matches☆11Updated last year
- FMSI is a highly memory efficient exact k-mer set based on masked superstrings and the masked Burrows-Wheeler transform☆18Updated last month
- A lightweight library for working with PAF (Pairwise mApping Format) files☆31Updated 2 years ago
- C++ library for analysing and storing large-scale cohorts of sequence variant data☆17Updated 5 years ago
- Given a set of kmers (fasta format) and a set of sequences (fasta format), this tool will extract the sequences containing the kmers.☆21Updated last year
- Iterate k-min-mers from a DNA sequence in Rust☆13Updated 10 months ago
- the we-flyin WFA-guided ultralong tiling sequence aligner☆11Updated 3 years ago
- An experimental tool to find approximate max-cuts in a large graph☆11Updated 3 years ago
- Next Index to Query Kmer Intersection☆16Updated 2 years ago
- Space-efficient pseudoalignment with a colored de Bruijn graph☆53Updated 2 months ago
- Python bindings for Bifrost with a NetworkX compatible API☆28Updated last year
- ☆28Updated last year
- Contains the description of a file format to store kmers and associated values☆32Updated 2 years ago
- Compute a pairwise SNP distance matrix from one or two alignment(s)☆24Updated 5 months ago
- ☆17Updated last year
- drunk on perbase pileups and lua expressions☆17Updated last year