Evidence map›Paper›PMID 38940133›Full record

ArticleBioinformatics (Oxford, England)2024

Learning locality-sensitive bucketing functions.

Xin Yuan, Ke Chen, Xiang Li, Qian Shi, Mingfu Shao

Abstract read
In one paragraph

Article in Bioinformatics (Oxford, England), 2024. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 2 papers.

0numbers the graph read from it
0cells of the map it votes in
2citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

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.

2 · The registry

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.

3 · Its place in the literature

Who cites it

2 citing papers in PubMed.

  1. bronko: ultrafast, alignment-free detection of viral genome variation.bioRxiv : the preprint server for biology · 2026
    Article
  2. MELO-ED: learning locality-sensitive multi-embeddings for edit distance.bioRxiv : the preprint server for biology · 2025
    Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

5 authors.

Xin YuanDepartment of Computer Science and Engineering, The Pennsylvania State University, University Park, PA16802, United States.
Ke ChenDepartment of Computer Science and Engineering, The Pennsylvania State University, University Park, PA16802, United States.ORCID 0000-0001-5470-6621
Xiang LiDepartment of Computer Science and Engineering, The Pennsylvania State University, University Park, PA16802, United States.
Qian ShiDepartment of Computer Science and Engineering, The Pennsylvania State University, University Park, PA16802, United States.
Mingfu ShaoDepartment of Computer Science and Engineering, The Pennsylvania State University, University Park, PA16802, United States.

Funding

Computational Methods for Assembling Multiple RNA-seq SamplesR01HG011065 · NHGRI · PENNSYLVANIA STATE UNIVERSITY, THE · PI SHAO, MINGFU · 2021 to 2025
$1.8M
Evolution-guided machine learning for inferring natural selectionR35GM142560 · NIGMS · PENNSYLVANIA STATE UNIVERSITY, THE · PI HUANG, YIFEI · 2021 to 2023
$746k
National Science Foundation DBI-2019797NHGRI NIH HHS R01 HG011065NIGMS NIH HHS R35 GM142560NIH HHS R01HG011065
6 · The paper itself

Abstract

motivationMany tasks in sequence analysis ask to identify biologically related sequences in a large set. The edit distance, being a sensible model for both evolution and sequencing error, is widely used in these tasks as a measure. The resulting computational problem-to recognize all pairs of sequences within a small edit distance-turns out to be exceedingly difficult, since the edit distance is known to be notoriously expensive to compute and that all-versus-all comparison is simply not acceptable with millions or billions of sequences. Among many attempts, we recently proposed the locality-sensitive bucketing (LSB) functions to meet this challenge. Formally, a (d1,d2)-LSB function sends sequences into multiple buckets with the guarantee that pairs of sequences of edit distance at most d1 can be found within a same bucket while those of edit distance at least d2 do not share any. LSB functions generalize the locality-sensitive hashing (LSH) functions and admit favorable properties, with a notable highlight being that optimal LSB functions for certain (d1,d2) exist. LSB functions hold the potential of solving above problems optimally, but the existence of LSB functions for more general (d1,d2) remains unclear, let alone constructing them for practical use.

resultsIn this work, we aim to utilize machine learning techniques to train LSB functions. With the development of a novel loss function and insights in the neural network structures that can potentially extend beyond this specific task, we obtained LSB functions that exhibit nearly perfect accuracy for certain (d1,d2), matching our theoretical results, and high accuracy for many others. Comparing to the state-of-the-art LSH method Order Min Hash, the trained LSB functions achieve a 2- to 5-fold improvement on the sensitivity of recognizing similar sequences. An experiment on analyzing erroneous cell barcode data is also included to demonstrate the application of the trained LSB functions. AVAILABILITY AND IMPLEMENTATION: The code for the training process and the structure of trained models are freely available at https://github.com/Shao-Group/lsb-learn.

Indexed as

AlgorithmsComputational BiologyMachine Learning

Identifiers

PMID38940133
PMCPMC11211848

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

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.