#54 Seeding methods for read alignment with Markus Schmidt

the bioinformatics chat

Kandungan disediakan oleh Roman Cheplyaka. Semua kandungan podcast termasuk episod, grafik dan perihalan podcast dimuat naik dan disediakan terus oleh Roman Cheplyaka atau rakan kongsi platform podcast mereka. Jika anda percaya seseorang menggunakan karya berhak cipta anda tanpa kebenaran anda, anda boleh mengikuti proses yang digariskan di sini https://ms.player.fm/legal.

4y ago 1:00:46

MP3•Laman utama episod

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.

Links:

A performant bridge between fixed-size and variable-size seeding (Arne Kutzner, Pok-Son Kim, Markus Schmidt)
MA the Modular Aligner
Calibrating Seed-Based Heuristics to Map Short Reads With Sesame (Guillaume J. Filion, Ruggero Cortini, Eduard Zorita) — another interesting recent work on seeding methods (though we didn’t get to discuss it in this episode)

If you enjoyed this episode, please consider supporting the podcast on Patreon.

70 episod

#Bioinformatics #Genetics #Algorithms #Ngs #Roman Cheplyaka #Biology #Science #Natural Sciences #Sequence #Genomics