The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Analysis and prediction of DNA-binding proteins and their binding residues based on composition, sequence and structural information
Abstract
Motivation: Though vitally important to cell function, the mechanism of protein–DNA binding has not yet been completely understood. We therefore analysed the relationship between DNA binding and protein sequence composition, solvent accessibility and secondary structure. Using non-redundant databases of transcription factors and protein–DNA complexes, neural network models were developed to utilize the information present in this relationship to predict DNA-binding proteins and their binding residues. Results: Sequence composition was found to provide sufficient information to predict the probability of its binding to DNA with nearly 69% sensitivity at 64% accuracy for the considered proteins; sequence neighbourhood and solvent accessibility information were sufficient to make binding site predictions with 40% sensitivity at 79% accuracy. Detailed analysis of binding residues shows that some three- and five-residue segments frequently bind to DNA and that solvent accessibility plays a major role in binding. Although, binding behaviour was not associated with any particular secondary structure, there were interesting exceptions at the residue level. Over-representation of some residues in the binding sites was largely lost at the total sequence level, but a different kind of compositional preference was observed in DNA-binding proteins. Availability: Online predictions of DNA-binding proteins and binding sites are available at http://www.netasa.org/dbs-pred/
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Gapped BLAST and PSI-BLAST: a new generation of protein database search programs
Altschul, S. (1997) · Nucleic Acids Research · doi:10.1093/nar/25.17.3389 · Cited by 73,302
Kabsch, W., & Sander, C. (1983) · Biopolymers · doi:10.1002/bip.360221211 · Cited by 15,320 · cited 1×
“Solvent accessibility or accessible surface area (ASA) values of 62 protein–DNA complexes were calculated using DSSP program (Kabsch and Sander, 1983).”
MethodThe SWISS-PROT protein knowledgebase and its supplement TrEMBL in 2003
Boeckmann, B. (2003) · Nucleic Acids Research · doi:10.1093/nar/gkg095 · Cited by 3,890
Sequence-specific recognition of double helical nucleic acids by proteins.
Seeman, N. C., Rosenberg, J. M., & Rich, A. (1976) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.73.3.804 · Cited by 1,125
Clustering of highly homologous sequences to reduce the size of large protein databases
Li, W., Jaroszewski, L., & Godzik, A. (2001) · Bioinformatics · doi:10.1093/bioinformatics/17.3.282 · Cited by 1,034
Cuff, J. A., & Barton, G. J. (2000) · Proteins: Structure, Function, and Genetics · doi:10.1002/1097-0134(20000815)40:3<502::aid-prot170>3.0.co;2-q · Cited by 770
Structural Features of Protein−Nucleic Acid Recognition Sites
Nadassy, K., Wodak, S. J., & Janin, J. (1999) · Biochemistry · doi:10.1021/bi982362d · Cited by 335
Removing near-neighbour redundancy from large protein sequence collections.
Holm, L., & Sander, C. (1998) · Bioinformatics · doi:10.1093/bioinformatics/14.5.423 · Cited by 294
Gromiha, M. M., & Selvaraj, S. (2001) · Journal of Molecular Biology · doi:10.1006/jmbi.2001.4775 · Cited by 294
Self-citationLuscombe, N. M., & Thornton, J. M. (2002) · Journal of Molecular Biology · doi:10.1016/s0022-2836(02)00571-5 · Cited by 265
Pabo, C. O., & Nekludova, L. (2000) · Journal of Molecular Biology · doi:10.1006/jmbi.2000.3918 · Cited by 232
Real value prediction of solvent accessibility from amino acid sequence
Ahmad, S., Gromiha, M. M., & Sarai, A. (2003) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.10328 · Cited by 198
Self-citationStructure-based prediction of DNA target sites by regulatory proteins
Kono, H., & Sarai, A. (1999) · Proteins: Structure, Function, and Genetics · doi:10.1002/(sici)1097-0134(19990401)35:1<114::aid-prot11>3.0.co;2-t · Cited by 190
Self-citationA role for CH…O interactions in protein-DNA recognition
Mandel-Gutfreund, Y., Margalit, H., Jernigan, R. L., & Zhurkin, V. B. (1998) · Journal of Molecular Biology · doi:10.1006/jmbi.1998.1660 · Cited by 176
Mandel‐Gutfreund, Y., & Margalit, H. (1998) · Nucleic Acids Research · doi:10.1093/nar/26.10.2306 · Cited by 148
NETASA: neural network based prediction of solvent accessibility
Ahmad, S., & Gromiha, M. M. (2002) · Bioinformatics · doi:10.1093/bioinformatics/18.6.819 · Cited by 103
Self-citationSelvaraj, S., Kono, H., & Sarai, A. (2002) · Journal of Molecular Biology · doi:10.1016/s0022-2836(02)00846-x · Cited by 68
Self-citation
Cited by
Electrostatic Interactions in Protein Structure, Folding, Binding, and Condensation
Zhou, H.-X., & Pang, X. (2018) · Chemical Reviews · doi:10.1021/acs.chemrev.7b00305 · Cited by 1,190
Automated inference of molecular mechanisms of disease from amino acid substitutions
Li, B., Krishnan, V. G., Mort, M. E., Xin, F., Kamati, K. K., Cooper, D. N., Mooney, S. D., & Radivojac, P. (2009) · Bioinformatics · doi:10.1093/bioinformatics/btp528 · Cited by 826
Performance of mutation pathogenicity prediction methods on missense variants
Thusberg, J., Olatubosun, A., & Vihinen, M. (2011) · Human Mutation · doi:10.1002/humu.21445 · Cited by 537
Wang, L., & Brown, S. J. (2006) · Nucleic Acids Research · doi:10.1093/nar/gkl298 · Cited by 417
iDNA-Prot: Identification of DNA Binding Proteins Using Random Forest with Grey Model
Lin, W.-Z., Fang, J.-A., Xiao, X., & Chou, K.-C. (2011) · PLoS ONE · doi:10.1371/journal.pone.0024756 · Cited by 284
Metadata
- Authors
- Ahmad, S., Gromiha, M. M., & Sarai, A.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2004-01-22
- Volume
- 20
- Issue
- 4
- Pages
- 477-486
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2096986143
- Cited by
- 345
- References
- 17
- FWCI
- 6.12
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.