nicolaprezza / lz-rlbwtLinks
Run-length compressed BWT with LZ77 sampled suffix array
☆10Updated 3 years ago
Alternatives and similar repositories for lz-rlbwt
Users that are interested in lz-rlbwt are comparing it to the libraries listed below
Sorting:
- 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
- FM-index representation of a de Bruijn graph☆27Updated 8 years ago
- Practical Dynamic de Bruijn Graphs☆18Updated 5 years ago
- A tool for merging large BWTs☆25Updated 4 years ago
- Simple and fast MinHash implementation in C with Python wrapper☆13Updated 3 months ago
- A fast constructor of the compressed de Bruijn graph from many genomes☆42Updated 9 months ago
- EXPERIMENTAL implementation of side graph☆10Updated 10 years ago
- Header-only, gzread-like reader for gzip, bz2, and xz.☆11Updated 7 years ago
- nimble aligner that will map your reads to the references on a laptop☆11Updated 8 years ago
- ☆13Updated 9 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
- ☆14Updated 5 years ago
- Sequence Bloom Trees with All/Some split☆11Updated 7 years ago
- Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.☆52Updated last year
- C++ library for analysing and storing large-scale cohorts of sequence variant data☆17Updated 6 years ago
- Johns Hopkins University student-led genomics paper discussion group☆13Updated 5 years ago
- succinct labeled graphs with collections and paths☆15Updated 6 years ago
- ☆24Updated 4 years ago
- ☆24Updated 2 months ago
- This repo is deprecated. Please use gfatools instead.☆15Updated 7 years ago
- a toolset for efficient analysis of 10X Genomics linked read data sets, in particular for de novo assembly☆15Updated 5 years ago
- Sequence Distance Graph framework: graph + reads + mapping + analysis☆25Updated 3 years ago
- ☆18Updated 7 years ago
- de Bruijn CompAction in Low Memory☆22Updated 9 years ago
- An experimental tool to find approximate max-cuts in a large graph☆10Updated 4 years ago
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 4 years ago
- StriDe Assembler☆25Updated 7 years ago
- A hash map using the BooPHF perfect hash function☆13Updated 9 years ago
- C++ wrapper to tabix indexer☆17Updated 4 months ago
- Generate kmers/minimizers/hashes/MinHash signatures, including with multiple kmer sizes.☆24Updated 4 years ago