The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
PhyME: A probabilistic algorithm for finding motifs in sets of orthologous sequences
Open accessAbstract
Background: This paper addresses the problem of discovering transcription factor binding sites in heterogeneous sequence data, which includes regulatory sequences of one or more genes, as well as their orthologs in other species. Results: We propose an algorithm that integrates two important aspects of a motif's significance – overrepresentation and cross-species conservation – into one probabilistic score. The algorithm allows the input orthologous sequences to be related by any user-specified phylogenetic tree. It is based on the Expectation-Maximization technique, and scales well with the number of species and the length of input sequences. We evaluate the algorithm on synthetic data, and also present results for data sets from yeast, fly, and human. Conclusions: The results demonstrate that the new approach improves motif discovery by exploiting multiple species information.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Evolutionary trees from DNA sequences: A maximum likelihood approach.
Felsenstein, J. (1981) · Journal of Molecular Evolution · doi:10.1007/bf01734359 · Cited by 14,571 · cited 1×
“Note that the evolutionary model used by PhyME comes into play only in Equations 2 as the term Pre(ψ|Wm, k). Other models of evolution, e.g., F81 [ 29 ], can be incorporated into PhyME by simply using the appropriate formulation of this term, as long as the derivatives of log Pre(ψ|Wm, k) can be computed efficiently.”
MethodEvolution of Protein Molecules
JUKES, T. H., & CANTOR, C. R. (1969) · Mammalian Protein Metabolism · doi:10.1016/b978-1-4832-3211-9.50009-7 · Cited by 11,032
LAGAN and Multi-LAGAN: Efficient tools for large-scale multiple alignment of genomic DNA
Brudno, M., Do, C. B., Cooper, G. M., Kim, M. F., Davydov, E., Program, N. C. S., Green, E. D., Sidow, A., & Batzoglou, S. (2003) · Genome Research · doi:10.1101/gr.926603 · Cited by 1,115
Cited by
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
Self-citationiRegulon: 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
“These methods could be improved by phylogenetic footprinting [97–103] and by applying genome-scale methods that exploit the entire gene expression data set rather than a set of co-expressed genes [104–106].”
An integrated software system for analyzing ChIP-chip and ChIP-seq data
Ji, H., Jiang, H., Ma, W., Johnson, D. S., Myers, R. M., & Wong, W. H. (2008) · Nature Biotechnology · doi:10.1038/nbt.1505 · Cited by 716
A survey of DNA motif finding algorithms
Das, M. K., & Dai, H.-K. (2007) · BMC Bioinformatics · doi:10.1186/1471-2105-8-s7-s21 · Cited by 429
Metadata
- Authors
- Sinha, S., Blanchette, M., & Tompa, M.
- Venue
- BMC Bioinformatics
- Published
- 2004-10-28
- Volume
- 5
- Issue
- 1
- Pages
- 170-170
- ISSN
- 1471-2105 (ISSN-L)
- OpenAlex
- W2134591904
- Cited by
- 197
- References
- 3
- FWCI
- 8.53
- 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: PhyME: A probabilistic algorithm for finding motifs in sets of orthologous sequences. https://app.cochat.ai/papers/10.1186/1471-2105-5-170
- The paper
- Sinha, S., Blanchette, M., & Tompa, M. (2004). PhyME: A probabilistic algorithm for finding motifs in sets of orthologous sequences. BMC Bioinformatics. https://doi.org/10.1186/1471-2105-5-170
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.