Computational Biology and ChemistryBioinformaticsPeer-reviewed journal article
conLSH: Context based Locality Sensitive Hashing for Mapping of noisy SMRT Reads
Abstract
Single Molecule Real-Time (SMRT) sequencing is a recent advancement of Next Gen technology developed by Pacific Bio (PacBio). It comes with an explosion of long and noisy reads demanding cutting edge research to get most out of it. To deal with the high error probability of SMRT data, a novel contextual Locality Sensitive Hashing (conLSH) based algorithm is proposed in this article, which can effectively align the noisy SMRT reads to the reference genome. Here, sequences are hashed together based not only on their closeness, but also on similarity of context. The algorithm has [Formula] space requirement, where n is the number of sequences in the corpus and{rho} is a constant. The indexing time and querying time are bounded by [Formula] and [Formula] respectively, where P2 > 0, is a probability value. This algorithm is particularly useful for retrieving similar sequences, a widely used task in biology. The proposed conLSH based aligner is compared with rHAT, popularly used for aligning SMRT reads, and is found to comprehensively beat it in speed as well as in memory requirements. In particular, it takes approximately 24.2% less processing time, while saving about 70.3% in peak memory requirement for H.sapiens PacBio dataset.
- organism: human
- assay: long-read sequencing
- research focus: variant calling
- approach: statistical model
- Citations
- 14
- FWCI
- 1.18
- Field percentile
- top 19%
Reproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- S-conLSH: Alignment-free gapped mapping of noisy long reads
Angana Chakraborty, Burkhard Morgenstern, Sanghamitra Bandyopadhyay·BMC BioinformaticsPeer-reviewed·Feb 11, 2021
- Alignment of Single-Molecule Sequencing Reads by Enhancing the Accuracy and Efficiency of Locality-Sensitive Hashing
Hassan Nikaein, Ali Sharifi‐Zarchi·bioRxiv·May 15, 2022
- A fast approximate algorithm for mapping long reads to large reference databases
Chirag Jain, Alexander Dilthey, … Adam M. Phillippy·Journal of Computational BiologyPeer-reviewed·Apr 30, 2018
- Efficient Seeding for Error-Prone Sequences with SubseqHash2
Xiang Li, Ke Chen, Mingfu Shao·BioinformaticsPeer-reviewed·Jul 23, 2025
- Assembling Large Genomes with Single-Molecule Sequencing and Locality Sensitive Hashing
Konstantin Berlin, Sergey Koren, … Adam M Phillippy·Nature BiotechnologyPeer-reviewed·May 25, 2015
- Locality sensitive hashing for the edit distance
Guillaume Marçais, Dan DeBlasio, … Carl Kingsford·BioinformaticsPeer-reviewed·May 9, 2019