Evidence map›Paper›PMID 28937647›Full record

ArticleMolecules (Basel, Switzerland)2017

Identification of DNA-Binding Proteins Using Mixed Feature Representation Methods.

Kaiyang Qu, Ke Han, Song Wu, Guohua Wang, Leyi Wei

Open access · goldAbstract read
In one paragraph

Article in Molecules (Basel, Switzerland), 2017. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 14 papers.

0numbers the graph read from it
0cells of the map it votes in
14citing papers in PubMed
2.4field-weighted citation impact, top 11% of its field
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

14 citing papers in PubMed, 38 citations in OpenAlex.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. Prediction of Anticancer Peptides Using a Low-Dimensional Feature Model.Frontiers in bioengineering and biotechnology · 2020
    Article
  8. Article
  9. Application of Machine Learning in Microbiology.Frontiers in microbiology · 2019
    Review
  10. Article
  11. Article
  12. RFAmyloid: A Web Server for Predicting Amyloid Proteins.International journal of molecular sciences · 2018
    Article
  13. Special Protein Molecules Computational Identification.International journal of molecular sciences · 2018
    Article
  14. Article
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

5 authors at 4 institutions in 1 country.

Kaiyang QuSchool of Computer Science and Technology, Tianjin University, Tianjin 300350, China. nyqky257248@163.com.
Ke HanSchool of Computer and Information Engineering, Harbin University of Commerce, Harbin 150028, China. hanke@hrbcu.edu.cn.
Song WuCenter of Potential Illness, Qinhuangdao Hospital of Traditional Chinese Medicine, Qinhuangdao 066001, China. suran.tju@gmail.com.
Guohua WangSchool of Computer Science and Technology, Harbin Institute of China, Harbin 150001, China. ghwang@hit.edu.cn.
Leyi WeiSchool of Computer Science and Technology, Tianjin University, Tianjin 300350, China. weileyi@tju.edu.cn.
First Hospital of Qinhuangdao · CNHarbin Institute of Technology · CNHarbin University of Commerce · CNNankai University · CN

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

DNA-binding proteins play vital roles in cellular processes, such as DNA packaging, replication, transcription, regulation, and other DNA-associated activities. The current main prediction method is based on machine learning, and its accuracy mainly depends on the features extraction method. Therefore, using an efficient feature representation method is important to enhance the classification accuracy. However, existing feature representation methods cannot efficiently distinguish DNA-binding proteins from non-DNA-binding proteins. In this paper, a multi-feature representation method, which combines three feature representation methods, namely, K-Skip-N-Grams, Information theory, and Sequential and structural features (SSF), is used to represent the protein sequences and improve feature representation ability. In addition, the classifier is a support vector machine. The mixed-feature representation method is evaluated using 10-fold cross-validation and a test set. Feature vectors, which are obtained from a combination of three feature extractions, show the best performance in 10-fold cross-validation both under non-dimensional reduction and dimensional reduction by max-relevance-max-distance. Moreover, the reduced mixed feature method performs better than the non-reduced mixed feature technique. The feature vectors, which are a combination of SSF and K-Skip-N-Grams, show the best performance in the test set. Among these methods, mixed features exhibit superiority over the single features.

Indexed as

Amino Acid SequenceComputational BiologyDNADNA-Binding ProteinsMachine LearningSupport Vector MachineDNADNA-Binding ProteinsDNA-binding proteinmixed feature representation methodssupport vector machine

Identifiers

PMID28937647
PMCPMC6151557
OpenAlexW2757460292

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.