Pierre Peterlongo

Pierre Peterlongo

@pierrepeterlongo.bsky.social

Inria Senior researcher. Head of the https://team.inria.fr/genscale/ at Inria and Irisa. Algorithmics for sequencing data analyses, genomics and metagenomics.

394 followers89 following68 posts

Pinned

❗ I clearly consider this result as THE most important result achieved over this last decade for exploiting and democratizing genomic data. I think there will be a "before" and an "after" logan and logan-search github.com/IndexThePlan... logan-search.org Have a look at this thread

Rayan Chikhi@rayanchikhi.bsky.social

πŸŒŽπŸ‘©β€πŸ”¬ For 15+ years biology has accumulated petabytes (million gigabytes) of🧬DNA sequencing data🧬 from the far reaches of our planet.πŸ¦ πŸ„πŸŒ΅ Logan now democratizes efficient access to the world’s most comprehensive genetics dataset. Free and open. doi.org/10.1101/2024...

1/ 🧬 & πŸ–₯️ New tool: kmhelpers β€” a Python toolkit dedicated to kmindex, automating the building, updating & querying of large-scale k-mer genomic indexes. Turning raw sequencing samples into a fast, size-optimized search engine β€” without needing to be a Bloom-filter expert. 🧡

View full thread

1/ 🧬 & πŸ–₯️ New tool: kmhelpers β€” a Python toolkit dedicated to kmindex, automating the building, updating & querying of large-scale k-mer genomic indexes. Turning raw sequencing samples into a fast, size-optimized search engine β€” without needing to be a Bloom-filter expert. 🧡

View full thread

5/ Real-world use: β€’ Tree of Life @ Wellcome Sanger Institute: 7,394 samples indexed, now powering sample-swap detection across the Darwin Tree of Life project. β€’ Logan-Search (~50 petabases from SRA): next update will use kmhelpers to re-optimize the index.

1/ 🧬 & πŸ–₯️ New tool: kmhelpers β€” a Python toolkit dedicated to kmindex, automating the building, updating & querying of large-scale k-mer genomic indexes. Turning raw sequencing samples into a fast, size-optimized search engine β€” without needing to be a Bloom-filter expert. 🧡

2/ The problem: k-mer indexes (Γ  la BIGSI, COBS, kmindex...) let you search for a sequence across thousands of samples using Bloom filters. But building an *efficient* one means hand-tuning BF sizes, memory, data distribution & sub-index grouping β€” for every sample, every time.

3/ kmhelpers automates the whole chain: list β†’ profile β†’ compose β†’ plan β†’ apply β†’ query It picks BF sizes and sample-to-sub-index assignments that minimize total index size under a false-positive-rate constraint, estimates disk/RAM upfront, and generates ready-to-run pipelines.

Pierre Peterlongo reposted

minibwa v0.3 released with a few minor bug fixes and two missing bwa-mem features (XA tag for secondary hits and option -H to inject header lines). Also added the "mem" subcommand to mimic "bwa mem" CLI to some extent. github.com/lh3/minibwa/...

github.comRelease Minibwa-0.3 (r391) Β· lh3/minibwaNotable changes: New feature: added the mem subcommand to mimic the bwa-mem command-line interface (CLI). Most input/output options and commonly used options are retained; unsupported or incompat...
View full thread
View full thread

πŸ” Raising your attention to the BLAST-like alignment tab: you can perform proper alignment of the query against assembled contigs or unitigs directly in the browser. It is limited to one sample at a time and may timeout on large inputs. Which is why we built the next tool.

View full thread
View full thread
View full thread

β€”5/8 πŸŽ›οΈ Key options: Using a logan-search session ID (received by email) -s Logan-search session ID Or for any sequence with any accessions list: -q query FASTA -a accessions file General options: -u align against unitigs instead of contigs -l limit number of accessions processed

πŸ“ Output structure: alignments/ β€” BLAST results per sample logan_data/ β€” downloaded contigs or unitigs and recruited sequences failed_accessions.txt β€” samples that couldn’t be downloaded

Pierre Peterlongo reposted

Pierre Peterlongo reposted

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

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

View full thread

🌊 On metagenomic data, other tools such as kmindex are good alternatives. At the same time, Kaminari consistently ranks as one of the fastest tools across all data types, generating the smallest indexes (or the lower FPR). 7/8

View full thread
View full thread

πŸ” Key findings include: - Use of minimizers and integer compression for indexing. - Lower memory footprint and faster query times. - Minimal impact of false positives on result ranking, using the Rank-Biased Overlap (RBO) metric. 2/8