The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Classifying G-protein coupled receptors with support vector machines
Open accessAbstract
Motivation: The enormous amount of protein sequence data uncovered by genome research has increased the demand for computer software that can automate the recognition of new proteins. We discuss the relative merits of various automated methods for recognizing G-Protein Coupled Receptors (GPCRs), a superfamily of cell membrane proteins. GPCRs are found in a wide range of organisms and are central to a cellular signalling network that regulates many basic physiological processes. They are the focus of a significant amount of current pharmaceutical research because they play a key role in many diseases. However, their tertiary structures remain largely unsolved. The methods described in this paper use only primary sequence information to make their predictions. We compare a simple nearest neighbor approach (BLAST), methods based on multiple alignments generated by a statistical profile Hidden Markov Model (HMM), and methods, including Support Vector Machines (SVMs), that transform protein sequences into fixed-length feature vectors. Results: The last is the most computationally expensive method, but our experiments show that, for those interested in annotation-quality classification, the results are worth the effort. In two-fold cross-validation experiments testing recognition of GPCR subfamilies that bind a specific ligand (such as a histamine molecule), the errors per sequence at the Minimum Error Point (MEP) were 13.7% for multi-class SVMs, 17.1% for our SVMtree method of hierarchical multi-class SVM classification, 25.5% for BLAST, 30% for profile HMMs, and 49% for classification based on nearest neighbor feature vector Kernel Nearest Neighbor (kernNN). The percentage of true positives recognized before the first false positive was 65% for both SVM methods, 13% for BLAST, 5% for profile HMMs and 4% for kernNN. Availability: We have set up a web server for GPCR subfamily classification based on hierarchical multi-class SVMs at http://www.soe.ucsc.edu/research/compbio/gpcr-subclass. By scanning predicted peptides found in the human genome with the SVMtree server, we have identified a large number of genes that encode GPCRs. A list of our predictions for human GPCRs is available at http://www.soe.ucsc.edu/research/compbio/gpcr˙hg/class˙results. We also provide suggested subfamily classification for 18 sequences previously identified as unclassified Class A (rhodopsin-like) GPCRs in GPCRDB (Horn et al. , Nucleic Acids Res. , 26, 277–281, 1998), available at http://www.soe.ucsc.edu/research/compbio/gpcr/classA˙unclassified/. Contact: rachelk@soe.ucsc.edu * To whom correspondence should be addressed.
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
Basic local alignment search tool
Altschul, S. F., Gish, W., Miller, W., Myers, E. W., & Lipman, D. J. (1990) · Journal of Molecular Biology · doi:10.1006/jmbi.1990.9999 · Cited by 98,669
An Introduction to Support Vector Machines and Other Kernel-based Learning Methods
Cristianini, N., & Shawe-Taylor, J. (2000) · doi:10.1017/cbo9780511801389 · Cited by 13,855
Probabilistic Outputs for Support vector Machines and Comparisons to Regularized Likelihood Methods
Platt, J. C. (1999) · Cited by 6,385
Crystal Structure of Rhodopsin: A G Protein-Coupled Receptor
Palczewski, K., Kumasaka, T., Hori, T., Behnke, C. A., Motoshima, H., Fox, B. A., Trong, I. L., Teller, D. C., Okada, T., Stenkamp, R. E., et al. (2000) · Science · doi:10.1126/science.289.5480.739 · Cited by 5,637
An Introduction to Support Vector Machines
Cristianini, N., & Shawe-Taylor, J. S. (2000) · ePrints Soton (University of Southampton) · Cited by 4,115
Biological sequence analysis probabilistic models of proteins and nucleic acids
Durbin, R. M., Eddy, S. R., Krogh, A., & Mitchison, G. (1998) · Cited by 3,565
CLUSTAL: a package for performing multiple sequence alignment on a microcomputer
Higgins, D. G., & Sharp, P. M. (1988) · Gene · doi:10.1016/0378-1119(88)90330-7 · Cited by 3,394
A hidden Markov model for predicting transmembrane helices in protein sequences.
Sonnhammer, E. L. L., von HEIJNE, G., & Krogh, A. (1998) · PubMed · Cited by 2,505
Hidden Markov Models in Computational Biology
Krogh, A., Brown, M., Mian, I. S., Sjölander, K., & Haussler, D. (1994) · Journal of Molecular Biology · doi:10.1006/jmbi.1994.1104 · Cited by 1,943
Self-citationLarge Margin DAG's for Multiclass Classification
Platt, J. C., Cristianini, N., & Shawe-Taylor, J. S. (1999) · ePrints Soton (University of Southampton) · Cited by 1,889
Cited by
Cai, C. Z. (2003) · Nucleic Acids Research · doi:10.1093/nar/gkg600 · Cited by 576
A survey of kernels for structured data
Gärtner, T. (2003) · ACM SIGKDD Explorations Newsletter · doi:10.1145/959242.959248 · Cited by 452
Yu, H., Chen, J., Xu, X., Li, Y., Zhao, H., Fang, Y., Li, X., Zhou, W., Wang, W., & Wang, Y. (2012) · PLoS ONE · doi:10.1371/journal.pone.0037608 · Cited by 423
Rao, H. B., Zhu, F., Yang, G. B., Li, Z. R., & Chen, Y. Z. (2011) · Nucleic Acids Research · doi:10.1093/nar/gkr284 · Cited by 359
Classification of Nuclear Receptors Based on Amino Acid Composition and Dipeptide Composition
Bhasin, M., & Raghava, G. P. S. (2004) · Journal of Biological Chemistry · doi:10.1074/jbc.m401932200 · Cited by 352
Metadata
- Authors
- Karchin, R., Karplus, K., & Haussler, D.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2002-01-01
- Volume
- 18
- Issue
- 1
- Pages
- 147-159
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2107427637
- Cited by
- 279
- References
- 22
- FWCI
- 9.07
- 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: Classifying G-protein coupled receptors with support vector machines. https://app.cochat.ai/papers/10.1093/bioinformatics/18.1.147
- The paper
- Karchin, R., Karplus, K., & Haussler, D. (2002). Classifying G-protein coupled receptors with support vector machines. Bioinformatics. https://doi.org/10.1093/bioinformatics/18.1.147
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.