bioinformatics chat

Seeding methods for read alignment with Markus Schmidt (#54)

December 16, 2020

In this episode, Markus Schmidt explains how seeding in read alignment works. We define and compare k-mers, minimizers, MEMs, SMEMs, and maximal spanning seeds. Markus also presents his recent work on computing variable-sized seeds (MEMs, SMEMs, and maximal spanning seeds) from fixed-sized seeds (k-mers and minimizers) and his Modular Aligner.


Don't miss the next episode! Subscribe on Apple Podcasts, Google Podcasts, Spotify, or via the RSS feed link. You can also follow the podcast on Twitter and Mastodon.

Music: Eric Skiff — Come and Find Me (modified, licensed under CC BY 4.0).