Malfoy / PACLinks
☆10Updated last year
Alternatives and similar repositories for PAC
Users that are interested in PAC are comparing it to the libraries listed below
Sorting:
- ProphAsm – a rapid computation of simplitigs directly from k-mer sets☆25Updated 2 years ago
- ☆24Updated last month
- Code for the paper Aligning Distant Sequences to Graphs using Long Seed Sketches.☆13Updated 2 years ago
- ☆13Updated 9 years ago
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 4 years ago
- Minimum plain text representation of kmer sets☆16Updated 8 months ago
- Next Index to Query Kmer Intersection☆16Updated 2 years ago
- Contains the description of a file format to store kmers and associated values☆33Updated 3 years ago
- This repo is deprecated. Please use gfatools instead.☆15Updated 7 years ago
- Fast and cache-efficient full-text pangenome index☆29Updated last week
- Tool (experimental) to compute layout from overlaps with spectral algorithm☆11Updated 7 years ago
- RabbitMash: an efficient highly optimized implementation of Mash.☆20Updated last year
- ☆28Updated 5 months ago
- the we-flyin WFA-guided ultralong tiling sequence aligner☆10Updated 4 years ago
- A script to extract graph structure from multiple sequence alignment result and output as GFA/JSON for vg☆11Updated 6 years ago
- Space-efficient pseudoalignment with a colored de Bruijn graph☆52Updated 6 months ago
- ☆14Updated 5 years ago
- Generate kmers/minimizers/hashes/MinHash signatures, including with multiple kmer sizes.☆24Updated 4 years ago
- syncmer graphs, and perhaps other sorts of sequence graphs☆21Updated 6 months ago
- A fast constructor of the compressed de Bruijn graph from many genomes☆42Updated 8 months ago
- FMSI is a highly memory efficient exact k-mer set index based on masked superstrings and the masked Burrows-Wheeler transform☆20Updated 2 months ago
- Optimal distance lower bound k-mer sampling.☆12Updated last year
- ☆18Updated 10 months ago
- a toolset for efficient analysis of 10X Genomics linked read data sets, in particular for de novo assembly☆15Updated 5 years ago
- ☆24Updated 4 years ago
- Paired reads mapping on de Bruijn graph☆13Updated 6 years ago
- An experimental tool to estimate the similarity between all pairs of contigs☆39Updated 4 years ago
- Indel-aware consensus for aligned BAM☆21Updated last month
- Reference implementations of minimizer schemes to go with the mod-minimizers paper.☆25Updated 5 months ago
- Fast-SG: An alignment-free algorithm for ultrafast scaffolding graph construction from short or long reads.☆22Updated 7 years ago