Efficient privacy-preserving variable-length substring match for genome sequence
Abstract The development of a privacy-preserving technology is important for accelerating genome data sharing. This study proposes an algorithm that securely searches a variable-length substring match between a query and a database sequence. Our concept hinges on a technique that efficiently applies...
Main Authors: | Yoshiki Nakagawa, Satsuya Ohata, Kana Shimizu |
---|---|
Format: | Article |
Language: | English |
Published: |
BMC
2022-04-01
|
Series: | Algorithms for Molecular Biology |
Subjects: | |
Online Access: | https://doi.org/10.1186/s13015-022-00211-1 |
Similar Items
-
Reference-based genome compression using the longest matched substrings with parallelization consideration
by: Zhiwen Lu, et al.
Published: (2023-09-01) -
Computing Maximal Lyndon Substrings of a String
by: Frantisek Franek, et al.
Published: (2020-11-01) -
Privacy-preserving recommendation system based on social relationships
by: Simin Yu, et al.
Published: (2024-02-01) -
Assessment of Two Privacy Preserving Authentication Methods Using Secure Multiparty Computation Based on Secret Sharing
by: Diana-Elena Fălămaş, et al.
Published: (2021-05-01) -
SNPs detection by eBWT positional clustering
by: Nicola Prezza, et al.
Published: (2019-02-01)