The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A comparison of profile hidden Markov model procedures for remote homology detection
Open accessAbstract
Profile hidden Markov models (HMMs) are amongst the most successful procedures for detecting remote homology between proteins. There are two popular profile HMM programs, HMMER and SAM. Little is known about their performance relative to each other and to the recently improved version of PSI-BLAST. Here we compare the two programs to each other and to non-HMM methods, to determine their relative performance and the features that are important for their success. The quality of the multiple sequence alignments used to build models was the most important factor affecting the overall performance of profile HMMs. The SAM T99 procedure is needed to produce high quality alignments automatically, and the lack of an equivalent component in HMMER makes it less complete as a package. Using the default options and parameters as would be expected of an inexpert user, it was found that from identical alignments SAM consistently produces better models than HMMER and that the relative performance of the model-scoring components varies. On average, HMMER was found to be between one and three times faster than SAM when searching databases larger than 2000 sequences, SAM being faster on smaller ones. Both methods were shown to have effective low complexity and repeat sequence masking using their null models, and the accuracy of their E-values was comparable. It was found that the SAM T99 iterative database search procedure performs better than the most recent version of PSI-BLAST, but that scoring of PSI-BLAST profiles is more than 30 times faster than scoring of SAM models.
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
A new approach to protein fold recognition
Jones, D. T., Taylort, W. R., & Thornton, J. M. (1992) · Nature · doi:10.1038/358086a0 · Cited by 1,221
Cited by
Accelerated Profile HMM Searches
Eddy, S. R. (2011) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1002195 · Cited by 6,975
Hidden Markov model speed heuristic and iterative HMM search procedure
Johnson, L. S., Eddy, S. R., & Portugaly, E. (2010) · BMC Bioinformatics · doi:10.1186/1471-2105-11-431 · Cited by 1,378
Evolution of transcription factors and the gene regulatory network in Escherichia coli
Madan Babu, M. (2003) · Nucleic Acids Research · doi:10.1093/nar/gkg210 · Cited by 353
Al-Lazikani, B., Jung, J., Xiang, Z., & Honig, B. (2001) · Current Opinion in Chemical Biology · doi:10.1016/s1367-5931(00)00164-2 · Cited by 316
The hornwort genome and early land plant evolution
Zhang, J., Fu, X.-X., Li, R.-Q., Zhao, X., Liu, Y., Li, M.-H., Zwaenepoel, A., Ma, H., Goffinet, B., Guan, Y.-L., et al. (2020) · Nature Plants · doi:10.1038/s41477-019-0588-4 · Cited by 312
Metadata
- Authors
- Madera, M.
- Venue
- Nucleic Acids Research
- Publisher
- Oxford University Press (OUP)
- Published
- 2002-10-01
- Volume
- 30
- Issue
- 19
- Pages
- 4321-4328
- ISSN
- 0305-1048 (ISSN-L)
- 1362-4962
- OpenAlex
- W2164886928
- Cited by
- 171
- References
- 1
- FWCI
- 3.56
- Type
- journal article
- Language
- en
- Open access
- bronze
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: A comparison of profile hidden Markov model procedures for remote homology detection. https://app.cochat.ai/papers/10.1093/nar/gkf544
- The paper
- Madera, M. (2002). A comparison of profile hidden Markov model procedures for remote homology detection. Nucleic Acids Research. https://doi.org/10.1093/nar/gkf544
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.