jltsiren / relative-fm
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
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 3 years ago
- compressed, queryable variation graphs☆11Updated 9 years ago
- FM-index representation of a de Bruijn graph☆27Updated 7 years ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- Run-length compressed BWT with LZ77 sampled suffix array☆10Updated 3 years ago
- External memory suffix array construction using inducing☆11Updated 4 years ago
- dynamic-updateable-index☆11Updated 9 years ago
- Practical Dynamic de Bruijn Graphs☆18Updated 4 years ago
- Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index☆81Updated last year
- ☆20Updated 4 years ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆64Updated last year
- Simple and fast MinHash implementation in C with Python wrapper☆13Updated 4 years ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆15Updated 7 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆84Updated last year
- Compact Tree Representation☆16Updated 8 years ago
- An alignment-free, reference-free and incremental data structure for colored de Bruijn graph with application to pan-genome indexing.☆43Updated 3 years ago
- Dynamic succinct/compressed data structures☆112Updated 11 months ago
- vector illustrations of BWT based searching on small strings☆16Updated 6 years ago
- BWT-based index for graphs☆71Updated 2 months ago
- Incremental construction of FM-index for DNA sequences☆70Updated 11 months 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
- deBGR: An Efficient and Near-Exact Representation of the Weighted de Bruijn Graph☆30Updated 4 years ago
- Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.☆51Updated last year
- A fast constructor of the compressed de Bruijn graph from many genomes☆40Updated 3 months ago
- A cheatsheet for most common Stringology tasks☆15Updated 4 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆63Updated 11 months ago
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆107Updated 10 years ago
- Implementation of a Backpack Quotient Filter☆11Updated 9 months ago
- Streaming algorithm for computing kmer statistics for massive genomics datasets☆54Updated 5 years ago