30 citations · 30 across the 2 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2019
Data structures to represent a set of k-long DNA sequences
Rayan Chikhi, Jan Holub, Paul Medvedev
The analysis of biological sequencing data has been one of the biggest applications of string algorithms. The approaches used in many such applications are based on the analysis of…
cs.DS2017
Modeling Biological Problems in Computer Science: A Case Study in Genome Assembly
Paul Medvedev
As computer scientists working in bioinformatics/computational biology, we often face the challenge of coming up with an algorithm to answer a biological question. This occurs in m…
cs.DS2016
TwoPaCo: An efficient algorithm to build the compacted de Bruijn graph from many complete genomes
Ilia Minkin, Son Pham, Paul Medvedev
Motivation: De Bruijn graphs have been proposed as a data structure to facilitate the analysis of related whole genome sequences, in both a population and comparative genomic setti…