SemanticCAP: Chromatin Accessibility Prediction Enhanced by Features Learning from a Language Model
Not on the map. Why?
Abstract (arXiv)
A large number of inorganic and organic compounds are able to bind DNA and form complexes, among which drug-related molecules are important. Chromatin accessibility changes not only directly affects drug-DNA interactions, but also promote or inhibit the expression of critical genes associated with drug resistance by affecting the DNA binding capacity of TFs and transcriptional regulators. However, Biological experimental techniques for measuring it are expensive and time consuming. In recent years, several kinds of computational methods have been proposed to identify accessible regions of the genome. Existing computational models mostly ignore the contextual information of bases in gene sequences. To address these issues, we proposed a new solution named SemanticCAP. It introduces a gene language model which models the context of gene sequences, thus being able to provide an effective representation of a certain site in gene sequences. Basically, we merge the features provided by the gene language model into our chromatin accessibility model. During the process, we designed some methods to make feature fusion smoother. Compared with other systems under public benchmarks, our model proved to have better performance.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 7 of its 41 references that are in the map. First posted on arXiv 5 Apr 2022.
Builds on
7 of 41 references.
References · 7
- 2017Attention Is All You Needcited by 59,932
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2016Densely Connected Convolutional Networkscited by 6,691
- 2016Layer Normalizationcited by 5,579
- 2020Rethinking Attention with Performerscited by 1,584
- 2014A Convolutional Neural Network for Modelling Sentencescited by 163
- 2016Gated End-to-End Memory Networkscited by 6
Built on by
Citing papers per year: 2024: 1; 2025: 0; 2026: 1.
2 papers.