The DOI matches its Crossref record.
CAST: an iterative algorithm for the complexity analysis of sequence tracts
Open accessAbstract
Motivation: Sensitive detection and masking of low-complexity regions in protein sequences. Filtered sequences can be used in sequence comparison without the risk of matching compositionally biased regions. The main advantage of the method over similar approaches is the selective masking of single residue types without affecting other, possibly important, regions. Results: A novel algorithm for low-complexity region detection and selective masking. The algorithm is based on multiple-pass Smith–Waterman comparison of the query sequence against twenty homopolymers with infinite gap penalties. The output of the algorithm is both the masked query sequence for further analysis, e.g. database searches, as well as the regions of low complexity. The detection of low-complexity regions is highly specific for single residue types. It is shown that this approach is sufficient for masking database query sequences without generating false positives. The algorithm is benchmarked against widely available algorithms using the 210 genes of Plasmodium falciparum chromosome 2, a dataset known to contain a large number of low-complexity regions. Availability: CAST (version 1.0) executable binaries are available to academic users free of charge under license. Web site entry point, server and additional material: http://www.ebi.ac.uk/research/cgg/services/cast/ Contact: ouzounis@ebi.ac.uk To whom correspondence should be addressed.
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
Linding, R., Jensen, L. J., Diella, F., Bork, P., Gibson, T. J., & Russell, R. B. (2003) · Structure · doi:10.1016/j.str.2003.10.002 · Cited by 1,212
A Highly Conserved Program of Neuronal Microexons Is Misregulated in Autistic Brains
Irimia, M., Weatheritt, R. J., Ellis, J. D., Parikshak, N. N., Gonatopoulos-Pournatzis, T., Babor, M., Quesnel-Vallières, M., Tapial, J., Raj, B., O’Hanlon, D., et al. (2014) · Cell · doi:10.1016/j.cell.2014.11.035 · Cited by 693
Assessing protein disorder and induced folding
Receveur‐Bréchot, V., Bourhis, J., Uversky, V. N., Canard, B., & Longhi, S. (2006) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.20750 · Cited by 445
Janssen, P. J., Van Houdt, R., Moors, H., Monsieurs, P., Morin, N., Michaux, A., Benotmane, M. A., Leys, N., Vallaeys, T., Lapidus, A., et al. (2010) · PLoS ONE · doi:10.1371/journal.pone.0010433 · Cited by 332
Involvement of Putative SNF2 Chromatin Remodeling Protein DRD1 in RNA-Directed DNA Methylation
Kanno, T., Mette, M. F., Kreil, D. P., Aufsatz, W., Matzke, M., & Matzke, A. J. M. (2004) · Current Biology · doi:10.1016/j.cub.2004.04.037 · Cited by 302
Self-citation
Metadata
- Authors
- Promponas, V. J., Enright, A. J., Tsoka, S., Kreil, D. P., Leroy, C., Hamodrakas, S., Sander, C., & Ouzounis, C. A.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2000-10-01
- Volume
- 16
- Issue
- 10
- Pages
- 915-922
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2104412724
- Cited by
- 170
- References
- 0
- FWCI
- 3.04
- 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: CAST: an iterative algorithm for the complexity analysis of sequence tracts. https://app.cochat.ai/papers/10.1093/bioinformatics/16.10.915
- The paper
- Promponas, V. J., Enright, A. J., Tsoka, S., Kreil, D. P., Leroy, C., Hamodrakas, S., Sander, C., & Ouzounis, C. A. (2000). CAST: an iterative algorithm for the complexity analysis of sequence tracts. Bioinformatics. https://doi.org/10.1093/bioinformatics/16.10.915
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.