Open Access Helper

OpenAlex Citation Counts

OpenAlex Citations Logo

OpenAlex is a bibliographic catalogue of scientific papers, authors and institutions accessible in open access mode, named after the Library of Alexandria. It's citation coverage is excellent and I hope you will find utility in this listing of citing articles!

If you click the article title, you'll navigate to the article, as listed in CrossRef. If you click the Open Access links, you'll navigate to the "best Open Access location". Clicking the citation count will open this listing for that article. Lastly at the bottom of the page, you'll find basic pagination options.

Requested Article:

Locality-sensitive hashing for the edit distance
Guillaume Marçais, Dan DeBlasio, Prashant Pandey, et al.
Bioinformatics (2019) Vol. 35, Iss. 14, pp. i127-i135
Open Access | Times Cited: 61

Showing 1-25 of 61 citing articles:

Visualization of very large high-dimensional data sets as minimum spanning trees
Daniel Probst, Jean‐Louis Reymond
Journal of Cheminformatics (2020) Vol. 12, Iss. 1
Open Access | Times Cited: 244
Minimizer-space de Bruijn graphs: Whole-genome assembly of long reads in minutes on a personal computer
Barış Ekim, Bonnie Berger, Rayan Chikhi
Cell Systems (2021) Vol. 12, Iss. 10, pp. 958-968.e6
Open Access | Times Cited: 85
A survey of mapping algorithms in the long-reads era
Kristoffer Sahlin, Thomas Baudeau, Bastien Cazaux, et al.
Genome biology (2023) Vol. 24, Iss. 1
Open Access | Times Cited: 37
Hamming Distance Tolerant Content-Addressable Memory (HD-CAM) for DNA Classification
Esteban Garzón, Roman Golman, Zuher Jahshan, et al.
IEEE Access (2022) Vol. 10, pp. 28080-28093
Open Access | Times Cited: 26
Genomic sketching with multiplicities and locality-sensitive hashing using Dashing 2
Daniel Baker, Ben Langmead
Genome Research (2023), pp. gr.277655.123-gr.277655.123
Open Access | Times Cited: 15
When the levee breaks: a practical guide to sketching algorithms for processing the flood of genomic data
Will Rowe
Genome biology (2019) Vol. 20, Iss. 1
Open Access | Times Cited: 39
EDAM
Robert Hanhan, Esteban Garzón, Zuher Jahshan, et al.
(2022)
Closed Access | Times Cited: 20
To Petabytes and beyond: recent advances in probabilistic and signal processing algorithms and their application to metagenomics
R. A. Leo Elworth, Qi Wang, Pavan K. Kota, et al.
Nucleic Acids Research (2020) Vol. 48, Iss. 10, pp. 5217-5234
Open Access | Times Cited: 28
The minimizer Jaccard estimator is biased and inconsistent
Mahdi Belbasi, Antonio Blanca, Robert S. Harris, et al.
Bioinformatics (2022) Vol. 38, Iss. Supplement_1, pp. i169-i176
Open Access | Times Cited: 17
Sequence similarity estimation by random subsequence sketching
Ke Chen, Vinamratha Pattar, Mingfu Shao
bioRxiv (Cold Spring Harbor Laboratory) (2025)
Open Access
GSearch: ultra-fast and scalable genome search by combining K-mer hashing with hierarchical navigable small world graphs
Jianshu Zhao, Jean Pierre Both, Luis M. Rodriguez‐R, et al.
Nucleic Acids Research (2024) Vol. 52, Iss. 16, pp. e74-e74
Open Access | Times Cited: 3
ProbMinHash – A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity
Otmar Ertl
IEEE Transactions on Knowledge and Data Engineering (2020), pp. 1-1
Open Access | Times Cited: 21
CONSULT: accurate contamination removal using locality-sensitive hashing
Eleonora Rachtman, Vineet Bafna, Siavash Mirarab
NAR Genomics and Bioinformatics (2021) Vol. 3, Iss. 3
Open Access | Times Cited: 19
Spectral Jaccard Similarity: A New Approach to Estimating Pairwise Sequence Alignments
Tavor Z. Baharav, Govinda M. Kamath, David Tse, et al.
Patterns (2020) Vol. 1, Iss. 6, pp. 100081-100081
Open Access | Times Cited: 19
Approximate Content-Addressable Memories: A Review
Esteban Garzón, Leonid Yavits, Adam Teman, et al.
Chips (2023) Vol. 2, Iss. 2, pp. 70-82
Open Access | Times Cited: 7
Drug-target interactions prediction based on network topology feature representation embedded deep forest
Majun Lian, Xinjie Wang, Wenli Du
Neurocomputing (2023) Vol. 551, pp. 126509-126509
Closed Access | Times Cited: 7
CMash: fast, multi-resolution estimation of k-mer-based Jaccard and containment indices
Shaopeng Liu, David Koslicki
Bioinformatics (2022) Vol. 38, Iss. Supplement_1, pp. i28-i35
Open Access | Times Cited: 11
Aligning distant sequences to graphs using long seed sketches
Amir Joudaki, Alexandru Meterez, Harun Mustafa, et al.
Genome Research (2023)
Open Access | Times Cited: 6
Similarity query processing for high-dimensional data
Jianbin Qin, Wei Wang, Chuan Xiao, et al.
Proceedings of the VLDB Endowment (2020) Vol. 13, Iss. 12, pp. 3437-3440
Open Access | Times Cited: 13
Seeding with minimized subsequence
Xiang Li, Qian Shi, Ke Chen, et al.
Bioinformatics (2023) Vol. 39, Iss. Supplement_1, pp. i232-i241
Open Access | Times Cited: 5
DIPER: Detection and Identification of Pathogens using Edit distance-tolerant Resistive CAM
Itay Merlin, Esteban Garzón, Alexander Fish, et al.
IEEE Transactions on Computers (2023) Vol. 73, Iss. 10, pp. 2463-2473
Open Access | Times Cited: 5
DASH-CAM: Dynamic Approximate SearcH Content Addressable Memory for genome classification
Zuher Jahshan, Itay Merlin, Esteban Garzón, et al.
(2023)
Open Access | Times Cited: 5
Dashing 2: genomic sketching with multiplicities and locality-sensitive hashing
Daniel Baker, Ben Langmead
bioRxiv (Cold Spring Harbor Laboratory) (2022)
Open Access | Times Cited: 7
Integrated multi-similarity fusion and heterogeneous graph inference for drug-target interaction prediction
Majun Lian, Xinjie Wang, Wenli Du
Neurocomputing (2022) Vol. 500, pp. 1-12
Closed Access | Times Cited: 6
Alignment-free Phylogenetic Placement and its Applications
Matthias Blanke
(2023)
Open Access | Times Cited: 3
Page 1 - Next Page

Scroll to top