RCSI: Scalable similarity search in thousand (s) of genomes

S Wandelt, J Starlinger, M Bux, U Leser - Proceedings of the VLDB …, 2013 - dl.acm.org
Until recently, genomics has concentrated on comparing sequences between species.
However, due to the sharply falling cost of sequencing technology, studies of populations of …

A generalized framework for preserving both privacy and utility in data outsourcing

S **e, M Mohammady, H Wang, L Wang… - IEEE transactions on …, 2021 - ieeexplore.ieee.org
Property preserving encryption techniques have significantly advanced the utility of
encrypted data in various data outsourcing settings (eg, the cloud). However, while …

Efficient similarity search in very large string sets

D Fenz, D Lange, A Rheinländer, F Naumann… - Scientific and Statistical …, 2012 - Springer
String similarity search is required by many real-life applications, such as spell checking,
data cleansing, fuzzy keyword search, or comparison of DNA sequences. Given a very large …

Efficient and privacy-preserving similar patients query scheme over outsourced genomic data

D Zhu, H Zhu, X Wang, R Lu… - IEEE Transactions on …, 2021 - ieeexplore.ieee.org
Over the past decade, genomic data has grown exponentially and is widely used in
promising medical and health-related applications, which opens up new opportunities for …

Secure sequence similarity search on encrypted genomic data

MSR Mahdi, MZ Hasan… - 2017 IEEE/ACM …, 2017 - ieeexplore.ieee.org
Genomic data is being produced rapidly by both individuals and enterprises and needs to
be outsourced from local machines to a cloud for better flexibility. Outsourcing also …

Scaling similarity joins over tree-structured data

Y Tang, Y Cai, N Mamoulis - Proceedings of the VLDB Endowment, 2015 - dl.acm.org
Given a large collection of tree-structured objects (eg, XML documents), the similarity join
finds the pairs of objects that are similar to each other, based on a similarity threshold and a …

Optimizing similarity search in the m-tree

S Guhlemann, U Petersohn, K Meyer-Wegener - 2017 - dl.gi.de
A topic of growing interest in a wide range of domains is the similarity of data entries. Data
sets of genome sequences, text corpora, complex production information, and multimedia …

Reducing the distance calculations when searching an M‑Tree

S Guhlemann, U Petersohn, K Meyer-Wegener - Datenbank-Spektrum, 2017 - Springer
Recent years have brought rising interest in efficiently searching for similar entities in a
broad range of domains. Such search can be used to facilitate working with unstructured …

An efficient enhanced prefix hash tree model for optimizing the storage and image deduplication in cloud

G Sujatha, R Jeberson Retnaraj - … and Computation: Practice …, 2022 - Wiley Online Library
The popularity of the cloud storage space mainly attracted organizations to store their data in
them. Therefore, the avoidance of duplicate data contents is unavoidable and several users …

Privacy-Preserving Similar Patient Query over Genomic Data

D Zhu, D Feng, X Shen - Privacy-Preserving Techniques with e-Healthcare …, 2024 - Springer
This chapter introduces an efficient and privacy-preserving similar patient query (SPQ)
scheme over genomic data. Given a genome collected from a new patient, the scheme can …