The DOI matches its Crossref record.
Variations on probabilistic suffix trees: statistical modeling and prediction of protein families
Open accessAbstract
Motivation: We present a method for modeling protein families by means of probabilistic suffix trees (PSTs). The method is based on identifying significant patterns in a set of related protein sequences. The patterns can be of arbitrary length, and the input sequences do not need to be aligned, nor is delineation of domain boundaries required. The method is automatic, and can be applied, without assuming any preliminary biological information, with surprising success. Basic biological considerations such as amino acid background probabilities, and amino acids substitution probabilities can be incorporated to improve performance. Results: The PST can serve as a predictive tool for protein sequence classification, and for detecting conserved patterns (possibly functionally or structurally important) within protein sequences. The method was tested on the Pfam database of protein families with more than satisfactory performance. Exhaustive evaluations show that the PST model detects much more related sequences than pairwise methods such as Gapped-BLAST, and is almost as sensitive as a hidden Markov model that is trained from a multiple alignment of the input sequences, while being much faster. Availability: The programs are available upon request from the authors. Contact: jill@cs.huji.ac.il; golan@cs.cornell.edu * To whom correspondence should be addressed. 3 Address starting from January 2001: Department of Computer Science, Cornell University, Ithaca, NY 14853, USA.
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
Cited by
Chandola, V., Banerjee, A., & Kumar, V. (2009) · ACM Computing Surveys · doi:10.1145/1541880.1541882 · Cited by 11,687
On Prediction Using Variable Order Markov Models
Begleiter, R., El-Yaniv, R., & Yona, G. (2004) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1491 · Cited by 258
Self-citationEvent-based classification of social media streams
Reuter, T., & Cimiano, P. (2012) · Proceedings of the 2nd ACM International Conference on Multimedia Retrieval · doi:10.1145/2324796.2324824 · Cited by 98
Metadata
- Authors
- Bejerano, G., & Yona, G.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2001-01-01
- Volume
- 17
- Issue
- 1
- Pages
- 23-43
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2129995544
- Cited by
- 167
- References
- 0
- FWCI
- 2.82
- Type
- journal article
- Language
- en
- Open access
- hybrid
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: Variations on probabilistic suffix trees: statistical modeling and prediction of protein families. https://app.cochat.ai/papers/10.1093/bioinformatics/17.1.23
- The paper
- Bejerano, G., & Yona, G. (2001). Variations on probabilistic suffix trees: statistical modeling and prediction of protein families. Bioinformatics. https://doi.org/10.1093/bioinformatics/17.1.23
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.