EUVIMEDEUVIMED entdecken
Open Access

Secure discovery of genetic relatives across large-scale and distributed genomic data sets

Matthew M Hong iD, David Froelicher, Ricky Magner, Victoria Popic, Bonnie Berger, Hyunghoon Cho iD

Genome Research · 2024

DOI: 10.1101/gr.279057.124 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Genome Research, 2024. Verfasst von Matthew M Hong und 5 weiteren Autor:innen. Beteiligte Einrichtung: Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139, USA. Hauptthemen laut MEDLINE: Algorithms, Genomics. Die Arbeit wurde bisher 5-mal zitiert (Crossref) und nennt 44 Literaturangaben. Der Volltext ist frei in PubMed Central verfügbar. Gefördert von: NIH HHS, NHGRI NIH HHS, NCI NIH HHS.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Finding relatives within a study cohort is a necessary step in many genomic studies. However, when the cohort is distributed across multiple entities subject to data-sharing restrictions, performing this step often becomes infeasible. Developing a privacy-preserving solution for this task is challenging owing to the burden of estimating kinship between all the pairs of individuals across data sets. We introduce SF-Relate, a practical and secure federated algorithm for identifying genetic relatives across data silos. SF-Relate vastly reduces the number of individual pairs to compare while maintaining accurate detection through a novel locality-sensitive hashing (LSH) approach. We assign individuals who are likely to be related together into buckets and then test relationships only between individuals in matching buckets across parties. To this end, we construct an effective hash function that captures identity-by-descent (IBD) segments in genetic sequences, which, along with a new bucketing strategy, enable accurate and practical private relative detection. To guarantee privacy, we introduce an efficient algorithm based on multiparty homomorphic encryption (MHE) to allow data holders to cooperatively compute the relatedness coefficients between individuals and to further classify their degrees of relatedness, all without sharing any private data. We demonstrate the accuracy and practical runtimes of SF-Relate on the UK Biobank and All of Us data sets. On a data set of 200,000 individuals split between two parties, SF-Relate detects 97% of third-degree or closer relatives within 15 h of runtime. Our work enables secure identification of relatives across large-scale genomic data sets.

Schlagwörter

MeSH-Schlagwörter (MEDLINE)

AlgorithmsGenomicsHumansPedigreeComputer Security

Autor:innen und Institutionen

  • Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139, USA.
  • Broad Institute of the Massachusetts Institute of Technology and Harvard, Cambridge, Massachusetts 02142, USA.
  • Broad Institute of the Massachusetts Institute of Technology and Harvard, Cambridge, Massachusetts 02142, USA; vpopic@broadinstitute.org bab@mit.edu hoon.cho@yale.edu.
  • Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139, USA; vpopic@broadinstitute.org bab@mit.edu hoon.cho@yale.edu.
  • Department of Mathematics, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139, USA.
  • Department of Biomedical Informatics and Data Science, Yale University, New Haven, Connecticut 06510, USA vpopic@broadinstitute.org bab@mit.edu hoon.cho@yale.edu.

ORCID-Profile: Matthew M Hong, Hyunghoon Cho

Förderung

  • NIH HHS
  • NHGRI NIH HHS
  • NCI NIH HHS
  • NIGMS NIH HHS
  • National Institutes of Health
  • Broad Institute
  • Regional Medical Centers
  • Federally Qualified Health Centers

Zitieren

APA

Hong, M. M., Froelicher, D., Magner, R., Popic, V., Berger, B., & Cho, H. (2024). Secure discovery of genetic relatives across large-scale and distributed genomic data sets. Genome Research. https://doi.org/10.1101/gr.279057.124

Vancouver

Hong MM, Froelicher D, Magner R, Popic V, Berger B, Cho H. Secure discovery of genetic relatives across large-scale and distributed genomic data sets. Genome Research. 2024. doi:10.1101/gr.279057.124

BibTeX
@article{Hong2024,
  author = {Hong, Matthew M and Froelicher, David and Magner, Ricky and Popic, Victoria and Berger, Bonnie and Cho, Hyunghoon},
  title = {Secure discovery of genetic relatives across large-scale and distributed genomic data sets},
  journal = {Genome Research},
  year = {2024},
  doi = {10.1101/gr.279057.124}
}
Kostenlos starten →