C++ Implementation of Zip Trees
☆14Nov 5, 2022Updated 3 years ago
Alternatives and similar repositories for zip-tree
Users that are interested in zip-tree are comparing it to the libraries listed below
Sorting:
- Implementation of eBWT using Prefix-free parse (PFP)☆14Jul 14, 2025Updated 7 months ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆15Jun 28, 2022Updated 3 years ago
- R-Index-F Library for Pattern Matching☆12Aug 8, 2024Updated last year
- ☆12Oct 15, 2023Updated 2 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Nov 10, 2021Updated 4 years ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆14May 11, 2018Updated 7 years ago
- Convert structural variants to sequence graphs [ VCF + FASTA ---> GFA ]☆11Mar 6, 2024Updated 2 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Aug 7, 2018Updated 7 years ago
- Paper Collection for Stringologists☆17Feb 14, 2026Updated 3 weeks ago
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆93Feb 24, 2026Updated last week
- modular k-mer count matrix and Bloom filter construction for large read collections☆86Dec 15, 2025Updated 2 months ago
- AnchorHash - A Scalable Consistent Hash☆26Dec 5, 2021Updated 4 years ago
- Efficient Prefix-Sum data structures in C++.☆26Oct 1, 2023Updated 2 years ago
- ☆24Aug 25, 2025Updated 6 months ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆31Jan 8, 2023Updated 3 years ago
- Dynamic succinct/compressed data structures☆116Dec 17, 2025Updated 2 months ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆68May 31, 2023Updated 2 years ago
- ☆81Sep 9, 2025Updated 5 months ago
- Example to read qr code with kotlin☆10Jul 24, 2018Updated 7 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Sep 4, 2024Updated last year
- GESTALT processing pipeline for barcodes captured with single-cell RNA sequencing☆13Jan 26, 2020Updated 6 years ago
- Minimum Bait Cover Toolkit Syotti.☆13Jan 22, 2025Updated last year
- ✨ Brand Indicators for Message Identification or BIMI ( 📢 pronounced: Bih-mee) is an emerging email 📧 specification that enables the us…☆10Mar 6, 2024Updated 2 years ago
- UppHub is the repository that serves as the official global registry for U++ distributed packages. Each package provides additional funct…☆12Nov 4, 2025Updated 4 months ago
- self study java, through cs61b (http://www.cs.berkeley.edu/~jrs/61b/)☆10Jul 9, 2013Updated 12 years ago
- Boost.Mustache☆10Jan 31, 2023Updated 3 years ago
- A fast heuristic search algorithm for finding the longest common subsequence of multiple strings☆10Nov 22, 2023Updated 2 years ago
- ☆11Updated this week
- ☆13Nov 15, 2017Updated 8 years ago
- A Simple Algorithm for Minimum Cuts in Near-Linear Time (SWAT '20)☆12Apr 24, 2020Updated 5 years ago
- ☆39Jun 20, 2020Updated 5 years ago
- Efficiently manage Git branches without leaving your local branch☆54Feb 7, 2025Updated last year
- GBZ file format for pangenome graphs☆46Feb 18, 2026Updated 2 weeks ago
- Bε tree implementation☆12Dec 6, 2023Updated 2 years ago
- notes and materials from dbug meetings☆10Sep 26, 2018Updated 7 years ago
- R integration for edlib, a C/C++ library for pairwise sequence alignment using edit distance (Levenshtein distance).☆11Jul 20, 2025Updated 7 months ago
- ☆10Feb 23, 2024Updated 2 years ago
- ☆13Aug 22, 2025Updated 6 months ago
- ☆11Dec 31, 2021Updated 4 years ago