https://www.selleckchem.com/pr....oducts/ldn193189.htm
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. We present memRGC, a novel reference-based genome compression algorithm that leverage
Like
Comment
Share
