4.7 Article

Quantum annealing versus classical machine learning applied to a simplified computational biology problem

期刊

NPJ QUANTUM INFORMATION
卷 4, 期 -, 页码 -

出版社

NATURE PUBLISHING GROUP
DOI: 10.1038/s41534-018-0060-8

关键词

-

资金

  1. USC Women in Science and Engineering Program
  2. National Institutes of Health [R01GM106056, U01GM103804]
  3. ARO [W911NF-12-1-0523]
  4. NSF [INSPIRE-1551064]
  5. Office of the Director of National Intelligence (ODNI), Intelligence Advanced Research Projects Activity (IARPA), via the U.S. Army Research Office [W911NF-17-C-0050]
  6. NATIONAL INSTITUTE OF GENERAL MEDICAL SCIENCES [R01GM106056, U01GM103804] Funding Source: NIH RePORTER

向作者/读者索取更多资源

Transcription factors regulate gene expression, but how these proteins recognize and specifically bind to their DNA targets is still debated. Machine learning models are effective means to reveal interaction mechanisms. Here we studied the ability of a quantum machine learning approach to classify and rank binding affinities. Using simplified data sets of a small number of DNA sequences derived from actual binding affinity experiments, we trained a commercially available quantum annealer to classify and rank transcription factor binding. The results were compared to state-of-the-art classical approaches for the same simplified data sets, including simulated annealing, simulated quantum annealing, multiple linear regression, LASSO, and extreme gradient boosting. Despite technological limitations, we find a slight advantage in classification performance and nearly equal ranking performance using the quantum annealer for these fairly small training data sets. Thus, we propose that quantum annealing might be an effective method to implement machine learning for certain computational biology problems.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据