This is the codebase for Faucet, described in our manuscript: https://academic.oup.com/bioinformatics/article/34/1/147/4004871, by Roye Rozov, Gil Goldshlager, Eran Halperin, and Ron Shamir
☆19May 21, 2017Updated 9 years ago
Alternatives and similar repositories for Faucet
Users that are interested in Faucet are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- ☆11Sep 11, 2024Updated 2 years ago
- SUPBUB is a tool that, in linear time, finds out superbubbles(special graph-structures) in a directed graph.☆12Sep 19, 2019Updated 7 years ago
- ☆15Apr 6, 2016Updated 10 years ago
- Next Index to Query Kmer Intersection☆17Feb 1, 2023Updated 3 years ago
- A fast constructor of the compressed de Bruijn graph from many genomes☆42Nov 27, 2025Updated 11 months ago
- 1-Click AI Models by DigitalOcean Gradient • AdDeploy popular AI models on DigitalOcean Gradient GPU virtual machines with just a single click. Zero configuration with optimized deployments.
- Correction of palindromes in long reads from PacBio and Nanopore☆14Mar 1, 2022Updated 4 years ago
- A rust wrapper for the spoa C++ partial order alignment library☆10Jun 11, 2025Updated last year
- KAUST Assembly Read Error Correction Tool☆15Aug 15, 2015Updated 11 years ago
- Estimating k-mer coverage histogram of genomics data☆80Mar 13, 2026Updated 7 months ago
- A hash map using the BooPHF perfect hash function☆13Sep 25, 2016Updated 10 years ago
- Optimal haplotype assembly of polyploids☆10Mar 29, 2019Updated 7 years ago
- ProphAsm – a rapid computation of simplitigs directly from k-mer sets☆25Feb 17, 2023Updated 3 years ago
- Lightweight C++ library for reading FASTA and FASTQ files.☆12Feb 16, 2019Updated 7 years ago
- deBGR: An Efficient and Near-Exact Representation of the Weighted de Bruijn Graph☆31Jan 19, 2021Updated 5 years ago
- Simple, predictable pricing with DigitalOcean hosting • AdAlways know what you'll pay with monthly caps and flat pricing. Enterprise-grade infrastructure trusted by 600k+ customers.
- a toolset for efficient analysis of 10X Genomics linked read data sets, in particular for de novo assembly☆15Nov 27, 2019Updated 6 years ago
- Mapping scheme test software, to be extended to sequence graphs.☆10Sep 28, 2022Updated 4 years ago
- nimble aligner that will map your reads to the references on a laptop☆11Jun 29, 2017Updated 9 years ago
- Create Bloom filters for a given reference and then use it to categorize sequences☆78Nov 26, 2024Updated last year
- A succinct colored dBG representation☆12Sep 11, 2018Updated 8 years ago
- Fast hash function for DNA/RNA sequences☆111Sep 4, 2026Updated last month
- find likely coding segments in DNA using composition-normalised hexamer tables☆18Oct 18, 2024Updated 2 years ago
- ☆11Feb 2, 2021Updated 5 years ago
- Run-length compressed BWT with LZ77 sampled suffix array☆10Apr 25, 2022Updated 4 years ago
- Managed Database hosting by DigitalOcean • AdPostgreSQL, MySQL, MongoDB, Kafka, Valkey, and OpenSearch available. Automatically scale up storage and focus on building your apps.
- ☆18Jul 9, 2018Updated 8 years ago
- Diverse sampling for single-cell datasets☆17Mar 22, 2026Updated 7 months ago
- Finding putative exons and constructing splicegraphs using Trans-ABySS contigs☆11Nov 8, 2018Updated 7 years ago
- Using reference-free compressed data structures to analyse thousands of human genomes (1000 Genomes ReadServer)☆14Sep 23, 2017Updated 9 years ago
- Rust bindings to the wavefront algorithm C implementation☆17Sep 20, 2022Updated 4 years ago
- Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.☆53Mar 12, 2024Updated 2 years ago
- Fast and accurate set similarity estimation via containment min hash☆41Jul 19, 2024Updated 2 years ago
- MAW: a suite on the computation and application of Minimal Absent Words☆18Nov 1, 2021Updated 4 years ago
- BlastGraph is a new tool for computing intensive approximate pattern matching in a sequence graph or a de-Bruijn graph. Given an oriented…☆12May 9, 2013Updated 13 years ago
- GPU virtual machines on DigitalOcean Gradient AI • AdGet to production fast with high-performance AMD and NVIDIA GPUs you can spin up in seconds. The definition of operational simplicity.
- Compressive Read-mapping Accelerator☆14Sep 7, 2016Updated 10 years ago
- Simple and fast MinHash implementation in C with Python wrapper☆13Jul 24, 2025Updated last year
- mreps: software for tandem repeat identification in DNA☆16Nov 13, 2019Updated 6 years ago
- A Python wrapper for the bbhash library for Minimal Perfect Hashing☆18Oct 26, 2025Updated last year
- StriDe Assembler☆25Nov 23, 2017Updated 8 years ago
- ntHash implementation in Rust☆36Jul 12, 2024Updated 2 years ago
- Minimalistic aligner which uses Minimap for input mapping locations and Edlib for fast bitvector alignment.☆10Jul 16, 2017Updated 9 years ago