Neural networks with circular filters enable data efficient inference of sequence motifs

Author:

Blum Christopher F1,Kollmann Markus1

Affiliation:

1. Institute for Mathematical Modeling of Biological Systems, Heinrich-Heine University of Düsseldorf, Düsseldorf, Germany

Abstract

Abstract Motivation Nucleic acids and proteins often have localized sequence motifs that enable highly specific interactions. Due to the biological relevance of sequence motifs, numerous inference methods have been developed. Recently, convolutional neural networks (CNNs) have achieved state of the art performance. These methods were able to learn transcription factor binding sites from ChIP-seq data, resulting in accurate predictions on test data. However, CNNs typically distribute learned motifs across multiple filters, making them difficult to interpret. Furthermore, networks trained on small datasets often do not generalize well to new sequences. Results Here we present circular filters, a novel convolutional architecture, that convolves sequences with circularly permutated variants of the same filter. We motivate circular filters by the observation that CNNs frequently learn filters that correspond to shifted and truncated variants of the true motif. Circular filters enable learning of full-length motifs and allow easy interpretation of the learned filters. We show that circular filters improve motif inference performance over a wide range of hyperparameters as well as sequence length. Furthermore, we show that CNNs with circular filters in most cases outperform conventional CNNs at inferring DNA binding sites from ChIP-seq data. Availability and implementation Code is available at https://github.com/christopherblum. Supplementary information Supplementary data are available at Bioinformatics online.

Funder

Deutsche Forschungsgemeinschaft

German Research Foundation

International Max Planck Research School

Max Planck Institute for Plant Breeding Research

Universities of Düsseldorf and Cologne

Publisher

Oxford University Press (OUP)

Subject

Computational Mathematics,Computational Theory and Mathematics,Computer Science Applications,Molecular Biology,Biochemistry,Statistics and Probability

Reference19 articles.

1. Predicting the sequence specificities of DNA- and RNA-binding proteins by deep learning;Alipanahi;Nat. Biotechnol,2015

2. Significance of nucleotide sequence alignments: a method for random sequence permutation that preserves dinucleotide and codon usage;Altschul;Mol. Biol. Evol,1985

3. Universal protein-binding microarrays for the comprehensive characterization of the DNA-binding specificities of transcription factors;Berger;Nat. Protoc,2009

4. An integrated encyclopedia of DNA elements in the human genome;Dunham;Nature,2012

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

1. Human DNA/RNA motif mining using deep-learning methods: a scoping review;Network Modeling Analysis in Health Informatics and Bioinformatics;2023-04-12

2. Rotation-Invariant Feature Learning via Convolutional Neural Network With Cyclic Polar Coordinates Convolutional Layer;IEEE Transactions on Geoscience and Remote Sensing;2023

3. Towards a better understanding of TF-DNA binding prediction from genomic features;Computers in Biology and Medicine;2022-10

4. An Interpretation of Convolutional Neural Networks for Motif Finding from the View of Probability;2021 IEEE 33rd International Conference on Tools with Artificial Intelligence (ICTAI);2021-11

5. Predicting transcription factor binding sites using DNA shape features based on shared hybrid deep learning architecture;Molecular Therapy - Nucleic Acids;2021-06

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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