Read Mapping on de Bruijn graph. - Antoine Limasset; Pierre Peterlongo (CoRR, 2015)

On the Representation of De Bruijn Graphs. - Rayan Chikhi; Antoine Limasset; Shaun Jackman; Jared T. Simpson; Paul Medvedev (J. Comput. Biol., 2015)

A Resource-frugal Probabilistic Dictionary and Applications in (Meta)Genomics. - Camille Marchet; Antoine Limasset; Lucie Bittner; Pierre Peterlongo (Stringology, 2016)

Compacting de Bruijn graphs from sequencing data quickly and in low memory. - Rayan Chikhi; Antoine Limasset; Paul Medvedev (Bioinform., 2016)

Read mapping on de Bruijn graphs. - Antoine Limasset; Bastien Cazaux; Eric Rivals; Pierre Peterlongo (BMC Bioinform., 2016)

Fast and Scalable Minimal Perfect Hashing for Massive Key Sets. - Antoine Limasset; Guillaume Rizk; Rayan Chikhi; Pierre Peterlongo (SEA, 2017)

Toward perfect reads. - Antoine Limasset; Jean-François Flot; Pierre Peterlongo (CoRR, 2017)

Novel approaches for the exploitation of high throughput sequencing data. (Nouvelles approches pour l'exploitation des données de sequençage haut débit). - Antoine Limasset (2017)

Toward perfect reads: self-correction of short reads via mapping on de Bruijn graphs. - Antoine Limasset; Jean-François Flot; Pierre Peterlongo (Bioinform., 2020)

A resource-frugal probabilistic dictionary and applications in bioinformatics. - Camille Marchet; Lolita Lecompte; Antoine Limasset; Lucie Bittner; Pierre Peterlongo (Discret. Appl. Math., 2020)

BLight: efficient exact associative structure for k-mers. - Camille Marchet; Maël Kerbiriou; Antoine Limasset (Bioinform., 2021)

Toward Optimal Fingerprint Indexing for Large Scale Genomics. - Clément Agret; Bastien Cazaux; Antoine Limasset (WABI, 2022)

Locality-Preserving Minimal Perfect Hashing of k-mers. - Giulio Ermanno Pibiri; Yoshihiro Shibuya; Antoine Limasset (CoRR, 2022)

Fractional Hitting Sets for Efficient and Lightweight Genomic Data Sketching. - Timothé Rouzé; Igor Martayan; Camille Marchet; Antoine Limasset (WABI, 2023)

Scalable sequence database search using partitioned aggregated Bloom comb trees. - Camille Marchet; Antoine Limasset (Bioinform., 2023)

Locality-preserving minimal perfect hashing of k-mers. - Giulio Ermanno Pibiri; Yoshihiro Shibuya; Antoine Limasset (Bioinform., 2023)

Conway-Bromage-Lyndon (CBL): an exact, dynamic representation of k-mer sets. - Igor Martayan; Bastien Cazaux; Antoine Limasset; Camille Marchet (Bioinform., 2024)

Hyper-k-mers: Efficient Streaming k-mers Representation. - Igor Martayan; Lucas Robidou; Yoshihiro Shibuya; Antoine Limasset (RECOMB, 2025)

Fractional hitting sets for efficient multiset sketching. - Timothé Rouzé; Igor Martayan; Camille Marchet; Antoine Limasset (Algorithms Mol. Biol., 2025)