This is your work, valued

Lille

Antoine Limasset

Advanced
@Malfoy

CNRS researcher     Université_Lille/CRIStaL/Bonsai.

malfoy.github.io./

Blight. De Bruijn graph representation in low memory

36

K2Rmini. Rust

27

BCALM. de Bruijn CompAction in Low Memory

23

NIQKI. Next Index to Query Kmer Intersection

17

BGREAT. de Bruijn Graph REAd mapping Tool

14

BWISE. de Bruijn Workflow using Integral information of Short pair End reads

14

BGREAT2. Paired reads mapping on de Bruijn graph

13

Onika. Rust

13

BCOOL. de Bruijn graph cOrrectiOn from graph aLignment

11

Miekki. Minhash Index Extended to Knead Kmer Intersection

11

PAC. C++

10

Brisk. Brisk Reduced Index for Sequence of K-mers

6

BRAW. Box of not RelAted Work

4

Onikacpp. Optimal Naive Inverted index for Kmer Analysis

3

KFC. kmer week experiment

2

HashesIndexes. Internship

2

Bcash. Best compressible hash

2

ZOR. ZOR filters

2

OLDMPHFREP. Brute Minimal pErfect hAshing constructioN

1

BOA. Bug-free pOA. Jokes appart: POA V2 code with minor (but important) fixes

1

BGREAT3. C++

1

Bmphf. Bucketing of mphfs

1