Roland Faure

@rfaure.bsky.social

Sequence bioinfomatician, algorithms, methods. Postdoc in Institut Pasteur in Rayan Chikhi's lab

When utilized in literature review, LLMs consistently 1. fail to mention female authors in female-led literatures, 2. insist that men are more influential or more heavily cited when this is contradicted by objective citation counts, and 3. attribute women’s work to hallucinated male scholars.

P

This is now published in Genome Research (doi.org/10.1101/gr.2...). Thank you everyone for your feedback and also the anonymous reviewers who helped to greatly improve the paper. I hope this becomes a useful resource for the community.

Hash functions in nucleotide sequence analysis

Randomness is a powerful tool in the design and analysis of algorithms and data structures for nucleotide sequence data. Nucleotide sequences are not themselves random but are often randomized using hash functions. Despite their widespread use in genomics, there is no comprehensive review of the types of hash functions used and their various applications. In this survey intended for bioinformatic methods developers, we divide hash functions into four categories: scattering hash functions, permutations, minimum perfect hash functions, and locality-sensitive hash functions. For each category, we provide examples of both general-use hash functions that have been applied in nucleotide sequence analysis and hash functions that have been designed specifically for nucleotide sequence analysis. We highlight their salient properties, commonalities, differences, and application areas.

doi.org

PPaul Medvedev @pashadag.bsky.social · last yr.

1/4 Hash functions in genomic sequence analysis (tinyurl.com/4kk9ccmt) : a new survey written together with Ke Chen, Xiang Li, Qian Shi, and Mingfu Shao. Before submitting it, we are posting it online to get feedback from the community.

what's the current status of HERRO and (bacterial) nanopore? Last I saw was Ryan Wick's blog evaluating it. How many people now use it (or did it actually get folded into a basecaller, or did it get dropped in favour of something else)?

📌 Les #soumissions pour @jobim2026.bsky.social sont ouvertes jusqu'au 15/03/26. 📝 Soumission de travaux originaux, articles longs (+ PCI), activités de plateformes et de service, posters et démonstrations 📍 Plus d’infos sur : jobim2026.sfbi.fr #JOBIM2026 #bioinfo #Strasbourg

JOBIM 2026@jobim2026.bsky.social · 6mo ago

📣 Ouverture des soumissionsSoumissions ouvertes pour #JOBIM2026 🎉  🗓️ 1er février → 15 mars 2026 👉 Posters, démos, highlights, articles longs, plateformes & services… 🔗 premc.org/jobim-2026/ #bioinfo #Strasbourg

🗜️⚡ If you use gzip/gunzip a lot in your pipelines, switch to the faster"libdeflate" versions instead! They use modern CPU capabilities to achieve a 2-3x speedup. libdeflate is in conda, and "libdeflate-gzip" and "libdeflate-gunzip" are drop-in replacements. #unix github.com/ebiggers/lib...

GitHub - ebiggers/libdeflate: Heavily optimized library for DEFLATE/zlib/gzip compression and decompression

Heavily optimized library for DEFLATE/zlib/gzip compression and decompression - ebiggers/libdeflate

github.com

"..based on a common wavefront design that can be adapted to support a variety of dynamic programming algorithms: local, global, and semi-global alignment of genomic and protein sequences with a variety of commonly used scoring schemes" from @martinsteinegger.bsky.social andco

bioRxiv Bioinfo@biorxiv-bioinfo.bsky.social · 8mo ago

Accelign: a GPU-based Library for Accelerating Pairwise Sequence Alignment https://www.biorxiv.org/content/10.64898/2025.12.17.694868v1

1/9 Just out: k-mer indexes are the backbone of fast search in genomic data, but many degrade under small k, subsampling, or high diversity. With Ondřej Sladký and @pavelvesely.bsky.social we asked: can we build one that works efficiently for any k-mer set?

Bioinformatics Advances@bioinfoadv.bsky.social · 8mo ago

🧮 Just out in Bioinformatics Advances: “FroM Superstring to Indexing: A space-efficient index for unconstrained k-mer sets using the Masked Burrows-Wheeler Transform (MBWT)”  Full article available: https://doi.org/10.1093/bioadv/vbaf290  Authors include: @pavelvesely.bsky.social, @brinda.eu

Preprint out for myloasm, our new nanopore / HiFi metagenome assembler! Nanopore's getting accurate, but 1. Can this lead to better metagenome assemblies? 2. How, algorithmically, to leverage them? with co-author Max Marin @mgmarin.bsky.social, supervised by Heng Li @lh3lh3.bsky.social 1 / N

bioRxiv Bioinfo@biorxiv-bioinfo.bsky.social · 11mo ago

High-resolution metagenome assembly for modern long reads with myloasm https://www.biorxiv.org/content/10.1101/2025.09.05.674543v1

I am happy to share our new preprint introducing MADRe - a pipeline for Metagenomic Assembly-Driven Database Reduction, enabling accurate and computationally efficient strain-level metagenomic classification. 🔗https://www.biorxiv.org/content/10.1101/2025.05.12.653324v1 1/9

Side note: you could, speaking purely theoretically, also fit every microbe onto an SD card, which is within the weight limit for a carrier pigeon. For some distances, it would be faster than the internet for transmitting sequence libraries 7/

Bild

So glad this is finally out. The method has been instrumental in allowing us to compress the AllTheBacteria data - ~2 million bacterial genomes shrink from 3Terabytes (gzipped) to 100Gb using phylogenetic compression. Great work by @brinda.eu

Michael Baym@baym.lol · last yr.

Our latest paper, in which @brinda.eu (along with @zaminiqbal.bsky.social and others) introduces phylogenetic compression for storage and search of enormous microbial genome libraries, was published today in @naturemethods.bsky.social: rdcu.be/eg4OA 1/

Ragnar's made some incredible optimizations on the computation of minimizers, can't wait to see how these improvements will benefit bioinfo tools!

Ragnar {Groot Koerkamp}@curiouscoding.nl · 2y ago

Nice result to end the day (night*): After discussions with @imartayan.bsky.social, the SIMD minimizer code now also does proper canonical (revcomp) minimizers: ~1ns/bp for fwd minis +0.4ns/bp with collect and dedup +0.6ns/bp with canonical hashes. Super happy how it's only 2x slower in the end!

So glad to have successfully defended my Ph.D. last week 😀 Work on producing haplotype-resolved metagenomic assemblies using noisy long reads (HairSplitter) and high-fidelity long reads (Alice assembler, unpublished yet). Thanks to my advisors Dominique Lavenier and Jean-François Flot ❤️

Bild