Controlling the signal: Practical privacy protection of genomic data sharing through Beacon services
Background Genomic data is increasingly collected by a wide array of organizations. As such, there is a growing demand to make summary information about such collections available more widely. However, over the past decade, a series of investigations have shown that attacks, rooted in statistical in...
Saved in:
| Published in | BMC medical genomics Vol. 10; no. Suppl 2; pp. 39 - 100 |
|---|---|
| Main Authors | , , , |
| Format | Journal Article |
| Language | English |
| Published |
London
BioMed Central
26.07.2017
BioMed Central Ltd BMC |
| Subjects | |
| Online Access | Get full text |
| ISSN | 1755-8794 1755-8794 |
| DOI | 10.1186/s12920-017-0282-1 |
Cover
| Abstract | Background
Genomic data is increasingly collected by a wide array of organizations. As such, there is a growing demand to make summary information about such collections available more widely. However, over the past decade, a series of investigations have shown that attacks, rooted in statistical inference methods, can be applied to discern the presence of a known individual’s DNA sequence in the pool of subjects. Recently, it was shown that the Beacon Project of the Global Alliance for Genomics and Health, a web service for querying about the presence (or absence) of a specific allele, was vulnerable. The Integrating Data for Analysis, Anonymization, and Sharing (iDASH) Center modeled a track in their third Privacy Protection Challenge on how to mitigate the Beacon vulnerability. We developed the winning solution for this track.
Methods
This paper describes our computational method to optimize the tradeoff between the utility and the privacy of the Beacon service. We generalize the genomic data sharing problem beyond that which was introduced in the iDASH Challenge to be more representative of real world scenarios to allow for a more comprehensive evaluation. We then conduct a sensitivity analysis of our method with respect to several state-of-the-art methods using a dataset of 400,000 positions in Chromosome 10 for 500 individuals from Phase 3 of the 1000 Genomes Project. All methods are evaluated for utility, privacy and efficiency.
Results
Our method achieves better performance than all state-of-the-art methods, irrespective of how key factors (e.g., the allele frequency in the population, the size of the pool and utility weights) change from the original parameters of the problem. We further illustrate that it is possible for our method to exhibit subpar performance under special cases of allele query sequences. However, we show our method can be extended to address this issue when the query sequence is fixed and known a priori to the data custodian, so that they may plan stage their responses accordingly.
Conclusions
This research shows that it is possible to thwart the attack on Beacon services, without substantially altering the utility of the system, using computational methods. The method we initially developed is limited by the design of the scenario and evaluation protocol for the iDASH Challenge; however, it can be improved by allowing the data custodian to act in a staged manner. |
|---|---|
| AbstractList | Abstract Background Genomic data is increasingly collected by a wide array of organizations. As such, there is a growing demand to make summary information about such collections available more widely. However, over the past decade, a series of investigations have shown that attacks, rooted in statistical inference methods, can be applied to discern the presence of a known individual’s DNA sequence in the pool of subjects. Recently, it was shown that the Beacon Project of the Global Alliance for Genomics and Health, a web service for querying about the presence (or absence) of a specific allele, was vulnerable. The Integrating Data for Analysis, Anonymization, and Sharing (iDASH) Center modeled a track in their third Privacy Protection Challenge on how to mitigate the Beacon vulnerability. We developed the winning solution for this track. Methods This paper describes our computational method to optimize the tradeoff between the utility and the privacy of the Beacon service. We generalize the genomic data sharing problem beyond that which was introduced in the iDASH Challenge to be more representative of real world scenarios to allow for a more comprehensive evaluation. We then conduct a sensitivity analysis of our method with respect to several state-of-the-art methods using a dataset of 400,000 positions in Chromosome 10 for 500 individuals from Phase 3 of the 1000 Genomes Project. All methods are evaluated for utility, privacy and efficiency. Results Our method achieves better performance than all state-of-the-art methods, irrespective of how key factors (e.g., the allele frequency in the population, the size of the pool and utility weights) change from the original parameters of the problem. We further illustrate that it is possible for our method to exhibit subpar performance under special cases of allele query sequences. However, we show our method can be extended to address this issue when the query sequence is fixed and known a priori to the data custodian, so that they may plan stage their responses accordingly. Conclusions This research shows that it is possible to thwart the attack on Beacon services, without substantially altering the utility of the system, using computational methods. The method we initially developed is limited by the design of the scenario and evaluation protocol for the iDASH Challenge; however, it can be improved by allowing the data custodian to act in a staged manner. Background Genomic data is increasingly collected by a wide array of organizations. As such, there is a growing demand to make summary information about such collections available more widely. However, over the past decade, a series of investigations have shown that attacks, rooted in statistical inference methods, can be applied to discern the presence of a known individual's DNA sequence in the pool of subjects. Recently, it was shown that the Beacon Project of the Global Alliance for Genomics and Health, a web service for querying about the presence (or absence) of a specific allele, was vulnerable. The Integrating Data for Analysis, Anonymization, and Sharing (iDASH) Center modeled a track in their third Privacy Protection Challenge on how to mitigate the Beacon vulnerability. We developed the winning solution for this track. Methods This paper describes our computational method to optimize the tradeoff between the utility and the privacy of the Beacon service. We generalize the genomic data sharing problem beyond that which was introduced in the iDASH Challenge to be more representative of real world scenarios to allow for a more comprehensive evaluation. We then conduct a sensitivity analysis of our method with respect to several state-of-the-art methods using a dataset of 400,000 positions in Chromosome 10 for 500 individuals from Phase 3 of the 1000 Genomes Project. All methods are evaluated for utility, privacy and efficiency. Results Our method achieves better performance than all state-of-the-art methods, irrespective of how key factors (e.g., the allele frequency in the population, the size of the pool and utility weights) change from the original parameters of the problem. We further illustrate that it is possible for our method to exhibit subpar performance under special cases of allele query sequences. However, we show our method can be extended to address this issue when the query sequence is fixed and known a priori to the data custodian, so that they may plan stage their responses accordingly. Conclusions This research shows that it is possible to thwart the attack on Beacon services, without substantially altering the utility of the system, using computational methods. The method we initially developed is limited by the design of the scenario and evaluation protocol for the iDASH Challenge; however, it can be improved by allowing the data custodian to act in a staged manner. Keywords: Genomic databases, Beacon service, Data sharing, Privacy, Perturbation, iDASH challenge Background Genomic data is increasingly collected by a wide array of organizations. As such, there is a growing demand to make summary information about such collections available more widely. However, over the past decade, a series of investigations have shown that attacks, rooted in statistical inference methods, can be applied to discern the presence of a known individual’s DNA sequence in the pool of subjects. Recently, it was shown that the Beacon Project of the Global Alliance for Genomics and Health, a web service for querying about the presence (or absence) of a specific allele, was vulnerable. The Integrating Data for Analysis, Anonymization, and Sharing (iDASH) Center modeled a track in their third Privacy Protection Challenge on how to mitigate the Beacon vulnerability. We developed the winning solution for this track. Methods This paper describes our computational method to optimize the tradeoff between the utility and the privacy of the Beacon service. We generalize the genomic data sharing problem beyond that which was introduced in the iDASH Challenge to be more representative of real world scenarios to allow for a more comprehensive evaluation. We then conduct a sensitivity analysis of our method with respect to several state-of-the-art methods using a dataset of 400,000 positions in Chromosome 10 for 500 individuals from Phase 3 of the 1000 Genomes Project. All methods are evaluated for utility, privacy and efficiency. Results Our method achieves better performance than all state-of-the-art methods, irrespective of how key factors (e.g., the allele frequency in the population, the size of the pool and utility weights) change from the original parameters of the problem. We further illustrate that it is possible for our method to exhibit subpar performance under special cases of allele query sequences. However, we show our method can be extended to address this issue when the query sequence is fixed and known a priori to the data custodian, so that they may plan stage their responses accordingly. Conclusions This research shows that it is possible to thwart the attack on Beacon services, without substantially altering the utility of the system, using computational methods. The method we initially developed is limited by the design of the scenario and evaluation protocol for the iDASH Challenge; however, it can be improved by allowing the data custodian to act in a staged manner. Genomic data is increasingly collected by a wide array of organizations. As such, there is a growing demand to make summary information about such collections available more widely. However, over the past decade, a series of investigations have shown that attacks, rooted in statistical inference methods, can be applied to discern the presence of a known individual's DNA sequence in the pool of subjects. Recently, it was shown that the Beacon Project of the Global Alliance for Genomics and Health, a web service for querying about the presence (or absence) of a specific allele, was vulnerable. The Integrating Data for Analysis, Anonymization, and Sharing (iDASH) Center modeled a track in their third Privacy Protection Challenge on how to mitigate the Beacon vulnerability. We developed the winning solution for this track.BACKGROUNDGenomic data is increasingly collected by a wide array of organizations. As such, there is a growing demand to make summary information about such collections available more widely. However, over the past decade, a series of investigations have shown that attacks, rooted in statistical inference methods, can be applied to discern the presence of a known individual's DNA sequence in the pool of subjects. Recently, it was shown that the Beacon Project of the Global Alliance for Genomics and Health, a web service for querying about the presence (or absence) of a specific allele, was vulnerable. The Integrating Data for Analysis, Anonymization, and Sharing (iDASH) Center modeled a track in their third Privacy Protection Challenge on how to mitigate the Beacon vulnerability. We developed the winning solution for this track.This paper describes our computational method to optimize the tradeoff between the utility and the privacy of the Beacon service. We generalize the genomic data sharing problem beyond that which was introduced in the iDASH Challenge to be more representative of real world scenarios to allow for a more comprehensive evaluation. We then conduct a sensitivity analysis of our method with respect to several state-of-the-art methods using a dataset of 400,000 positions in Chromosome 10 for 500 individuals from Phase 3 of the 1000 Genomes Project. All methods are evaluated for utility, privacy and efficiency.METHODSThis paper describes our computational method to optimize the tradeoff between the utility and the privacy of the Beacon service. We generalize the genomic data sharing problem beyond that which was introduced in the iDASH Challenge to be more representative of real world scenarios to allow for a more comprehensive evaluation. We then conduct a sensitivity analysis of our method with respect to several state-of-the-art methods using a dataset of 400,000 positions in Chromosome 10 for 500 individuals from Phase 3 of the 1000 Genomes Project. All methods are evaluated for utility, privacy and efficiency.Our method achieves better performance than all state-of-the-art methods, irrespective of how key factors (e.g., the allele frequency in the population, the size of the pool and utility weights) change from the original parameters of the problem. We further illustrate that it is possible for our method to exhibit subpar performance under special cases of allele query sequences. However, we show our method can be extended to address this issue when the query sequence is fixed and known a priori to the data custodian, so that they may plan stage their responses accordingly.RESULTSOur method achieves better performance than all state-of-the-art methods, irrespective of how key factors (e.g., the allele frequency in the population, the size of the pool and utility weights) change from the original parameters of the problem. We further illustrate that it is possible for our method to exhibit subpar performance under special cases of allele query sequences. However, we show our method can be extended to address this issue when the query sequence is fixed and known a priori to the data custodian, so that they may plan stage their responses accordingly.This research shows that it is possible to thwart the attack on Beacon services, without substantially altering the utility of the system, using computational methods. The method we initially developed is limited by the design of the scenario and evaluation protocol for the iDASH Challenge; however, it can be improved by allowing the data custodian to act in a staged manner.CONCLUSIONSThis research shows that it is possible to thwart the attack on Beacon services, without substantially altering the utility of the system, using computational methods. The method we initially developed is limited by the design of the scenario and evaluation protocol for the iDASH Challenge; however, it can be improved by allowing the data custodian to act in a staged manner. Genomic data is increasingly collected by a wide array of organizations. As such, there is a growing demand to make summary information about such collections available more widely. However, over the past decade, a series of investigations have shown that attacks, rooted in statistical inference methods, can be applied to discern the presence of a known individual's DNA sequence in the pool of subjects. Recently, it was shown that the Beacon Project of the Global Alliance for Genomics and Health, a web service for querying about the presence (or absence) of a specific allele, was vulnerable. The Integrating Data for Analysis, Anonymization, and Sharing (iDASH) Center modeled a track in their third Privacy Protection Challenge on how to mitigate the Beacon vulnerability. We developed the winning solution for this track. This paper describes our computational method to optimize the tradeoff between the utility and the privacy of the Beacon service. We generalize the genomic data sharing problem beyond that which was introduced in the iDASH Challenge to be more representative of real world scenarios to allow for a more comprehensive evaluation. We then conduct a sensitivity analysis of our method with respect to several state-of-the-art methods using a dataset of 400,000 positions in Chromosome 10 for 500 individuals from Phase 3 of the 1000 Genomes Project. All methods are evaluated for utility, privacy and efficiency. Our method achieves better performance than all state-of-the-art methods, irrespective of how key factors (e.g., the allele frequency in the population, the size of the pool and utility weights) change from the original parameters of the problem. We further illustrate that it is possible for our method to exhibit subpar performance under special cases of allele query sequences. However, we show our method can be extended to address this issue when the query sequence is fixed and known a priori to the data custodian, so that they may plan stage their responses accordingly. This research shows that it is possible to thwart the attack on Beacon services, without substantially altering the utility of the system, using computational methods. The method we initially developed is limited by the design of the scenario and evaluation protocol for the iDASH Challenge; however, it can be improved by allowing the data custodian to act in a staged manner. Genomic data is increasingly collected by a wide array of organizations. As such, there is a growing demand to make summary information about such collections available more widely. However, over the past decade, a series of investigations have shown that attacks, rooted in statistical inference methods, can be applied to discern the presence of a known individual's DNA sequence in the pool of subjects. Recently, it was shown that the Beacon Project of the Global Alliance for Genomics and Health, a web service for querying about the presence (or absence) of a specific allele, was vulnerable. The Integrating Data for Analysis, Anonymization, and Sharing (iDASH) Center modeled a track in their third Privacy Protection Challenge on how to mitigate the Beacon vulnerability. We developed the winning solution for this track. This paper describes our computational method to optimize the tradeoff between the utility and the privacy of the Beacon service. We generalize the genomic data sharing problem beyond that which was introduced in the iDASH Challenge to be more representative of real world scenarios to allow for a more comprehensive evaluation. We then conduct a sensitivity analysis of our method with respect to several state-of-the-art methods using a dataset of 400,000 positions in Chromosome 10 for 500 individuals from Phase 3 of the 1000 Genomes Project. All methods are evaluated for utility, privacy and efficiency. Our method achieves better performance than all state-of-the-art methods, irrespective of how key factors (e.g., the allele frequency in the population, the size of the pool and utility weights) change from the original parameters of the problem. We further illustrate that it is possible for our method to exhibit subpar performance under special cases of allele query sequences. However, we show our method can be extended to address this issue when the query sequence is fixed and known a priori to the data custodian, so that they may plan stage their responses accordingly. This research shows that it is possible to thwart the attack on Beacon services, without substantially altering the utility of the system, using computational methods. The method we initially developed is limited by the design of the scenario and evaluation protocol for the iDASH Challenge; however, it can be improved by allowing the data custodian to act in a staged manner. Background Genomic data is increasingly collected by a wide array of organizations. As such, there is a growing demand to make summary information about such collections available more widely. However, over the past decade, a series of investigations have shown that attacks, rooted in statistical inference methods, can be applied to discern the presence of a known individual’s DNA sequence in the pool of subjects. Recently, it was shown that the Beacon Project of the Global Alliance for Genomics and Health, a web service for querying about the presence (or absence) of a specific allele, was vulnerable. The Integrating Data for Analysis, Anonymization, and Sharing (iDASH) Center modeled a track in their third Privacy Protection Challenge on how to mitigate the Beacon vulnerability. We developed the winning solution for this track. Methods This paper describes our computational method to optimize the tradeoff between the utility and the privacy of the Beacon service. We generalize the genomic data sharing problem beyond that which was introduced in the iDASH Challenge to be more representative of real world scenarios to allow for a more comprehensive evaluation. We then conduct a sensitivity analysis of our method with respect to several state-of-the-art methods using a dataset of 400,000 positions in Chromosome 10 for 500 individuals from Phase 3 of the 1000 Genomes Project. All methods are evaluated for utility, privacy and efficiency. Results Our method achieves better performance than all state-of-the-art methods, irrespective of how key factors (e.g., the allele frequency in the population, the size of the pool and utility weights) change from the original parameters of the problem. We further illustrate that it is possible for our method to exhibit subpar performance under special cases of allele query sequences. However, we show our method can be extended to address this issue when the query sequence is fixed and known a priori to the data custodian, so that they may plan stage their responses accordingly. Conclusions This research shows that it is possible to thwart the attack on Beacon services, without substantially altering the utility of the system, using computational methods. The method we initially developed is limited by the design of the scenario and evaluation protocol for the iDASH Challenge; however, it can be improved by allowing the data custodian to act in a staged manner. |
| ArticleNumber | 39 |
| Audience | Academic |
| Author | Wan, Zhiyu Kantarcioglu, Murat Vorobeychik, Yevgeniy Malin, Bradley |
| Author_xml | – sequence: 1 givenname: Zhiyu surname: Wan fullname: Wan, Zhiyu email: zhiyu.wan@vanderbilt.edu organization: Department of Electrical Engineering and Computer Science, Vanderbilt University – sequence: 2 givenname: Yevgeniy surname: Vorobeychik fullname: Vorobeychik, Yevgeniy organization: Department of Electrical Engineering and Computer Science, Vanderbilt University, Department of Biomedical Informatics, Vanderbilt University – sequence: 3 givenname: Murat surname: Kantarcioglu fullname: Kantarcioglu, Murat organization: Department of Computer Science, University of Texas at Dallas – sequence: 4 givenname: Bradley surname: Malin fullname: Malin, Bradley organization: Department of Electrical Engineering and Computer Science, Vanderbilt University, Department of Biomedical Informatics, Vanderbilt University, Department of Biostatistics, Vanderbilt University |
| BackLink | https://www.ncbi.nlm.nih.gov/pubmed/28786360$$D View this record in MEDLINE/PubMed |
| BookMark | eNp9kl9v0zAUxSM0xP7AB-AFReKFPWTYcRw7PEwa1YBKk0Cwd-vGdlJXaVzspGLfntumQ-0EyA-2bn7n5Pr6nCcnve9tkrym5IpSWb6PNK9ykhEqMpLLPKPPkjMqOM-kqIqTg_Npch7jkpCS8Iq-SE5zKWTJSnKWmJnvh-C7zvVtOixsGl3bQ_ch_RZAD05Dl66D24B-wN0PFmu-T32Ttrb3K6dTAwOkcQFhMgh-bBfpRwsasWjDxmkbXybPG-iifbXfL5L7T7f3sy_Z3dfP89nNXaZLJoaMgtGWmZIaWgFQLqQBRoBLYxhvqgaglkBlUxlTCykaWtNGS1ZXoiGF0OwimU-2xsNSYdsrCA_Kg1O7gg-tgoB36qyqqQBU1dbYvGB1XjOwIAsr6tpyKAx6XU9e67FeWewLpwTdkenxl94tVOs3ivNCFAVHg3d7g-B_jjYOauWitl0HvfVjVLTKBcO2OUH07RN06ceAr7CjOBMV2xnuqRbwAq5vPP5Xb03VTVFVjOeUCKSu_kLhMhZfC-PTOKwfCS6PBMgM9tfQwhijmv_4fsy-ORzKn2k8xgkBMQE6-BiDbZR2A2wjg124TlGitsFVU3AVBldtg6soKukT5aP5_zT5pInrbfpsOJjbP0W_AbBqAC0 |
| CitedBy_id | crossref_primary_10_1093_bioinformatics_btab305 crossref_primary_10_2139_ssrn_3157968 crossref_primary_10_1093_bib_bbx139 crossref_primary_10_1093_jamia_ocac165 crossref_primary_10_1109_ACCESS_2019_2947261 crossref_primary_10_1126_sciadv_abe9986 crossref_primary_10_1038_s41576_022_00455_y crossref_primary_10_1080_23294515_2020_1818875 crossref_primary_10_1055_s_0041_1740630 crossref_primary_10_1016_j_jmoldx_2018_07_009 crossref_primary_10_1038_s41525_017_0036_1 crossref_primary_10_2196_22769 crossref_primary_10_1093_bib_bbz013 |
| Cites_doi | 10.1126/science.1165490 10.1186/gm527 10.1038/ng1007-1181 10.1038/nature15816 10.1038/nature15393 10.1038/nrg3067 10.1016/j.ajhg.2009.10.002 10.1126/science.1229566 10.1038/gim.2013.72 10.1016/j.atg.2016.01.001 10.1016/j.ajhg.2015.09.010 10.1056/NEJMp1500523 10.1038/ejhg.2015.118 10.1016/j.cell.2013.09.006 10.1145/1653662.1653726 10.1002/humu.23022 10.1109/FOCS.2015.46 10.1016/j.ajhg.2016.12.002 10.1093/jamia/ocw167 10.1038/nrg3463 10.1371/journal.pbio.1002195 10.1038/gim.2016.196 10.1038/ng.436 10.1186/gm530 10.1038/nature09764 10.1038/nrg3555 10.1080/15265160802478404 10.1371/journal.pgen.1000167 10.1038/nature06258 10.1001/jamainternmed.2013.12048 |
| ContentType | Journal Article |
| Copyright | The Author(s). 2017 COPYRIGHT 2017 BioMed Central Ltd. Copyright BioMed Central 2017 |
| Copyright_xml | – notice: The Author(s). 2017 – notice: COPYRIGHT 2017 BioMed Central Ltd. – notice: Copyright BioMed Central 2017 |
| DBID | C6C AAYXX CITATION NPM ISR 3V. 7X7 7XB 88E 8AO 8FD 8FE 8FH 8FI 8FJ 8FK ABUWG AFKRA AZQEC BBNVY BENPR BHPHI CCPQU DWQXO FR3 FYUFA GHDGH GNUQQ HCIFZ K9. LK8 M0S M1P M7P P64 PHGZM PHGZT PIMPY PJZUB PKEHL PPXIY PQEST PQGLB PQQKQ PQUKI PRINS RC3 7X8 5PM DOA |
| DOI | 10.1186/s12920-017-0282-1 |
| DatabaseName | Springer Nature OA Free Journals CrossRef PubMed Science in Context ProQuest Central (Corporate) Health & Medical Collection ProQuest Central (purchase pre-March 2016) Medical Database (Alumni Edition) ProQuest Pharma Collection Technology Research Database ProQuest SciTech Collection ProQuest Natural Science Collection Hospital Premium Collection Hospital Premium Collection (Alumni Edition) ProQuest Central (Alumni) (purchase pre-March 2016) ProQuest Central (Alumni) ProQuest Central UK/Ireland ProQuest Central Essentials Biological Science Database ProQuest Central ProQuest Natural Science Collection ProQuest One Community College ProQuest Central Korea Engineering Research Database Health Research Premium Collection Health Research Premium Collection (Alumni) ProQuest Central Student SciTech Premium Collection ProQuest Health & Medical Complete (Alumni) ProQuest Biological Science Collection Health & Medical Collection (Alumni Edition) PML(ProQuest Medical Library) Biological Science Database Biotechnology and BioEngineering Abstracts ProQuest Central Premium ProQuest One Academic (New) Publicly Available Content Database ProQuest Health & Medical Research Collection ProQuest One Academic Middle East (New) ProQuest One Health & Nursing ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic ProQuest One Academic UKI Edition ProQuest Central China Genetics Abstracts MEDLINE - Academic PubMed Central (Full Participant titles) DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef PubMed Publicly Available Content Database ProQuest Central Student Technology Research Database ProQuest One Academic Middle East (New) ProQuest Central Essentials ProQuest Health & Medical Complete (Alumni) ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest One Health & Nursing ProQuest Natural Science Collection ProQuest Pharma Collection ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest Health & Medical Research Collection Genetics Abstracts Health Research Premium Collection Health and Medicine Complete (Alumni Edition) Natural Science Collection ProQuest Central Korea Health & Medical Research Collection Biological Science Collection ProQuest Central (New) ProQuest Medical Library (Alumni) ProQuest Biological Science Collection ProQuest One Academic Eastern Edition ProQuest Hospital Collection Health Research Premium Collection (Alumni) Biological Science Database ProQuest SciTech Collection ProQuest Hospital Collection (Alumni) Biotechnology and BioEngineering Abstracts ProQuest Health & Medical Complete ProQuest Medical Library ProQuest One Academic UKI Edition Engineering Research Database ProQuest One Academic ProQuest One Academic (New) ProQuest Central (Alumni) MEDLINE - Academic |
| DatabaseTitleList | Publicly Available Content Database MEDLINE - Academic PubMed |
| Database_xml | – sequence: 1 dbid: C6C name: Springer Nature OA Free Journals url: http://www.springeropen.com/ sourceTypes: Publisher – sequence: 2 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 3 dbid: NPM name: PubMed url: https://proxy.k.utb.cz/login?url=http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed sourceTypes: Index Database – sequence: 4 dbid: BENPR name: ProQuest Central url: http://www.proquest.com/pqcentral?accountid=15518 sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Medicine |
| EISSN | 1755-8794 |
| EndPage | 100 |
| ExternalDocumentID | oai_doaj_org_article_b17a7f0bede243b2b3aea84e7bbe5a4d PMC5547445 A499352107 28786360 10_1186_s12920_017_0282_1 |
| Genre | Journal Article |
| GrantInformation_xml | – fundername: NHGRI NIH HHS grantid: R01 HG006844 – fundername: NHGRI NIH HHS grantid: RM1 HG009034 |
| GroupedDBID | --- 0R~ 23N 2WC 53G 5GY 5VS 6J9 7X7 88E 8AO 8FE 8FH 8FI 8FJ AAFWJ AAJSJ AASML ABDBF ABUWG ACGFO ACGFS ACIHN ACMJI ACPRK ACUHS ADBBV ADRAZ ADUKV AEAQA AENEX AFKRA AFPKN AHBYD AHMBA AHYZX ALMA_UNASSIGNED_HOLDINGS AMKLP AMTXH AOIJS BAPOH BAWUL BBNVY BCNDV BENPR BFQNJ BHPHI BMC BPHCQ BVXVI C6C CCPQU CS3 DIK DU5 E3Z EBD EBLON EBS EJD EMOBN ESX F5P FYUFA GROUPED_DOAJ GX1 H13 HCIFZ HMCUK HYE IAO IHR INH INR ISR ITC KQ8 LK8 M1P M48 M7P M~E O5R O5S OK1 OVT P2P PGMZT PHGZM PHGZT PIMPY PJZUB PPXIY PQGLB PQQKQ PROAC PSQYO PUEGO RBZ RNS ROL RPM RSV SBL SOJ SV3 TR2 TUS UKHRP W2D ~8M AAYXX ALIPV CITATION -A0 3V. ACRMQ ADINQ C24 NPM PMFND 7XB 8FD 8FK AHSBF AZQEC DWQXO FR3 GNUQQ K9. P64 PKEHL PQEST PQUKI PRINS RC3 7X8 5PM |
| ID | FETCH-LOGICAL-c637t-1adce3d61d19aa1578da30a58dd35f9faab8a18f9ddb787f1b1fc83b97f047c3 |
| IEDL.DBID | M48 |
| ISSN | 1755-8794 |
| IngestDate | Wed Aug 27 01:30:18 EDT 2025 Thu Aug 21 17:21:11 EDT 2025 Thu Sep 04 22:56:10 EDT 2025 Fri Jul 25 19:23:44 EDT 2025 Tue Jun 17 21:21:22 EDT 2025 Tue Jun 10 20:42:38 EDT 2025 Fri Jun 27 03:37:51 EDT 2025 Wed Feb 19 02:43:28 EST 2025 Tue Jul 01 02:55:33 EDT 2025 Thu Apr 24 23:01:36 EDT 2025 Sat Sep 06 07:29:03 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | Suppl 2 |
| Keywords | Beacon service Privacy Genomic databases Perturbation Data sharing iDASH challenge |
| Language | English |
| License | Open AccessThis article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The Creative Commons Public Domain Dedication waiver (http://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated. |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c637t-1adce3d61d19aa1578da30a58dd35f9faab8a18f9ddb787f1b1fc83b97f047c3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23 |
| OpenAccessLink | https://doi.org/10.1186/s12920-017-0282-1 |
| PMID | 28786360 |
| PQID | 1925379345 |
| PQPubID | 55237 |
| PageCount | 14 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_b17a7f0bede243b2b3aea84e7bbe5a4d pubmedcentral_primary_oai_pubmedcentral_nih_gov_5547445 proquest_miscellaneous_1927304750 proquest_journals_1925379345 gale_infotracmisc_A499352107 gale_infotracacademiconefile_A499352107 gale_incontextgauss_ISR_A499352107 pubmed_primary_28786360 crossref_citationtrail_10_1186_s12920_017_0282_1 crossref_primary_10_1186_s12920_017_0282_1 springer_journals_10_1186_s12920_017_0282_1 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 20170726 |
| PublicationDateYYYYMMDD | 2017-07-26 |
| PublicationDate_xml | – month: 7 year: 2017 text: 20170726 day: 26 |
| PublicationDecade | 2010 |
| PublicationPlace | London |
| PublicationPlace_xml | – name: London – name: England |
| PublicationSubtitle | BMC series – open, inclusive and trusted |
| PublicationTitle | BMC medical genomics |
| PublicationTitleAbbrev | BMC Med Genomics |
| PublicationTitleAlternate | BMC Med Genomics |
| PublicationYear | 2017 |
| Publisher | BioMed Central BioMed Central Ltd BMC |
| Publisher_xml | – name: BioMed Central – name: BioMed Central Ltd – name: BMC |
| References | SC Hull (282_CR15) 2008; 8 282_CR31 282_CR32 282_CR11 ZD Stephens (282_CR1) 2015; 13 KM Boycott (282_CR9) 2013; 14 EA Zerhouni (282_CR22) 2008; 322 ED Green (282_CR5) 2011; 470 M Gymrek (282_CR26) 2013; 339 M Torres-Espanol (282_CR29) 2016; 37 HL Rehm (282_CR3) 2013; 14 SC Sanderson (282_CR14) 2016; 24 S Sankararaman (282_CR23) 2009; 41 EC Hayden (282_CR12) 2013; 498 KA Frazer (282_CR19) 2007; 449 Z Wan (282_CR33) 2017; 100 O Gottesman (282_CR6) 2013; 15 282_CR24 MD Mailman (282_CR17) 2007; 39 282_CR27 282_CR21 N Homer (282_CR18) 2008; 4 DJ Kaufman (282_CR16) 2009; 85 DC Kobalt (282_CR10) 2013; 155 F Collins (282_CR7) 2015; 372 AM Philips (282_CR2) 2016; 8 SJ Aronson (282_CR8) 2015; 526 A Auton (282_CR20) 2015; 526 D Craig (282_CR25) 2011; 12 MP Ball (282_CR13) 2014; 6 SS Shringarpure (282_CR30) 2015; 97 KAJ Taber (282_CR4) 2014; 174 B Knoppers (282_CR28) 2014; 6 19878915 - Am J Hum Genet. 2009 Nov;85(5):643-54 19003716 - Am J Bioeth. 2008 Oct;8(10):62-70 26432245 - Nature. 2015 Oct 1;526(7571):68-74 21307933 - Nature. 2011 Feb 10;470(7333):204-13 28065469 - Am J Hum Genet. 2017 Feb 2;100(2):316-322 19701190 - Nat Genet. 2009 Sep;41(9):965-7 17898773 - Nat Genet. 2007 Oct;39(10):1181-6 21921928 - Nat Rev Genet. 2011 Sep 16;12 (10 ):730-6 23478348 - Nat Rev Genet. 2013 Apr;14 (4):295-300 17943122 - Nature. 2007 Oct 18;449(7164):851-61 24217348 - JAMA Intern Med. 2014 Feb 1;174(2):275-80 26469044 - Nature. 2015 Oct 15;526(7573):336-42 23999272 - Nat Rev Genet. 2013 Oct;14(10):681-91 18769715 - PLoS Genet. 2008 Aug 29;4(8):e1000167 28339683 - J Am Med Inform Assoc. 2017 Feb 20;:null 23739403 - Nature. 2013 Jun 6;498(7452):16-7 23743551 - Genet Med. 2013 Oct;15(10):761-71 24713084 - Genome Med. 2014 Feb 28;6(2):10 26036856 - Eur J Hum Genet. 2016 Jan;24(1):14-20 24074859 - Cell. 2013 Sep 26;155(1):27-38 18772394 - Science. 2008 Oct 3;322(5898):44 27363592 - Hum Mutat. 2016 Oct;37(10):1106-9 26522470 - Am J Hum Genet. 2015 Nov 5;97(5):631-46 25031613 - Genome Med. 2014 Feb 27;6(2):13 26151137 - PLoS Biol. 2015 Jul 07;13(7):e1002195 23329047 - Science. 2013 Jan 18;339(6117):321-4 25635347 - N Engl J Med. 2015 Feb 26;372(9):793-5 27047755 - Appl Transl Genom. 2016 Feb 02;8:16-22 28055021 - Genet Med. 2017 Jul;19(7):721-722 |
| References_xml | – volume: 322 start-page: 44 year: 2008 ident: 282_CR22 publication-title: Science doi: 10.1126/science.1165490 – volume: 6 start-page: 10 year: 2014 ident: 282_CR13 publication-title: Genome Med doi: 10.1186/gm527 – volume: 39 start-page: 1181 year: 2007 ident: 282_CR17 publication-title: Nat Genet doi: 10.1038/ng1007-1181 – volume: 526 start-page: 336 year: 2015 ident: 282_CR8 publication-title: Nature doi: 10.1038/nature15816 – volume: 526 start-page: 68 year: 2015 ident: 282_CR20 publication-title: Nature doi: 10.1038/nature15393 – volume: 12 start-page: 730 year: 2011 ident: 282_CR25 publication-title: Nat Rev Genet doi: 10.1038/nrg3067 – volume: 85 start-page: 643 issue: 5 year: 2009 ident: 282_CR16 publication-title: Am J Hum Genet doi: 10.1016/j.ajhg.2009.10.002 – volume: 339 start-page: 321 issue: 6117 year: 2013 ident: 282_CR26 publication-title: Science doi: 10.1126/science.1229566 – volume: 15 start-page: 761 year: 2013 ident: 282_CR6 publication-title: Genet Med doi: 10.1038/gim.2013.72 – volume: 8 start-page: 16 year: 2016 ident: 282_CR2 publication-title: Appl Transl Genomics doi: 10.1016/j.atg.2016.01.001 – volume: 97 start-page: 631 year: 2015 ident: 282_CR30 publication-title: Am J Hum Genet doi: 10.1016/j.ajhg.2015.09.010 – ident: 282_CR21 – volume: 372 start-page: 793 year: 2015 ident: 282_CR7 publication-title: N Engl J Med doi: 10.1056/NEJMp1500523 – volume: 24 start-page: 14 year: 2016 ident: 282_CR14 publication-title: Eur J Hum Genet doi: 10.1038/ejhg.2015.118 – volume: 155 start-page: 27 issue: 1 year: 2013 ident: 282_CR10 publication-title: Cell doi: 10.1016/j.cell.2013.09.006 – ident: 282_CR24 doi: 10.1145/1653662.1653726 – volume: 37 start-page: 1106 issue: 1 year: 2016 ident: 282_CR29 publication-title: Hum Mutat doi: 10.1002/humu.23022 – volume: 498 start-page: 16 issue: 7452 year: 2013 ident: 282_CR12 publication-title: Nature – ident: 282_CR27 doi: 10.1109/FOCS.2015.46 – volume: 100 start-page: 316 issue: 2 year: 2017 ident: 282_CR33 publication-title: Am J Hum Genet doi: 10.1016/j.ajhg.2016.12.002 – ident: 282_CR32 doi: 10.1093/jamia/ocw167 – volume: 14 start-page: 295 year: 2013 ident: 282_CR3 publication-title: Nat Rev Genet doi: 10.1038/nrg3463 – ident: 282_CR31 – volume: 13 start-page: e1002195 issue: 7 year: 2015 ident: 282_CR1 publication-title: PLoS Biol doi: 10.1371/journal.pbio.1002195 – ident: 282_CR11 doi: 10.1038/gim.2016.196 – volume: 41 start-page: 965 year: 2009 ident: 282_CR23 publication-title: Nat Genet doi: 10.1038/ng.436 – volume: 6 start-page: 13 issue: 2 year: 2014 ident: 282_CR28 publication-title: Genome Med doi: 10.1186/gm530 – volume: 470 start-page: 204 year: 2011 ident: 282_CR5 publication-title: Nature doi: 10.1038/nature09764 – volume: 14 start-page: 681 year: 2013 ident: 282_CR9 publication-title: Nat Rev Genet doi: 10.1038/nrg3555 – volume: 8 start-page: 62 issue: 10 year: 2008 ident: 282_CR15 publication-title: Am J Bioeth doi: 10.1080/15265160802478404 – volume: 4 start-page: e1000167 issue: 8 year: 2008 ident: 282_CR18 publication-title: PLoS Genet doi: 10.1371/journal.pgen.1000167 – volume: 449 start-page: 851 issue: 7164 year: 2007 ident: 282_CR19 publication-title: Nature doi: 10.1038/nature06258 – volume: 174 start-page: 275 issue: 2 year: 2014 ident: 282_CR4 publication-title: JAMA Intern Med doi: 10.1001/jamainternmed.2013.12048 – reference: 25635347 - N Engl J Med. 2015 Feb 26;372(9):793-5 – reference: 24713084 - Genome Med. 2014 Feb 28;6(2):10 – reference: 27047755 - Appl Transl Genom. 2016 Feb 02;8:16-22 – reference: 26522470 - Am J Hum Genet. 2015 Nov 5;97(5):631-46 – reference: 21307933 - Nature. 2011 Feb 10;470(7333):204-13 – reference: 28065469 - Am J Hum Genet. 2017 Feb 2;100(2):316-322 – reference: 19878915 - Am J Hum Genet. 2009 Nov;85(5):643-54 – reference: 23478348 - Nat Rev Genet. 2013 Apr;14 (4):295-300 – reference: 19701190 - Nat Genet. 2009 Sep;41(9):965-7 – reference: 26469044 - Nature. 2015 Oct 15;526(7573):336-42 – reference: 25031613 - Genome Med. 2014 Feb 27;6(2):13 – reference: 19003716 - Am J Bioeth. 2008 Oct;8(10):62-70 – reference: 26036856 - Eur J Hum Genet. 2016 Jan;24(1):14-20 – reference: 28339683 - J Am Med Inform Assoc. 2017 Feb 20;:null – reference: 23329047 - Science. 2013 Jan 18;339(6117):321-4 – reference: 23739403 - Nature. 2013 Jun 6;498(7452):16-7 – reference: 23999272 - Nat Rev Genet. 2013 Oct;14(10):681-91 – reference: 26432245 - Nature. 2015 Oct 1;526(7571):68-74 – reference: 26151137 - PLoS Biol. 2015 Jul 07;13(7):e1002195 – reference: 17898773 - Nat Genet. 2007 Oct;39(10):1181-6 – reference: 21921928 - Nat Rev Genet. 2011 Sep 16;12 (10 ):730-6 – reference: 23743551 - Genet Med. 2013 Oct;15(10):761-71 – reference: 27363592 - Hum Mutat. 2016 Oct;37(10):1106-9 – reference: 18772394 - Science. 2008 Oct 3;322(5898):44 – reference: 28055021 - Genet Med. 2017 Jul;19(7):721-722 – reference: 17943122 - Nature. 2007 Oct 18;449(7164):851-61 – reference: 24074859 - Cell. 2013 Sep 26;155(1):27-38 – reference: 18769715 - PLoS Genet. 2008 Aug 29;4(8):e1000167 – reference: 24217348 - JAMA Intern Med. 2014 Feb 1;174(2):275-80 |
| SSID | ssj0060591 |
| Score | 2.2652102 |
| Snippet | Background
Genomic data is increasingly collected by a wide array of organizations. As such, there is a growing demand to make summary information about such... Genomic data is increasingly collected by a wide array of organizations. As such, there is a growing demand to make summary information about such collections... Background Genomic data is increasingly collected by a wide array of organizations. As such, there is a growing demand to make summary information about such... Abstract Background Genomic data is increasingly collected by a wide array of organizations. As such, there is a growing demand to make summary information... |
| SourceID | doaj pubmedcentral proquest gale pubmed crossref springer |
| SourceType | Open Website Open Access Repository Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 39 |
| SubjectTerms | Alleles Beacon service Biomedical and Life Sciences Biomedicine Chromosome 10 Computer applications Consortia Custodians Data collection Data processing Data sharing Deoxyribonucleic acid DNA DNA sequencing Gene Expression Gene frequency Genetic research Genomes Genomic databases Genomics Haplotypes Human Genetics iDASH challenge Information management Information sharing Medical practice software Microarrays Nucleotide sequence Perturbation Population genetics Privacy Sensitivity analysis Technology application |
| SummonAdditionalLinks | – databaseName: DOAJ Directory of Open Access Journals dbid: DOA link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3NaxUxEA_Sg3gRv12tEkUQlKUvm2yy660tlirUg1boLUw2iS20-6T7XqH_vTObvMfbinoR9rSZ_ch8ZYZMfsPYGwzpIeBKWWqodKli9GUbjStrabyTUkjQdBr56Is-_K4-n9QnG62-qCYswQMnxu04YcDEmQs-VEq6ykkI0KhgnAs1KE_eF5exVTKVfDDG6K3Ie5ii0TuDoKZMJXlkyjFKMVmFRrD-313yxpp0s17yxqbpuBYd3GN3cxDJd9PP32e3Qv-A3T7K2-QPmd9PBeh01JxjhMepSgPOP_CEToRi4fjmK-iuecZpQOnweeSE2Hpx1nGqG-XDKVymF4ytfPgeec-eD9m7PGLHBx-P9w_L3E6h7LQ0i1IATkB6LbxoAQSaqgc5g7rxXtaxjQCuAdHE1nuHZhyFE7FrpGuR_cp08jHb6ud9eMo4GrLzHV61UlSf6jQJKLR10AGirAo2W3HXdhlqnDpenNsx5Wi0TQKxKBBLArGiYO_Wj_xMOBt_I94jka0JCSJ7vIGKY7Pi2H8pTsFek8AtgWD0VGXzA5bDYD99-2p3MQ3EwBQz44K9zURxjjPoIB9aQD4QbtaEcntCiVbaTYdXemWzlxgsRtdoE61UdcFerYfpSap868N8OdIY2hqtZwV7ktRwPW_MdhvCeyuYmSjohDHTkf7sdMQQxyjSKPru-5Uqb_zWn_j-7H_w_Tm7U42GaMpKb7OtxeUyvMDAbuFejjb8C4jQTS8 priority: 102 providerName: Directory of Open Access Journals – databaseName: Health & Medical Collection dbid: 7X7 link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV3da9UwFA86QXwRv1edEkUQlLCbpk1aX2QbjinMB52wt3DSJNtgtvP2XsH_3nPa3Os6cdCn5qRtcj5yTnPyO4y9RpceAq6UQkOuRRGjF3U0TpTKeKeUVKDpNPLhF33wvfh8XB6nH259Sqtc2cTBUPuuoX_k2-iJYP9aFeWHi5-CqkbR7moqoXGT3ZJIQFJtjtcBF3rqtUw7mbLS272k0kyC7DJFGkJO1qIBsv9fw3xpZbqaNXll63RYkfbvsbvJleQ7I-_vsxuhfcBuH6bN8ofM741p6HTgnKOfxylXA87f8xGjCJnD8cm_oPnNE1oD8oh3kRNu64-zhlP2KO9PYT4-YCjow3fJhra8TzbmETva_3i0dyBSUQXRaGUWQgIOQHktvawBJCqsBzWDsvJelbGOAK4CWcXae4fKHKWTsamUq02cFaZRj9lG27Vhk3FUZ-cbvMqioCxVp-PMhVCXQQeIKs_YbDW7tkmA41T34twOgUel7cgQiwyxxBArM_Z23eViRNu4jniXWLYmJKDs4UY3P7FJ76yTBgx9lw95oVzuFASoimCcCyUUPmOviOGWoDBayrU5gWXf20_fvtodDAbRPcX4OGNvElHscAQNpKMLOA-EnjWh3JpQoq420-aVXNlkK3r7V7Iz9nLdTD0p_60N3XKgMbRBWs4y9mQUw_W4MeatCPUtY2YioJOJmba0Z6cDkjj6kqag975bifKlz_rfvD-9fhDP2J18UDEjcr3FNhbzZXiOjtvCvRi08w_JMEKI priority: 102 providerName: ProQuest – databaseName: Springer Nature OA Free Journals dbid: C6C link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3di9QwEA9ygvgifls9JYogKMVN89X6drd4nML5oCfcW5g0yd3B2ZXrruB_70ybXbbnBwh9aiZtkvnIDDP5hbGX6NJDxJ2yNFCZUqUUyiZZX2ppg5dSSDB0Gvnokzn8qj6e6JMMFk1nYbbz96I2b3tB1ymVZEspOigx0Lmu0e5S9d7czNdGF53yRuSk5R-7TbadAZ3_dxu8tQldLZC8kiUdNp-D2-xW9hr53sjmO-xa7O6yG0c5L36PhflYcU5nyzm6dJzKMuDiHR_hiJAPHL_8A9qfPAMzIDv4InGCaP123nIqFOX9GVyOHxju7uH7ZC473mdzcp8dH7w_nh-W-f6EsjXSLksBOAEZjAiiARComwHkDHQdgtSpSQC-BlGnJgSPepuEF6mtpW9sminbygdsp1t08RHjqLk-tPhopagg1Zs08zE2OpoISVYFm61X17UZW5yuuLhwQ4xRGzcyxCFDHDHEiYK93nT5PgJr_It4n1i2ISRM7OEFiorLKua8sGBpXCFWSvrKS4hQq2i9jxpUKNgLYrgj1IuOympOYdX37sOXz24P4z70RDEULtirTJQWOIMW8ikFXAcCyppQ7k4oUS3bafNarlw2C71DdxqVoJFKF-z5ppl6UqlbFxergcZSLlTPCvZwFMPNvDG8rQngrWB2IqCThZm2dOdnA2g4uo1W0X_frEV5a1h_W_fH_0X9hN2sBo2zZWV22c7ychWfosu29M8GZf0F1xU62g priority: 102 providerName: Springer Nature |
| Title | Controlling the signal: Practical privacy protection of genomic data sharing through Beacon services |
| URI | https://link.springer.com/article/10.1186/s12920-017-0282-1 https://www.ncbi.nlm.nih.gov/pubmed/28786360 https://www.proquest.com/docview/1925379345 https://www.proquest.com/docview/1927304750 https://pubmed.ncbi.nlm.nih.gov/PMC5547445 https://doaj.org/article/b17a7f0bede243b2b3aea84e7bbe5a4d |
| Volume | 10 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVADU databaseName: BioMedCentral customDbUrl: eissn: 1755-8794 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0060591 issn: 1755-8794 databaseCode: RBZ dateStart: 20080101 isFulltext: true titleUrlDefault: https://www.biomedcentral.com/search/ providerName: BioMedCentral – providerCode: PRVAFT databaseName: Open Access Digital Library customDbUrl: eissn: 1755-8794 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0060591 issn: 1755-8794 databaseCode: KQ8 dateStart: 20080101 isFulltext: true titleUrlDefault: http://grweb.coalliance.org/oadl/oadl.html providerName: Colorado Alliance of Research Libraries – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 1755-8794 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0060591 issn: 1755-8794 databaseCode: DOA dateStart: 20080101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVEBS databaseName: EBSCOhost Academic Search Ultimate customDbUrl: https://search.ebscohost.com/login.aspx?authtype=ip,shib&custid=s3936755&profile=ehost&defaultdb=asn eissn: 1755-8794 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0060591 issn: 1755-8794 databaseCode: ABDBF dateStart: 20090101 isFulltext: true titleUrlDefault: https://search.ebscohost.com/direct.asp?db=asn providerName: EBSCOhost – providerCode: PRVBFR databaseName: Free Medical Journals customDbUrl: eissn: 1755-8794 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0060591 issn: 1755-8794 databaseCode: DIK dateStart: 20080101 isFulltext: true titleUrlDefault: http://www.freemedicaljournals.com providerName: Flying Publisher – providerCode: PRVFQY databaseName: GFMER Free Medical Journals customDbUrl: eissn: 1755-8794 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0060591 issn: 1755-8794 databaseCode: GX1 dateStart: 0 isFulltext: true titleUrlDefault: http://www.gfmer.ch/Medical_journals/Free_medical.php providerName: Geneva Foundation for Medical Education and Research – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 1755-8794 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0060591 issn: 1755-8794 databaseCode: M~E dateStart: 20080101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre – providerCode: PRVAQN databaseName: PubMed Central customDbUrl: eissn: 1755-8794 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0060591 issn: 1755-8794 databaseCode: RPM dateStart: 20080101 isFulltext: true titleUrlDefault: https://www.ncbi.nlm.nih.gov/pmc/ providerName: National Library of Medicine – providerCode: PRVPQU databaseName: Health & Medical Collection customDbUrl: eissn: 1755-8794 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0060591 issn: 1755-8794 databaseCode: 7X7 dateStart: 20090101 isFulltext: true titleUrlDefault: https://search.proquest.com/healthcomplete providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: http://www.proquest.com/pqcentral?accountid=15518 eissn: 1755-8794 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0060591 issn: 1755-8794 databaseCode: BENPR dateStart: 20090101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVFZP databaseName: Scholars Portal Journals: Open Access customDbUrl: eissn: 1755-8794 dateEnd: 20250131 omitProxy: true ssIdentifier: ssj0060591 issn: 1755-8794 databaseCode: M48 dateStart: 20080401 isFulltext: true titleUrlDefault: http://journals.scholarsportal.info providerName: Scholars Portal – providerCode: PRVAVX databaseName: Springer Nature HAS Fully OA customDbUrl: eissn: 1755-8794 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0060591 issn: 1755-8794 databaseCode: AAJSJ dateStart: 20081201 isFulltext: true titleUrlDefault: https://www.springernature.com providerName: Springer Nature – providerCode: PRVAVX databaseName: Springer Nature OA Free Journals customDbUrl: eissn: 1755-8794 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0060591 issn: 1755-8794 databaseCode: C6C dateStart: 20081201 isFulltext: true titleUrlDefault: http://www.springeropen.com/ providerName: Springer Nature |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1ta9swEBZdC2Nfxt7nrQvaGAw2vMWWLNmDMZLQ0gVSRl8g34RkSW0hc7Y4Geu_353shLrrBgODwTorlu5OdxedniPkNbj02oGljIVORcy9t3HhpYkzJq1hLGFa4GnkyaE4OOXjaTbdIuvyVu0E1jeGdlhP6nQxe__rx-VnUPhPQeFz8aFOsORSjOstRhAxBEM7YJhSFPIJ32wqgOMeCuiBwcxgESh4u8l5YxcdMxXQ_P9cs68YresJldd2VYOx2r9H7rZeJh00YnGfbLnqAbk9affRHxI7ajLU8Sw6BReQYhqHnn2kDXwR8I1Czz91eUlbIAdgH517ipCu3y5KiomltD7Xi6aDUOuHDnF5rWjdLj-PyMn-3snoIG7rLcSlYHIZJxoGwKxIbFJonYAuW836OsutZZkvvNYm10nuC2sN6LlPTOLLnJlC-j6XJXtMtqt55Z4SCppubAlXxjkmsBrh-8a5InPCac_SiPTXs6vKFoscS2LMVIhJcqEahihgiEKGqCQibzevfG-AOP5FPESWbQgRQzs8mC_OVKuSyiRSS_wu61LOTGqYdjrnThrjMs1tRF4hwxWiZFSYhnOmV3WtvhwfqQHEieC5QugckTctkZ_DCErdnmqAeUBgrQ7lbocS1LjsNq_lSq21QIH7DUpTMJ5F5OWmGd_E1LjKzVeBRuLeadaPyJNGDDfjhnA4R0C4iMiOgHYmpttSXZwHkHFwMyXH3323FuUrn_W3eX_2P0x6Tu6kQeFknIpdsr1crNwL8PCWpkduyanskZ3BYHw8hvtw7_DrETwdiVEv_GvSC5r9G1hjUMY |
| linkProvider | Scholars Portal |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwELZKkYAL4k2ggEEgJFDUOHbiBAmhtlDt0m4PUKS9WXZst5VKUja7oP4o_iMzeSxNEb1Vymk9dmLPeB7r8TeEvASXXjuwlGGq4zQU3tsw99KECZfWcM64TvE28mQvHX0Tn6fJdIX87u_CYFplrxMbRW2rAv8jXwdPBPrnXCQfTn6EWDUKT1f7EhqtWOy4018QstXvxx-Bv6_iePvT_tYo7KoKhEXK5Txk2haO25RZlmvNQGKt5pFOMmt54nOvtck0y3xurQFp9swwX2Tc5NJHQhYchr1CrgoeCYTql9NlfAeBQc66g1OWpes1w0pQIZoBDGxCNjB9TYWAf-3AGUN4Pknz3EltYwC3b5GbnedKN1pRu01WXHmHXJt0Z_N3id1qs97xfjsFt5Jiaog-fkdbSCSQBQoj_9TFKe3AIUAkaOUpwsR-PyooJqvS-lDP2gGa-kF0E1V2SetOpd0j-5ex2vfJalmV7iGhoD2MLeBJhMCkWJP6yDiXJy512vM4IFG_uqro8M2xzMaxauKcLFUtQxQwRCFDFAvIm2WXkxbc4yLiTWTZkhBxuZsfqtmB6ra5Mkxqid9lXSy4iQ3XTmfCSWNcooUNyAtkuELkjRJTew70oq7V-OsXtQGxJ3jDEI4H5HVH5CuYQaG7mxKwDgjWNaBcG1CCaiiGzb1cqU411ervRgrI82Uz9sR0u9JVi4ZG4nlsEgXkQSuGy3lDiJ0hyFxA5EBABwszbCmPDhvgcnBdpcD3vu1F-cxn_W_dH108iWfk-mh_sqt2x3s7j8mNuNluMozTNbI6ny3cE_AZ5-Zps1MpUZesGf4ASfOBEA |
| linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3_a9UwEA-ywfAXcX7tNjWKIChlTdMmrb-9TR_b0w1xE_ZbSJpkG8x2vL4n-N9716aPdX4BoT81lzbJ5S533OVzhLwGk147OCljoVMRZ97buPTSxDmX1nDOuBZ4G_noWBx8y2Zn-Vmoc9oO2e5DSLK_04AoTfVi99r6XsQLsdsyLLIUo4ZFnyEG92e9yEsB3tf6ZDI7mQ3KGIz1koVg5h87jo6jDrX_d91843C6nTh5K3raHUrT--ResCbppGf_Jrnj6gdk4yjEyx8Su99nouOdcwqmHsV0DX31nvYwRcAfCl_-oaufNAA2AJto4ylCt36_rCgmkNL2Qs_7D3Q1fegeqtGatkHNPCKn04-n-wdxqKsQV4LLRcw0TIBbwSwrtWYgs1bzROeFtTz3pdfaFJoVvrTWgDx7ZpivCm5K6ZNMVvwxWaub2j0lFCTa2AqePMswUdUInxjnytwJpz1PI5IMq6uqgDmOpS-uVOd7FEL1DFHAEIUMUSwib1ddrnvAjX8R7yHLVoSIld29aObnKoieMkxqieOyLs24SQ3XTheZk8a4XGc2Iq-Q4QrRMGpMtznXy7ZVhydf1QT8QbBQwUWOyJtA5BuYQaXD7QVYBwTQGlHujChBXKtx87CvVFAXrQIzG4Sj5FkekZerZuyJKXC1a5YdjcQYaZ5E5Em_DVfzBre3QOC3iMjRBh0tzLilvrzowMTBnJQZ_vfdsJVvDOtv6771X9QvyMaXD1P1-fD40za5m3bCJ-NU7JC1xXzpnoFVtzDPg-T-ArEBR4U |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Controlling+the+signal%3A+Practical+privacy+protection+of+genomic+data+sharing+through+Beacon+services&rft.jtitle=BMC+medical+genomics&rft.au=Wan%2C+Zhiyu&rft.au=Vorobeychik%2C+Yevgeniy&rft.au=Kantarcioglu%2C+Murat&rft.au=Malin%2C+Bradley&rft.date=2017-07-26&rft.issn=1755-8794&rft.eissn=1755-8794&rft.volume=10&rft.issue=S2&rft_id=info:doi/10.1186%2Fs12920-017-0282-1&rft.externalDBID=n%2Fa&rft.externalDocID=10_1186_s12920_017_0282_1 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1755-8794&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1755-8794&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1755-8794&client=summon |