dominikkempa / zip-treeView external linksLinks
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 last year
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequencesโ15Aug 7, 2018Updated 7 years ago
- Paper Collection for Stringologistsโ17Feb 7, 2026Updated last week
- ๐ ๐งฌ SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.โ93Updated this week
- modular k-mer count matrix and Bloom filter construction for large read collectionsโ86Dec 15, 2025Updated last month
- Efficient Prefix-Sum data structures in C++.โ26Oct 1, 2023Updated 2 years ago
- AnchorHash - A Scalable Consistent Hashโ26Dec 5, 2021Updated 4 years ago
- โ24Aug 25, 2025Updated 5 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โ115Dec 17, 2025Updated last month
- 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
- โ11Updated this week
- Prototype public schematic transport lines in secondsโ12Nov 11, 2023Updated 2 years ago
- โจ Brand Indicators for Message Identification or BIMI ( ๐ข pronounced: Bih-mee) is an emerging email ๐ง specification that enables the usโฆโ10Mar 6, 2024Updated last year
- UppHub is the repository that serves as the official global registry for U++ distributed packages. Each package provides additional functโฆโ12Nov 4, 2025Updated 3 months ago
- A fast heuristic search algorithm for finding the longest common subsequence of multiple stringsโ10Nov 22, 2023Updated 2 years ago
- self study java, through cs61b (http://www.cs.berkeley.edu/~jrs/61b/)โ10Jul 9, 2013Updated 12 years ago
- GESTALT processing pipeline for barcodes captured with single-cell RNA sequencingโ13Jan 26, 2020Updated 6 years ago
- โ13Nov 15, 2017Updated 8 years ago
- Boost.Mustacheโ10Jan 31, 2023Updated 3 years ago
- Minimum Bait Cover Toolkit Syotti.โ13Jan 22, 2025Updated last year
- A Simple Algorithm for Minimum Cuts in Near-Linear Time (SWAT '20)โ12Apr 24, 2020Updated 5 years ago
- GBWT in Rustโ45Dec 26, 2025Updated last month
- โ39Jun 20, 2020Updated 5 years ago
- Efficiently manage Git branches without leaving your local branchโ54Feb 7, 2025Updated last year
- CLI utilty to work out proper constants for vpternlogic instructionโ13Jan 22, 2023Updated 3 years ago
- multi_tbx: a simple tool for indexing VCF files and extract variant records for variant data stored in multiple VCF files.โ10Jan 7, 2022Updated 4 years ago
- Bฮต tree implementationโ12Dec 6, 2023Updated 2 years ago
- MultiBreak-SV identifies structural variants from next-generation paired end data, third-generation long read data, or data from a combinโฆโ12Jul 19, 2016Updated 9 years ago
- An efficient method for sampling from the Gram--Schmidt Walk Design.โ13Sep 16, 2023Updated 2 years ago