Evidence map›Paper›PMID 25250338›Full record

ArticleBioMed research international2014

Identification and analysis of driver missense mutations using rotation forest with feature selection.

Xiuquan Du, Jiaxing Cheng

Open access · hybridAbstract read
In one paragraph

Article in BioMed research international, 2014. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

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

1 citing paper in PubMed, 2 citations in OpenAlex.

  1. Review
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

2 authors at 1 institution in 1 country.

Xiuquan DuKey Laboratory of Intelligent Computing and Signal Processing of Ministry of Education, Anhui University, Hefei, Anhui 230601, China ; School of Computer Science and Technology, Anhui University, Hefei, Anhui 230601, China.ORCID 0000-0001-7913-7605
Jiaxing ChengKey Laboratory of Intelligent Computing and Signal Processing of Ministry of Education, Anhui University, Hefei, Anhui 230601, China ; School of Computer Science and Technology, Anhui University, Hefei, Anhui 230601, China.
Anhui University · CN

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Identifying cancer-associated mutations (driver mutations) is critical for understanding the cellular function of cancer genome that leads to activation of oncogenes or inactivation of tumor suppressor genes. Many approaches are proposed which use supervised machine learning techniques for prediction with features obtained by some databases. However, often we do not know which features are important for driver mutations prediction. In this study, we propose a novel feature selection method (called DX) from 126 candidate features' set. In order to obtain the best performance, rotation forest algorithm was adopted to perform the experiment. On the train dataset which was collected from COSMIC and Swiss-Prot databases, we are able to obtain high prediction performance with 88.03% accuracy, 93.9% precision, and 81.35% recall when the 11 top-ranked features were used. Comparison with other various techniques in the TP53, EGFR, and Cosmic2plus datasets shows the generality of our method.

Indexed as

AlgorithmsAmino Acid SequenceArtificial IntelligenceBase SequenceBiomarkers, TumorComputer SimulationDatabases, ProteinData MiningDNA Mutational AnalysisGenetic MarkersGenetic Predisposition to DiseaseHumansModels, StatisticalMolecular Sequence DataMutation, MissenseNeoplasm ProteinsBiomarkers, TumorGenetic MarkersNeoplasm Proteins

Identifiers

PMID25250338
PMCPMC4163459
OpenAlexW2026371655

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.