The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Fast Kernels for String and Tree Matching
Abstract
In this paper we present a new algorithm suitable for matching discrete objects such as strings and trees in linear time, thus obviating dynamic programming with quadratic time complexity. Furthermore, prediction cost in many cases can be reduced to linear cost in the length of the se-quence to be classified, regardless of the number of support vectors. This improvement on the currently available algorithms makes string kernels a viable alternative for the practitioner. 1
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
Introduction to automata theory, languages and computation
(1981) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(81)90068-9 · Cited by 10,699
Making Large-Scale SVM Learning Practical
Joachims, T. (1998) · RePEc: Research Papers in Economics · doi:10.17877/de290r-14262 · Cited by 4,411
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
Efficient string matching: an aid to bibliographic search
Aho, A. V., & Corasick, M. J. (1975) · Communications of the ACM · doi:10.1145/360825.360855 · Cited by 2,944
The Art of Computer Programming. Volume 1: Fundamental Algorithms.
Odeh, R. E., & Knuth, D. E. (1969) · Journal of the American Statistical Association · doi:10.2307/2283757 · Cited by 2,525
Linear pattern matching algorithms
Weiner, P. (1973) · 14th Annual Symposium on Switching and Automata Theory (swat 1973) · doi:10.1109/swat.1973.13 · Cited by 1,801
Salton, G. (1988) · Cited by 1,587
A Space-Economical Suffix Tree Construction Algorithm
McCreight, E. M. (1976) · Journal of the ACM · doi:10.1145/321941.321946 · Cited by 1,511
On-line construction of suffix trees
Ukkonen, E. (1995) · Algorithmica · doi:10.1007/bf01206331 · Cited by 1,472
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
Convolution Kernels for Natural Language
Collins, M., & Duffy, N. (2002) · Advances in Neural Information Processing Systems 14 · doi:10.7551/mitpress/1120.003.0085 · Cited by 808
Learning Kernel Classifiers: Theory and Algorithms
Herbrich, R. (2001) · The MIT Press eBooks · doi:10.7551/mitpress/4170.001.0001 · Cited by 547
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
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 support vector machines
Altün, Y., Tsochantaridis, I., & Hofmann, T. (2003) · Cited by 458
Text Categorization with Support Vector Machines. How to Represent Texts in Input Space?
Leopold, E., & Kindermann, J. (2002) · Machine Learning · doi:10.1023/a:1012491419635 · Cited by 403
Watkins, C. (2000) · Advances in Large-Margin Classifiers · doi:10.7551/mitpress/1113.003.0006 · Cited by 244
Remote homology detection: a motif based approach
Ben-Hur, A., & Brutlag, D. (2003) · Bioinformatics · doi:10.1093/bioinformatics/btg1002 · Cited by 193
Sublinear approximate string matching and biological applications
Chang, W. I., & Lawler, E. L. (1994) · Algorithmica · doi:10.1007/bf01185431 · Cited by 187
Kernel Methods Fast Algorithms and real life applications
Vishwanathan, S. V. N. (2003) · Cited by 9
Self-citation
Cited by
Gaussian Processes for Machine Learning
Rasmussen, C. E., & Williams, C. K. I. (2005) · doi:10.7551/mitpress/3206.001.0001 · Cited by 11,705
(2006) · The MIT Press eBooks · doi:10.7551/mitpress/9780262033589.001.0001 · Cited by 4,280
Kernel methods in machine learning
Hofmann, T., Schölkopf, B., & Smola, A. J. (2008) · The Annals of Statistics · doi:10.1214/009053607000000677 · Cited by 1,651
Self-citationText Mining Infrastructure in R
Feinerer, I., Hornik, K., & Meyer, D. (2008) · Journal of Statistical Software · doi:10.18637/jss.v025.i05 · Cited by 1,252
Kivinen, J., Smola, A. J., & Williamson, R. C. (2004) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2004.830991 · Cited by 1,004
Self-citation
Metadata
- Authors
- Vishwanathan, S. V. N., & Smola, A. J.
- Venue
- Kernel Methods in Computational Biology
- Publisher
- The MIT Press
- Published
- 2004-07-16
- Pages
- 113-130
- OpenAlex
- W2124225821
- Cited by
- 294
- References
- 20
- FWCI
- 38.94
- Type
- book chapter
- 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.