jltsiren / relative-fmLinks
Relative data structures based on the BWT
☆12Updated 7 years ago
Alternatives and similar repositories for relative-fm
Users that are interested in relative-fm are comparing it to the libraries listed below
Sorting:
- A tool for merging large BWTs☆26Updated 4 years ago
- FM-index representation of a de Bruijn graph☆27Updated 7 years ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 3 years ago
- compressed, queryable variation graphs☆11Updated 10 years ago
- ☆20Updated 4 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆84Updated last year
- Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index☆81Updated last year
- Run-length compressed BWT with LZ77 sampled suffix array☆10Updated 3 years ago
- Dynamic succinct/compressed data structures☆112Updated last year
- An optimal space run-length Burrows-Wheeler transform full-text index☆66Updated 2 years ago
- dynamic-updateable-index☆11Updated 9 years ago
- BlastGraph is a new tool for computing intensive approximate pattern matching in a sequence graph or a de-Bruijn graph. Given an oriented…☆12Updated 12 years ago
- Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.☆52Updated last year
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- Practical Dynamic de Bruijn Graphs☆18Updated 4 years ago
- DartMinHash: Fast Sketching for Weighted Sets☆13Updated 4 years ago
- deBGR: An Efficient and Near-Exact Representation of the Weighted de Bruijn Graph☆30Updated 4 years ago
- memory mapped multimap, multiset, and implicit interval tree based on an in-place parallel sort☆27Updated 4 years ago
- Simple and fast MinHash implementation in C with Python wrapper☆13Updated 5 years ago
- External memory suffix array construction using inducing☆11Updated 4 years ago
- An alignment-free, reference-free and incremental data structure for colored de Bruijn graph with application to pan-genome indexing.☆44Updated 3 years ago
- An experimental tool to find approximate max-cuts in a large graph☆11Updated 4 years ago
- BWT-based index for graphs☆71Updated 4 months ago
- Extremely fast inplace radix sort☆42Updated 5 years ago
- A fast constructor of the compressed de Bruijn graph from many genomes☆41Updated 5 months ago
- Incremental construction of FM-index for DNA sequences☆71Updated last year
- Smith-Waterman database searches with inter-sequence SIMD parallelisation☆60Updated last year
- vector illustrations of BWT based searching on small strings☆16Updated 6 years ago
- Implementation of eBWT using Prefix-free parse (PFP)☆14Updated 10 months ago
- ProbMinHash – A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity☆42Updated 4 years ago