Showing results (21-30 of 100) with videos related to
Sort By:
Pageof 10
Journal of Computational Biology : a Journal of Computational Molecular Cell Biology|March 10, 2016
Gap Filling as Exact Path Length ProblemLeena Salmela, Kristoffer Sahlin, Veli Mäkinen, et al.BMC Bioinformatics|August 17, 2014
BESST--efficient scaffolding of large fragmented assembliesKristoffer Sahlin, Francesco Vezzi, Björn Nystedt, et al.Briefings in Bioinformatics|February 3, 2018
Modeling biological problems in computer science: a case study in genome assemblyPaul MedvedevPlos Computational Biology|April 3, 2020
Ten Simple Rules for writing algorithmic bioinformatics conference papersPaul MedvedevPlos One|July 24, 2025
cONcat: Computational reconstruction of concatenated fragments from long Oxford Nanopore readsAlexander J Petri, Mai Thi-Huyen Nguyen, Anjali Rajwar, et al.Plos Computational Biology|May 20, 2021
What do Eulerian and Hamiltonian cycles have to do with genome assembly?Paul Medvedev, Mihai PopBiorxiv : the Preprint Server for Biology|April 10, 2026
The gift of novelty: repeat-robust k -mer-based estimators of mutation ratesHaonan Wu, Paul MedvedevLipics : Leibniz International Proceedings in Informatics|June 4, 2024
Exact Sketch-Based Read MappingTizian Schulz, Paul MedvedevJournal of Computational Biology : a Journal of Computational Molecular Cell Biology|August 4, 2009
Maximum likelihood genome assemblyPaul Medvedev, Michael BrudnoBioinformatics (Oxford, England)|December 25, 2016
VarMatch: robust matching of small variant datasets using flexible scoring schemesChen Sun, Paul MedvedevPageof 10