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
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
Practical solutions to the problem of diagonal dominance in kernel document clustering
Greene, D., & Cunningham, P. (2006) · Proceedings of the 23rd international conference on Machine learning - ICML '06 · doi:10.1145/1143844.1143892 · Cited by 616
A brief survey on sequence classification
Xing, Z., Pei, J., & Keogh, E. (2010) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1882471.1882478 · Cited by 553
Machine Learning Methods for Small Data Challenges in Molecular Science
Dou, B., Zhu, Z., Merkurjev, E., Ke, L., Chen, L., Jiang, J., Zhu, Y., Liu, J., Zhang, B., & Wei, G.-W. (2023) · Chemical Reviews · doi:10.1021/acs.chemrev.3c00189 · Cited by 499
A Survey on Metric Learning for Feature Vectors and Structured Data
Bellet, A., Habrard, A., & Sebban, M. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1306.6709 · Cited by 494
Molecular evolution of peptidergic signaling systems in bilaterians
Mirabeau, O., & Joly, J.-S. (2013) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1219956110 · Cited by 422
Applications of Support Vector Machines in Chemistry
Ivanciuc, O. (2007) · Reviews in Computational Chemistry · doi:10.1002/9780470116449.ch6 · Cited by 384
Hajisharifi, Z., Piryaiee, M., Mohammad Beigi, M., Behbahani, M., & Mohabatkar, H. (2014) · Journal of Theoretical Biology · doi:10.1016/j.jtbi.2013.08.037 · Cited by 294
Finding the Best Classification Threshold in Imbalanced Classification
Zou, Q., Xie, S., Lin, Z., Wu, M., & Ju, Y. (2016) · Big Data Research · doi:10.1016/j.bdr.2015.12.001 · Cited by 281
Liu, B., Zhang, D., Xu, R., Xu, J., Wang, X., Chen, Q., Dong, Q., & Chou, K.-C. (2014) · Bioinformatics · doi:10.1093/bioinformatics/btt709 · Cited by 270
The benefits (and misfortunes) of SDS in top-down proteomics
Kachuk, C., & Doucette, A. A. (2018) · Journal of Proteomics · doi:10.1016/j.jprot.2017.03.002 · Cited by 39
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.