Your browser doesn't support javascript.
loading
Learning locality-sensitive bucketing functions.
Yuan, Xin; Chen, Ke; Li, Xiang; Shi, Qian; Shao, Mingfu.
Affiliation
  • Yuan X; Department of Computer Science and Engineering, The Pennsylvania State University, University Park, PA16802, United States.
  • Chen K; Department of Computer Science and Engineering, The Pennsylvania State University, University Park, PA16802, United States.
  • Li X; Department of Computer Science and Engineering, The Pennsylvania State University, University Park, PA16802, United States.
  • Shi Q; Department of Computer Science and Engineering, The Pennsylvania State University, University Park, PA16802, United States.
  • Shao M; Department of Computer Science and Engineering, The Pennsylvania State University, University Park, PA16802, United States.
Bioinformatics ; 40(Suppl 1): i318-i327, 2024 06 28.
Article in En | MEDLINE | ID: mdl-38940133
ABSTRACT
MOTIVATION Many 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.

RESULTS:

In 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.
Subject(s)

Full text: 1 Collection: 01-internacional Database: MEDLINE Main subject: Algorithms Language: En Journal: Bioinformatics / Bioinformatics (Oxford. Online) Journal subject: INFORMATICA MEDICA Year: 2024 Type: Article Affiliation country: United States

Full text: 1 Collection: 01-internacional Database: MEDLINE Main subject: Algorithms Language: En Journal: Bioinformatics / Bioinformatics (Oxford. Online) Journal subject: INFORMATICA MEDICA Year: 2024 Type: Article Affiliation country: United States