Really proud of @ale-campa.bsky.social for his amazing contributions to the Fulgor ⚡ index! I'm very excited for what's next 🙂 CC @robp.bsky.social @zaminiqbal.bsky.social

GitHub - jermp/sshash: 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers. 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers. - jermp/sshash

C++ code is here github.com/jermp/sshash and also available via Bioconda bioconda.github.io/recipes/ssha.... Rust code is here instead github.com/COMBINE-lab/... (thank you again @robp.bsky.social!)

Accepted to ISMB'26. Revised paper is here: jermp.github.io/assets/pdf/p.... I'd like to thank @robp.bsky.social once again and all the received feedback from the reviewers. To me, ISMB has had the highest quality review process over the past few years!

GitHub - COMBINE-lab/sshash-rs: A Rust implementation of SSHash A Rust implementation of SSHash. Contribute to COMBINE-lab/sshash-rs development by creating an account on GitHub.

We have it indeed: github.com/COMBINE-lab/...!

Oh iterator stability! Right. Probably not easy to guarantee with open addressing.

The question is: why on Earth STL implements ordered maps with RB-trees instead of (shallow) BTrees, and unordered maps with hash-chaining instead of open addressing?! 🥲

Those maps are supposed to be dynamic so... difficult to be done with a flat array that works for static data structures.

Thank you Rob! You’re always very kind ☺️

I made this sculpture (clay and acrylic paints) for my mother’s birthday present 🎂 Artistic expression has always been part of my life, besides science.

Wow beautiful!

Wow! What a tool: half million downloads from Bioconda - Congrats @robp.bsky.social and Combine-Lab! 👏 Happy to see SSHash plugged here.

Karel Břinda on research at Harvard and working with bacteria as if they were books Karel Břinda sheds light on how curiosity, mobility, and interdisciplinarity can shape a modern researcher’s path in a world where science increasingly transcends borders.

I was pleased to give an interview to @radiopraguefr.bsky.social about my academic journey across Czechia, France, and the United States, and about my research. english.radio.cz/karel-brinda...

Insane!

The first fully Rust version of piscem! scRNA, scATAC, and bulk-RNA -> RAD files, accurately, in low memory, and FAST. And all in Rust :) anaconda.org/channels/bio...

Wow, impressive feat! Congratulations!

sshash Python bindings for the sshash compressed k-mer dictionary

Another Claude Code win. Did you ever want to be able to use SSHash from Python? To have access to the tiny space and query power of that index from directly within your high-level scripts? Now, with you can (for sshash-rs, at least)! Hope to do the same for piscem-rs soon

pypi.org/project/ssha...

Yes but “anonymously”, please 😂

Haven't checked BlueSky for a few days. Very nice to see people commenting on DSB and its beautiful location! Thanks again to all contributors! It's been our pleasure to welcome you all in Venice 🙂 #DSB2026

Aula Magna "Silvio Trentin"; property of Ca' Foscari University of Venice :)

A truly nice read!

I’d like to thank very much the (anonymous) reviewers for their valuable feedback!

Modern Minimal Perfect Hashing: A Survey | ACM Computing Surveys Given a set S of n keys, a perfect hash function for S maps the keys in S to the first m ≥ n integers without collisions. It may return an arbitrary result for any key not in S and is called minimal i...

Just accepted! dl.acm.org/doi/10.1145/...

I almost feel guilty I did not write the Rust port 😅 Rob and Claude did an amazing job!

QuadRank: Engineering a High Throughput Rank Given a text, a query $\mathsf{rank}(q, c)$ counts the number of occurrences of character $c$ among the first $q$ characters of the text. Space-efficient methods to answer these rank queries form an i...

Now also on arxiv:
arxiv.org/abs/2602.04103

Nice work @npmalfoy.bsky.social! Can't wait for this at DSB :)

Congratulations guys!! 👏

Surprising that they did not cite our work on repetition aware compression :) well, it’s rather new so probably not known enough yet

Really? I did not even know it existed :D

Nice! I'm glad to answer any questions/curiosities you guys might have. And, of course, we are open to collaboration.

Deadline for registration is Jan 31. Don’t miss it! See you all in beautiful Venice 😉