English

copMEM: Finding maximal exact matches via sampling both genomes

Data Structures and Algorithms 2018-05-24 v1 Genomics

Abstract

Genome-to-genome comparisons require designating anchor points, which are given by Maximum Exact Matches (MEMs) between their sequences. For large genomes this is a challenging problem and the performance of existing solutions, even in parallel regimes, is not quite satisfactory. We present a new algorithm, copMEM, that allows to sparsely sample both input genomes, with sampling steps being coprime. Despite being a single-threaded implementation, copMEM computes all MEMs of minimum length 100 between the human and mouse genomes in less than 2 minutes, using less than 10 GB of RAM memory.

Keywords

Cite

@article{arxiv.1805.08816,
  title  = {copMEM: Finding maximal exact matches via sampling both genomes},
  author = {Szymon Grabowski and Wojciech Bieniecki},
  journal= {arXiv preprint arXiv:1805.08816},
  year   = {2018}
}

Comments

The source code of copMEM is freely available at https://github.com/wbieniec/copmem. Contact: wbieniec@kis.p.lodz.pl, wbieniec@kis.p.lodz.pl

R2 v1 2026-06-23T02:04:50.223Z