با برنامه Player FM !
#42 Spectrum-preserving string sets and simplitigs with Amatur Rahman and Karel Břinda
Manage episode 254805114 series 1537951
In this episode, we hear from Amatur Rahman and Karel Břinda, who independently of one another released preprints on the same concept, called simplitigs or spectrum-preserving string sets. Simplitigs offer a way to efficiently store and query large sets of k-mers—or, equivalently, large de Bruijn graphs.
Links:
- Simplitigs as an efficient and scalable representation of de Bruijn graphs (Karel Břinda, Michael Baym, Gregory Kucherov)
- Representation of k-mer sets using spectrum-preserving string sets (Amatur Rahman, Paul Medvedev)
- Open mic
If you enjoyed this episode, please consider supporting the podcast on Patreon.
70 قسمت
Manage episode 254805114 series 1537951
In this episode, we hear from Amatur Rahman and Karel Břinda, who independently of one another released preprints on the same concept, called simplitigs or spectrum-preserving string sets. Simplitigs offer a way to efficiently store and query large sets of k-mers—or, equivalently, large de Bruijn graphs.
Links:
- Simplitigs as an efficient and scalable representation of de Bruijn graphs (Karel Břinda, Michael Baym, Gregory Kucherov)
- Representation of k-mer sets using spectrum-preserving string sets (Amatur Rahman, Paul Medvedev)
- Open mic
If you enjoyed this episode, please consider supporting the podcast on Patreon.
70 قسمت
Tất cả các tập
×به Player FM خوش آمدید!
Player FM در سراسر وب را برای یافتن پادکست های با کیفیت اسکن می کند تا همین الان لذت ببرید. این بهترین برنامه ی پادکست است که در اندروید، آیفون و وب کار می کند. ثبت نام کنید تا اشتراک های شما در بین دستگاه های مختلف همگام سازی شود.