Allowing mutations in maximal matches boosts genome compression performance.
- Publisher:
- Oxford University Press
- Publication Type:
- Journal Article
- Citation:
- Bioinformatics, 2020, 36, (18), pp. 4675-4681
- Issue Date:
- 2020-09-15
Open Access
Copyright Clearance Process
- Recently Added
- In Progress
- Open Access
This item is open access.
Motivation
A maximal match between two genomes is a contiguous non-extendable sub-sequence common in the two genomes. DNA bases mutate very often from the genome of one individual to another. When a mutation occurs in a maximal match, it breaks the maximal match into shorter match segments. The coding cost using these broken segments for reference-based genome compression is much higher than that of using the maximal match which is allowed to contain mutations.
Results
We present memRGC, a novel reference-based genome compression algorithm that leverages mutation-containing matches (MCMs) for genome encoding. MemRGC detects maximal matches between two genomes using a coprime double-window k-mer sampling search scheme, the method then extends these matches to cover mismatches (mutations) and their neighbouring maximal matches to form long and MCMs. Experiments reveal that memRGC boosts the compression performance by an average of 27% in reference-based genome compression. MemRGC is also better than the best state-of-the-art methods on all of the benchmark datasets, sometimes better by 50%. Moreover, memRGC uses much less memory and de-compression resources, while providing comparable compression speed. These advantages are of significant benefits to genome data storage and transmission.
Please use this identifier to cite or link to this item: