Showing results (1-10 of 159) with videos related to
Sort By:
Pageof 16
ACM Computing Surveys|March 9, 2026
Data Structures to Represent a Set of <math><mi>k</mi></math> -long DNA SequencesRayan Chikhi, Jan Holub, Paul MedvedevBioinformatics (Oxford, England)|June 5, 2013
Informed and automated k-mer size selection for genome assemblyRayan Chikhi, Paul MedvedevIscience|November 7, 2022
Mapping-friendly sequence reductions: Going beyond homopolymer compressionLuc Blassel, Paul Medvedev, Rayan ChikhiAlgorithms for Molecular Biology : AMB|June 22, 2021
Disk compression of k-mer setsAmatur Rahman, Rayan Chikhi, Paul MedvedevBioinformatics (Oxford, England)|June 17, 2016
Compacting de Bruijn graphs from sequencing data quickly and in low memoryRayan Chikhi, Antoine Limasset, Paul MedvedevBioinformatics Advances|January 26, 2023
kmtricks: efficient and flexible construction of Bloom filters for large sequencing data collectionsTéo Lemane, Paul Medvedev, Rayan Chikhi, et al.Journal of Computational Biology : a Journal of Computational Molecular Cell Biology|April 6, 2018
AllSome Sequence Bloom TreesChen Sun, Robert S Harris, Rayan Chikhi, et al.Genome Research|July 3, 2023
Efficient mapping of accurate long reads in minimizer space with mapquikBariş Ekim, Kristoffer Sahlin, Paul Medvedev, et al.Journal of Computational Biology : a Journal of Computational Molecular Cell Biology|January 29, 2015
On the representation of de Bruijn graphsRayan Chikhi, Antoine Limasset, Shaun Jackman, et al.Genome Research|December 17, 2020
Data structures based on <i>k</i>-mers for querying large collections of sequencing data setsCamille Marchet, Christina Boucher, Simon J Puglisi, et al.Pageof 16