Dataset Information

Network-based characterization and prediction of human DNA repair genes and pathways.

ABSTRACT: Network biology is a useful strategy to understand cell's functional organization. In this study, for the first time, we successfully introduced network approaches to study properties of human DNA repair genes. Compared with non-DNA repair genes, we found distinguishing features for DNA repair genes: (i) they tend to have higher degrees; (ii) they tend to be located at global network center; (iii) they tend to interact directly with each other. Based on these features, we developed the first algorithm to predict new DNA repair genes. We tested several machine-learning models and found that support vector machine with kernel function of radial basis function (RBF) achieve the best performance, with precision?=?0.74 and area under curve (AUC)?=?0.96. In the end, we applied the algorithm to predict new DNA repair genes and got 32 new candidates. Literature supporting four of the predictions was found. We believe the network approaches introduced here might open a new avenue to understand DNA repair genes and pathways. The suggested algorithm and the predicted genes might be helpful for scientists in the field.

SUBMITTER: Li YH

PROVIDER: S-EPMC5377940 | biostudies-literature | 2017 Apr

REPOSITORIES: biostudies-literature

ACCESS DATA

Publications

Network-based characterization and prediction of human DNA repair genes and pathways.

Li Yan-Hui YH Zhang Gai-Gai GG

Scientific reports 20170403

Network biology is a useful strategy to understand cell's functional organization. In this study, for the first time, we successfully introduced network approaches to study properties of human DNA repair genes. Compared with non-DNA repair genes, we found distinguishing features for DNA repair genes: (i) they tend to have higher degrees; (ii) they tend to be located at global network center; (iii) they tend to interact directly with each other. Based on these features, we developed the first alg ...[more]

PMID: 28368026

Similar Datasets

Project description:In recent years, high-throughput protein interaction identification methods have generated a large amount of data. When combined with the results from other in vivo and in vitro experiments, a complex set of relationships between biological molecules emerges. The growing popularity of network analysis and data mining has allowed researchers to recognize indirect connections between these molecules. Due to the interdependent nature of network entities, evaluating proteins in this context can reveal relationships that may not otherwise be evident.We examined the human protein interaction network as it relates to human illness using the Disease Ontology. After calculating several topological metrics, we trained an alternating decision tree (ADTree) classifier to identify disease-associated proteins. Using a bootstrapping method, we created a tree to highlight conserved characteristics shared by many of these proteins. Subsequently, we reviewed a set of non-disease-associated proteins that were misclassified by the algorithm with high confidence and searched for evidence of a disease relationship.Our classifier was able to predict disease-related genes with 79% area under the receiver operating characteristic (ROC) curve (AUC), which indicates the tradeoff between sensitivity and specificity and is a good predictor of how a classifier will perform on future data sets. We found that a combination of several network characteristics including degree centrality, disease neighbor ratio, eccentricity, and neighborhood connectivity help to distinguish between disease- and non-disease-related proteins. Furthermore, the ADTree allowed us to understand which combinations of strongly predictive attributes contributed most to protein-disease classification. In our post-processing evaluation, we found several examples of potential novel disease-related proteins and corresponding literature evidence. In addition, we showed that first- and second-order neighbors in the PPI network could be used to identify likely disease associations.We analyzed the human protein interaction network and its relationship to disease and found that both the number of interactions with other proteins and the disease relationship of neighboring proteins helped to determine whether a protein had a relationship to disease. Our classifier predicted many proteins with no annotated disease association to be disease-related, which indicated that these proteins have network characteristics that are similar to disease-related proteins and may therefore have disease associations not previously identified. By performing a post-processing step after the prediction, we were able to identify evidence in literature supporting this possibility. This method could provide a useful filter for experimentalists searching for new candidate protein targets for drug repositioning and could also be extended to include other network and data types in order to refine these predictions.

Project description:Human longevity is a complex phenotype that has a significant genetic predisposition. Like other biological processes, ageing process is governed through the regulation of signaling pathways and transcription factors. The DNA damage theory of ageing suggests that ageing is a consequence of un-repaired DNA damage accumulation. Intensive research has been carried out to elucidate the role of DNA repair systems in the ageing process. Decision Trees and Naive Bayesian Algorithm are two data-mining based classification methods for systematically analyzing data about human DNA repair genes. In this paper we develop a linearly combined kernel with Support Vector Machine (SVM) to analyze the ageing related data. The popular supervised learning algorithm enables better discrimination between ageing-related and non-ageing-related DNA repair genes. The linear combination of linear kernel and polynomial kernel of degree 3 in conjunction with SVM allows better classification accuracy in DNA repair gene data set. Compared to Decision Trees and Naive Bayesian Algorithm, SVM with the proposed kernel can achieve 65% AUC (Area Under ROC Curve) values, in contrast to 51.1% and 52.1% respectively. More importantly, we obtain 5 significant ageingrelated genes selected through the training on the whole data set and they are PCNA, PARP, APEX1, MLH1 and XRCC6. Different from the two methods, we can identify another important gene PCNA in the pathways the two methods targeted, while they failed to. And two novel genes PARP, MLH1 are selected as well. The two genes might provide potential insights for biologists in ageing research. SVM is a powerful and robust classification algorithm that can yield higher predictive accuracies. The selection of proper kernel plays a more important role in fulfilling the classification task. The important genes identified not only can target critical pathways related to ageing but also detected genes that may reveal possible related ageing biomarkers.

Dataset Information

Network-based characterization and prediction of human DNA repair genes and pathways.

Publications

Network-based characterization and prediction of human DNA repair genes and pathways.

Similar Datasets

OmicsDI is part of the ELIXIR infrastructure

Tweets