14 citations · 15 across the 2 of their papers we have counts for
3 papers
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…
q-bio.QM2013★ 14 cited
Sibelia: A scalable and comprehensive synteny block generation tool for closely related microbial genomes
Ilya Minkin, Anand Patel, Mikhail Kolmogorov +2
Comparing strains within the same microbial species has proven effective in the identification of genes and genomic regions responsible for virulence, as well as in the diagnosis a…
q-bio.QM2013★ 1 cited
Cerulean: A hybrid assembly using high throughput short and long reads
Viraj Deshpande, Eric DK Fung, Son Pham +1
Genome assembly using high throughput data with short reads, arguably, remains an unresolvable task in repetitive genomes, since when the length of a repeat exceeds the read length…