ArticleDevelopments in language theory. Conference on Developments in Language Theory2024
How to Find Long Maximal Exact Matches and Ignore Short Ones.
Article in Developments in language theory. Conference on Developments in Language Theory, 2024. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 8 papers.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
8 citing papers in PubMed.
- Lossless pangenome indexing using tag arrays.Algorithms for molecular biology : AMB · 2026Article
- Lossless Pangenome Indexing Using Tag Arrays.Research square · 2026Article
- Suffixient Arrays: A New Efficient Suffix Array Compression Technique.Theory of computing systems · 2026Article
- KeBaB:International Symposium on String Processing and Information Retrieval : SPIRE ... : proceedings. SPIRE (Symposium) · 2026Article
- Article
- Haplotype Matching with GBWT for Pangenome Graphs.bioRxiv : the preprint server for biology · 2025Article
- Faster run-length compressed suffix arrays.Oasics : openaccess series in informatics · 2025Article
- BWT construction and search at the terabase scale.Bioinformatics (Oxford, England) · 2024Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
1 author.
Funding
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
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.