mohsenzakeri / Movi
Fast and cache-efficient full-text pangenome index
☆27Updated 3 weeks ago
Alternatives and similar repositories for Movi:
Users that are interested in Movi are comparing it to the libraries listed below
- Reference implementations of minimizer schemes to go with the mod-minimizers paper.☆23Updated this week
- ☆25Updated 3 years ago
- Optimal distance lower bound k-mer sampling.☆12Updated 8 months ago
- A k-mer search engine for all Sequence Read Archive public accessions☆20Updated 3 months ago
- Code for the paper Succinct k-mer Set Representations Using Subset Rank Queries on the Spectral Burrows-Wheeler Transform (SBWT)☆24Updated 2 months ago
- ☆25Updated 3 years ago
- Contains the description of a file format to store kmers and associated values☆32Updated 2 years ago
- Fulgor is a fast and space-efficient colored de Bruijn graph index.☆49Updated this week
- ☆17Updated last year
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 2 years ago
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 3 years ago
- Code for the paper Aligning Distant Sequences to Graphs using Long Seed Sketches.☆13Updated 2 years ago
- Space-efficient pseudoalignment with a colored de Bruijn graph☆53Updated 2 months ago
- ProphAsm – a rapid computation of simplitigs directly from k-mer sets☆26Updated 2 years ago
- Iterate over minimizers of a DNA sequence☆27Updated 7 months ago
- vector illustrations of BWT based searching on small strings☆16Updated 5 years ago
- Iterate k-min-mers from a DNA sequence in Rust☆13Updated 10 months ago
- SAPLING: Suffix Array Piecewise Linear INdex for Genomics☆25Updated 4 years ago
- An experimental tool to find approximate max-cuts in a large graph☆11Updated 3 years ago
- A Rust library providing fully dynamic sets of k-mers with high locality☆44Updated 4 months ago
- Efficient construction of the BWT using string compression☆17Updated 4 months ago
- Benchmarking pairwise aligners☆36Updated last week
- FMSI is a highly memory efficient exact k-mer set based on masked superstrings and the masked Burrows-Wheeler transform☆18Updated 3 weeks ago
- ☆14Updated 4 years ago
- A fast constructor of the compressed de Bruijn graph from many genomes☆40Updated 2 weeks ago
- Validation of sycnmers compared to minimizers☆11Updated 4 years ago
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Updated last year
- RabbitMash: an efficient highly optimized implementation of Mash.☆21Updated last year
- A reimplementation of the WaveFront Alignment algorithm at low memory☆49Updated 8 months ago
- ☆28Updated last year