Vikram Shivakumar
vikramshivakumar.bsky.social
Vikram Shivakumar
@vikramshivakumar.bsky.social
PhD Student @ JHU Langmead Lab
Reposted by Vikram Shivakumar
Nicole Brown gave a fantastic talk on Identifying introgressions across pangenomes with Panagram

It uses k-mer conservation to annotate genomic variation across hundreds of genomes, followed by normalization of k-mer profiles to identify introgression events
github.com/kjenike/pana... #GI2025
November 6, 2025 at 2:52 AM
Reposted by Vikram Shivakumar
Fantastic talk by @vikramshivakumar.bsky.social Mumemto—Scalable multi-MUM finding for pangenomes
Papers biorxiv.org/content/10.1101/2025.05.20.654611 & doi.org/10.1186/s13059-025-03644-0
Code: github.com/vikshiv/mume...
Very efficient pangenome visualization tool, revealing synteny and variations!
November 6, 2025 at 1:13 AM
Now this, undergrads, is how you cold email a professor.
November 3, 2025 at 8:32 PM
Reposted by Vikram Shivakumar
If that’s not enough, we threw in a complete, T2T giraffe genome! Giraffe genomes are pretty cool. Almost all of their chromosomes are Robertsonian fusions of the typically telocentric ruminant chromosomes. 🐄 vs. 🦒...
October 10, 2025 at 3:26 PM
10/10 tool name 👌
August 22, 2025 at 1:43 PM
Not saying I agree either way, but one pro for text-based file formats are less dependencies needed for viewing files
August 6, 2025 at 10:42 PM
This is so amazing, thank you!
July 31, 2025 at 1:00 PM
And of course, the poster itself:
July 21, 2025 at 5:00 PM
We've released a new version (v1.3) of Mumemto (github.com/vikshiv/mume...) that implements merging. Running Mumemto in merge-mode makes the output set of multi-MUMs dynamic, so adding new assemblies is as easy as computing a new set of MUMs and merging them in.
GitHub - vikshiv/mumemto: Mumemto: multi-MUM and MEM finding across pangenomes
Mumemto: multi-MUM and MEM finding across pangenomes - vikshiv/mumemto
github.com
May 27, 2025 at 7:35 PM
We can also merge along the shape of a phylogenetic tree, finding clade-specific variation and conserved elements. Previously, adding new assemblies can lose MUMs, which must be present across the whole collection. Now we can find MUMs that reveal local variation distinct to specific subgroups. 3/n
May 27, 2025 at 7:35 PM
We implement two partition/merge algorithms that can merge multi-MUMs between datasets. This makes Mumemto highly parallelizable, but also very memory efficient if partitions are computed in serial. 2/n
May 27, 2025 at 7:35 PM