The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Protein homology detection using string alignment kernels
Abstract
Motivation: Remote homology detection between protein sequences is a central problem in computational biology. Discriminative methods involving support vector machines (SVMs) are currently the most effective methods for the problem of superfamily recognition in the Structural Classification Of Proteins (SCOP) database. The performance of SVMs depends critically on the kernel function used to quantify the similarity between sequences. Results: We propose new kernels for strings adapted to biological sequences, which we call local alignment kernels. These kernels measure the similarity between two sequences by summing up scores obtained from local alignments with gaps of the sequences. When tested in combination with SVM on their ability to recognize SCOP superfamilies on a benchmark dataset, the new kernels outperform state-of-the-art methods for remote homology detection. Availability: Software and data available upon request.
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
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
Gapped BLAST and PSI-BLAST: a new generation of protein database search programs
Altschul, S. (1997) · Nucleic Acids Research · doi:10.1093/nar/25.17.3389 · Cited by 73,302
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Wu, Y. (1999) · Technometrics · doi:10.1080/00401706.1999.10485951 · Cited by 27,221
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
A training algorithm for optimal margin classifiers
Boser, B. E., Guyon, I. M., & Vapnik, V. N. (1992) · Proceedings of the fifth annual workshop on Computational learning theory · doi:10.1145/130385.130401 · Cited by 11,992
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
Schölkopf, B., & Smola, A. J. (2001) · The MIT Press eBooks · doi:10.7551/mitpress/4175.001.0001 · Cited by 11,703
Identification of common molecular subsequences
Smith, T. F., & Waterman, M. S. (1981) · Journal of Molecular Biology · doi:10.1016/0022-2836(81)90087-5 · Cited by 9,940
Murzin, A. G., Brenner, S. E., Hubbard, T., & Chothia, C. (1995) · Journal of Molecular Biology · doi:10.1016/s0022-2836(05)80134-2 · Cited by 6,445
Learning With Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
Williams, C. K. I. (2003) · Journal of the American Statistical Association · doi:10.1198/jasa.2003.s269 · Cited by 4,281
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
An Introduction to Support Vector Machines and Other Kernel‐based Learning Methods
(2001) · Kybernetes · doi:10.1108/k.2001.30.1.103.6 · Cited by 3,308
[5] Rapid and sensitive sequence comparison with FASTP and FASTA
Pearson, W. R. (1990) · Methods in Enzymology · doi:10.1016/0076-6879(90)83007-v · Cited by 1,946
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
Advances in Large-Margin Classifiers
(2000) · The MIT Press eBooks · doi:10.7551/mitpress/1113.001.0001 · Cited by 1,869
The KEGG databases at GenomeNet
Kanehisa, M. (2002) · Nucleic Acids Research · doi:10.1093/nar/30.1.42 · Cited by 1,504
Harmonic Analysis on Semigroups
Berg, C., Christensen, J. P. R., & Ressel, P. (1984) · Graduate Texts in Mathematics · doi:10.1007/978-1-4612-1128-0 · Cited by 1,134
Hidden Markov models for detecting remote protein homologies.
Karplus, K., Barrett, C., & Hughey, R. (1998) · Bioinformatics · doi:10.1093/bioinformatics/14.10.846 · Cited by 1,102
Convolution kernels on discrete structures
Haussler, D. H. (1999) · Cited by 1,089
Kernel Methods in Computational Biology
(2004) · The MIT Press eBooks · doi:10.7551/mitpress/4057.001.0001 · Cited by 1,032
THE SPECTRUM KERNEL: A STRING KERNEL FOR SVM PROTEIN CLASSIFICATION
LESLIE, C., ESKIN, E., & NOBLE, W. S. (2001) · Biocomputing 2002 · doi:10.1142/9789812799623_0053 · Cited by 927
A Discriminative Framework for Detecting Remote Protein Homologies
Jaakkola, T., Diekhans, M., & Haussler, D. (2000) · Journal of Computational Biology · doi:10.1089/10665270050081405 · Cited by 496
Gribskov, M., Lothy, R., & Eisenberg, D. (1990) · Methods in Enzymology · doi:10.1016/0076-6879(90)83011-w · Cited by 472
Use of receiver operating characteristic (ROC) analysis to evaluate sequence matching
Gribskov, M., & Robinson, N. L. (1996) · Computers & Chemistry · doi:10.1016/s0097-8485(96)80004-0 · Cited by 468
Hidden Markov models of biological primary sequence information.
Baldi, P., Chauvin, Y., Hunkapiller, T., & McClure, M. A. (1994) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.91.3.1059 · Cited by 450
Watkins, C. (2000) · Advances in Large-Margin Classifiers · doi:10.7551/mitpress/1113.003.0006 · Cited by 244
Liao, L., & Noble, W. S. (2002) · doi:10.1145/565196.565225 · Cited by 145
A Kernel Approach for Learning from almost Orthogonal Patterns
Schölkopf, B., Weston, J., Eskin, E., Leslie, C. S., & Noble, W. S. (2002) · Lecture notes in computer science · doi:10.1007/3-540-36755-1_44 · Cited by 69
A Kernel Approach for Learning from Almost Orthogonal Patterns
Schölkopf, B., Weston, J., Eskin, E., Leslie, C. S., & Noble, W. S. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45681-3_42 · Cited by 21
Cited by
(2006) · The MIT Press eBooks · doi:10.7551/mitpress/9780262033589.001.0001 · Cited by 4,280
Kernel Methods in Computational Biology
(2004) · The MIT Press eBooks · doi:10.7551/mitpress/4057.001.0001 · Cited by 1,032
Predicting linear B‐cell epitopes using string kernels
EL‐Manzalawy, Y., Dobbs, D., & Honavar, V. (2008) · Journal of Molecular Recognition · doi:10.1002/jmr.893 · Cited by 753
Liu, Y., & Wu, Y.-F. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.11268 · Cited by 663
Supervised prediction of drug–target interactions using bipartite local models
Bleakley, K., & Yamanishi, Y. (2009) · Bioinformatics · doi:10.1093/bioinformatics/btp433 · Cited by 628
Metadata
- Authors
- Saigo, H., Vert, J.-P., Ueda, N., & Akutsu, T.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2004-02-26
- Volume
- 20
- Issue
- 11
- Pages
- 1682-1689
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2121950477
- Cited by
- 379
- References
- 29
- FWCI
- 8.09
- Type
- journal article
- Language
- en
- Open access
- closed
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
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.