Efficient privacy-preserving variable-length substring match for genome sequence

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...

Full description

Bibliographic Details
Main Authors: Yoshiki Nakagawa, Satsuya Ohata, Kana Shimizu
Format: Article
Language:English
Published: BMC 2022-04-01
Series:Algorithms for Molecular Biology
Subjects:
Private genome sequence search
Secure multiparty computation
Secret sharing
FM-index
Suffix array
LCP array
Online Access:https://doi.org/10.1186/s13015-022-00211-1

Internet

https://doi.org/10.1186/s13015-022-00211-1

Similar Items