Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Filters

Paul Medvedev

Showing results (11-20 of 82) with videos related to

Pageof 9
Sort By:
Algorithms for Molecular Biology : AMB|May 4, 2024
ESKEMAP: exact sketch-based read mappingTizian Schulz, Paul Medvedev
Lipics : Leibniz International Proceedings in Informatics|April 29, 2025
PLA-index: A <i>k</i>-mer Index Exploiting Rank Curve LinearityHasin Abrar, Paul Medvedev
Journal of Computational Biology : a Journal of Computational Molecular Cell Biology|March 18, 2020
De Novo Clustering of Long-Read Transcriptome Data Using a Greedy, Quality Value-Based AlgorithmKristoffer Sahlin, Paul Medvedev
Nature Communications|December 11, 2020
Scalable multiple whole-genome alignment and locally collinear block construction with SibeliaZIlia Minkin, Paul Medvedev
Iscience|June 21, 2020
Scalable Pairwise Whole-Genome Homology Mapping of Long Genomes with BubbZIlia Minkin, Paul Medvedev
Bioinformatics (Oxford, England)|July 23, 2018
Toward fast and accurate SNP genotyping from whole genome sequencing data for bedside diagnosticsChen Sun, Paul Medvedev
Bioinformatics (Oxford, England)|June 5, 2013
Informed and automated k-mer size selection for genome assemblyRayan Chikhi, Paul Medvedev
Nature Communications|January 5, 2021
Error correction enables use of Oxford Nanopore technology for reference-free transcriptome analysisKristoffer Sahlin, Paul Medvedev
Nature Communications|February 9, 2021
Author Correction: Error correction enables use of Oxford Nanopore technology for reference-free transcriptome analysisKristoffer Sahlin, Paul Medvedev
Bioinformatics (Oxford, England)|July 7, 2026
The gift of novelty: repeat-robust k-mer-based estimators of mutation ratesHaonan Wu, Paul Medvedev
Pageof 9

Showing results (11-20 of 82) with videos related to

Sort By:
Pageof 9
Algorithms for Molecular Biology : AMB|May 4, 2024
ESKEMAP: exact sketch-based read mappingTizian Schulz, Paul Medvedev
Lipics : Leibniz International Proceedings in Informatics|April 29, 2025
PLA-index: A <i>k</i>-mer Index Exploiting Rank Curve LinearityHasin Abrar, Paul Medvedev
Journal of Computational Biology : a Journal of Computational Molecular Cell Biology|March 18, 2020
De Novo Clustering of Long-Read Transcriptome Data Using a Greedy, Quality Value-Based AlgorithmKristoffer Sahlin, Paul Medvedev
Nature Communications|December 11, 2020
Scalable multiple whole-genome alignment and locally collinear block construction with SibeliaZIlia Minkin, Paul Medvedev
Iscience|June 21, 2020
Scalable Pairwise Whole-Genome Homology Mapping of Long Genomes with BubbZIlia Minkin, Paul Medvedev
Bioinformatics (Oxford, England)|July 23, 2018
Toward fast and accurate SNP genotyping from whole genome sequencing data for bedside diagnosticsChen Sun, Paul Medvedev
Bioinformatics (Oxford, England)|June 5, 2013
Informed and automated k-mer size selection for genome assemblyRayan Chikhi, Paul Medvedev
Nature Communications|January 5, 2021
Error correction enables use of Oxford Nanopore technology for reference-free transcriptome analysisKristoffer Sahlin, Paul Medvedev
Nature Communications|February 9, 2021
Author Correction: Error correction enables use of Oxford Nanopore technology for reference-free transcriptome analysisKristoffer Sahlin, Paul Medvedev
Bioinformatics (Oxford, England)|July 7, 2026
The gift of novelty: repeat-robust k-mer-based estimators of mutation ratesHaonan Wu, Paul Medvedev
Pageof 9