nicolaprezza / lz-rlbwt
Run-length compressed BWT with LZ77 sampled suffix array
☆10Updated 2 years ago
Alternatives and similar repositories for lz-rlbwt:
Users that are interested in lz-rlbwt are comparing it to the libraries listed below
- Header-only, gzread-like reader for gzip, bz2, and xz.☆12Updated 6 years ago
- MEM mapper prototype☆13Updated 4 years ago
- A tool for merging large BWTs☆26Updated 4 years ago
- Efficient C functions to compute the summary statistics (flagstats) for sequencing read sets.☆15Updated 5 years ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 2 years ago
- FM-index representation of a de Bruijn graph☆27Updated 7 years ago
- comb aligner -- a graphical nucleotide sequence alignment tool☆9Updated 8 years ago
- An experimental tool to find approximate max-cuts in a large graph☆11Updated 3 years ago
- Relative data structures based on the BWT☆12Updated 6 years ago
- A fast constructor of the compressed de Bruijn graph from many genomes☆40Updated last month
- SIMD-parallel BLAST X-drop DP on sequence graphs☆24Updated 9 months ago
- vector illustrations of BWT based searching on small strings☆16Updated 5 years ago
- efficient alignment of strings to partially ordered string graphs☆33Updated 3 years ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 3 years ago
- A hash map using the BooPHF perfect hash function☆12Updated 8 years ago
- Practical Dynamic de Bruijn Graphs☆18Updated 4 years ago
- Streaming algorithm for computing kmer statistics for massive genomics datasets☆54Updated 5 years ago
- deBGR: An Efficient and Near-Exact Representation of the Weighted de Bruijn Graph☆30Updated 4 years ago
- EXPERIMENTAL implementation of side graph☆10Updated 9 years ago
- nimble aligner that will map your reads to the references on a laptop☆12Updated 7 years ago
- Sequence Bloom Trees with All/Some split☆11Updated 6 years ago
- ☆13Updated 5 years ago
- ☆25Updated 3 years ago
- compressed, queryable variation graphs☆11Updated 9 years ago
- Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.☆51Updated last year
- ☆18Updated 6 years ago
- Johns Hopkins University student-led genomics paper discussion group☆13Updated 4 years ago
- Convert structural variants to sequence graphs [ VCF + FASTA ---> GFA ]☆12Updated last year
- de Bruijn CompAction in Low Memory☆23Updated 9 years ago
- Sequence Distance Graph framework: graph + reads + mapping + analysis☆25Updated 2 years ago