Browse
Submit Data
Databases
API
Help

Dataset Information

26 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

PredPSD: A Gradient Tree Boosting Approach for Single-Stranded and Double-Stranded DNA Binding Protein Prediction.

ABSTRACT: Interactions between proteins and DNAs play essential roles in many biological processes. DNA binding proteins can be classified into two categories. Double-stranded DNA-binding proteins (DSBs) bind to double-stranded DNA and are involved in a series of cell functions such as gene expression and regulation. Single-stranded DNA-binding proteins (SSBs) are necessary for DNA replication, recombination, and repair and are responsible for binding to the single-stranded DNA. Therefore, the effective classification of DNA-binding proteins is helpful for functional annotations of proteins. In this work, we propose PredPSD, a computational method based on sequence information that accurately predicts SSBs and DSBs. It introduces three novel feature extraction algorithms. In particular, we use the autocross-covariance (ACC) transformation to transform feature matrices into fixed-length vectors. Then, we put the optimal feature subset obtained by the minimal-redundancy-maximal-relevance criterion (mRMR) feature selection algorithm into the gradient tree boosting (GTB). In 10-fold cross-validation based on a benchmark dataset, PredPSD achieves promising performances with an AUC score of 0.956 and an accuracy of 0.912, which are better than those of existing methods. Moreover, our method has significantly improved the prediction accuracy in independent testing. The experimental results show that PredPSD can significantly recognize the binding specificity and differentiate DSBs and SSBs.

SUBMITTER: Tan C

PROVIDER: S-EPMC6982935 | biostudies-literature |

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Similar Datasets

Analysis and prediction of single-stranded and double-stranded DNA binding proteins based on protein sequences.

Project description:BackgroundDNA-binding proteins perform important functions in a great number of biological activities. DNA-binding proteins can interact with ssDNA (single-stranded DNA) or dsDNA (double-stranded DNA), and DNA-binding proteins can be categorized as single-stranded DNA-binding proteins (SSBs) and double-stranded DNA-binding proteins (DSBs). The identification of DNA-binding proteins from amino acid sequences can help to annotate protein functions and understand the binding specificity. In this study, we systematically consider a variety of schemes to represent protein sequences: OAAC (overall amino acid composition) features, dipeptide compositions, PSSM (position-specific scoring matrix profiles) and split amino acid composition (SAA), and then we adopt SVM (support vector machine) and RF (random forest) classification model to distinguish SSBs from DSBs.ResultsOur results suggest that some sequence features can significantly differentiate DSBs and SSBs. Evaluated by 10 fold cross-validation on the benchmark datasets, our prediction method can achieve the accuracy of 88.7% and AUC (area under the curve) of 0.919. Moreover, our method has good performance in independent testing.ConclusionsUsing various sequence-derived features, a novel method is proposed to distinguish DSBs and SSBs accurately. The method also explores novel features, which could be helpful to discover the binding specificity of DNA-binding proteins.

| S-EPMC5469069 | biostudies-literature

Coordinated Binding of Single-Stranded and Double-Stranded DNA by UvsX Recombinase.

Project description:Homologous recombination is important for the error-free repair of DNA double-strand breaks and for replication fork restart. Recombinases of the RecA/Rad51 family perform the central catalytic role in this process. UvsX recombinase is the RecA/Rad51 ortholog of bacteriophage T4. UvsX and other recombinases form presynaptic filaments on ssDNA that are activated to search for homology in dsDNA and to perform DNA strand exchange. To effectively initiate recombination, UvsX must find and bind to ssDNA within an excess of dsDNA. Here we examine the binding of UvsX to ssDNA and dsDNA in the presence and absence of nucleotide cofactor, ATP. We also examine how the binding of one DNA substrate is affected by simultaneous binding of the other to determine how UvsX might selectively assemble on ssDNA. We show that the two DNA binding sites of UvsX are regulated by the nucleotide cofactor ATP and are coordinated with each other such that in the presence of ssDNA, dsDNA binding is significantly reduced and correlated with its homology to the ssDNA bound to the enzyme. UvsX has high affinity for dsDNA in the absence of ssDNA, which may allow for sequestration of the enzyme in an inactive form prior to ssDNA generation.

| S-EPMC3688935 | biostudies-literature

Identification of single-stranded and double-stranded DNA binding proteins based on protein structure.

Project description:BackgroundProtein-DNA interactions are essential for many biological processes. However, the structural mechanisms underlying these interactions are not fully understood. DNA binding proteins can be classified into double-stranded DNA binding proteins (DSBs) and single-stranded DNA binding proteins (SSBs), and they take part in different biological functions. DSBs usually act as transcriptional factors to regulate the genes' expressions, while SSBs usually play roles in DNA replication, recombination, and repair, etc. Understanding the binding specificity of a DNA binding protein is helpful for the research of protein functions.ResultsIn this paper, we investigated the differences between DSBs and SSBs on surface tunnels as well as the OB-fold domain information. We detected the largest clefts on the protein surfaces, to obtain several features to be used for distinguishing the potential interfaces between SSBs and DSBs, and compared its structure with each of the six OB-fold protein templates, and use the maximal alignment score TM-score as the OB-fold feature of the protein, based on which, we constructed the support vector machine (SVM) classification model to automatically distinguish these two kinds of proteins, with prediction accuracy of 87%,83% and 83% for HOLO-set, APO-set and Mixed-set respectively.ConclusionsWe found that they have different ranges of tunnel lengths and tunnel curvatures; moreover, the alignment results with OB-fold templates have also found to be the discriminative feature of SSBs and DSBs. Experimental results on 10-fold cross validation indicate that the new feature set are effective to describe DNA binding proteins. The evaluation results on both bound (DNA-bound) and non-bound (DNA-free) proteins have shown the satisfactory performance of our method.

| S-EPMC4243121 | biostudies-literature

Analysis and classification of DNA-binding sites in single-stranded and double-stranded DNA-binding proteins using protein information.

Project description:Single-stranded DNA-binding proteins (SSBs) and double-stranded DNA-binding proteins (DSBs) play different roles in biological processes when they bind to single-stranded DNA (ssDNA) or double-stranded DNA (dsDNA). However, the underlying binding mechanisms of SSBs and DSBs have not yet been fully understood. Here, the authors firstly constructed two groups of ssDNA and dsDNA specific binding sites from two non-redundant sets of SSBs and DSBs. They further analysed the relationship between the two classes of binding sites and a newly proposed set of features (residue charge distribution, secondary structure and spatial shape). To assess and utilise the predictive power of these features, they trained a classification model using support vector machine to make predictions about the ssDNA and the dsDNA binding sites. The author's analysis and prediction results indicated that the two classes of binding sites can be distinguishable by the three types of features, and the final classifier using all the features achieved satisfactory performance. In conclusion, the proposed features will deepen their understanding of the specificity of proteins which bind to ssDNA or dsDNA.

| S-EPMC8687298 | biostudies-literature

Rolling circle replication requires single-stranded DNA binding protein to avoid termination and production of double-stranded DNA.

Project description:In rolling circle replication, a circular template of DNA is replicated as a long single-stranded DNA concatamer that spools off when a strand displacing polymerase traverses the circular template. The current view is that this type of replication can only produce single-stranded DNA, because the only 3'-ends available are the ones being replicated along the circular templates. In contrast to this view, we find that rolling circle replication in vitro generates large amounts of double stranded DNA and that the production of single-stranded DNA terminates after some time. These properties can be suppressed by adding single-stranded DNA-binding proteins to the reaction. We conclude that a model in which the polymerase switches templates to the already produced single-stranded DNA, with an exponential distribution of template switching, can explain the observed data. From this, we also provide an estimate value of the switching rate constant.

| S-EPMC4176320 | biostudies-literature

Identify DNA-Binding Proteins Through the Extreme Gradient Boosting Algorithm.

Project description:The exploration of DNA-binding proteins (DBPs) is an important aspect of studying biological life activities. Research on life activities requires the support of scientific research results on DBPs. The decline in many life activities is closely related to DBPs. Generally, the detection method for identifying DBPs is achieved through biochemical experiments. This method is inefficient and requires considerable manpower, material resources and time. At present, several computational approaches have been developed to detect DBPs, among which machine learning (ML) algorithm-based computational techniques have shown excellent performance. In our experiments, our method uses fewer features and simpler recognition methods than other methods and simultaneously obtains satisfactory results. First, we use six feature extraction methods to extract sequence features from the same group of DBPs. Then, this feature information is spliced together, and the data are standardized. Finally, the extreme gradient boosting (XGBoost) model is used to construct an effective predictive model. Compared with other excellent methods, our proposed method has achieved better results. The accuracy achieved by our method is 78.26% for PDB2272 and 85.48% for PDB186. The accuracy of the experimental results achieved by our strategy is similar to that of previous detection methods.

| S-EPMC8837382 | biostudies-literature

Human Age Prediction Based on DNA Methylation Using a Gradient Boosting Regressor.

Project description:All tissues of organisms will become old as time goes on. In recent years, epigenetic investigations have found that there is a close correlation between DNA methylation and aging. With the development of DNA methylation research, a quantitative statistical relationship between DNA methylation and different ages was established based on the change rule of methylation with age, it is then possible to predict the age of individuals. All the data in this work were retrieved from the Illumina HumanMethylation BeadChip platform (27K or 450K). We analyzed 16 sets of healthy samples and 9 sets of diseased samples. The healthy samples included a total of 1899 publicly available blood samples (0⁻103 years old) and the diseased samples included 2395 blood samples. Six age-related CpG sites were selected through calculating Pearson correlation coefficients between age and DNA methylation values. We built a gradient boosting regressor model for these age-related CpG sites. 70% of the data was randomly selected as training data and the other 30% as independent data in each dataset for 25 runs in total. In the training dataset, the healthy samples showed that the correlation between predicted age and DNA methylation was 0.97, and the mean absolute deviation (MAD) was 2.72 years. In the independent dataset, the MAD was 4.06 years. The proposed model was further tested using the diseased samples. The MAD was 5.44 years for the training dataset and 7.08 years for the independent dataset. Furthermore, our model worked well when it was applied to saliva samples. These results illustrated that the age prediction based on six DNA methylation markers is very effective using the gradient boosting regressor.

| S-EPMC6162650 | biostudies-literature

Gradient Boosting Decision Tree Algorithm for the Prediction of Postoperative Intraocular Lens Position in Cataract Surgery.

Project description:PurposeTo develop a method for predicting postoperative anterior chamber depth (ACD) in cataract surgery patients based on preoperative biometry, demographics, and intraocular lens (IOL) power.MethodsPatients who underwent cataract surgery and had both preoperative and postoperative biometry measurements were included. Patient demographics and IOL power were collected from the Sight Outcomes Research Collaborative (SOURCE) database. A gradient-boosting decision tree model was developed to predict the postoperative ACD. The mean absolute error (MAE) and median absolute error (MedAE) were used as evaluation metrics. The performance of the proposed method was compared with five existing formulas.ResultsIn total, 847 patients were assigned randomly in a 4:1 ratio to a training/validation set (678 patients) and a testing set (169 patients). Using preoperative biometry and patient sex as predictors, the presented method achieved an MAE of 0.106 ± 0.098 (SD) on the testing set, and a MedAE of 0.082. MAE was significantly lower than that of the five existing methods (P < 0.01). When keratometry was excluded, our method attained an MAE of 0.123 ± 0.109, and a MedAE of 0.093. When IOL power was used as an additional predictor, our method achieved an MAE of 0.105 ± 0.091 and a MedAE of 0.080.ConclusionsThe presented machine learning method achieved greater accuracy than previously reported methods for the prediction of postoperative ACD.Translational relevanceIncreasing accuracy of postoperative ACD prediction with the presented algorithm has the potential to improve refractive outcomes in cataract surgery.

| S-EPMC7757635 | biostudies-literature

Accurate prediction of functional effects for variants by combining gradient tree boosting with optimal neighborhood properties.

Project description:Single amino acid variations (SAVs) potentially alter biological functions, including causing diseases or natural differences between individuals. Identifying the relationship between a SAV and certain disease provides the starting point for understanding the underlying mechanisms of specific associations, and can help further prevention and diagnosis of inherited disease.We propose PredSAV, a computational method that can effectively predict how likely SAVs are to be associated with disease by incorporating gradient tree boosting (GTB) algorithm and optimally selected neighborhood features. A two-step feature selection approach is used to explore the most relevant and informative neighborhood properties that contribute to the prediction of disease association of SAVs across a wide range of sequence and structural features, especially some novel structural neighborhood features. In cross-validation experiments on the benchmark dataset, PredSAV achieves promising performances with an AUC score of 0.908 and a specificity of 0.838, which are significantly better than that of the other existing methods. Furthermore, we validate the capability of our proposed method by an independent test and gain a competitive advantage as a result. PredSAV, which combines gradient tree boosting with optimally selected neighborhood features, can return reliable predictions in distinguishing between disease-associated and neutral variants. Compared with existing methods, PredSAV shows improved specificity as well as increased overall performance.

| S-EPMC5470696 | biostudies-literature

Double-stranded telomeric DNA binding proteins: Diversity matters.

Project description:Telomeric sequences constitute only a small fraction of the whole genome yet they are crucial for ensuring genomic stability. This function is in large part mediated by protein complexes recruited to telomeric sequences by specific telomere-binding proteins (TBPs). Although the principal tasks of nuclear telomeres are the same in all eukaryotes, TBPs in various taxa exhibit a surprising diversity indicating their distinct evolutionary origin. This diversity is especially pronounced in ascomycetous yeasts where they must have co-evolved with rapidly diversifying sequences of telomeric repeats. In this article we (i) provide a historical overview of the discoveries leading to the current list of TBPs binding to double-stranded (ds) regions of telomeres, (ii) describe examples of dsTBPs highlighting their diversity in even closely related species, and (iii) speculate about possible evolutionary trajectories leading to a long list of various dsTBPs fulfilling the same general role(s) in their own unique ways.

| S-EPMC5587031 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data