Evidence map›Paper›PMID 30323198›Full record

ArticleScientific reports2018

Recurrent Neural Network for Predicting Transcription Factor Binding Sites.

Zhen Shen, Wenzheng Bao, De-Shuang Huang

Abstract read
In one paragraph

Article in Scientific reports, 2018. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 76 papers, 1 of them a synthesis that pooled it.

0numbers the graph read from it
0cells of the map it votes in
76citing papers in PubMed, 1 pooled it
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

76 citing papers in PubMed, 1 synthesis or guideline pooled it.

  1. Pooled it
  2. Article
  3. Article
  4. Article
  5. Review
  6. Machine learning approaches enable the discovery of therapeutics across domains.Molecular therapy : the journal of the American Society of Gene Therapy · 2025
    Review
  7. Article
  8. Kolmogorov-Arnold networks for genomic tasks.Briefings in bioinformatics · 2025
    Article
  9. Review
  10. Article
  11. Article
  12. Review
  13. Article
  14. Article
  15. Article
  16. Article
  17. Article
  18. Article
  19. Article
  20. Article

16 more citing papers are in PubMed but not listed here.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Zhen ShenInstitute of Machine Learning and Systems Biology, School of Electronics and Information Engineering, Tongji University, Shanghai, 201804, P. R. China.
Wenzheng BaoInstitute of Machine Learning and Systems Biology, School of Electronics and Information Engineering, Tongji University, Shanghai, 201804, P. R. China.ORCID http://orcid.org/0000-0002-1471-5432
De-Shuang HuangInstitute of Machine Learning and Systems Biology, School of Electronics and Information Engineering, Tongji University, Shanghai, 201804, P. R. China. dshuang@tongji.edu.cn.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

It is well known that DNA sequence contains a certain amount of transcription factors (TF) binding sites, and only part of them are identified through biological experiments. However, these experiments are expensive and time-consuming. To overcome these problems, some computational methods, based on k-mer features or convolutional neural networks, have been proposed to identify TF binding sites from DNA sequences. Although these methods have good performance, the context information that relates to TF binding sites is still lacking. Research indicates that standard recurrent neural networks (RNN) and its variants have better performance in time-series data compared with other models. In this study, we propose a model, named KEGRU, to identify TF binding sites by combining Bidirectional Gated Recurrent Unit (GRU) network with k-mer embedding. Firstly, DNA sequences are divided into k-mer sequences with a specified length and stride window. And then, we treat each k-mer as a word and pre-trained word representation model though word2vec algorithm. Thirdly, we construct a deep bidirectional GRU model for feature learning and classification. Experimental results have shown that our method has better performance compared with some state-of-the-art methods. Additional experiments about embedding strategy show that k-mer embedding will be helpful to enhance model performance. The robustness of KEGRU is proved by experiments with different k-mer length, stride window and embedding vector dimension.

Indexed as

Computational BiologyNeural Networks, ComputerAlgorithmsBinding SitesDatabases, GeneticProtein BindingTranscription FactorsTranscription Factors

Identifiers

PMID30323198
PMCPMC6189047

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.