StephenHwang / MEMOLinks
MEMO: MEM-based pangenome indexing for k-mer queries
☆20Updated last year
Alternatives and similar repositories for MEMO
Users that are interested in MEMO are comparing it to the libraries listed below
Sorting:
- Genome Assembly 102☆17Updated 9 months ago
- PAF (pairwise alignment format) validator based on extended CIGAR strings☆15Updated 6 months ago
- Genotyping lots of samples with big pangenomes☆11Updated 3 months ago
- Long read aligner for cyclic and acyclic pangenome graphs☆40Updated 2 years ago
- ☆23Updated 5 months ago
- Long-read aligner to pangenome graphs☆29Updated last year
- Compares pangenome graphs by calculating the segmentation distance between two GFA (Graphical Fragment Assembly) files.☆12Updated 4 months ago
- Phasing reads with secondary alignments☆21Updated last year
- Transfer HiFi read mappings from their own assembly contigs to a standard reference☆29Updated last month
- a tool to evaluate long-read error correction mainly with PacBio High-Fidelity Reads (HiFi reads).☆21Updated 2 years ago
- recompute GFA link overlaps☆25Updated 3 years ago
- Prefix-renaming FASTA records really fast.☆17Updated last year
- COsine SImilarity-based Genotyper using pangenomes☆25Updated 2 weeks ago
- ANI based satellite annotation☆23Updated 3 months ago
- ☆13Updated 8 months ago
- Genome Assembly Validation via Inter-SUNK distances in ONT reads☆15Updated 2 years ago
- Extracts subgraphs or components from a graph in GFA format☆24Updated last year
- syncmer graphs, and perhaps other sorts of sequence graphs☆24Updated last month
- Efficient indexing and querying of annotations in a pangenome graph☆10Updated 3 months ago
- General purpose utility related to GAF files☆29Updated 2 weeks ago
- base-level dotplots from PAF alignments☆30Updated 4 months ago
- ☆19Updated last year
- ☆28Updated 6 months ago
- AlfaPang builds pangenome graphs without alignments or references.☆15Updated 3 months ago
- Detect and phase minor SNVs from long-read sequencing data☆14Updated 4 years ago
- Annotation of cryptic transposon variants using Hidden Markov Models to detect conserved terminal features.☆10Updated 2 weeks ago
- Everything but the kitchen sink☆12Updated last year
- ☆19Updated 11 months ago
- Improved long-read assembly by preserving contained reads☆30Updated last year
- convert variation graph alignments to coverage maps over nodes☆27Updated 3 weeks ago