DNA Familial Binding Profiles Made Easy: Comparison of Various Motif Alignment and Clustering Strategies
Open accessThe DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
Transcription factor (TF) proteins recognize a small number of DNA sequences with high specificity and control the expression of neighbouring genes. The evolution of TF binding preference has been the subject of a number of recent studies, in which generalized binding profiles have been introduced and used to improve the prediction of new target sites. Generalized profiles are generated by aligning and merging the individual profiles of related TFs. However, the distance metrics and alignment algorithms used to compare the binding profiles have not yet been fully explored or optimized. As a result, binding profiles depend on TF structural information and sometimes may ignore important distinctions between subfamilies. Prediction of the identity or the structural class of a protein that binds to a given DNA pattern will enhance the analysis of microarray and ChIP-chip data where frequently multiple putative targets of usually unknown TFs are predicted. Various comparison metrics and alignment algorithms are evaluated (a total of 105 combinations). We find that local alignments are generally better than global alignments at detecting eukaryotic DNA motif similarities, especially when combined with the sum of squared distances or Pearson's correlation coefficient comparison metrics. In addition, multiple-alignment strategies for binding profiles and tree-building methods are tested for their efficiency in constructing generalized binding models. A new method for automatic determination of the optimal number of clusters is developed and applied in the construction of a new set of familial binding profiles which improves upon TF classification accuracy. A software tool, STAMP, is developed to host all tested methods and make them publicly available. This work provides a high quality reference set of familial binding profiles and the first comprehensive platform for analysis of DNA profiles. Detecting similarities between DNA motifs is a key step in the comparative study of transcriptional regulation, and the work presented here will form the basis for tool and method development for future transcriptional modeling studies.
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
Davies, D. L., & Bouldin, D. W. (1979) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1979.4766909 · Cited by 9,145
Estimating the Number of Clusters in a Data Set Via the Gap Statistic
Tibshirani, R., Walther, G., & Hastie, T. (2001) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/1467-9868.00293 · Cited by 6,205
Xie, X., Lu, J., Kulbokas, E. J., Golub, T. R., Mootha, V., Lindblad-Toh, K., Lander, E. S., & Kellis, M. (2005) · Nature · doi:10.1038/nature03441 · Cited by 1,872
Assessing computational tools for the discovery of transcription factor binding sites
Tompa, M., Li, N., Bailey, T. L., Church, G. M., De Moor, B., Eskin, E., Favorov, A. V., Frith, M. C., Fu, Y., Kent, W. J., et al. (2005) · Nature Biotechnology · doi:10.1038/nbt1053 · Cited by 1,268 · cited 1×
“The use of FBPs as prior information focuses the motif search on biologically relevant patterns, offering a way to improve upon the currently limited performance of DNA motif-finders [9].”
Crystal structure of PU. 1/IRF-4/DNA ternary complex
Escalante, C. R., Brass, A. L., Pongubala, J. M. R., Shatova, E., Shen, L., Singh, H., & Aggarwal, A. K. (2002) · Molecular Cell · doi:10.1016/s1097-2765(02)00703-7 · Cited by 154 · cited 1×
“The IRF family consists of wHTH proteins that bind as homodimers via nonpalindromic direct repeats [24] or as monomers cooperatively with other proteins, like ETS [25].”
Background
Cited by
JASPAR 2022: the 9th release of the open-access database of transcription factor binding profiles
Castro-Mondragon, J. A., Riudavets-Puig, R., Rauluseviciute, I., Berhanu Lemma, R., Turchi, L., Blanc-Mathieu, R., Lucas, J., Boddie, P., Khan, A., Manosalva Pérez, N., et al. (2022) · Nucleic Acids Research · doi:10.1093/nar/gkab1113 · Cited by 1,935
iRegulon: From a Gene List to a Gene Regulatory Network Using Large Motif and Track Collections
Janky, R., Verfaillie, A., Imrichová, H., Van de Sande, B., Standaert, L., Christiaens, V., Hulselmans, G., Herten, K., Naval Sanchez, M., Potier, D., et al. (2014) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1003731 · Cited by 900
“The enriched motifs are clustered by STAMP [137] so that similar motifs are visually represented with different colors in the Results table.”
BackgroundFMRP targets distinct mRNA sequence elements to regulate protein expression
Ascano, M., Mukherjee, N., Bandaru, P., Miller, J. B., Nusbaum, J. D., Corcoran, D. L., Langlois, C., Munschauer, M., Dewell, S., Hafner, M., et al. (2012) · Nature · doi:10.1038/nature11737 · Cited by 701
Bryne, J. C., Valen, E., Tang, M.-H. E., Marstrand, T., Winther, O., da Piedade, I., Krogh, A., Lenhard, B., & Sandelin, A. (2007) · Nucleic Acids Research · doi:10.1093/nar/gkm955 · Cited by 692
A transcription factor hierarchy defines an environmental stress response network
Song, L., Huang, S.-S. C., Wise, A., Castanon, R., Nery, J. R., Chen, H., Watanabe, M., Thomas, J., Bar-Joseph, Z., & Ecker, J. R. (2016) · Science · doi:10.1126/science.aag1550 · Cited by 522
Metadata
- Authors
- Mahony, S., Auron, P. E., & Benos, P. V.
- Venue
- PLoS Computational Biology
- Publisher
- Public Library of Science (PLoS)
- Published
- 2007-03-30
- Volume
- 3
- Issue
- 3
- Pages
- e61
- ISSN
- 1553-734X (ISSN-L)
- 1553-7358
- OpenAlex
- W2065635150
- Cited by
- 124
- References
- 5
- FWCI
- 3.95
- Type
- journal article
- Language
- en
- Open access
- gold
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: DNA Familial Binding Profiles Made Easy: Comparison of Various Motif Alignment and Clustering Strategies. https://app.cochat.ai/papers/10.1371/journal.pcbi.0030061
- The paper
- Mahony, S., Auron, P. E., & Benos, P. V. (2007). DNA Familial Binding Profiles Made Easy: Comparison of Various Motif Alignment and Clustering Strategies. PLoS Computational Biology. https://doi.org/10.1371/journal.pcbi.0030061
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.