davidecenzato / PFP-eBWTLinks
Implementation of eBWT using Prefix-free parse (PFP)
☆14Updated 10 months ago
Alternatives and similar repositories for PFP-eBWT
Users that are interested in PFP-eBWT are comparing it to the libraries listed below
Sorting:
- Efficient construction of the BWT using string compression☆18Updated last month
- modified from gitlab.com/manzai/Big-BWT to support fasta files☆9Updated 5 months ago
- Cache-friendly, Parallel, and Samplesort-based Constructor for Suffix Arrays and LCP Arrays☆13Updated 2 weeks ago
- Fast and cache-efficient full-text pangenome index☆29Updated this week
- vector illustrations of BWT based searching on small strings☆16Updated 6 years ago
- A cheatsheet for most common Stringology tasks☆15Updated 4 years ago
- Code for the paper Succinct k-mer Set Representations Using Subset Rank Queries on the Spectral Burrows-Wheeler Transform (SBWT)☆24Updated 4 months ago
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Updated last year
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- Practical Dynamic de Bruijn Graphs☆18Updated 4 years ago
- A tool for merging large BWTs☆26Updated 4 years ago
- Implementation of a Backpack Quotient Filter☆12Updated this week
- SIMD-parallel BLAST X-drop DP on sequence graphs☆25Updated last year
- ☆25Updated 4 years ago
- ☆14Updated 5 years ago
- ☆11Updated 2 years ago
- An experimental tool to find approximate max-cuts in a large graph☆11Updated 4 years ago
- R-Index-F Library for Pattern Matching☆13Updated 11 months ago
- Fast FASTA/Q parser and writer (C++ re-implementation of kseq library)☆51Updated last year
- Reference implementations of minimizer schemes to go with the mod-minimizers paper.☆25Updated 2 months ago
- SAPLING: Suffix Array Piecewise Linear INdex for Genomics☆25Updated 4 years ago
- Optimal distance lower bound k-mer sampling.☆12Updated last year
- Pan-genome Seed Index☆20Updated 4 months ago
- Johns Hopkins University student-led genomics paper discussion group☆13Updated 5 years ago
- ☆10Updated last year
- Inducing enhanced suffix arrays for string collections [DCC'16, TCS 2017]☆26Updated 2 years ago
- ProphAsm – a rapid computation of simplitigs directly from k-mer sets☆26Updated 2 years ago
- A fast constructor of the compressed de Bruijn graph from many genomes☆41Updated 5 months ago
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 3 years ago
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 3 years ago