Related Experiment Video
Updated: Jun 15, 2025

Creating and Applying a Reference to Facilitate the Discussion and Classification of Proteins in a Diverse Group
Published on: August 16, 2017
How to Find Long Maximal Exact Matches and Ignore Short Ones
1Faculty of Computer Science, Dalhousie University, Halifax, Canada.
Abstract:
Finding maximal exact matches (MEMs) between strings is an important task in bioinformatics, but it is becoming increasingly challenging as geneticists switch to pangenomic references. Fortunately, we are usually interested only in the relatively few MEMs that are longer than we would expect by chance. In this paper we show that under reasonable assumptions we can find all MEMs of length at least between a pattern of length and a text of length in time plus extra time only for each MEM of length at least nearly using a compact index for the text, suitable for pangenomics.
Related Concept Videos
Multi-species Conserved Sequences
Although the genome of each species varies greatly from each other, a few sequences are highly conserved. Such conserved...
Maxam-Gilbert Sequencing
Challenges of the Maxam-Gilbert Method
The...
Long-patch Base Excision Repair
Multiple Comparison Tests
It would be easy to compare two samples using a significance alpha level of 0.05. In other words, there is only one sample pair to be compared. However, it would be difficult to identify a significantly different sample if the number...
RACE - Rapid Amplification of cDNA Ends
Mismatch Repair
The Mutator Protein Family Plays a Key Role in DNA Mismatch Repair
The human genome has more than 3 billion base pairs of DNA per cell. Prior to cell division, that vast amount of genetic...

