jltsiren / bwt-mergeLinks
A tool for merging large BWTs
☆26Updated 4 years ago
Alternatives and similar repositories for bwt-merge
Users that are interested in bwt-merge are comparing it to the libraries listed below
Sorting:
- A fast constructor of the compressed de Bruijn graph from many genomes☆42Updated 7 months ago
- Practical Dynamic de Bruijn Graphs☆18Updated 4 years ago
- BWT-based index for graphs☆72Updated 6 months ago
- Efficient construction of the BWT using string compression☆18Updated 3 months ago
- Incremental construction of FM-index for DNA sequences☆71Updated last year
- Substring index for paths in a graph☆60Updated 4 months ago
- Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.☆52Updated last year
- A hash map using the BooPHF perfect hash function☆13Updated 8 years ago
- Fast FASTA/Q parser and writer (C++ re-implementation of kseq library)☆51Updated last year
- An optimal space run-length Burrows-Wheeler transform full-text index☆66Updated 2 years ago
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Updated last year
- De Bruijn graph representation in low memory☆36Updated last year
- A python toolkit for building and querying multi-string BWTs☆27Updated 8 years ago
- vector illustrations of BWT based searching on small strings☆16Updated 6 years ago
- An experimental tool to find approximate max-cuts in a large graph☆10Updated 4 years ago
- SIMD-parallel BLAST X-drop DP on sequence graphs☆24Updated last year
- FM-index representation of a de Bruijn graph☆27Updated 8 years ago
- Parallel Sequence to Graph Alignment☆36Updated 2 years ago
- ☆24Updated 4 years ago
- SAPLING: Suffix Array Piecewise Linear INdex for Genomics☆25Updated 5 years ago
- efficient alignment of strings to partially ordered string graphs☆33Updated 3 years ago
- Adaptive semi-global banded alignment on string graphs☆66Updated 7 years ago
- ☆10Updated 3 years ago
- A fast, AVX2 and ARM Neon accelerated FM index library☆34Updated 9 months ago
- Fast and cache-efficient full-text pangenome index☆29Updated last month
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 4 years ago
- BELLA: a Computationally-Efficient and Highly-Accurate Long-Read to Long-Read Aligner and Overlapper☆50Updated 3 years ago
- Run-length compressed BWT with LZ77 sampled suffix array☆11Updated 3 years ago
- FMtree: A fast locating algorithm of FM-indexes for genomic data☆18Updated 7 years ago
- Space-efficient pseudoalignment with a colored de Bruijn graph☆53Updated 6 months ago