rcedgar / syncmerLinks
Validation of sycnmers compared to minimizers
☆12Updated last month
Alternatives and similar repositories for syncmer
Users that are interested in syncmer are comparing it to the libraries listed below
Sorting:
- RabbitMash: an efficient highly optimized implementation of Mash.☆21Updated last year
- Utilities to detect and profile `het-kmers`☆11Updated 10 months ago
- Reference implementations of minimizer schemes to go with the mod-minimizers paper.☆25Updated 2 months ago
- Iterate k-min-mers from a DNA sequence in Rust☆13Updated last year
- recompute GFA link overlaps☆25Updated 2 years ago
- syncmer graphs, and perhaps other sorts of sequence graphs☆20Updated 2 months ago
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 3 years ago
- Alignment algorithm for short Illumina reads to a de Bruijn graph☆16Updated 6 years ago
- ☆28Updated 2 months ago
- Code to create a PRG from a Multiple Sequence Alignment file☆25Updated last week
- the we-flyin WFA-guided ultralong tiling sequence aligner☆11Updated 4 years ago
- deSAMBA: fast and accurate classification of metagenomics long reads with sparse approximate matches☆10Updated last year
- Long read aligner for cyclic and acyclic pangenome graphs☆37Updated last year
- ☆14Updated 2 years ago
- This repo is deprecated. Please use gfatools instead.☆16Updated 6 years ago
- mSWEEP High-resolution sweep metagenomics using fast probabilistic inference☆14Updated 8 months ago
- ☆25Updated 4 years ago
- ☆15Updated 4 years ago
- Wavefront alignment algorithm (WFA) in Golang☆29Updated 7 months ago
- A long read simulator based on badread idea☆22Updated 2 years ago
- Contains the description of a file format to store kmers and associated values☆32Updated 2 years ago
- Dividing heterogeneous long-read sequencing into groups with de Bruijn graphs☆25Updated 7 months ago
- Sketch-based surveillance platform☆13Updated 6 months ago
- Extracts subgraphs or components from a graph in GFA format☆23Updated 7 months ago
- GFAffix identifies walk-preserving shared affixes in variation graphs and collapses them into a non-redundant graph structure.☆36Updated 3 weeks ago
- ProphAsm – a rapid computation of simplitigs directly from k-mer sets☆26Updated 2 years ago
- MEMO: MEM-based pangenome indexing for k-mer queries☆18Updated last year
- fast, multithreaded sourmash operations: search, compare, and gather.☆22Updated this week
- ☆12Updated 6 months ago
- An algorithm for centromere assembly using long error-prone reads☆26Updated 4 years ago