Secure DNA Motif-Finding Method Based on Sampling Candidate Pruning

Author:

Xia Kaijian1,Wu Xiang2,Mao Yaqing2,Wang Huanhuan3

Affiliation:

1. School of Medical Informatics, Xuzhou Medical University, Xuzhou, Jiangsu 221116, China; The affiliated Changshu Hospital of Soochow University (Changshu No. 1 People's Hospital), Changshu 215500, China; and School of Information and Control Engineering, China University of Mining and Technology, Jiangsu, Xuzhou 221116, China

2. School of Medical Informatics, Xuzhou Medical University, Xuzhou, Jiangsu 221116, China

3. School of Medical Informatics, Xuzhou Medical University, Xuzhou, Jiangsu 221116, China; and School of Information and Control Engineering, China University of Mining and Technology, Jiangsu, Xuzhou 221116, China

Abstract

With the continuous exploration of genetic research, gradually exposed privacy issues become the bottleneck that limits its development. DNA motif finding is an important study to understand the regulation of gene expression; however, the existing methods generally ignore the potential sensitive information that may be exposed in the process. In this work, we utilize the -differential privacy model to provide provable privacy guarantees which is independent of attackers’ background knowledge. Our method makes use of sample databases to prune the generated candidate motifs to lower the magnitude of added noise. Furthermore, to improve the utility of mining results, a strategy of threshold modification is designed to reduce the propagation and random sampling errors in the mining process. Extensive experiments on actual DNA databases confirm that our approach can privately find DNA motifs with high utility and efficiency.

Publisher

Association for Computing Machinery (ACM)

Subject

Computer Networks and Communications

Reference37 articles.

1. A survey of DNA motif finding algorithms

2. Finding Motifs in DNA Sequences Using Low-Dispersion Sequences

3. A genetic optimization approach for finding common motif in biological sequences;Vishal V.;International Journal of Computer Technology and Applications,2011

4. GibbsST: a Gibbs sampling method for motif discovery with enhanced resistance to local optima

Cited by 4 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3