ArticleAlgorithms in bioinformatics : ... International Workshop, WABI ..., proceedings. WABI (Workshop)2025
An Efficient Data Structure and Algorithm for Long-Match Query in Run-Length Compressed BWT.
Article in Algorithms in bioinformatics : ... International Workshop, WABI ..., proceedings. WABI (Workshop), 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 3 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
3 citing papers in PubMed.
- RLBWT-based LCP computation in compressed space for terabase-scale pangenome analysis.Bioinformatics (Oxford, England) · 2026Article
- RLBWT-Based LCP Computation in Compressed Space for Terabase-Scale Pangenome Analysis.bioRxiv : the preprint server for biology · 2026Article
- An Efficient Data Structure and Algorithm for Long-Match Query in Run-Length Compressed BWT.Algorithms in bioinformatics : ... International Workshop, WABI ..., proceedings. WABI (Workshop) · 2025Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
3 authors.
Funding
Abstract
String matching problems in bioinformatics are typically for finding exact substring matches between a query and a reference text. Previous formulations often focus on maximum exact matches (MEMs). However, multiple occurrences of substrings of the query in the text that are long enough but not maximal may not be captured by MEMs. Such long matches can be informative, especially when the text is a collection of similar sequences such as genomes. In this paper, we describe a new type of match between a pattern and a text that aren't necessarily maximal in the query, but still contain useful matching information: locally maximal exact matches (LEMs). There are usually a large amount of LEMs, so we only consider those above some length threshold
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.