How to Find Long Maximal Exact Matches and Ignore Short Ones
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 $L$ between a pattern of length $m$ and a text of length $n$ in $O (m)$ time plus extra $O (\log n)$ time only for each MEM of length at least nearly $L$ using a compact index for the text, suitable for pangenomics.
- Gao, Y.: Computing matching statistics on repetitive texts. In: Data Compression Conference (DCC). pp. 73–82 (2022)
- Navarro, G.: Compact data structures: A practical approach. Cambridge University Press (2016)
- Navarro, G.: Computing MEMs on repetitive text collections. In: 34th Symposium on Combinatorial Pattern Matching (CPM) (2023)
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.