arnimarj / py-pointless
A fast and efficient read-only relocatable data structure for JSON like data, with C and Python APIs
☆12Updated last month
Alternatives and similar repositories for py-pointless:
Users that are interested in py-pointless are comparing it to the libraries listed below
- A fast, compact trigram library for Icelandic☆11Updated 7 months ago
- The vocabulary of modern Icelandic, encapsulated in a Python package☆24Updated 7 months ago
- Drög að kennslubók í vefforritun☆12Updated last year
- A succinct colored dBG representation☆12Updated 6 years ago
- Streaming sequence classification with web services ✓📌☆19Updated 2 years ago
- Population-scale detection of novel sequence insertions☆27Updated 2 years ago
- Git guide in Icelandic☆36Updated 10 years ago
- Comparing and combining multiple metagenomic datasets☆16Updated 2 years ago
- compressed, queryable variation graphs☆11Updated 9 years ago
- XL-mHG: A Semiparametric Test for Enrichment in Ranked Lists.☆13Updated 2 years ago
- A collection of bioinformatics algorithms☆12Updated 2 years ago
- prioritize effects of variant annotations from VEP, SnpEff, et al.☆34Updated 4 months ago
- probability of mendelian error in trios.☆11Updated 9 years ago
- Snakemake pipeline for benchmarking read mappers☆16Updated last year
- Bioinformatics pipelines with Haskell and Shake☆56Updated 5 years ago
- RNAlien - unsupervised RNA family model construction☆14Updated 3 years ago
- RNF framework for NGS: simulation of reads, evaluation of mappers, conversion of RNF-compliant data.☆14Updated 6 years ago
- FAstqc DAta PArser - A minimal parser to parse FastQC output data.☆16Updated 9 years ago
- Sequence Bloom Trees with All/Some split☆11Updated 6 years ago
- Parallel k-mer indexing for biological sequences☆12Updated 6 years ago
- MIcrobiomes using Compressive Acceleration☆17Updated 7 years ago
- The python binding for D4 format☆16Updated 3 years ago
- SIMD C/C++ library for massive optimal sequence alignment (local/SW, infix, overlap, global)☆38Updated last year
- Improves the known complexity of online lowest common ancestor search to O(log h) persistently, and without preprocessing☆25Updated 3 months ago
- De Bruijn graph representation in low memory☆36Updated 9 months ago
- Universal K-mer Hitting Set library in Rust☆10Updated 4 years ago
- Tissue-specific variant annotation☆10Updated 6 years ago
- Manager for multi-container computing environments☆24Updated 6 months ago
- Normalization and difference calling for Next Generation Sequencing (NGS) data via joint multinomial modeling.☆11Updated 3 years ago
- DNA assembler developed on FER (Croatia), RBI (Croatia) and GIS (Singapore)☆18Updated 9 years ago