| karel-brinda/mof-search |
18 |
|
0 |
0 |
over 2 years ago |
0 |
|
8 |
other |
Python |
| BLAST-like search across all pre-2019 bacteria on ordinary laptop and desktop computers within a few hours |
| mklarqvist/tachyon |
17 |
|
0 |
0 |
almost 7 years ago |
0 |
|
2 |
mit |
C++ |
| High-level API for storing and querying sequence variant data |
| wiedenhoeft/HaMMLET |
10 |
|
0 |
0 |
about 6 years ago |
0 |
|
2 |
gpl-3.0 |
C++ |
| Fast Bayesian Hidden Markov Model with Wavelet Compression |
| yuansliu/HiRGC |
9 |
|
0 |
0 |
almost 6 years ago |
0 |
|
1 |
|
C++ |
| High-speed and high-ratio referential genome compression |
| GuillaumeHolley/DARRC |
7 |
|
0 |
0 |
almost 9 years ago |
0 |
|
0 |
mit |
C |
| DARRC is a new alignment-free and reference-free compression method that addresses the problem of pan-genome compression by encoding the sequences of a pan-genome as a guided de Bruijn Graph. The novelty of this method is its ability to incrementally update DARRC archives with new genome sequences without full decompression of the archive. DARRC can compress both single-end and paired-end read sequences of any length using all symbols of the IUPAC nucleotide code. |
| karel-brinda/MiniPhy |
7 |
|
0 |
0 |
over 2 years ago |
0 |
|
7 |
other |
Python |
| Phylogenetic compression of extremely large genome collections [661k โ๐๐.๐๐๐, BIGSIdata โ๐๐ ๐๐] |
